1+N network protection for mesh networks: Network coding-based protection using p-cycles

IEEE/ACM Transactions on Networking

Volumn 18, Issue 1, 2010, Pages 67-80

  Kamal, Ahmed E ^a  

^a Iowa State University   (United States)

Author keywords

1+N survivability; Network coding; Optical networks; P Cycles; Protection

Indexed keywords

BI-DIRECTIONAL CONNECTIONS; DATA UNITS; HYBRID SCHEME; IP-OVER-WDM; LINK DISJOINT; MESH NETWORK; MODE OF OPERATIONS; MPLS/GMPLS; MULTI-POINT CONNECTION; NETWORK CODING; NETWORK GRAPH; NETWORK PROTECTION; NEW CONCEPT; NUMERICAL RESULTS; OPTICAL MESH NETWORK; OPTICAL NETWORKS; OPTIMAL FORMULATION; OUTAGE TIME; P-CYCLES; PERFORMANCE STUDY; PROPAGATION DELAYS; PROTECTION CIRCUITS; PROTECTION SCHEMES; SMALL NETWORKS; TWO-LINK;

FIBER OPTIC NETWORKS; MESH NETWORKING; NUMERICAL ANALYSIS; OPTICAL MATERIALS; TELECOMMUNICATION NETWORKS;

COMPUTER SYSTEM RECOVERY;

EID: 77249094494     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2020503     Document Type: Article

References (16)

1. D. Zhou and S. Subramaniam, "Survivability in optical networks," IEEE Network, vol.14, no.6, pp. 16-23, Nov./Dec. 2000.
2. 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.
3. 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.
4. W. D. Grover, Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Upper Saddle River, NJ: Prentice-Hall, 2004.
5. 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.
6. 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.
7. 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.
8. 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.
9. T. Ho,D. R. Karger,M. Medard, andR. Koetter, "Network coding from a network flow perspective," in Proc. Int. Symp. Inf. Theory, 2003, p. 441.
10. 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.
11. R.Koetter and M.Medard, "An algebraic approach tonetwork coding," IEEE/ACM Trans. Netw., vol.11, no.5, pp. 782-795, Oct. 2005.
12. 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.
13. 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.
14. 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.
15. R. Bhandari, Survivable Networks: Algorithms for Diverse Routing. New York: Springer, 1999.
16. 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.