Cost-efficient fiber connection topology design for metropolitan area WDM networks

Journal of Optical Communications and Networking

Volumn 1, Issue 1, 2009, Pages 158-175

  Guan, Kyle C ^a   Chan, Vincent W S ^b  

^a BAE SYSTEMS   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Generalized Moore Graph; Metropolitan area network (MAN); Network optimization; Optical cross connect (OXC); Regular topology; Routing and wavelength assignment (RWA)

Indexed keywords

GENERALIZED MOORE GRAPH; NETWORK OPTIMIZATION; OPTICAL CROSS-CONNECT (OXC); REGULAR TOPOLOGY; ROUTING AND WAVELENGTH ASSIGNMENT (RWA);

ARCHITECTURAL DESIGN; COST BENEFIT ANALYSIS; COSTS; ELECTRIC NETWORK TOPOLOGY; FIBER OPTIC NETWORKS; NETWORK ARCHITECTURE; OPTICAL SWITCHES; WAVELENGTH DIVISION MULTIPLEXING;

METROPOLITAN AREA NETWORKS;

EID: 67651171580     PISSN: 19430620     EISSN: None     Source Type: Journal    
DOI: 10.1364/JOCN.1.000158     Document Type: Article

References (24)

1. V. W. S. Chan, Guest Editorial: Optical Communications and Networking Series, IEEE J. Sel. Areas Commun., vol. 23, pp. 1441-1443, Aug. 2005.
2. C. Guan and V. W. S. Chan, "Topology design of OXC-switched WDM networks," IEEE J. Sel. Areas Commun., vol. 23, no. 8, pp. 1670-1686, Aug. 2005.
3. C. Guan and V. W. S. Chan, "Topology design and resource dimensioning for optical mesh networks under demand uncertainties," in Globecom 2005, St. Louis, Nov. 2005.
4. C. Guan and V. W. S. Chan, "The cost scalability of optical mesh Networks - Moore Graphs, Generalized Moore Graphs and their close relatives," in Globecom 2006, San Francisco, Nov. 2006.
5. C. Guan, Cost-Effective Optical Network Architecture - A Joint Optimization of Topology, Switching, Routing and Wavelength Assignment, Ph.D. thesis, MIT, 2006.
6. M. Tornatore, G. Maier, and A. Pattavina, "WDM network design by ILP models based on flow aggregation," IEEE/ACM Trans. Netw., vol. 15, no. 3, Jun. 2007.
7. R. Ramaswami and K. Sivarajan, "Routing and wavelength assignment in all-optical networks," IEEE/ACM Trans. Netw., vol. 3, pp. 489-500, Oct. 1995.
8. W. Grover, Mesh-Based Survivable Networks, Prentice Hall, 2004.
9. B. Jaumard, C. Meyer, and B. Thiongane, "Comparison of column generation formulations for the RWA problem," Concordia University, Montreal, Quebec, Canada, 2004, http:// users.encs.concordia.ca/∼bjaumard/ CRC-chair/Publications/ 2004/Abstracts/Gencol-RWA.html
10. L. Caccetta and W. F. Symyth, "Graphs of maximum diameter," Discrete Math., vol. 102, pp. 121-144, 1992.
11. T. E. Stern and K. Bala, Multiwavelength Optical Networks: A Layered Approach, Prentice Hall, 2000.
12. V. G. Cerf, D. D. Cowan, R. C. Mullin, and R. G. Stanton, "Computer networks and Generalized Moore Graphs," Congressus Numerantium, vol. 9, pp. 379-398, 1973.
13. M. Samples, "Vertex-symmetric Generalized Moore Graphs," Discrete Appl. Math., vol. 138, no. 1-2, pp. 195-202, 2004.
14. M. Samples, 2006, http://www.cs.uni-essen.de/samples/mean-distance.html.
15. G. Panchapakesan and A. Sengupta, "On a lightwave network topology using Kautz Digraphs," IEEE Trans. Comput., vol. 48, no. 10, pp. 1131-1138, Oct. 1999.
16. W. G. Bridges and S. Toueg, "On the impossibility of directed Moore Graphs," J. Comb. Theory Ser. B, vol. 29, pp. 339-341, 1980.
17. A. J. Hoffman and R. R. Singleton, "On Moore Graphs with diameter 2 and 3," IBM J. Res. Dev., vol. 4, pp. 497-504, 1960.
18. S. Sengupta, V. Kumar, and D. Saha, "Switched optical backbone for cost-effective scalable core IP networks," IEEE Com-mun. Mag., vol. 41, no. 6, pp. 60-70, Jun. 2003.
19. B. Beauqier, "All-to-all communication in some wavelengthrouted all-optical networks," Networks, vol. 33, no. 3, pp. 179-187, May 1999.
20. B. Bollobas, Modern Graph Theory, Springer, 1998.
21. R. P. Gupta, "The chromatic index and the degree of a graph," Not. Amer. Math. Soc., vol. 13, p. 719, 1966.
22. I. Holyer, "The NP-completeness of edge coloring," SIAM J. Comput., vol. 10, pp. 718-720, 1981.
23. H. Zang, J. P. Jue, and B. Mukherjee, "A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks," Opt. Networks Mag., vol. 1, pp. 24-32, Jan. 2000.
24. B. Yener and T. Boult, "Flow trees: a lower bound computation tool for network optimization," Technical Report CUCS-006-94, Computer Science Department, Columbia University, 1994.