Cost-Efficient Fiber Connection Topology Design for Metropolitan Area WDM Networks

In this paper, we provide some analytical insights into physical architectures that can serve as benchmarks for designing a cost-efficient WDM metropolitan area network (MAN). For uniform all-to-all traffic and regular topologies with nodal symmetry, we identify a class of regular graphs-Generalized Moore Graphs-that have several attractive properties by formulating a first-order cost model and characterizing the tradeoff between fiber and switching resources. Our results show that, in conjunction with minimum hop routing, Moore Graphs achieve the minimum cost and simultaneously use the least number of wavelengths. We also take steps to broaden the scope of our work by addressing irregular network topologies, which represent most existing networks. Our results show that Generalized Moore Graphs can be used to provide useful estimates of the cost of irregular networks and can serve as good reference architectures for the designs of practical networks.

[1]  Lou Caccetta,et al.  Graphs of maximum diameter , 1992, Discret. Math..

[2]  Asif Zaman,et al.  MOORE GRAPHS OF DIAMETER 2 AND 3 , 2010 .

[3]  Abhijit Sengupta,et al.  On a Lightwave Network Topology Using Kauts Digraphs , 1999, IEEE Trans. Computers.

[4]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[5]  V.W.S. Chan Guest Editorial. Optical communications and networking series , 2005 .

[6]  Bruno Beauquier All-to-All Communication for some Wavelength-Routed All-Optical Networks , 1999 .

[7]  Vijay P. Kumar,et al.  Switched optical backbone for cost-effective scalable core IP networks , 2003, IEEE Commun. Mag..

[8]  Ian Holyer,et al.  The NP-Completeness of Edge-Coloring , 1981, SIAM J. Comput..

[9]  Thomas E. Stern,et al.  Multiwavelength Optical Networks: A Layered Approach , 1999 .

[10]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[11]  Kyle Guan,et al.  Joint optimization of topology, switching, routing and wavelength assignment , 2007 .

[12]  Alan J. Hoffman,et al.  On Moore Graphs with Diameters 2 and 3 , 1960, IBM J. Res. Dev..

[13]  Sam Toueg,et al.  On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.

[14]  Vincent W. S. Chan,et al.  Topology design of OXC-switched WDM networks , 2005, IEEE Journal on Selected Areas in Communications.

[15]  Bruno Beauquier,et al.  All-to-all communication for some wavelength-routed all-optical networks , 1999, Networks.

[16]  Michael Sampels,et al.  Vertex-symmetric generalized Moore graphs , 2004, Discret. Appl. Math..

[17]  Vincent W. S. Chan,et al.  Topology design and resource dimensioning for optical mesh networks under demand uncertainties , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[18]  G. Maier,et al.  WDM Network Design by ILP Models Based on Flow Aggregation , 2007, IEEE/ACM Transactions on Networking.

[19]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.