Cost comparison of 1+1 path protection schemes: A case for coding

IEEE International Conference on Communications

Volumn , Issue , 2012, Pages 3067-3072

  Øverby, Harald ^a   Biczók, Gergely ^a   Babarczi, Péter ^b   Tapolcai, János ^b  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

BACK-BONE NETWORK; COST COMPARISONS; COST-EFFICIENT; NETWORK TOPOLOGY; PATH PROTECTION; REDUCED COST; SHORT-PATH;

ELECTRIC NETWORK TOPOLOGY; NETWORK CODING; QUALITY OF SERVICE;

COSTS;

EID: 84871942228     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2012.6363928     Document Type: Conference Paper

References (11)

1. D. Zhou and S. Subramaniam. Survivability in optical networks, IEEE Netw., 14(6):12-23, 2000.
2. D. Griffith and S. Less. A 1+1 protection architecture for optical burst switched networks, IEEE JSAC, 21:1384-1398, 2003.
3. H. Øverby. Cost evaluations of the protected network layer packet redundancy scheme, OSA J. Opt. Netw., 5(10):747-763, 2006.
4. E. Anyanoglu, D. Gitlin and J. Mazo. Diversity Coding and Transparent Self-Healing and Fault-Tolerant Communication Networks, IEEE Trans. Comm., 41(11):1677-1686, 1993.
5. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow, IEEE Trans. Inform. Theory, 46:1204-1216, 2000.
6. M. Belzner and H. Haunstein. Performance of Network Coding in Transport Networks with Traffic Protection, In: Proc. of 10. ITGFachtagung Photonische Netze, 2009.
7. S. El Rouayheb, A. Sprintson and C. Georghiades. Robust Network Codes for Unicast Connections: A Case Study, IEEE/ACM Trans. Netw., 19:644-656, 2011.
8. A. E. Kamal. A Generalized Strategy for 1+N Protection, In: Proc. of IEEE ICC, 2008.
9. M. Belzner, H. Haunstein and A. Wijngaarden. On the Performance of Network Coding with Protection Cycles, In: Proc. of IEEE ICC, 2011.
10. M. Zhang, L.Wang, and P. Ye. All optical XOR logic gates: technologies and experiment demonstrations, IEEE Commun. Mag., 43(5):19-24, 2005.
11. J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths, Networks, 14(2):325-336, 1984.