OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: Keren Bergman and Vincent Chan
  • Vol. 1, Iss. 2 — Jul. 1, 2009
  • pp: A56–A68

Improving the Resilience of Emerging Generation GMPLS Networks

Antoine B. Bagula  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 1, Issue 2, pp. A56-A68 (2009)
http://dx.doi.org/10.1364/JOCN.1.000A56


View Full Text Article

Acrobat PDF (1045 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

We propose a traffic engineering (TE) scheme that uses virtual preemption and configurable survivability to improve the resilience of the emerging-generation GMPLS networks. Virtual preemption ranks the rerouting requests based on bandwidth granularity and, using this ranking, reroutes these requests to allow the highest-bandwidth-demanding requests to be rerouted first with the expectation of achieving higher restorability. Configurable survivability moves the network operating conditions close to a predefined performance pattern and balances the routing configuration to improve the network survivability. Simulation reveals that the proposed TE scheme can increase the survivability of a network and achieve higher restorability while maintaining the signaling efficiency at an acceptable level.

© 2009 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.4510) Fiber optics and optical communications : Optical communications

ToC Category:
Optical Networks for the Future Internet

History
Original Manuscript: November 18, 2008
Revised Manuscript: February 2, 2009
Manuscript Accepted: February 18, 2009
Published: June 18, 2009

Virtual Issues
Optical Networks for the Future Internet (2009) Journal of Optical Networking

Citation
Antoine B. Bagula, "Improving the Resilience of Emerging Generation GMPLS Networks," J. Opt. Commun. Netw. 1, A56-A68 (2009)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-1-2-A56


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. S. J. Ben Yoo, “Optical-label switching, MPLS, MPLambdaS, and GMPLS,” Opt. Networks Mag. , vol. 4, no. 3, pp. 17-31, May 2003.
  2. “Architecture for the automatically switched optical network (ASON),” ITU-T Rec. G8080, Nov. 2001.
  3. L.Berger, ed., “Generalized multiprotocol label switching (GMPLS) signalling functional description,” Network Working Group Request for Comments 3471, Jan. 2003, http://www.ietf.org/rfc/rfc3471.txt.
  4. E.Mannie, ed., “Generalized multiprotocol label switching (GMPLS) architecture,” Network Working Group Request for Comments 3749, Oct. 2004, http://www.ietf.org/rfc/rfc3945.txt.
  5. E.C.Rosen, A.Viswanathan, and R.Callon, eds., “Multiprotocol label switching architecture,” Network Working Group Request for Comments 3031, Jan. 2001, http://www.ietf.org/rfc/rfc3031.txt.
  6. V.Sharma and F.Hellstrand, eds., “Requirements for traffic engineering over MPLS,” Network Working Group Request for Comments 2702, Sept. 1999, http://www.ietf.org/rfc/rfc2702.txt.
  7. M. Vigoureux, B. Berde, L. Andersson, T. Cinkler, L. Levrau, M. Ondata, D. Colle, J. Fernandez-Palacios, and M. Jager, “Multilayer traffic engineering for GMPLS-enabled networks,” IEEE Commun. Mag. , vol. 43, no. 7, pp. 44-50, July 2005. [CrossRef]
  8. R. Sabella, P. Iovanna, G. Oriolo, and P. D'Aprile, “Strategy for dynamic routing and grooming of data flows into lightpaths in new generation network based on the GMPLS paradigm,” Photonic Network Commun. , vol. 7, no 2, pp. 131-144, March 2004. [CrossRef]
  9. D. Colle, S. De Maesschalck, C. Develder, P. Van Heuven, A. Groebbens, J. Cheyns, I. Lievens, M. Pickavet, P. Lagasse, and P. Demeester, “Data-centric optical networks and their survivability” IEEE J. Sel. Areas Commun. , vol. 20, no. 1, pp. 6-20, Jan. 2002. [CrossRef]
  10. D. Papadimitriou and D. Verchere, “GMPLS user-network interface in support of end-to-end rerouting,” IEEE Commun. Mag. , vol. 43, no. 7, pp. 35-43, July 2005. [CrossRef]
  11. K.-I.KitayamaF.Masetti-Placci, and G.Prati, eds., Optical Networks and Technologies, New York, NY: International Federation for Information Processing and Springer Science+Business Media, 2004.
  12. V.Sharma and F.Hellstrand, eds., “Framework for multi-protocol label switching (MPLS)-based recovery,” Network Working Group Request for Comments 3469, Feb. 2003, http://www.ietf.org/rfc/rfc3469.txt.
  13. D.Papadimitriou and E.Mannie, eds., “Analysis of generalized multi-protocol label switching (GMPLS)-based recovery mechanisms (including protection and restoration),” Network Working Group Request For Comments 4428, March 2006, http://www.ietf.org/rfc/rfc4428.txt.
  14. W.Lai and D.McDysan, eds., “Network hierarchy and multilayer survivability,” Network Working Group Request For Comments 3386, Nov. 2002, http://www.ietf.org/rfc/rfc3386.txt.
  15. J. Vasseur, M. Picavet, and P. Demeester, Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS, San Francisco, CA: Morgan Kaufman, 2004.
  16. S. De Maesschalck, D. Colle, A. Groebbens, P. Lagasse, M. Pickavet, P. Demeester, F. Saluta, and M. Quagliatti, “Intelligent optical networking for multilayer survivability,” IEEE Commun. Mag. , vol. 40, no. 1, pp. 42-49, Jan. 2002. [CrossRef]
  17. A. Fumagali and L. Valcare, “IP restoration vs. WDM protection: is there an optimal choice?” IEEE Network , vol. 14, no. 6, pp. 34-41, Nov.-Dec. 2000.
  18. L. Sahasrabuddhe, S. Ramamurthy, and B. Mukherjee, “Fault tolerance in IP-over-WDM networking: WDM protection vs. IP restoration,” IEEE J. Sel. Areas Commun. , vol. 20, no 1, pp. 21-33, Jan. 2002. [CrossRef]
  19. M. Pioro and D. Medhi, “Routing, Flow, and Capacity Design in Communication and Computer Networks,” San Francisco, CA: Morgan Kaufmann, 2004.
  20. J.P.Lang, Y.Rekhter, and D.Papadimitriou, eds., “RSVP-TE extensions in support of end-to-end generalized multi-protocol label switching (GMPLS) recovery,” Network Working Group Request for Comments 4872, May 2007, http://www.ietf.org/rfc/rfc4872.txt.
  21. L.Berger, I.Bryskin, D.Papadimitriou, and A.Farrel, eds., “GMPLS segment recovery,” Network Working Group Request for Comments 4873, May 2007, http://www.ietf.org/rfc/rfc4873.txt.
  22. P. Francois, C. Filsfils, J. Evans, and O. Bonaventure, “Achieving sub-second IGP convergence in large IP networks,” ACM SIGCOMM Comput. Commun. Rev. , vol. 35, no. 3, pp. 35-44, July 2005. [CrossRef]
  23. S. Rai, B. Mukherjee, and O. Deshpande, “IP resilience within an autonomous system: current approaches, challenges, and future directions,” IEEE Commun. Mag. , vol. 43, no. 10, pp. 142-149, Oct. 2005. [CrossRef]
  24. R. Bhandari, “Survivable Networks: Algorithms for Diverse Routing,” 1st ed., New York, NY: Springer, 1999.
  25. B. Szviatovszky, A. Szentesi, and A. Jüttner, “Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing,” Comput. Commun. , vol. 25, nos. 11-12, pp. 1076-1084, July 2002.
  26. D. Mitra and K. G. Ramakrishnan, “A case study of multiservice, multipriority traffic engineering design for data networks,” in Global Telecommunications Conf., 1999. GLOBECOM '99, Rio de Janeireo, Brazil, Dec. 5-9, 1999, vol. 1B, pp. 1077-1083.
  27. J. A. Garay and I. S. Gopal, “Call preemption in communication networks,” in IEEE INFOCOM '92. 11th Annu. Joint Conf. of the IEEE Computer and Communications Societies, Florence, Italy, May 4-8, 1992, vol. 3, pp. 1043-1050.
  28. S. Kaczmarek and K. Nowak, “A new heuristic algorithm for effective preemption in MPLS networks,” in 2006 Workshop on High Performance Switching and Routing, Poznan, Poland, June 2006, pp. 7-9.
  29. F. Blanchy, L. Melon, and G. Leduc, “Routing in a MPLS network featuring preemption mechanisms,” in 10th Int. Conf. on Telecommunications 2003. ICT 2003, Feb. 23-March 1, 2003, vol. 1, pp. 253-260.
  30. X. He , Q. Chu and M. Zhu, “Minimizing preemption cost for path selection in Diffserv-ware MPLS networks,” Comput. Commun. , vol. 29, no. 18, pp. 3825-3832, Nov. 2006. [CrossRef]
  31. C. H. Chun, B.-H. Soong, and S. K. Bose, “Path selection with preemption and re-routing control for multi-protocol label switching networks,” Comput. Commun. , vol. 29, no. 18, pp. 3718-3732, Nov. 2006. [CrossRef]
  32. F. Blanchy, L. Mélon, and G. Leduc, “A preemption-aware on-line routing algorithm for MPLS networks,” Telecommun. Syst. , vol. 24, nos. 2-4, pp. 187-206, Oct. 2003. [CrossRef]
  33. F. Blanchy, L. Mélon, and G. Leduc, “Routing in a MPLS network featuring preemption mechanisms,” in 10th Int. Conf. on Telecommunications, 2003. ICT 2003, Papeete, Tahiti, Feb. 23-March 1, 2003, vol. 1, pp. 253-260.
  34. J. C. de Oliveira, C. Scoglio, I. F. Akyildiz, and G. Uhl, “A new preemption policy for DiffServ-aware traffic engineering to minimize rerouting,” in IEEE INFOCOM 2002. 21st Annu. Joint Conf. of the IEEE Computer and Communications Societies, June 2002, vol. 2, pp. 695-704.
  35. J. Moy, “OSPF Version 2,” Network Working Group Request for Comments 1583, March 1994, http://www.ietf.org/rfc/rfc1583.txt.
  36. B. Fortz and M. Thorup, “Internet traffic engineering by optimizing OSPF weights,” in IEEE INFOCOM 2000. 19th Annu. Joint Conf. of the IEEE Computer and Communications Societies, Tel Aviv, Israel, March 26-30, 2000, vol. 2, pp. 519-528.
  37. A. Riedl, “A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics,” in 2002 IEEE Workshop on IP Operations and Management, Oct. 2002, pp. 166-170.
  38. L. S. Buriol, M. G. C. Resende, C. C. Ribeiro, and M. Thorup, “A memetic algorithms for OSPF routing,” Proc. 6th INFORMS Telecommunications Conf., Boca Raton, FL, 2002, pp. 187-188.
  39. E. CrawleyR. Nair, B. Rajagopalan, and H. Sandick, “A framework for QoS-based routing in the Internet,” Network Working Group Request for Comments 2386, Aug. 1998, http://www.ietf.org/rfc/rfc2386.txt.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited