Dynamic Routing with Partial Information in Mesh-Restorable Optical Networks

  • Murari Sridharan
  • R. Srinivasan
  • Arun K. Somani
Part of the IFIP Advances in Information and Communication Technology book series (IFIPAICT, volume 114)


Changing trends in backbone transport networks towards dynamic path provi sioning 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 infor­mation, 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 ap­proach 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 algo­rithms 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 perfor­mance improvement of dynamic routing algorithms using K pre-computed paths is significant even for small values of K.


Optical networks Dynamic routing Protection Restoration Survivability 


  1. [1]
    Alanyali, M. and E. Ayanoglu: 1998, ‘Provisioning Algorithms for WDM Optical Networks’. IEEE INFOCOM 2, 910–918.Google Scholar
  2. [2]
    Banerjee, D. and B. Mukherjee: 1996, ‘A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks’. IEEE Journal of Selected Areas in Communications 14 (5), 903–908.CrossRefGoogle Scholar
  3. [3]
    Bhandari, R.: 1999, Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers.Google Scholar
  4. [4]
    Doshi, B., S. Dravida, P. Harshavardhana, O. Hauser, and Y. Wang: 1999, ‘Optical Network Design and Restoration’. Bell Labs Technical Journal pp. 58–83.Google Scholar
  5. [5]
    Fonseca, P.: 1998, Tan-European Multi-Wavelength Transport Networks: Network Design, Architecture, Survivability and SDH Networking’. Proceedings of the ist International Workshop on Reliable Communication Networks.Google Scholar
  6. [6]
    Iraschko, R., M. MacGregor, and W. Grover: 1998, ‘Optimal Capacity Placement for Path Restoration in STM or ATM Mesh-Survivable Networks’. IEEE/ACM Transactions on Networking 6 (3), 325–336.CrossRefGoogle Scholar
  7. [7]
    lraschko, R. R. and W. D. Grover: 2000, ‘A highly efficient path-restoration protocol for management of optical network transport integrity’. IEEE Journal of Selected Areas in Communications 18 (5), 779–794.CrossRefGoogle Scholar
  8. [8]
    Jue, J. and G. Xiao: 2000, ‘An adaptive routing algorithm for wavelength-routed optical networks with a distributed control scheme’. In: Proceedings of the Nineth International Conference on Computer Communications and Networks. pp. 192–197.Google Scholar
  9. [9]
    Kodialam, M. and T. Lakshma.n: 2000, ‘Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration’. In: Proceedings of IEEE INFOCOM’00. pp. 902–911.Google Scholar
  10. [101.
    Li, L. and A. K. Somani: 1999, ‘Dynamic Wavelength Routing Using Congestion and Neighbourhood Information’. IEEE/ACM Transactions on Networking 7(5), 779–786.Google Scholar
  11. [11]
    Lowe, E. D. and D. K. Hunter: 1997, ‘Performance of dynamic path optical networks’. In: IEE-Proceedings of Optoelectronics. pp. 235–239.Google Scholar
  12. [12]
    Miyao, Y. and H. Saito: 1998, ‘Optimal Design and Evaluation of Survivable WDM Transport Networks’. IEEE Journal of Selected Areas in Communications 16(7), 1190— 1198.Google Scholar
  13. [13]
    Mohan, G., C. Murthy, and A. K. Somani. 2001, ‘Efficient Algorithms for Routing Dependable Connections in WDM Optical Networks’. IEEE/ACM Transactions on Networking 9 (5), 553–566.CrossRefGoogle Scholar
  14. [14]
    Mohan, G. and A. K. Somani: 2000, ‘Routing Dependable Connections With Specified Failure Restoration Guarantees in WDM Networks’. IEEE INFOCOM pp. 1761–1770.Google Scholar
  15. [15]
    Ramamurthy, R., Z. Bogdanowicz, S. Samieian, D. Saha, B. Rajagopalan, S. Sengupta, and S. Chaudhuri: 2001, ‘Capacity Performance of Dynamic Provisioning in Optical Networks’. Journal of Lightwave Technology 19 (1), 40–48.CrossRefGoogle Scholar
  16. [16]
    Ramamurthy, S. and B. Mukherjee: 1998, ‘Fixed alternate routing and wavelength conversion in wavelength-routed optical networks’. In: Proceedings of the Global Telecommunications Conference, GLOBECOM ‘88. pp. 2295–2303.Google Scholar
  17. [17]
    Ramamurthy, S. and B. Mukherjee: 1999, ‘Survivable WDM Mesh Networks, Part 1:Protection’. IEEE INFOCOM 2, 744 751.Google Scholar
  18. [18]
    Ramaswamy, R. and K. Sivarajan: 1995, ‘Routing and Wavelength Assignment in All-Optical Networks’. IEEE/ACM Transactions on Networking 3 (5), 489–500.CrossRefGoogle Scholar
  19. [19]
    Sridharan, M., M. Salapaka, and A. K. Somani. Expected publication date : ist Quarter 2002, ‘A Practical Approach to Operating Survivable WDM Networks’. Accepted for publication in Spl. Issue on WDM Based Network Architectures,Journal of Selected Areas in Communication.Google Scholar
  20. [20]
    Sridharan, M., A. K. Somani, and M. Salapaka: 2001, ‘Approaches for Capacity and Revenue Optimization in Survivable WDM Networks’. Journal of High Speed Networks 10(2), 109 — 125.Google Scholar
  21. [21]
    Srinivasan, R. and A. K. Somani: 2001, ‘Dynamic Routing in WDM Grooming Networks’. Technical Report (DCNL-ON-200 I-001), Dependable Computing Networking Laboratory, Department of Electrical and Computer Engineering, Iowa State University.Google Scholar
  22. [22]
    Thiagarajan, S. and A. K. Somani: 2001, ‘Traffic Grooming for Survivable WDM Mesh Networks’. Opticomm: Optical Networking and Communications.Google Scholar
  23. [23]
    Wu, T.: 1992, Fiber Network Service Survivability. Norwood, MA: Artech House.Google Scholar
  24. [24]
    Zang, H. and B. Mukherjee: 2001, ‘Connection Management for Survivable Wavelength-routed WDM Mesh Networks’. Optical Networks Magazine 2 (4), 17–28.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2003

Authors and Affiliations

  • Murari Sridharan
    • 1
  • R. Srinivasan
    • 2
  • Arun K. Somani
    • 3
  1. 1.Dependable Computing & Networking LaboratoryUSA
  2. 2.Department of Electrical and Computer EngineeringUSA
  3. 3.Iowa State UniversityAmesUSA

Personalised recommendations