Please use this identifier to cite or link to this item:
Title: Protection algorithms for bandwidth guaranteed connections in MPLS networks
Keywords: Multiprotocol label switching, network survivability, protection, multipath routing, scheduled demands
Issue Date: 2-Feb-2006
Citation: WONG SHEK YOON (2006-02-02). Protection algorithms for bandwidth guaranteed connections in MPLS networks. ScholarBank@NUS Repository.
Abstract: Multiprotocol label switching (MPLS) technique, which can offer connection-oriented services, is a new network technology that supports quality of service (QoS), traffic engineering and survivability in the Next Generation networks. Network survivability has become an important issue in MPLS-based networks. In this dissertation, path protection algorithms have been proposed to provide reliable connections while at the same time use the network resources efficiently. First, multipath protection algorithms are developed to provide near optimal routing for dynamic requests in MPLS networks. Then, several new supplementary information are proposed and disseminated in distributed MPLS networks to further improve the routing performance. Finally, protection of scheduled demands whose setup time and teardown time are known in advance are considered. Scheduled demands allow bandwidth to be reused by time-disjoint demands; thus, reduce the total amount of bandwidth consumed in networks.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
sywong_MEng_thesis.pdf1.96 MBAdobe PDF



Page view(s)

checked on Apr 8, 2019


checked on Apr 8, 2019

Google ScholarTM


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