## Topological Wavelength Usage Estimation in Transparent Wide Area Networks

Journal of Optical Communications and Networking, Vol. 1, Issue 1, pp. 196-203 (2009)

http://dx.doi.org/10.1364/JOCN.1.000196

Acrobat PDF (579 KB)

### Abstract

A power law relationship is established between wavelength usage and algebraic connectivity of backbone wavelength division multiplexing networks. From this observation, a concise prediction formula linking wavelength consumption to network topologies is derived and evaluated for real-world wide area networks. It is shown that the algebraic-connectivity-based wavelength usage estimation is more precise than evaluations relying on node degree variance, number of spanning trees, and average internodal distance.

© 2009 Optical Society of America

**OCIS Codes**

(060.1155) Fiber optics and optical communications : All-optical networks

(060.4264) Fiber optics and optical communications : Networks, wavelength assignment

**ToC Category:**

WDM Architecture

**History**

Original Manuscript: October 30, 2008

Revised Manuscript: April 13, 2009

Manuscript Accepted: April 15, 2009

Published: June 1, 2009

**Citation**

Benoît Châtelain, Michel P. Bélanger, Christine Tremblay, François Gagnon, and David V. Plant, "Topological Wavelength Usage Estimation in Transparent Wide Area Networks," J. Opt. Commun. Netw. **1**, 196-203 (2009)

http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-1-1-196

Sort: Year | Journal | Reset

### References

- I. Chlamtac, A. Ganz, and G. Karmi, “Lightpath communications: an approach to high-bandwidth optical WANs,” IEEE Trans. Commun. , vol. 40, pp. 1171-1182, 1992. [CrossRef]
- S. Baroni and P. Bayvel, “Wavelength requirements in arbitrarily connected wavelength-routed optical networks,” J. Lightwave Technol. , vol 15, pp. 242-251, 1997. [CrossRef]
- C. Fenger, E. Limal, U. Gliese, and C. J. Mahon, “Statistical study of the correlation between topology and wavelength usage in optical networks with and without conversion,” in Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks, vol. 1815of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2002, pp. 168-175.
- D. O'Brien, B. Châtelain, F. Gagnon, C. Tremblay, M. P. Bélanger, and É. Bernier, “A dual metaheuristic solution for the min-RWA problem,” in Optical Fiber Communication Conf. and Exposition and Nat. Fiber Optic Engineers Conf., OSA Technical Digest (CD), Washington, DC: Optical Society of America, 2008, paper JThA80.
- C. Rose, “Mean internodal distance in regular and random multihop networks,” IEEE Trans. Commun. , vol. 40, pp. 1310-1318, 1992. [CrossRef]
- M. Fiedler, “Algebraic connectivity of graphs,” Czech. Math. J. , vol. 23, pp. 298-305, 1973.
- A. S. Rodionov and H. Choo, “On generating random network structures: connected graphs,” in Information Networking, vol. 3090of Lecture Notes in Computer Science, Berlin, Germany: Springer, 2004, pp. 483-491
- M. Stoer and F. Wagner, “A simple min-cut algorithm,” J. ACM , vol. 44, pp. 585-591, 1997. [CrossRef]

## Cited By |
Alert me when this paper is cited |

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

OSA is a member of CrossRef.