article

Survivable virtual concatenation for data over SONET/SDH in optical transport networks

Authors:

Laxman H. Sahasrabuddhe,

Charles U. Martel,

Biswanath MukherjeeAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 14, Issue 1

Pages 218 - 231

https://doi.org/10.1109/TNET.2005.863462

Published: 01 February 2006 Publication History

Abstract

Next-generation SONET/SDH technologies--namely, generic framing procedure, virtual concatenation, and link-capacity-adjustment scheme--enable network operators to provide integrated data and voice services over their legacy SONET/SDH infrastructure to generate new revenue. An important open research problem on data over SONET/SDH (DoS) is survivability: SONET automatic protection switching is too resource inefficient for data services, and the protection mechanisms of data networks are too slow for mission-critical applications.We propose two approaches for provisioning survivable DoS connections. Our approaches exploit the tradeoff between resource overbuild and fault-recovery time while utilizing the inverse-multiplexing capability of virtual concatenation to increase backup sharing. Our results show that one approach achieves low resource overbuild and much faster fault recovery than that of data networks, and the other approach achieves fast fault recovery comparable to SONET 50-ms protection (for typical U.S. backbone networks) while still achieving modest backup sharing. We further investigate the tradeoff between network blocking performance and network control and management complexity resulting from the number of paths M a connection can be inversely multiplexed onto: larger M leads to more freedom in routing and better network performance but increases network control and management complexity. Our results indicate that the network blocking performance for small values of M (e.g., M = 2 for some representative backbone network topologies) is almost as good as the case in which M is infinity.

References

[1]

{1} "Synchronous Optical Networks (SONET)," ANSI T1X1.5, 2001-062, Jan. 2001.

[2]

{2} "Metro Ethernet Networks--A Technical Overview," Metro Ethernet Forum white paper, Jul. 2002.

[3]

{3} "Link Capacity Adjustment Scheme (LCAS) for Virtual Concatenated Signals," ITU-T Rec. G.7042/Y.1305, Nov. 2001.

[4]

{4} "Network Node Interface for the Synchronous Digital Hierarchy (SDH)," ITU-T Rec. G.707, Apr. 2002.

[5]

{5} R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1993.

[6]

{6} E. Bouillet, J.-F. Labourdette, R. Ramamurthy, and S. Chaudhuri, "Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths," presented at the Optical Fiber Communication Conf., Anaheim, CA, Mar. 2002, paper Th W2.

[7]

{7} E. Bouillet, J.-F. Labourdette, G. Ellinas, R. Ramamurthy, and S. Chaudhuri, "Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures," in Proc. IEEE INFOCOM, Jun. 2002, pp. 801-807.

[8]

{8} B. T. Doshi, S. Dravida, P. Harshavardhana, O. Hauser, and Y. Wang, "Optical network design and restoration," Bell Labs Tech. J., vol. 4, pp. 58-84, Jan.-Mar. 1999.

[9]

{9} S. Fortune, J. E. Hopcroft, and J. Wyllie, "The directed subgraph homeomorphism problem," J. Theoretical Comput. Sci., vol. 10, no. 2, pp. 111-121, 1980.

[10]

{10} A. Fumagalli, I. Cerutti, and M. Tacca, "Optimal design of survivable mesh networks based on line switched WDM self-healing rings," IEEE/ACM Trans. Netw., vol. 11, no. 3, pp. 501-512, Jun. 2003.

[11]

{11} A. Fumagalli and L. Valcarenghi, "IP restoration versus WDM protection: is there an optimal choice?," IEEE Network, vol. 14, pp. 34-41, Nov.-Dec. 2000.

[12]

{12} M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman Co., 1979.

[13]

{13} O. Gerstel and R. Ramaswami, "Optical layer survivability: a services perspective," IEEE Commun. Mag., vol. 38, no. 3, pp. 104-113, Mar. 2000.

[14]

{14} M. Goyal, G. Li, and J. Yates, "Shared mesh restoration: a simulation study," in Proc. OFC, Mar. 2002, pp. 489-490.

[15]

{15} W. Grover and D. Stamatelakis, "Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration," in Proc. IEEE ICC, vol. 1, 1998, pp. 537-543.

[16]

{16} O. Hauser, M. Kodialam, and T. V. Lakshman, "Capacity design of fast path restorable optical networks," in Proc. IEEE INFOCOM, vol. 2, Jun. 2002, pp. 817-826.

[17]

{17} E. Hernandez-Valencia, M. Scholten, and Z. Zhu, "The generic framing procedure (GFP): an overview," IEEE Commun. Mag., vol. 40, pp. 63-71, May 2002.

[18]

{18} S. Koo and S. Subramaniam, "Trade-offs between speed, capacity, and restorability in optical mesh network restoration," in Proc. OFC, Mar. 2002, pp. 487-489.

[19]

{19} M. Kodialam and T. V. Lakshman, "Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information," IEEE/ACM Trans. Netw., vol. 11, no. 3, pp. 399-410, Jun. 2003.

[20]

{20} G. Li, D. Wang, C. Kalmanek, and R. Doverspike, "Efficient distributed path selection for shared restoration connections," in Proc. IEEE INFOCOM , Jun. 2002, pp. 140-149.

[21]

{21} Y. Liu, D. Tipper, and P. Siripongwutikorn, "Approximating optimal spare capacity allocation by successive survivable routing," in Proc. IEEE INFOCOM, vol. 2, Apr. 2001, pp. 699-708.

[22]

{22} R. MacDonald, L.-P. Chen, C.-X. Shi, and B. Faer, "Requirements of optical layer network restoration," in Proc. OFC, Mar. 2000, pp. 68-70.

[23]

{23} M. Medard, R. A. Barry, S. Finn, W. He, and S. Lumetta, "Generalized loop-back recovery in optical mesh networks," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 153-164, Feb. 2002.

[24]

{24} E. Modiano and A. Narula-Tam, "Survivable lightpath routing: a new approach to the design of WDM-based networks," IEEE J. Select. Areas Commun., vol. 20, no. 5, pp. 800-809, May 2002.

[25]

{25} G. Mohan, C. S. R. Murthy, and A. K. Somani, "Efficient algorithms for routing dependable connections in WDM optical networks," IEEE/ACM Trans. Netw., vol. 9, no. 10, pp. 553-566, Oct. 2001.

[26]

{26} B. Mukherjee, Optical Communication Networks. New York: Mc-Graw-Hill, 1997.

[27]

{27} C. Ou, J. Zhang, H. Zang, L. Sahasrabuddhe, and B. Mukherjee, "New and improved approaches for shared-path protection in WDM mesh networks," J. Lightw. Technol., vol. 22, no. 5, pp. 1223-1232, May 2004.

[28]

{28} S. Ramamurthy, L. Sahasrabuddhe, and B. Mukherjee, "Survivable WDM mesh networks," J. Lightw. Technol., vol. 21, no. 4, pp. 870-883, Apr. 2003.

[29]

{29} N. Robertson and P. D. Seymour, "Graph minors XIII: the disjoint paths problem," J. Combin. Theory Ser. B, vol. 63, pp. 65-110, 1995.

[30]

{30} L. Sahasrabuddhe, S. Ramamurthy, and B. Mukherjee, "Fault tolerance in IP-over-WDM networking: WDM protection versus IP restoration," IEEE J. Select. Areas Commun., vol. 20, no. 1, pp. 21-33, Jan. 2002.

[31]

{31} P. Sebos, J. Yates, G. Hjlmtsson, and A. Greenberg, "Auto-discovery of shared risk link groups," in Proc. OFC, vol. 3, 2001, pp. WDD3-1-WDD3-3.

[32]

{32} S. Stanley, "Making SONET Ethernet-Friendly," Lightreading report, Mar. 2003.

[33]

{33} J. Strand, A. Chiu, and R. Tkach, "Issues for routing in the optical layer," IEEE Commun. Mag., vol. 39, no. 2, pp. 81-87, Feb. 2001.

[34]

{34} C. Su and X. Su, "Protection path routing on WDM networks," in Proc. OFC, vol. 2, Mar. 2001, pp. TuO2-T1-TuO2-T3.

[35]

{35} X. Su and C. Su, "An online distributed protection algorithm in WDM networks," in Proc. IEEE ICC, vol. 5, Jun. 2001, pp. 1571-1575.

[36]

{36} Y. Xiong, D. Xu, and C. Qiao, "Achieving fast and bandwidth-efficient shared-path protection," J. Lightw. Technol., vol. 21, no. 2, pp. 365-371, Feb. 2003.

[37]

{37} D. Xu, Y. Xiong, C. Qiao, and G. Li, "Trap avoidance and protection schemes in networks with shared risk link groups," J. Lightw. Technol., vol. 21, no. 11, pp. 2683-2693, Nov. 2003.

[38]

{38} 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., vol. 11, no. 4, pp. 248-258, Apr. 2003.

[39]

{39} K. Zhu, H. Zang, and B. Mukherjee, "Exploiting the benefit of virtual concatenation technique to the optical transport networks," in Proc. OFC, Mar. 2003, pp. 363-364.

Cited By

Zeng S(2023)IPoE Enhanced Reliability Model Based on SDH Optical Transmission for Intelligent Power DispatchingMobile Information Systems10.1155/2023/92499722023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1155/2023/9249972
Singh SDas TJukan A(2015)A Survey on Internet Multipath Routing and ProvisioningIEEE Communications Surveys & Tutorials10.1109/COMST.2015.246022217:4(2157-2175)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1109/COMST.2015.2460222
Um TKim JLee HKim S(2013)Dynamic resource control mechanism for multimedia overlay transport in NGNMultimedia Tools and Applications10.1007/s11042-011-0778-165:2(187-199)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1007/s11042-011-0778-1
Show More Cited By

Index Terms

Survivable virtual concatenation for data over SONET/SDH in optical transport networks

Recommendations

Service overlays for Ethernet LAN over SONET/SDH

Next-generation SONET/SDH provides carriers with new capabilities for building advanced Ethernet data services. Along these lines, numerous Ethernet-over-SONET studies have been done, with most focusing on point-to-point private line type services. This ...
Performance comparison of OBS and SONET in metropolitan ring networks

This paper explores the feasibility of deploying optical burst switching (OBS) in metropolitan area networks (MANs) as an alternative to synchronous optical network (SONET), over wavelength-division multiplexing. We present a comparison between two OBS ...
Multi-point ethernet over next-generation SONET/SDH
ICC'09: Proceedings of the 2009 IEEE international conference on Communications

Advances in SONET/SDH technologies have introduced novel features for improved services mapping and provisioning, enabling many new avenues for new Carrier Ethernet support. However Ethernet-over-SONET studies have mostly focused on provisioning point-...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 14, Issue 1

February 2006

231 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 February 2006

Published in TON Volume 14, Issue 1

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
782
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zeng S(2023)IPoE Enhanced Reliability Model Based on SDH Optical Transmission for Intelligent Power DispatchingMobile Information Systems10.1155/2023/92499722023Online publication date: 1-Jan-2023
https://dl.acm.org/doi/10.1155/2023/9249972
Singh SDas TJukan A(2015)A Survey on Internet Multipath Routing and ProvisioningIEEE Communications Surveys & Tutorials10.1109/COMST.2015.246022217:4(2157-2175)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1109/COMST.2015.2460222
Um TKim JLee HKim S(2013)Dynamic resource control mechanism for multimedia overlay transport in NGNMultimedia Tools and Applications10.1007/s11042-011-0778-165:2(187-199)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1007/s11042-011-0778-1
Manke SKhare KSapre S(2012)FPGA Implementation of Cross Virtual Concatenation Transmitter/ Receiver for Data Transmission over Next Generation SDH SystemsJournal of Signal Processing Systems10.1007/s11265-010-0508-367:2(105-116)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1007/s11265-010-0508-3
Huang SMartel CMukherjee B(2011)Survivable multipath provisioning with differential delay constraint in telecom mesh networksIEEE/ACM Transactions on Networking10.1109/TNET.2010.208256019:3(657-669)Online publication date: 1-Jun-2011
https://dl.acm.org/doi/10.1109/TNET.2010.2082560
Ramachandran MRani NGonsalves T(2010)Path computation algorithms for dynamic service provisioning with protection and inverse multiplexing in SDH/SONET networksIEEE/ACM Transactions on Networking10.1109/TNET.2010.204353818:5(1492-1504)Online publication date: 1-Oct-2010
https://dl.acm.org/doi/10.1109/TNET.2010.2043538
Xie CGhani NLiu QShu WGumaste AQiao YWu M(2009)Multi-point ethernet over next-generation SONET/SDHProceedings of the 2009 IEEE international conference on Communications10.5555/1817271.1817719(2414-2419)Online publication date: 14-Jun-2009
https://dl.acm.org/doi/10.5555/1817271.1817719
Das AMartel CMukherjee B(2009)A partial-protection approach using multipath provisioningProceedings of the 2009 IEEE international conference on Communications10.5555/1817271.1817504(1256-1260)Online publication date: 14-Jun-2009
https://dl.acm.org/doi/10.5555/1817271.1817504
Xie CGhani NLiu QKouatang RShu WQiao YWu MPeng S(2009)Traffic engineering for Ethernet over SONET/SDHIEEE Network: The Magazine of Global Internetworking10.1109/MNET.2009.493925923:3(18-25)Online publication date: 1-May-2009
https://dl.acm.org/doi/10.1109/MNET.2009.4939259

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents