Comparison of p-cycles and p-trees in a unified mathematical framework

Photonic Network Communications

Volumn 14, Issue 2, 2007, Pages 123-133

  Grue, Aden ^a   Grover, Wayne D ^a,b  

^a TRLABS   (Canada)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Hierarchical tree; Integer linear programming; P Cycle; P Path; P Segment; P Tree; Restorable network

Indexed keywords

HAMILTONIANS; INTEGER PROGRAMMING; LINEAR PROGRAMMING;

CAPACITY EFFICIENCY; HIERARCHICAL TREE; RESTORABLE NETWORK;

TREES (MATHEMATICS);

EID: 34848876309     PISSN: 1387974X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11107-007-0059-0     Document Type: Article

References (15)

1. Grover, W. D., & Stamatelakis, D. (2000). Bridging the ring-mesh dichotomy with p-cycles. Proceedings of IEEE/VDE design of reliable communication networks (DRCN 2000) (pp. 92-104). Munich, Germany, April 2000.
2. Grover, W. (2003). Mesh-based survivable networks: Options and strategies for optical, MPLS, SONET and ATM Networking, Prentice-Hall PTR.
3. Stamatelakis, D. (1997). Theory and algorithms for preconfiguration of spare capacity in mesh restorable networks, M. Sc. Thesis. University of Alberta, Spring 1997.
4. Lan, T., Steenhaut, K., & Nowe, A. (2002). Shared backup tree protection in MPλS networks. Proceedings of 8th international conference on communication systems 2002 (Vol. 2, pp. 1237-1241). Brussels, Belgium, November 2002.
5. Groebbens A., Colle D., Maesschalck S.D., Lievens I., Pickavet M., Demeester P. (2003). Efficient protection in MPλS networks using backup trees: Part one-concepts and heuristics. Photonic Network Communications 6(3): 191-206
6. Groebbens A., Colle D., Maesschalck S.D., Lievens I., Pickavet M., Demeester P. (2003). Efficient protection in MPλS networks using backup trees: Part two-simulations. Photonic Network Communications 6(3): 207-222
7. Médard M., Finn S.G., Barry R.A. (1999). Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Transactions on Network 7(5): 641-652
8. Xue G., Chen L., Thulasiraman K. (2002). Delay reduction in redundant trees for pre-planned protection against single link/node failure in 2-connected graphs. Proceedings of GLOBECOM 2002 - IEEE Global Telecommunications Conference 21(1): 2698-2702
9. Xue G., Chen L., Thulasiraman K. (2003). Quality of service and quality of protection issues in preplanned recovery schemes using redundant trees. IEEE Journal on Selected Areas in Communications 21: 1332-1345
10. Shah-Heydari, S., & Yang, O. (2001). A tree-based algorithm for protection/restoration in optical mesh networks. Proceedings of Canadian conference on electrical and computer engineering CCECE'2001 (pp. 1169-1173). Toronto, Canada, May 2001.
11. Shah-Heydari S., Yang O. (2004). Hierarchical protection tree scheme for failure recovery in mesh networks. Photonic Network Communications 7(2): 145-159
12. Yang, O., & Zhang, Y. (2002). A distributed tree algorithms for WDM network protection/restoration. Proceedings of high speed networks and multimedia communications 5th IEEE international conference (pp. 289-294). Jeju Island, Korea, July 2002.
13. Shah-Heydari, S. (2007). Self-repairing hierarchical tree-based Link restoration scheme for mesh networks, Ph.D. Thesis. University of Ottawa, Spring 2007.
14. Tang, F., & Ruan, L. (2005). A protection tree scheme for first-failure protection and second-failure restoration in optical networks. Proceedings of international conference on computer network and mobile computing 2005 (pp. 620-631). Zhangjiajie, China, August 2005.
15. Schupke, D. (2004). Cycle-based protection for optical transport networks, Ph.D. Dissertation. Technical University of Munich, Fall 2004.