Dynamic Routing with Partial Information in Mesh-Restorable Optical Networks
Changing trends in backbone transport networks towards dynamic path provisioning and evolving optical technologies have motivated the study of dynamic routing algorithms in the context of Multi Protocol Label Switching (MPLS) based networks. Several methods have been proposed for joint optimization of working and spare capacity in survivable optical networks. These techniques are centralized and do not scale well as they rely on per-flow information. This motivates the need for developing a) distributed algorithms with complete information, b) source based algorithms with partial information which can be easily obtained from traffic engineering extensions to routing protocols.
In this paper, we develop dynamic algorithms for source based routing with partial information. The algorithms are classified based on the path selection approach used for the primary path. We compare the performance of various routing algorithms through simulation studies, based on metrics such as the call blocking probability, average path length of an accepted connections, capacity redundancy, and effective network utilization. Our studies show that dynamic routing algorithms perform better than static routing algorithms using pre-computed paths even when the path selection in static algorithms is based on optimizing a global network metric. The other interesting observation we make is that the performance improvement of dynamic routing algorithms using K pre-computed paths is significant even for small values of K.
This is a post-peer-review, pre-copyedit version of a proceeding published as Sridharan, Murari, R. Srinivasan, and Arun K. Somani. "Dynamic routing with partial information in mesh-restorable optical networks." In International IFIP Conference on Optical Network Design and Modeling, pp. 327-343. Springer, New York, NY, 2002. The final authenticated version is available online at DOI: 10.1007/978-0-387-35670-9_21. Posted with permission.