Multi-criteria p-cycle network design

Proceedings - Conference on Local Computer Networks, LCN

Volumn , Issue , 2008, Pages 361-366

  Drid, Hamza ^a   Cousin, Bernard ^a   Lahoud, Samer ^a   Molnar, Miklos ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Network management complexity; Network survivability; P cycle; WDM protection

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ARTS COMPUTING; COMPUTER NETWORKS; COMPUTERS; HEURISTIC METHODS; INTERNET; MANAGEMENT INFORMATION SYSTEMS; METROPOLITAN AREA NETWORKS; QUALITY ASSURANCE; REDUNDANCY; RELIABILITY; TELECOMMUNICATION NETWORKS; WAVELENGTH DIVISION MULTIPLEXING;

EFFICIENT SETS; HEURISTIC APPROACHES; NETWORK DESIGNS; NETWORK MANAGEMENT COMPLEXITY; NETWORK SURVIVABILITY; ONE STEPS; OPTIMAL SETS; P-CYCLE; P-CYCLES; SIMULATION STUDIES; WDM PROTECTION; WORKING CAPACITIES;

NETWORK MANAGEMENT;

EID: 58049128232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LCN.2008.4664191     Document Type: Conference Paper

References (13)

1. W. D. Grover and D. Stamatelakis, Cycle Oriented Distributed Preconfiguration: Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration, In Proc. of IEEE International Conference on Communications, pp. 537-543,1998.
2. D. A. Schupke, C. G. Gruber and A. Autenrieth, Optimal Configuration of p-Cycles in WDM Networks, In Proc. of IEEE International Conference on Communications, pp. 2761-2765, 2002.
3. J. Doucette, D. He, W. D. Grover and O. Yang, Algorithmic Approaches for Efficient Enumeration of Candidate p-Cycles and Capacitated p-Cycle Network Design, In Proc. of the Fourth International Workshop on the Design of Reliable Communication Networks DRCN, pp. 212-220, 2003.
4. D. A. Schupke, An ILP for Optimal p-Cycle Selection without Cycle Enumeration, in Proc. of the Eighth Working Conference on Optical Network Design and Modelling, 2004.
5. Z. Zhang, W. Zhong and B. Mukherjee, A Heuristic Algorithm for p-Cycles Configuration in WDM Optical Networks, in Proc : Opto-Elecrtoinics and Communications Conference, pp. 568-569, 2003.
6. C. G.Gruber, Resilient Networks with Non-Simple p-Cycles, in Proc. of the International Conference on Telecommunications, 2003.
7. H. N. Nguyen, D. Habibi, V. Q. Phung, S. Lachowicz, K. Lo and B. Kang, Joint Optimization in Capacity Design of Networks with p-Cycle Using the Fundamental Cycle Set, In Proc. of IEEE GLOBECOM, 2006.
8. H. Zhang and O. Yang, Finding Protection Cycles in DWDM Networks, In Proc. IEEE International Conference on Communication, pp. 2756-2760, 2002.
9. C. Liu and L. Ruan, Finding Good Candidate Cycles for Efficient p-Cycle Network Design, In Proc. 13th International Conference on Computer Communication and Networks, pp. 321-326, 2004.
10. W. D.Grover and J. Doucette, Advances in Optical Network Design with p-Cycles: Joint optimization and pre-selection of candidate P-cycles, In Proc. of the IEEE-LEOS Summer Topical Meeting on All Optical Networking, pp. WA2-49-WA2-50, 2002.
11. D. P.Onguetou and W. D. Grover, p-Cycle Network Design: from Fewest in Number to Smallest in Size, In Proc of the 6th International Workshop on Design and Reliable Communication Networks, 2007.
12. J. L. Marzo, E. Calle, P. Vil, A. Urra, Performance evaluation of minimum interference routing in network scenarios with protection requirements, Computer Communications, pp. 3161-3168, 2007.
13. J. Van Leeuwen, Algorithms and Complexity, Handbook of Theoretical Computer Science,1990.