OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and V. Chan
  • Vol. 2, Iss. 5 — May. 1, 2010
  • pp: 256–265

Telecom Mesh Network Upgrade to Manage Traffic Growth

Rajesh Roy, Avishek Nag, and Biswanath Mukherjee  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 2, Issue 5, pp. 256-265 (2010)
http://dx.doi.org/10.1364/JOCN.2.000256


View Full Text Article

Acrobat PDF (437 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Telecom mesh networks require periodic upgrades to support increasing traffic. Such upgrades, which are referred to as network engineering (NE), determine the additional network resources that must be provided to meet the network performance while minimizing the incremental network cost. To facilitate such network growth, considering dynamic routing, attention should be directed toward critical cut sets rather than individual links. Our analysis in this paper shows how capacity exhaustion of critical cut sets indicates urgency of the need for upgrading a mesh network. To handle traffic growth, we also introduce a new parameter called the network-cut exhaustion probability. This parameter is efficient and appropriate to assist incremental growth of the existing network as well as new network design. Finally, we provide an algorithm to calculate the urgency and the pointers to specific locations that require upgrade under desired performance constraints.

© 2010 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(060.4254) Fiber optics and optical communications : Networks, combinatorial network design
(060.4256) Fiber optics and optical communications : Networks, network optimization

ToC Category:
Research Papers

History
Original Manuscript: March 12, 2010
Revised Manuscript: March 15, 2010
Manuscript Accepted: March 17, 2010
Published: April 27, 2010

Citation
Rajesh Roy, Avishek Nag, and Biswanath Mukherjee, "Telecom Mesh Network Upgrade to Manage Traffic Growth," J. Opt. Commun. Netw. 2, 256-265 (2010)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-2-5-256


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. B. Mukherjee, Optical WDM Networks. Springer, 2006.
  2. A. Girard and R. Page, “Dimensioning of telephone networks with nonhierarchical routing and trunk reservation,” in Proc. Network Planning Symp., June 1986, pp. 85–93.
  3. F. P. Kelly, “Routing and capacity allocation in networks with trunk reservation,” in Proc. Mathematics of Operations Research, 1990, pp. 771–793.
  4. M. Pioro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Elsevier, 2004.
  5. M. P. Pioro, “A uniform approach to the analysis and optimization of circuit switched communication networks,” in Proc. Int. Teletraffic Congr., 1983.
  6. R. J. Harris, “Comparison of network dimensioning models,” in Proc. Australian Telecommunication Research, 1984, pp. 59–69.
  7. T. K. Nayak and K. N. Sivaranjan, “A new approach to dimensioning optical networks,” IEEE J. Sel. Areas Commun. , vol. 20, no. 1, pp. 134–148, Jan. 2002. [CrossRef]
  8. T. K. Nayak and K. N. Sivaranjan, “Dimensioning optical networks under traffic growth models,” IEEE/ACM Trans. Netw. , vol. 11, no. 6, pp. 935–947, Dec. 2003. [CrossRef]
  9. S. Tsukiyama, I. Shirakawa, H. Ozaki, and H. Ariyoshi, “An algorithm to enumerate all cutsets of a graph in linear time per cutset,” J. ACM , vol. 27, no. 4, pp. 619–632, Oct. 1980. [CrossRef]
  10. K. Zhu, L. Sahasrabuddhe, and B. Mukherjee, “Topology design and upgrade of an optical network by bottleneck-cut identification,” J. High Speed Networks , vol. 10, no. 4, pp. 293–301, Oct. 2001.
  11. W. Feller, An Introduction to Probability Theory and Its Applications. New York: Wiley, 1968.
  12. J. Kleinberg and E. Tardos, Algorithm Design. Addison Wesley, 2005.
  13. T. Leighton and S. Rao, “Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms,” J. ACM , vol. 46, no. 6, pp. 787–832, Nov. 1999. [CrossRef]
  14. R. Roy and M. Tornatore, “Cost-efficient non-blocking WDM network upgrade,” in Optical Fiber Communication Conf. and Expo., San Diego, Mar. 2009.

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.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited