Path Computation Algorithms for Dynamic Service Provisioning With Protection and Inverse Multiplexing in SDH/SONET Networks

Synchronous Digital Hierarchy (SDH) and Synchronous Optical Network (SONET) are time-division multiplexing technologies widely used in transport networks to provide bandwidth services. Dynamic service provisioning requires the use of online algorithms that automatically compute the path to be taken...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 18; číslo 5; s. 1492 - 1504
Hlavní autoři: Ramachandran, Madanagopal, Usha Rani, N, Gonsalves, Timothy A
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Asynchronous transfer mode
Bandwidth
Bandwidths
Computation
Computer networks
Dedicated and shared protection
DSL
Dynamics
Heuristic algorithms
Inverse
inverse multiplexing (IM)
Multiplexing
Networks
NP-completeness
Product introduction
Protection
Provisioning
SDH/SONET
Shared Risk Link Group (SRLG)
SONET
Studies
Synchronous digital hierarchy
trail
Wavelength division multiplexing
WDM networks
ISSN:1063-6692, 1558-2566
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Synchronous Digital Hierarchy (SDH) and Synchronous Optical Network (SONET) are time-division multiplexing technologies widely used in transport networks to provide bandwidth services. Dynamic service provisioning requires the use of online algorithms that automatically compute the path to be taken to satisfy the given service request. SDH/SONET multiplexing structure imposes restrictions on the allocation of bandwidth. Bandwidth services mostly require protection so that they are resilient to failures in the network. Two types of protection techniques-namely, dedicated protection and shared protection-are commonly used to protect bandwidth. Also, SDH/SONET provides standard protection mechanisms like linear MSP/APS, MS-SPRing/BLSR and SNCP/UPSR. In shared protection, complete path information for all the existing connections has to be maintained to maximize sharing for future service requests. This information will be typically very large. To overcome this problem, a minimum information scenario is proposed as a tradeoff between maintaining less information and maximizing sharing. In this work, heuristic algorithms are proposed for dedicated and shared protection that take into account the above-mentioned factors. These algorithms use the path computation algorithms for SDH networks proposed in a previous work of the authors, which compute paths for service requests without considering protection. The performance is evaluated for different values for the relative weight of sharing for the complete and minimum information scenarios. An extension to these algorithms for satisfying bandwidth requests that use various inverse multiplexing techniques is also proposed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2010.2043538