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. 12 — Dec. 1, 2010
  • pp: 1077–1086

Virtual Topology Design for Minimizing Network Diameter and Average Hop Count in WDM Networks

Bin Wu, Kwan L. Yeung, and Pin-Han Ho  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 2, Issue 12, pp. 1077-1086 (2010)
http://dx.doi.org/10.1364/JOCN.2.001077


View Full Text Article

Enhanced HTML    Acrobat PDF (709 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

We design virtual topologies in wavelength division multiplexing (WDM) networks to minimize the network diameter and average hop count, where network diameter refers to the number of hops of the longest shortest path and average hop count is the average number of hops among the shortest paths of all node pairs. Such objectives are important to WDM networks, especially to those with statistical multiplexing mechanisms such as optical burst switching (OBS) and optical packet switching (OPS). By minimizing the network diameter and average hop count, optical packets or bursts will experience less contention loss and smaller delay due to a reduced number of intermediate nodes en route. In this paper, we first formulate an integer linear program (ILP) for optimal design of virtual topologies with minimized network diameter and average hop count. Then, a novel heuristic least weight minimum diameter (LWMD) is proposed to find good solutions efficiently. Based on the virtual topology obtained, we further design two traffic accommodation schemes to provision wavelengths under a given traffic matrix, with guaranteed network diameter and minimized network resource consumption.

© 2010 Optical Society of America

OCIS Codes
(060.4256) Fiber optics and optical communications : Networks, network optimization
(060.4258) Fiber optics and optical communications : Networks, network topology

ToC Category:
Research Papers

History
Original Manuscript: December 9, 2009
Revised Manuscript: August 3, 2010
Manuscript Accepted: August 11, 2010
Published: November 30, 2010

Citation
Bin Wu, Kwan L. Yeung, and Pin-Han Ho, "Virtual Topology Design for Minimizing Network Diameter and Average Hop Count in WDM Networks," J. Opt. Commun. Netw. 2, 1077-1086 (2010)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-2-12-1077


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. L. Guo, J. Cao, H. Yu, L. Li, “Path-based routing provisioning with mixed shared protection in WDM mesh networks,” J. Lightwave Technol., vol. 24, no. 3, pp. 1129–1141, Mar. 2006. [CrossRef]
  2. D. Z. Chen, G. Wellbrock, S. J. Penticost, D. Patel, C. Rasmussen, M. C. Childers, X. Yang, M. Y. Frankel, “World’s first 40 Gbps overlay on a field-deployed, 10 Gbps, mixed-fiber, 1200 km, ultra long-haul system,” in Optical Fiber Communication Conf. and Expo. and the Nat. Fiber Optic Engineers Conf., 2005, vol. 2, paper OTuH4.
  3. G. X. Shen, R. S. Tucker, “Sparse traffic grooming in translucent optical networks,” J. Lightwave Technol., vol. 27, no. 20, pp. 4471–4479, Oct. 2009. [CrossRef]
  4. C. S. Xin, “Resource planning for dynamic traffic grooming in WDM optical networks,” J. Lightwave Technol., vol. 27, no. 5–8, pp. 817–824, Apr. 2009. [CrossRef]
  5. Q. D. Ho, M. S. Lee, “A zone-based approach for scalable dynamic traffic grooming in large WDM mesh networks,” J. Lightwave Technol., vol. 25, no. 1, pp. 261–270, Jan. 2007. [CrossRef]
  6. L. Guo, X. Wang, J. Cao, L. Li, “Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks,” Comput. Netw., vol. 52, no. 7, pp. 1492–1505, May 2008. [CrossRef]
  7. C. Qiao, M. Yoo, “Optical burst switching (OBS)—a new paradigm for an optical internet,” J. High Speed Networks, vol. 8, no. 1, pp. 69–84, Jan. 1999.
  8. J. Li, C. Qiao, J. Xu, D. Xu, “Maximizing throughput for optical burst switching networks,” IEEE/ACM Trans. Netw., vol. 15, no. 5, pp. 1163–1176, Oct. 2007. [CrossRef]
  9. Y. Chen, X. Yu, C. Qiao, “Optical burst switching (OBS): a new area of research in optical networking,” IEEE Network, vol. 18, no. 3, pp. 16–23, Jan. 2004. [CrossRef]
  10. J. P. Jue, V. M. Vokkarane, Optical Burst Switched Networks. Springer, 2005.
  11. X. Huang, Q. She, T. Zhang, K. Lu, J. P. Jue, “Modeling and performance analysis of small group multicast with deflection routing in optical burst switched networks,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, pp. 74–86, Apr. 2008. [CrossRef]
  12. B. Chen, J. P. Wang, “Hybrid switching and p-routing for optical burst switching networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 7, pp. 1071–1080, Sept. 2003. [CrossRef]
  13. K. Ross, N. Bambos, K. Kumaran, I. Saniee, I. Widjaja, “Scheduling bursts in time-domain wavelength interleaved networks,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1441–1451, Nov. 2003. [CrossRef]
  14. J. P. Jue, W.-H. Yang, Y.-C. Kim, Q. Zhang, “Optical packet and burst switched networks: a review,” IET Commun., vol. 3, no. 3, pp. 334–352, Mar. 2009. [CrossRef]
  15. T. S. El-Bawab, J. Shin, “Optical packet switching in core networks: between vision and reality,” IEEE Commun. Mag., vol. 40, no. 9, pp. 60–65, Sept. 2002. [CrossRef]
  16. B. Wu, K. L. Yeung, M. Hamdi, X. Li, “Minimizing internal speedup for performance guaranteed switches with optical fabrics,” IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 632–645, Apr. 2009. [CrossRef]
  17. B. Wu, K. L. Yeung, P.-H. Ho, X. H. Jiang, “Minimum delay scheduling for performance guaranteed switches with optical fabrics,” J. Lightwave Technol., vol. 27, no. 16, pp. 3453–3465, Aug. 2009. [CrossRef]
  18. A. S. Arora, S. Subramaniam, H.-A. Choi, “Logical topology design for linear and ring optical networks,” IEEE J. Sel. Areas Commun., vol. 20, pp. 62–74, Jan. 2002. [CrossRef]
  19. I. Chlamtac, A. Ganz, G. Karmi, “Lightpath communications: an approach to high bandwidth optical WAN’s,” IEEE Trans. Commun., vol. 40, pp. 1171–1182, July 1992. [CrossRef]
  20. Z. Zhang, A. S. Acampora, “A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength re-use,” IEEE/ACM Trans. Netw., vol. 3, pp. 281–288, June 1995. [CrossRef]
  21. N. Wauters, P. Demeester, “Design of the optical path layer in multi-wavelength cross-connected networks,” IEEE J. Sel. Areas Commun., vol. 14, pp. 881–892, June 1996. [CrossRef]
  22. R. Ramaswami, K. N. Sivarajan, “Design of logical topologies for wavelength-routed optical networks,” IEEE J. Sel. Areas Commun., vol. 14, pp. 840–851, June 1996. [CrossRef]
  23. P. Pavon-Marino, R. Aparicio-Pardo, B. Garcia-Manrubia, N. Skorin-Kapov, “Virtual topology design and flow routing in optical networks under multihour traffic demand,” Photonic Network Commun., vol. 19, no. 1, pp. 42–54, Aug. 2009. [CrossRef]
  24. F. E. El-Khamy, M. Nasr, H. M. H. Shalaby, H. T. Mouftah, “The performance for heuristic algorithms for virtual topology design in all-optical WDM networks,” in 11th Int. Conf. on Transparent Optical Networks (ICTON 2009), 2009, pp. 64–67.
  25. P. Van Hentenryck, Y. Vergados, “Traveling tournament scheduling: a systematic evaluation of simulated annealing,” in 3rd Int. Conf. on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006, vol. 3990, pp. 228–243. [CrossRef]
  26. R. K. Ahuja, T. L. Magnanti, J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Upper Saddle River, NJ: Prentice-Hall, 1993.
  27. www.eee.hku.hk/~kyeung/vtd.c.
  28. F. Xue, S. J. B. Yoo, “High-capacity multiservice optical label switching for the next-generation Internet,” IEEE Commun. Mag., vol. 42, no. 5, pp. S16–S22, May 2004. [CrossRef]
  29. H. V. Madhyastha, N. Balakrishnan, “An efficient algorithm for virtual-wavelength-path routing minimizing average number of hops,” IEEE J. Sel. Areas Commun., vol. 21, no. 9, pp. 1433–1440, Nov. 2003. [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.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited