Ahmed E. Kamal
Abstract
p-Cycles have been proposed for preprovisioned 1 + N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the rerouting of traffic can be a time consuming operation. Another survivable mode of operation is the 1 + 1 protection mode, in which a signal is transmitted to the destination on two link disjoint circuits, hence recovery from failures is expeditious. However, this requires a large number of protection circuits. In this paper, we introduce a new concept in protection: 1 + N protection, in which a p-Cycle, similar to FIPP p-cycles, can be used to protect a number of bidirectional connections, which are mutually link disjoint, and also link disjoint from all links of the p-Cycle. However, data units from different circuits are combined using network coding, which can be implemented in a number of technologies, such as Next Generation SONET (NGS), MPLS/GMPLS, or IP-over-WDM. The maximum outage time under this protection scheme can be limited to no more than the p-Cycle propagation delay. It is also shown how to implement a hybrid 1 + N and 1 + N protection scheme, in which on-cycle links are protected using 1 + N protection, while straddling links, or paths, are protected using 1 + N protection. Extensions of this technique to protect multipoint connections are also introduced. A performance study based on optimal formulations of the 1 + 1, 1 + N and the hybrid scheme is introduced. Although 1 + N speed of recovery is comparable to that of 1 + N protection, numerical results for small networks indicate that 1 + N is about 30% more efficient than 1 + 1 protection, in terms of the amount of protection resources, especially as the network graph density increases.
- D. Zhou and S. Subramaniam, "Survivability in optical networks," IEEE Network, vol. 14, no. 6, pp. 16-23, Nov./Dec. 2000. Google Scholar
- D. Stamatelakis and W. D. Grover, "Theoretical underpinnings for the efficiency of restorable networks using preconfigured cycles (p-cycles)," IEEE Trans. Commun., vol. 48, no. 8, pp. 1262-1265, Aug. 2000.Google Scholar
- D. Stamatelakis and W. D. Grover, "Ip layer restoration and network planning based on virtual protection cycles," IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1938-1949, Oct. 2000. Google Scholar
- W. D. Grover, Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Upper Saddle River, NJ: Prentice-Hall, 2004. Google Scholar
- G. Shen and W. D. Grover, "Extending the p-cycle concept to path segment protection for span and node failure recovery," IEEE J. Sel. Areas Commun., vol. 21, no. 10, pp. 1306-1319, Oct. 2003. Google Scholar
- A. Kodian and W. D. Grover, "Failure-independent path-protecting p-cycles: Efficient and simple fully preconnected optical-path protection," J. Lightw. Technol., vol. 23, no. 10, pp. 3241-3259, Oct. 2005.Google Scholar
- W. D. Grover and A. Kodian, "Failure-independent path protection with p-cycles: Efficient, fast and simple protection for transparent optical networks," in Proc. 7th ICTON, Jul. 2005, pp. 363-369.Google Scholar
- R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, Jul. 2000. Google Scholar
- T. Ho, D. R. Karger, M. Medard, and R. Koetter, "Network coding from a network flow perspective," in Proc. Int. Symp. Inf. Theory, 2003, p. 441.Google Scholar
- D. S. Lun, M. Médard, T. Ho, and R. Koetter, "Network coding with a cost criterion," in Proc. Int. Symp. Inf. Theory and Its Appl., Parma, Italy, Oct. 2004, pp. 1232-1237.Google Scholar
- R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2005. Google Scholar
- S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. M. G. M. Tolhuizen, "Polynomial time algorithms for multicast network code construction," IEEE Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, Jun. 2005. Google Scholar
- C. Fragouli, J.-Y. LeBoudec, and J. Widmer, "Network coding: An instant primer," Comput. Commun. Rev., vol. 36, no. 1, pp. 63-68, Jan. 2006. Google Scholar
- E. Hernandez-Valencia, M. Scholten, and Z. Zhu, "The generic framing procedure (gfp): An overview," IEEE Commun., vol. 40, no. 5, pp. 63-71, May 2002. Google Scholar
- R. Bhandari, Survivable Networks: Algorithms for Diverse Routing. New York: Springer, 1999. Google Scholar
- W. He, J. Fang, and A. Somani, "A p-cycle based survivable design for dynamic traffic in WDM networks," presented at the IEEE Globecom, 2005.Google Scholar
Index Terms
- 1 + N network protection for mesh networks: network coding-based protection using p-cycles
Recommendations
On surviving dual-link failures in path protected optical WDM mesh networks
In this paper, we investigate the problem of enhancing dual-failure restorability in path protected mesh-restorable optical Wavelength Division Multiplexed (WDM) networks. Recent studies have demonstrated the need to survive simultaneous dual-link ...
Extension of segment protection for bandwidth efficiency and differentiated quality of protection in optical/MPLS networks
This paper investigates the problem of dynamic survivable lightpath provisioning against single-node/link failures in optical mesh networks employing wavelength-division multiplexing (WDM). We unify various forms of segment protection into generalized ...
Survivability in waveband switching optical networks: Challenges and new ideas
With the developmental trend of ultra-high speed and ultra-large capacity required in optical networks, the number of wavelengths in each fiber greatly keeps increasing and the consequence is that the size (i.e., number of switching ports) and cost of ...
Comments