Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/17816
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShukla, Sidharth-
dc.date.accessioned2025-07-06T12:50:00Z-
dc.date.available2025-07-06T12:50:00Z-
dc.date.issued2013-06-
dc.identifier.urihttp://localhost:8081/jspui/handle/123456789/17816-
dc.description.abstractTelecommunication networks over the years have undergone huge technological advancements emerging from circuit switched networks to state of the art optical networks. In this present scenario pure optical wavelength routed networks have taken prominence as the future backbone telecommunication network, incorporating technologies like dense wavelength division multiplexing and generalized multiprotocol labeled switching for its control plane. To efficiently optimize these networks, efficient traffic engineering and dynamic routing and wavelength assignment techniques need to be incorporated to improve connection blocking probabilities. The proposed connection admission grooming algorithm implements the above in an efficient manner. It has been shown by results that the blocking probability of the network, which is an important benchmark for judging the efficiency of the network, reduces substantially thus improving the overall utilization of network resources.en_US
dc.description.sponsorshipINDIAN INSTITUTE OF TECHNOLOGY ROORKEEen_US
dc.language.isoenen_US
dc.publisherI I T ROORKEEen_US
dc.subjectTelecommunication Networksen_US
dc.subjectSwitched Networksen_US
dc.subjectControl Planeen_US
dc.subjectBlocking Probabilityen_US
dc.titleCONNECTION ADMISSION GROOMING IN PCE BASED ARCHITECHTURE INCORPORATING DYNAMIC FIBER STATE IN FORMATION WITH COMBINED RWAen_US
dc.typeOtheren_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
G22598.pdf9.94 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.