Abstract

The p-cycle is the most promising technique used for the survivability of WDM networks. Relevant studies conducted by eminent researchers in this field have suggested that the reliability of the p-cycle can be enhanced further. In order to address the problem, the authors introduced a concept, namely, intercycle switching (ICS), that reduces the length of the p-cycle restoration segment by exploiting an idle p-cycle. This reduction implies a minimized restored path (end-to-end) length and thus improves the quality and reliability of optical transport networks. Through this paper, the authors show how the effectiveness of the ICS approach can be enhanced by considering the restored path during intercycle switching instead of the p-cycle restoration segment, namely, as enhanced ICS (EICS). Furthermore, the authors worked on the optimal allocation of the candidate p-cycle and idle p-cycle (OPIA) to the working paths to choose the restored path optimally where EICS is more effective.

© 2010 Optical Society of America

Full Article  |  PDF Article

References

  • View by:
  • |
  • |
  • |

  1. W. D. Grover, D. Stamatelakis, “Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration,” in IEEE Int. Conf. on Communications, 1998, pp. 537–543.
  2. W. D. Grover, “p-cycles,” in Mesh-Based Survivable Networks: Options for Optical, MPLS, SONET and ATM Networking. Prentice-Hall, 2003, ch. 10.
  3. R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd ed. Morgan Kaufmann, 2002, pp. 667–710.
    [CrossRef]
  4. R. Yadav, R. S. Yadav, H. M. Singh, “A review: survivable transport networks based on p-cycles,” Int. J. Comput. Sci. Eng. Syst., vol. 1, no. 3, pp. 225–233, July 2007.
  5. R. Asthana, Y. N. Singh, W. D. Grover, “p-cycles: an overview,” IEEE Commun. Surv. Tutorials, vol. 12, no. 1, pp. 97–111, 2010.
    [CrossRef]
  6. F. Zhang, W.-D. Zhong, Y. Jin, “Optimizations of p-cycle-based protection of optical multicast sessions,” J. Lightwave Technol., vol. 26, no. 19, pp. 3298–3306, Jan. 2009.
    [CrossRef]
  7. L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
    [CrossRef]
  8. A. Kodian, A. Sack, W. D. Grover, “The threshold hop-limit effect in p-cycles: comparing hop- and circumference-limited design,” Opt. Switching Networking, vol. 2, pp. 72–85, 2005.
    [CrossRef]
  9. A. Kodin, A. Sack, W. D. Grover, “p-cycle network design with hop limits and circumference limits,” in Proc. 5th Int. Conf. on Broadband Networks, San Jose, CA, 2004, pp. 244–253.
  10. R. Asthana, Y. N. Singh, “Second phase reconfiguration of restored path for removal of loop back in p-cycle protection,” IEEE Commun. Lett., vol. 11, no. 2, pp. 201–203, Feb. 2007.
    [CrossRef]
  11. R. Asthana, Y. N. Singh, “distributed protocol for removal of loop backs and optimum allocation of p-cycles to minimize the restored path lengths,” J. Lightwave Technol., vol. 26, no. 5, pp. 616–627, Mar. 2008.
    [CrossRef]
  12. P. Cholda, A. Jaiszczyk, “Reliability assessment of p-cycles,” in IEEE Global Telecommunications Conf., St. Louis, MO, 2005.
  13. D. Schupke, R. Prinz, “Capacity efficiency and restorability of path protection and rerouting in WDM networks subject to dual failures,” Photon. Netw. Commun., vol. 8, no. 2, pp. 191–207, 2004.
    [CrossRef]
  14. D. S. Mukherjee, C. Assi, A. Agarwal, “Alternate strategies for dual failure restoration using p-cycles,” in IEEE Int. Conf. on Communications, Istanbul, Turkey, 2006, vol. 6, pp. 2477–2482.
  15. C.-C. Sue, “Locally reconfigurable p-cycle networks for dual-failure restoration,” Photon. Netw. Commun., vol. 17, pp. 129–144, 2009.
    [CrossRef]
  16. R. Yadav, R. S. Yadav, H. M. Singh, “Two dynamic reconfiguration approaches for optimization of restoration path length in p-cycle protection network,” Optoelectron. Lett., vol. 6, no. 4, pp. 291–294, July 2010.
    [CrossRef]
  17. R. Yadav, R. S. Yadav, H. M. Singh, “Quality enhancement in p-cycles using optimized restoration path (ORP) algorithm,” in Proc. of IEEE Int. Conf. on Advances in Recent Technologies in Communication and Computing, 2009, pp. 549–553.
  18. D. P. Onguetou, W. D. Grover, “Approaches to p-cycle network design with controlled optical path lengths in the restored network state,” J. Opt. Netw., vol. 7, no. 7, pp. 673–691, July 2008.
    [CrossRef]
  19. Y. Liu, N. C. Raleigh, D. Tipper, “Apparatus and method for spare capacity allocation,” U.S. Patent 6,744,727B2, June 1, 2004.
  20. D. Stamatelakis, W. D. Grover, “Distributed pre-configuration of spare capacity in closed paths for network restoration,” U.S. Patent 7,230,916, June 12, 2007.

2010 (3)

R. Asthana, Y. N. Singh, W. D. Grover, “p-cycles: an overview,” IEEE Commun. Surv. Tutorials, vol. 12, no. 1, pp. 97–111, 2010.
[CrossRef]

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

R. Yadav, R. S. Yadav, H. M. Singh, “Two dynamic reconfiguration approaches for optimization of restoration path length in p-cycle protection network,” Optoelectron. Lett., vol. 6, no. 4, pp. 291–294, July 2010.
[CrossRef]

2009 (2)

C.-C. Sue, “Locally reconfigurable p-cycle networks for dual-failure restoration,” Photon. Netw. Commun., vol. 17, pp. 129–144, 2009.
[CrossRef]

F. Zhang, W.-D. Zhong, Y. Jin, “Optimizations of p-cycle-based protection of optical multicast sessions,” J. Lightwave Technol., vol. 26, no. 19, pp. 3298–3306, Jan. 2009.
[CrossRef]

2008 (2)

2007 (2)

R. Yadav, R. S. Yadav, H. M. Singh, “A review: survivable transport networks based on p-cycles,” Int. J. Comput. Sci. Eng. Syst., vol. 1, no. 3, pp. 225–233, July 2007.

R. Asthana, Y. N. Singh, “Second phase reconfiguration of restored path for removal of loop back in p-cycle protection,” IEEE Commun. Lett., vol. 11, no. 2, pp. 201–203, Feb. 2007.
[CrossRef]

2005 (1)

A. Kodian, A. Sack, W. D. Grover, “The threshold hop-limit effect in p-cycles: comparing hop- and circumference-limited design,” Opt. Switching Networking, vol. 2, pp. 72–85, 2005.
[CrossRef]

2004 (1)

D. Schupke, R. Prinz, “Capacity efficiency and restorability of path protection and rerouting in WDM networks subject to dual failures,” Photon. Netw. Commun., vol. 8, no. 2, pp. 191–207, 2004.
[CrossRef]

Agarwal, A.

D. S. Mukherjee, C. Assi, A. Agarwal, “Alternate strategies for dual failure restoration using p-cycles,” in IEEE Int. Conf. on Communications, Istanbul, Turkey, 2006, vol. 6, pp. 2477–2482.

Assi, C.

D. S. Mukherjee, C. Assi, A. Agarwal, “Alternate strategies for dual failure restoration using p-cycles,” in IEEE Int. Conf. on Communications, Istanbul, Turkey, 2006, vol. 6, pp. 2477–2482.

Asthana, R.

R. Asthana, Y. N. Singh, W. D. Grover, “p-cycles: an overview,” IEEE Commun. Surv. Tutorials, vol. 12, no. 1, pp. 97–111, 2010.
[CrossRef]

R. Asthana, Y. N. Singh, “distributed protocol for removal of loop backs and optimum allocation of p-cycles to minimize the restored path lengths,” J. Lightwave Technol., vol. 26, no. 5, pp. 616–627, Mar. 2008.
[CrossRef]

R. Asthana, Y. N. Singh, “Second phase reconfiguration of restored path for removal of loop back in p-cycle protection,” IEEE Commun. Lett., vol. 11, no. 2, pp. 201–203, Feb. 2007.
[CrossRef]

Cao, J.

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

Cholda, P.

P. Cholda, A. Jaiszczyk, “Reliability assessment of p-cycles,” in IEEE Global Telecommunications Conf., St. Louis, MO, 2005.

Grover, W. D.

R. Asthana, Y. N. Singh, W. D. Grover, “p-cycles: an overview,” IEEE Commun. Surv. Tutorials, vol. 12, no. 1, pp. 97–111, 2010.
[CrossRef]

D. P. Onguetou, W. D. Grover, “Approaches to p-cycle network design with controlled optical path lengths in the restored network state,” J. Opt. Netw., vol. 7, no. 7, pp. 673–691, July 2008.
[CrossRef]

A. Kodian, A. Sack, W. D. Grover, “The threshold hop-limit effect in p-cycles: comparing hop- and circumference-limited design,” Opt. Switching Networking, vol. 2, pp. 72–85, 2005.
[CrossRef]

A. Kodin, A. Sack, W. D. Grover, “p-cycle network design with hop limits and circumference limits,” in Proc. 5th Int. Conf. on Broadband Networks, San Jose, CA, 2004, pp. 244–253.

W. D. Grover, D. Stamatelakis, “Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration,” in IEEE Int. Conf. on Communications, 1998, pp. 537–543.

W. D. Grover, “p-cycles,” in Mesh-Based Survivable Networks: Options for Optical, MPLS, SONET and ATM Networking. Prentice-Hall, 2003, ch. 10.

D. Stamatelakis, W. D. Grover, “Distributed pre-configuration of spare capacity in closed paths for network restoration,” U.S. Patent 7,230,916, June 12, 2007.

Guo, L.

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

Hou, W.

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

Jaiszczyk, A.

P. Cholda, A. Jaiszczyk, “Reliability assessment of p-cycles,” in IEEE Global Telecommunications Conf., St. Louis, MO, 2005.

Jin, Y.

Kodian, A.

A. Kodian, A. Sack, W. D. Grover, “The threshold hop-limit effect in p-cycles: comparing hop- and circumference-limited design,” Opt. Switching Networking, vol. 2, pp. 72–85, 2005.
[CrossRef]

Kodin, A.

A. Kodin, A. Sack, W. D. Grover, “p-cycle network design with hop limits and circumference limits,” in Proc. 5th Int. Conf. on Broadband Networks, San Jose, CA, 2004, pp. 244–253.

Li, Y.

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

Liu, Y.

Y. Liu, N. C. Raleigh, D. Tipper, “Apparatus and method for spare capacity allocation,” U.S. Patent 6,744,727B2, June 1, 2004.

Mukherjee, D. S.

D. S. Mukherjee, C. Assi, A. Agarwal, “Alternate strategies for dual failure restoration using p-cycles,” in IEEE Int. Conf. on Communications, Istanbul, Turkey, 2006, vol. 6, pp. 2477–2482.

Onguetou, D. P.

Prinz, R.

D. Schupke, R. Prinz, “Capacity efficiency and restorability of path protection and rerouting in WDM networks subject to dual failures,” Photon. Netw. Commun., vol. 8, no. 2, pp. 191–207, 2004.
[CrossRef]

Raleigh, N. C.

Y. Liu, N. C. Raleigh, D. Tipper, “Apparatus and method for spare capacity allocation,” U.S. Patent 6,744,727B2, June 1, 2004.

Ramaswami, R.

R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd ed. Morgan Kaufmann, 2002, pp. 667–710.
[CrossRef]

Sack, A.

A. Kodian, A. Sack, W. D. Grover, “The threshold hop-limit effect in p-cycles: comparing hop- and circumference-limited design,” Opt. Switching Networking, vol. 2, pp. 72–85, 2005.
[CrossRef]

A. Kodin, A. Sack, W. D. Grover, “p-cycle network design with hop limits and circumference limits,” in Proc. 5th Int. Conf. on Broadband Networks, San Jose, CA, 2004, pp. 244–253.

Schupke, D.

D. Schupke, R. Prinz, “Capacity efficiency and restorability of path protection and rerouting in WDM networks subject to dual failures,” Photon. Netw. Commun., vol. 8, no. 2, pp. 191–207, 2004.
[CrossRef]

Singh, H. M.

R. Yadav, R. S. Yadav, H. M. Singh, “Two dynamic reconfiguration approaches for optimization of restoration path length in p-cycle protection network,” Optoelectron. Lett., vol. 6, no. 4, pp. 291–294, July 2010.
[CrossRef]

R. Yadav, R. S. Yadav, H. M. Singh, “A review: survivable transport networks based on p-cycles,” Int. J. Comput. Sci. Eng. Syst., vol. 1, no. 3, pp. 225–233, July 2007.

R. Yadav, R. S. Yadav, H. M. Singh, “Quality enhancement in p-cycles using optimized restoration path (ORP) algorithm,” in Proc. of IEEE Int. Conf. on Advances in Recent Technologies in Communication and Computing, 2009, pp. 549–553.

Singh, Y. N.

R. Asthana, Y. N. Singh, W. D. Grover, “p-cycles: an overview,” IEEE Commun. Surv. Tutorials, vol. 12, no. 1, pp. 97–111, 2010.
[CrossRef]

R. Asthana, Y. N. Singh, “distributed protocol for removal of loop backs and optimum allocation of p-cycles to minimize the restored path lengths,” J. Lightwave Technol., vol. 26, no. 5, pp. 616–627, Mar. 2008.
[CrossRef]

R. Asthana, Y. N. Singh, “Second phase reconfiguration of restored path for removal of loop back in p-cycle protection,” IEEE Commun. Lett., vol. 11, no. 2, pp. 201–203, Feb. 2007.
[CrossRef]

Sivarajan, K. N.

R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd ed. Morgan Kaufmann, 2002, pp. 667–710.
[CrossRef]

Stamatelakis, D.

W. D. Grover, D. Stamatelakis, “Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration,” in IEEE Int. Conf. on Communications, 1998, pp. 537–543.

D. Stamatelakis, W. D. Grover, “Distributed pre-configuration of spare capacity in closed paths for network restoration,” U.S. Patent 7,230,916, June 12, 2007.

Sue, C.-C.

C.-C. Sue, “Locally reconfigurable p-cycle networks for dual-failure restoration,” Photon. Netw. Commun., vol. 17, pp. 129–144, 2009.
[CrossRef]

Tipper, D.

Y. Liu, N. C. Raleigh, D. Tipper, “Apparatus and method for spare capacity allocation,” U.S. Patent 6,744,727B2, June 1, 2004.

Wang, X.

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

Wu, J.

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

Yadav, R.

R. Yadav, R. S. Yadav, H. M. Singh, “Two dynamic reconfiguration approaches for optimization of restoration path length in p-cycle protection network,” Optoelectron. Lett., vol. 6, no. 4, pp. 291–294, July 2010.
[CrossRef]

R. Yadav, R. S. Yadav, H. M. Singh, “A review: survivable transport networks based on p-cycles,” Int. J. Comput. Sci. Eng. Syst., vol. 1, no. 3, pp. 225–233, July 2007.

R. Yadav, R. S. Yadav, H. M. Singh, “Quality enhancement in p-cycles using optimized restoration path (ORP) algorithm,” in Proc. of IEEE Int. Conf. on Advances in Recent Technologies in Communication and Computing, 2009, pp. 549–553.

Yadav, R. S.

R. Yadav, R. S. Yadav, H. M. Singh, “Two dynamic reconfiguration approaches for optimization of restoration path length in p-cycle protection network,” Optoelectron. Lett., vol. 6, no. 4, pp. 291–294, July 2010.
[CrossRef]

R. Yadav, R. S. Yadav, H. M. Singh, “A review: survivable transport networks based on p-cycles,” Int. J. Comput. Sci. Eng. Syst., vol. 1, no. 3, pp. 225–233, July 2007.

R. Yadav, R. S. Yadav, H. M. Singh, “Quality enhancement in p-cycles using optimized restoration path (ORP) algorithm,” in Proc. of IEEE Int. Conf. on Advances in Recent Technologies in Communication and Computing, 2009, pp. 549–553.

Zhang, F.

Zhong, W.-D.

IEEE Commun. Lett. (1)

R. Asthana, Y. N. Singh, “Second phase reconfiguration of restored path for removal of loop back in p-cycle protection,” IEEE Commun. Lett., vol. 11, no. 2, pp. 201–203, Feb. 2007.
[CrossRef]

IEEE Commun. Surv. Tutorials (1)

R. Asthana, Y. N. Singh, W. D. Grover, “p-cycles: an overview,” IEEE Commun. Surv. Tutorials, vol. 12, no. 1, pp. 97–111, 2010.
[CrossRef]

IEEE Trans. Commun. (1)

L. Guo, X. Wang, J. Cao, W. Hou, J. Wu, Y. Li, “Local and global Hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks,” IEEE Trans. Commun., vol. 58, no. 3, pp. 851–859, Mar. 2010.
[CrossRef]

Int. J. Comput. Sci. Eng. Syst. (1)

R. Yadav, R. S. Yadav, H. M. Singh, “A review: survivable transport networks based on p-cycles,” Int. J. Comput. Sci. Eng. Syst., vol. 1, no. 3, pp. 225–233, July 2007.

J. Lightwave Technol. (2)

J. Opt. Netw. (1)

Opt. Switching Networking (1)

A. Kodian, A. Sack, W. D. Grover, “The threshold hop-limit effect in p-cycles: comparing hop- and circumference-limited design,” Opt. Switching Networking, vol. 2, pp. 72–85, 2005.
[CrossRef]

Optoelectron. Lett. (1)

R. Yadav, R. S. Yadav, H. M. Singh, “Two dynamic reconfiguration approaches for optimization of restoration path length in p-cycle protection network,” Optoelectron. Lett., vol. 6, no. 4, pp. 291–294, July 2010.
[CrossRef]

Photon. Netw. Commun. (2)

C.-C. Sue, “Locally reconfigurable p-cycle networks for dual-failure restoration,” Photon. Netw. Commun., vol. 17, pp. 129–144, 2009.
[CrossRef]

D. Schupke, R. Prinz, “Capacity efficiency and restorability of path protection and rerouting in WDM networks subject to dual failures,” Photon. Netw. Commun., vol. 8, no. 2, pp. 191–207, 2004.
[CrossRef]

Other (9)

D. S. Mukherjee, C. Assi, A. Agarwal, “Alternate strategies for dual failure restoration using p-cycles,” in IEEE Int. Conf. on Communications, Istanbul, Turkey, 2006, vol. 6, pp. 2477–2482.

R. Yadav, R. S. Yadav, H. M. Singh, “Quality enhancement in p-cycles using optimized restoration path (ORP) algorithm,” in Proc. of IEEE Int. Conf. on Advances in Recent Technologies in Communication and Computing, 2009, pp. 549–553.

Y. Liu, N. C. Raleigh, D. Tipper, “Apparatus and method for spare capacity allocation,” U.S. Patent 6,744,727B2, June 1, 2004.

D. Stamatelakis, W. D. Grover, “Distributed pre-configuration of spare capacity in closed paths for network restoration,” U.S. Patent 7,230,916, June 12, 2007.

A. Kodin, A. Sack, W. D. Grover, “p-cycle network design with hop limits and circumference limits,” in Proc. 5th Int. Conf. on Broadband Networks, San Jose, CA, 2004, pp. 244–253.

P. Cholda, A. Jaiszczyk, “Reliability assessment of p-cycles,” in IEEE Global Telecommunications Conf., St. Louis, MO, 2005.

W. D. Grover, D. Stamatelakis, “Cycle-oriented distributed pre-configuration: ring-like speed with mesh-like capacity for self-planning network restoration,” in IEEE Int. Conf. on Communications, 1998, pp. 537–543.

W. D. Grover, “p-cycles,” in Mesh-Based Survivable Networks: Options for Optical, MPLS, SONET and ATM Networking. Prentice-Hall, 2003, ch. 10.

R. Ramaswami, K. N. Sivarajan, Optical Networks: A Practical Perspective, 2nd ed. Morgan Kaufmann, 2002, pp. 667–710.
[CrossRef]

Cited By

OSA participates in CrossRef's Cited-By Linking service. Citing articles from OSA journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (5)

Fig. 1
Fig. 1

(a) Restoration path with conventional p-cycle and idle p-cycle. (b) Restored path with EICS.

Fig. 2
Fig. 2

(a) Restoration path with conventional p-cycle and idle p-cycle. (b) Restored path with EICS and OPIA.

Fig. 3
Fig. 3

Test network with working capacity and available number of idle p-cycles on each span.

Fig. 4
Fig. 4

Lengths of the restored paths with CRP, ICS, EICS, and EICS with OPIA for test network.

Fig. 5
Fig. 5

Effect on restored path lengths with CRP, ICS, EICS, and EICS with OPIA approaches.

Tables (3)

Tables Icon

Table 1 Algorithm for Enhanced Intercycle Switching

Tables Icon

Table 1 Possible Allotment of RPs and Idle p -Cycles

Tables Icon

Table 2 Average Lengths of Restored Path With Percentage of Released Spare Capacity