Optimization of operational fiber links and interconnections for the merger of two networks

Optical Fiber Technology

Volumn 15, Issue 1, 2009, Pages 57-64

  Leung, Raymond Hai Ming ^a   Xie, Zhenchang ^a   Chen, Lian Kuan ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Hamiltonian path; Network merging; Network optimization; Network topology; Resource allocation

Indexed keywords

CODES (SYMBOLS); COSTS; FIBERS; HAMILTONIANS; INTERCONNECTION NETWORKS (CIRCUIT SWITCHING); MERGERS AND ACQUISITIONS; MERGING; RESOURCE ALLOCATION;

ANALYTICAL RESULTS; ARTICULATION NODE; HAMILTONIAN PATH; NETWORK MERGING; NETWORK OPTIMIZATION; NETWORK TOPOLOGY; OVERALL COSTS; SIMULATION MODEL;

TOPOLOGY;

EID: 55949132848     PISSN: 10685200     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.yofte.2008.04.005     Document Type: Article

References (20)

1. R.H.M. Leung, Q.L. Ding, V. Hung, Designing and planning of national optical networks in China, in: Proceedings of Pacific Telecom. Conference, HI, USA, 2001, paper W.1.3.3
2. R.H.M. Leung, L.K. Chen, Resources optimization of integration of separate optical networks, in: Proceedings of OFC/NFOEC 2006, Anaheim, CA, USA, 2006, paper NThE5
3. The Office of the Telecommunications Authority, Draft merger guideline for Hong Kong telecommunication markets, The HKSAR government publication, 2003
4. Bloomber, Alcatel and Lucent discuss merger, South China Morning Post newspaper, 25 March 2006, p. B4
5. D. Dunphy, Optical networking: An industry in transition, Fiber Systems/Lightwave Europe, March 2006, pp. 23-25
6. Cisco Systems, Evolving multiservice metro networks to support next generation service growth, Cisco Systems Inc. February 2006, paper Pa/LW10419
7. Das G., Parthiban R., and Tucher R.S. Traffic grooming in hybrid ring-star optical networks. J. Opt. Network 6 3 (2007) 263-277
8. Ramarao B., and Hanna M. Cutting the cost of transmission. Telecom. Int. Mag. (2006) 20-24
9. Raz, and Shavitt Y. Active networks for efficient distributed network management. IEEE Commun. Mag. (2000) 138-143
10. Wynants C. Network Synthesis Problems (2001), Kluwer, Dordrecht pp. 179-190, chap. 6
11. I. LOG, ILOG CPLEX6.5, Reference and user manual, March 1999
12. I. LOG, ILOG CPLEX6.5, Setting up guide, March 1999
13. Bienstock D., Chopra S., Gunleck O., and Tsai C.Y. Minimum cost capacity installation for multicommodity network flows. Math. Prog. 81 2 (1998) 177-199
14. A. Feldnann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, F. Tree, Deriving traffic demands for operational IP networks: methodology and experience, in: Proceedings of ACM SIGCOMM, Stockholm, Sweden, 2000, paper 8-1
15. Brownlee N. Understanding internet traffic streams dragonflies and tortoises. IEEE Commun. Mag. (2002) 110-117
16. Dahl G., and Stoer M. A cutting plane algorithm for multicommodity survivable network design problems. Inform. J. Comp. 10 1 (1998) 1-11
17. Gould R. Graph Theory (1998), Benjamin-Cummings, Redwood City, CA chap. 5
18. Z.C. Xie, L.K. Chen, R.H.M. Leung, C.K. Chan, An algorithm for resource optimization of consolidating two coexisting networks, in: Proceedings of OECC/IOOC 2007, Yokohama, Japan, 2007, paper 13A2-6
19. Z.C. Xie, R.H.M. Leung, L.K. Chen, C.K. Chan, Optimal location analysis of two interconnections for the consolidation of two networks, in: Proceedings of OFC/NFOEC 2008, San Diego, CA, USA, 2008, paper JThA 85
20. Zhang Z., Zhong W.D., and Mukherjee B. A heuristicmethod for design of survival WDM networks p-cycles. IEEE Commun. Lett. 8 7 (2004) 467-469