Dynamic service Allocation with Protection Path

Path computation algorithms are necessary for providing optimal utilization of available resources. Static path assignment does not satisfy the real-time data traffic requirement, thus leading to inefficient network resource utilization and compromised services for customers. Dynamic assignment of bandwidth requires the use of online algorithms which automatically compute the path to be taken to satisfy the given service request. Many researchers have addressed online path computation algorithms, but they consider each link having a number of slots of bandwidth. They do not take into account the multiplexing mechanism which causes restrictions on the allocation of bandwidth and the fact that higher order trails have to be established to support any bandwidth requirement. The novel feature of this work is the development of new path computation algorithm for service provisioning in SDH/SONET. The feature of this algorithm is that it takes into account the multiplexing structure, which imposes restrictions on the allocation of bandwidth and support the Subnetwork Connection Protection (SNCP) as defined in SDH/SONET.