Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Dynamic Survivable Routing for Shared Segment Protection

  • Tapolcai, Janos (Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics) ;
  • Ho, Pin-Han (Department of Electrical and Computer Engineering, University of Waterloo)
  • Published : 2007.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

Keywords

References

  1. P.-H. Ho, J. Tapolcai, and T. Cinkler, 'Segment shared protection in mesh communication networks with bandwidth guaranteed tunnels,' IEEE/ACM Trans. Networking, vol. 12, pp. 1105-1118, Dec. 2004 https://doi.org/10.1109/TNET.2004.838592
  2. P.-H. Ho and H. T. Mouftah, 'A framework of service guaranteed shared protection for optical networks,' IEEE Commun. Mag., pp. 97-103, Feb. 2002
  3. P.-H. Ho and H. T. Mouftah, 'A novel survivable routing algorithm for segment shared protection in mesh wdm networks with partial wavelength conversion,' IEEE J. Sel. Areas Commun., to be published
  4. D. Xu, Y. Xiong, and C. Qiao, 'Protection with multi-segments PROMISE in networks with shared risk link groups SRG,' in Proc. the 40th Annual Allerton Conf. Commun., Control, and Computing, 2002
  5. C. V. Saradhi and C. S. R. Murthy, 'Dynamic establishment of segmented protection paths in single and multi-fiber WDM mesh networks,' in Proc. SPIE OPTICOMM, 2002, pp. 211-222
  6. M. Kodialam and T. V. Lakshman, 'Dynamic routing oflocally restorable bandwidth guaranteed tunnels using aggregated link usage information,' in Proc. IEEE INFOCOM, 2001, pp. 376-385
  7. C.-F. Su and X. Su, 'An on-line distributed protection algorithm in WDM networks,' in Proc. IEEE ICC, 2001, pp. 1571-1575
  8. Y. Bejerano, Y. Breitbart, A. Orda, R. Rastogi, and A. Sprintson, 'Algorithms for computing QoS paths with restoration,' in Proc. IEEE INFOCOM, 2003, pp. 1435-1445
  9. L. Li, M. M. Buddhikot, C. Chekuri, and K. Guo, 'Routing bandwidth guaranteed paths with local restoration in label switched networks,' in Proc. IEEE ICNP, 2002, pp. 110-120
  10. R. W. Ashford and R. C. Daniel, 'Some lessons in solving practical integer programs,' J. Operational Research Society, vol. 43, no. 5, pp. 425-433, 1992 https://doi.org/10.1057/jors.1992.69
  11. A. M. Geoffrion and R. E. Marsten, 'Integer programming algorithms: A framework and state-of-the-art survey,' Management Science, vol. 18, pp. 465-491, 1972 https://doi.org/10.1287/mnsc.18.9.465
  12. P. H. Ho, (2004), 'State-of-the-art progresses in developing survivable routing strategies in the optical internet.' IEEE Commun. Surveys and Tutorials. [Online]. 6(4), Available:http://bbcr.uwaterloo.ca/~pinhan /CST2003.pdf
  13. P.-H. Ho, J. Tapolcai, H. T. Mouftah, and C.-H. Yeh, 'Linear formulation for path shared protection,' in Proc. IEEE ICC, 2004, pp. 20-24
  14. LION and COST 266, 'Reference networks,' 2003. Part of the European Information Society Technologies (1ST) Fifth Framework program
  15. M. De, V. Mariappan, V. Chandramouli, and S. K. Kuppusamy, 'US national network design,' 2002. Presetation held at CReWMaN, University of Texas at Arlington
  16. R. W. M. Vaughn, 'Metropolitan network traffic demand study,' in Proc. 13th Annual Meeting LEOS, vol. 1, 2000, pp. 102-103
  17. R. W. A Dwivedi, 'Traffic model for USA long-distance optical network,' in Proc. OFC, 2000, pp. 156-158
  18. K. J. Christense. (2004). Tools page. [Online]. Available:http://www.csee.usf.edu/~christen/toolpage.html
  19. M. Garrett and W. Willinger, 'Analysis, modeling and generation of selfsimilar vbr video traffic,' ACM Computer Commun. Review, vol. 24, pp. 269-280, Sept. 1994 https://doi.org/10.1145/190809.190339