OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Keren Bergman
  • Vol. 8, Iss. 5 — May. 1, 2009
  • pp: 438–453

Survivable and traffic-oblivious routing in WDM networks: valiant load balancing versus tree routing

Rui Dai, Lemin Li, Sheng Wang, and Xiaoning Zhang  »View Author Affiliations


Journal of Optical Networking, Vol. 8, Issue 5, pp. 438-453 (2009)
http://dx.doi.org/10.1364/JON.8.000438


View Full Text Article

Acrobat PDF (901 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

This paper investigates the issue of survivable routing to prevent arbitrary single-link failures in WDM networks when the traffic information is partially known. Two novel protection schemes called valiant-load-balancing- (VLB-) based hop constraint segment protection (VLB-HCSP) and hop constraint minimizing leaf nodes (HCMLN) are proposed and evaluated. Simulation results confirm our expectation that VLB-HCSP can achieve a desirable compromise between cost and failure recovery time compared with the previous VLB-based method, while HCMLN performs even more inspiringly for being able to provide both a low-cost budget and a fast recovery at the same time, in contrast to VLB-HCSP and the other existing schemes.

© 2009 Optical Society of America

OCIS Codes
(060.4257) Fiber optics and optical communications : Networks, network survivability
(060.4261) Fiber optics and optical communications : Networks, protection and restoration

ToC Category:
Research Papers

History
Original Manuscript: November 21, 2008
Revised Manuscript: February 22, 2009
Manuscript Accepted: March 5, 2009
Published: April 8, 2009

Citation
Rui Dai, Lemin Li, Sheng Wang, and Xiaoning Zhang, "Survivable and traffic-oblivious routing in WDM networks: valiant load balancing versus tree routing," J. Opt. Netw. 8, 438-453 (2009)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-8-5-438


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. B. Mukherjee, Optical Communication Networks (McGraw-Hill, 1997).
  2. A. Medina, N. Taft, K. Salamatian, S. Bhattacharyya, and C. Diot, “Traffic matrix estimation: existing techniques and new directions,” in Proceedings of ACM SIGCOMM (ACM, 2002), pp. 161-174.
  3. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener, “Provisioning a virtual private network: a network design problem for multicommodity flow,” in ACM Symposium on Theory of Computing (ACM, 2001), pp. 389-398.
  4. R. Zhang-Shen and N. McKeown, “Designing a predictable Internet backbone network,” in Proceedings of HotNets III (2004).
  5. M. Kodialam, T. V. Lakshman, and S. Sengupta, “Efficient and robust routing of highly variable traffic,” in Proceedings of 3rd Workshop on Hot Topics in Networks (2004).
  6. N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J. E. van der Merwe, “A flexible model for resource management in virtual private networks,” in Proceedings of ACM SIGCOMM (ACM, 1999), pp. 95-108.
  7. A. Juttner, I. Szabo, and A. Szentesi, “On bandwidth efficiency of the hose resource management model in virtual private network,” in Twenty-Second Annual Conference of the IEEE Computer and Communications Societies (IEEE, 2003), pp. 385-395.
  8. A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener, “Algorithms for provisioning virtual private networks in the hose model,” in Proceedings of ACM SIGCOMM (ACM, 2001), pp. 135-146.
  9. R. Zhang-Shen and N. McKeown, “Designing a fault-tolerant network using valiant load-balancing,” in The 27th Conference on Computer Communications (IEEE, 2008), pp. 2360-2368.
  10. H. Zang, C. Ou, and B. Mukherjee, “Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints,” IEEE/ACM Trans. Netw. 11, 248-258 (2003). [CrossRef]
  11. G. F. Italiano, R. Rastogi, and B. Yener, “Restoration algorithms for virtual private networks in the hose model,” in Twenty-First Annual Joint Conference of the IEEE Computer and Communication Societies (IEEE, 2002), pp. 131-139.
  12. Y. L. Liu, Y. S. Sun, and M. C. Chen, “Traffic engineering for hose-model VPN provisioning,” in IEEE Global Telecommunications Conference (IEEE, 2005), pp. 1080-1085.
  13. P. Ho, J. Tapolcai, and T. Cinkler, “Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels,” IEEE/ACM Trans. Netw. 12, 1105-1118 (2004). [CrossRef]
  14. D. Xu, Y. Xiong, and C. Qiao, “Novel algorithms for shared segment protection,” IEEE J. Sel. Areas Commun. 21, 1320-1331 (2003). [CrossRef]
  15. F. Harary, Graph Theory (Addison-Wesley, 1972).
  16. K. Zhu and B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun. 20, 122-133 (2002). [CrossRef]
  17. E. Modiano and P. J. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag. 39(7), 124-129 (2001). [CrossRef]
  18. H. B. Wen, R. X. He, L. M. Li, and S. Wang, “Dynamic traffic-grooming algorithms in wavelength-division-multiplexing mesh networks,” J. Opt. Netw. 2, 100-111 (2003).
  19. C. Ou, K. Zhu, H. Zang, L. H. Sahasrabuddhe, and B. Mukherjee, “Traffic grooming for survivable WDM networks--shared protection,” IEEE J. Sel. Areas Commun. 21, 1367-1383 (2003). [CrossRef]
  20. M. Kodialam, T. V. Lakshman, J. B. Orlin, and S. Sengupta, “Preconfiguring IP-over-optical networks to handle router failures and unpredictable traffic,” IEEE J. Sel. Areas Commun. 25, 934-947 (2007).
  21. L. Valiant and G. Brebner, “Universal scheme for parallel communications,” in Proceedings of the 13th Annual Symposium on Theory Computing (ACM, 1981), pp. 263-277.

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