Provisioning algorithms for WDM optical networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in optical networks
IEEE/ACM Transactions on Networking (TON)
Span-disjoint paths for physical diversity in networks
ISCC '95 Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95)
IEEE/ACM Transactions on Networking (TON)
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 02
Survivable virtual concatenation for data over SONET/SDH in optical transport networks
IEEE/ACM Transactions on Networking (TON)
Service level agreement and provisioning in optical networks
IEEE Communications Magazine
Traffic grooming for survivable WDM networks - shared protection
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.