Skip to main content
Top
Published in: Photonic Network Communications 1/2017

06-10-2016 | Original Paper

Partitioning-based approach to control the restored path length in p-cycle-based survivable optical networks

Authors: Hari Mohan Singh, Rama Shankar Yadav

Published in: Photonic Network Communications | Issue 1/2017

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In recent years, p-cycles have been widely investigated for survivability of WDM networks. They provide fast recovery speed such as ring and capacity efficiency as mesh survivability schemes. However, restoration paths are very long, which causes excessive latency and intolerable physical impairments. On the other hand, nowadays, a wide set of applications require an optical path with almost no delay. The existing approaches, namely loopbacks removal and inter-cycle switching, provide a significant reduction in the restored path, but even then a number of restored paths remain many times longer than the working path lengths. In this paper, we propose a network partitioning-based approach to control the length of each restored path as per delay sustainability of time critical applications. The basic idea of the work is to partition the network into domains and construct the p-cycles for each domain independently. The domain wise construction of p-cycles restricts their length, which consequently reduces the length of restored paths. Here, we introduce a new concept where the selected border nodes are overlapped among adjacent domains to cover inter-domain spans of the network as a domain span in order to ensure their survivability through domain p-cycles. Simulation results show that the proposed solution is good enough to control the restored path length with small augmentation in redundancy of spare capacity as compared to optimal design of p-cycles. More importantly, it enhances the dual failure restorability significantly.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Cisco Inc.: Cisco visual networking index -forecast and methodology, 2012–2017, White paper. In: SPIC Proceeding, vol. 900 (2013) Cisco Inc.: Cisco visual networking index -forecast and methodology, 2012–2017, White paper. In: SPIC Proceeding, vol. 900 (2013)
2.
go back to reference Gerstel, O., et al.: Elastic optical networking: a new dawn for the optical layer. IEEE Commun. Mag. 50, 512–520 (2012)CrossRef Gerstel, O., et al.: Elastic optical networking: a new dawn for the optical layer. IEEE Commun. Mag. 50, 512–520 (2012)CrossRef
3.
go back to reference Ramamurthy, S., Sahasrabuddhe, L., Mukherjee, B.: Survivable WDM mesh network. J. Lightwave Technol. 21(4), 870–883 (2003)CrossRef Ramamurthy, S., Sahasrabuddhe, L., Mukherjee, B.: Survivable WDM mesh network. J. Lightwave Technol. 21(4), 870–883 (2003)CrossRef
4.
go back to reference Grover, W.D.: Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice Hall, Upper Saddle River (2004) Grover, W.D.: Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice Hall, Upper Saddle River (2004)
5.
go back to reference Grover, W. D., Stamatelakis, D.: Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration, Proc. IEEE International Conference on Communications (ICC). Atlanta, Georgia, USA, (1998), pp. 537–543 Grover, W. D., Stamatelakis, D.: Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration, Proc. IEEE International Conference on Communications (ICC). Atlanta, Georgia, USA, (1998), pp. 537–543
6.
go back to reference Kiaei, M.S., Assi, C., Jaumard, B.: A survey on the \(p\)-cycle protection method. IEEE Commun. Surv. Tutor. 11(3), 53–70 (2009)CrossRef Kiaei, M.S., Assi, C., Jaumard, B.: A survey on the \(p\)-cycle protection method. IEEE Commun. Surv. Tutor. 11(3), 53–70 (2009)CrossRef
7.
go back to reference Asthana, R., Singh, Y. N., Grover, W.D.: \(p\)-Cycles - An overview, Communications Surveys & Tutorials, IEEE, 12(1):97-111, First Quarter (2010) Asthana, R., Singh, Y. N., Grover, W.D.: \(p\)-Cycles - An overview, Communications Surveys & Tutorials, IEEE, 12(1):97-111, First Quarter (2010)
8.
go back to reference Wensheng, H.,Somani. A. K.: Comparison of Protection Mechanisms - Capacity Efficiency and Recovery Time, In: IEEE International Conference on Communications—ICC, 2218–2223, (2007) Wensheng, H.,Somani. A. K.: Comparison of Protection Mechanisms - Capacity Efficiency and Recovery Time, In: IEEE International Conference on Communications—ICC, 2218–2223, (2007)
9.
go back to reference Wei,Y., Xu, K., Zhao, H.: Applying p-cycle Technique to Elastic Optical Networks, ONDM 2014, 19–22, Stockholm, Sweden, (2014) Wei,Y., Xu, K., Zhao, H.: Applying p-cycle Technique to Elastic Optical Networks, ONDM 2014, 19–22, Stockholm, Sweden, (2014)
11.
go back to reference Li, B., et al.: Application of forecasting based dynamic \(p\)-cycle reconfiguration under reliable optical networks in smart grid. Comput. Commun. 49, 48–59 (2014)CrossRef Li, B., et al.: Application of forecasting based dynamic \(p\)-cycle reconfiguration under reliable optical networks in smart grid. Comput. Commun. 49, 48–59 (2014)CrossRef
12.
go back to reference Bobrovs, V., Spolitis, S., Ivanovs, G.: Latency cause and reduction in optical metro networks, Proceding of SPIE, vol. 9008, p. 1, (2004) (Invited paper) Bobrovs, V., Spolitis, S., Ivanovs, G.: Latency cause and reduction in optical metro networks, Proceding of SPIE, vol. 9008, p. 1, (2004) (Invited paper)
13.
go back to reference O3b Networks Ltd.: What is network latency and why it matters? White paper (2011) O3b Networks Ltd.: What is network latency and why it matters? White paper (2011)
14.
go back to reference Asthana, R., Singh, Y. N.: Removal of Loop Back in p-cycle Protection-Second Phase Reconfiguration, In: Proceedings of IEEE International Conference on Communication Systems, Singapore, Oct. 30–Nov. 1, (2006) Asthana, R., Singh, Y. N.: Removal of Loop Back in p-cycle Protection-Second Phase Reconfiguration, In: Proceedings of IEEE International Conference on Communication Systems, Singapore, Oct. 30–Nov. 1, (2006)
15.
go back to reference Asthana, R., Singh, Y.N.: Distributed protocol for removal loop backs and optimum allocation of \(p\)-cycles to minimize the restored path lengths. J. Lightwave Technol. 26(5), 616–627 (2008)CrossRef Asthana, R., Singh, Y.N.: Distributed protocol for removal loop backs and optimum allocation of \(p\)-cycles to minimize the restored path lengths. J. Lightwave Technol. 26(5), 616–627 (2008)CrossRef
16.
go back to reference Huang, S., et al.: Distributed protocol for removal of loop backs with asymmetric digraph using GMPLS in \(p\)-cycle based optical networks. IEEE Trans. Commun. 59(2), 541 (2011)CrossRef Huang, S., et al.: Distributed protocol for removal of loop backs with asymmetric digraph using GMPLS in \(p\)-cycle based optical networks. IEEE Trans. Commun. 59(2), 541 (2011)CrossRef
17.
go back to reference Yadav, R., Yadav, R.S.: Two dynamic reconfiguration approaches for optimizing the restoration path length in \(p\)-cycle protection network. Optoelectron. Lett. 6(4), 291–294 (2010)CrossRef Yadav, R., Yadav, R.S.: Two dynamic reconfiguration approaches for optimizing the restoration path length in \(p\)-cycle protection network. Optoelectron. Lett. 6(4), 291–294 (2010)CrossRef
18.
go back to reference Stamatelakis, D., Grover, W. D.: Distributed Reconfiguration of Spare Capacity in Closed Paths for Network Restoration,” U.S. Patent Pending, July 11, (1997) Stamatelakis, D., Grover, W. D.: Distributed Reconfiguration of Spare Capacity in Closed Paths for Network Restoration,” U.S. Patent Pending, July 11, (1997)
19.
go back to reference Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–307 (1970)CrossRefMATH Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–307 (1970)CrossRefMATH
Metadata
Title
Partitioning-based approach to control the restored path length in p-cycle-based survivable optical networks
Authors
Hari Mohan Singh
Rama Shankar Yadav
Publication date
06-10-2016
Publisher
Springer US
Published in
Photonic Network Communications / Issue 1/2017
Print ISSN: 1387-974X
Electronic ISSN: 1572-8188
DOI
https://doi.org/10.1007/s11107-016-0659-7

Other articles of this Issue 1/2017

Photonic Network Communications 1/2017 Go to the issue