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. 6 — Jun. 1, 2010
  • pp: 305–318

Fairness in Zone-Based Algorithms for Dynamic Traffic Grooming in WDM Mesh Networks

André C. Drummond and Nelson L.S. da Fonseca  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 2, Issue 6, pp. 305-318 (2010)
http://dx.doi.org/10.1364/JOCN.2.000305


View Full Text Article

Enhanced HTML    Acrobat PDF (641 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously known. Solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network partially leading to scalable solutions; however, a previous proposal employing a reduced auxiliary graph produces blocking that is not fairly distributed among calls. A novel algorithm is thus proposed in this paper for achieving fairness in relation to the blocking of calls. This algorithm uses alternative routing rather than shortest-path routing as well as auxiliary graphs based on the virtual topology. Results reveal a higher degree of fairness obtained by the use of the novel algorithm than by previously proposed algorithms.

© 2010 Optical Society of America

OCIS Codes
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms
(060.4253) Fiber optics and optical communications : Networks, circuit-switched

ToC Category:
Research Papers

History
Original Manuscript: August 28, 2009
Revised Manuscript: February 25, 2010
Manuscript Accepted: April 13, 2010
Published: May 12, 2010

Citation
André C. Drummond and Nelson L.S. da Fonseca, "Fairness in Zone-Based Algorithms for Dynamic Traffic Grooming in WDM Mesh Networks," J. Opt. Commun. Netw. 2, 305-318 (2010)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-2-6-305


Sort:  Author  |  Year  |  Journal  |  Reset  

References

  1. K. Zhu, B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag., vol. 4, no. 2, pp. 55–64, Feb. 2003.
  2. S. Huang, R. Dutta, “Dynamic traffic grooming: the changing role of traffic grooming,” IEEE Commun. Surv. & Tutorials, vol. 8, no. 4, pp. 32–50, 2006.
  3. R. Dutta, A. E. Kamal, G. N. Rouskas, Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers. Springer, 2008. [CrossRef]
  4. R. Dutta, G. N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network, vol. 16, no. 6, pp. 46–56, Nov./Dec. 2002. [CrossRef]
  5. O. Gerstel, R. Ramaswami, G. Sasaki, “Cost-effective traffic grooming in WDM rings,” IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 618–630, 2000. [CrossRef]
  6. A. Chiu, E. Modiano, “Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks,” J. Lightwave Technol., vol. 18, no. 1, pp. 2–12, 2000. [CrossRef]
  7. H. Liu, F. Tobagi, “Traffic grooming in WDM SONET UPSR rings with multiple line speeds,” in Proc. of IEEE INFOCOM, 2005, pp. 718–729.
  8. S. Huang, R. Dutta, G. N. Rouskas, “Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms,” IEEE J. Sel. Areas Commun., vol. 24, no. 4, pp. 66–82, 2006. [CrossRef]
  9. J. Hu, B. Leida, “Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks,” in Proc. of IEEE INFOCOM, 2004, pp. 1340–1351.
  10. W. Yao, B. Ramamurthy, “A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks,” IEEE J. Sel. Areas Commun., vol. 23, no. 8, pp. 1542–1555, 2005. [CrossRef]
  11. C. Xin, “Blocking analysis of dynamic traffic grooming in mesh WDM optical networks,” IEEE/ACM Trans. Netw., vol. 15, no. 3, pp. 721–733, 2007. [CrossRef]
  12. F. Palmieri, U. Fiore, S. Ricciardi, “SPARK: a smart parametric online RWA algorithm,” J. Commun. Networks, vol. 9, no. 4, pp. 368–376, 2007. [CrossRef]
  13. C. Xin, C. Qiao, “Performance analysis of multi-hop traffic grooming in mesh WDM optical networks,” in Proc. of the Int. Conf. on Computer Communications and Networks, 2003, pp. 237–242.
  14. E. A. Doumith, M. Gagnaire, “Impact of traffic predictability on WDM EXC/OXC network performance,” IEEE J. Sel. Areas Commun., vol. 25, no. 5, pp. 895–904, 2007. [CrossRef]
  15. M. Tornatore, A. Baruffaldi, H. Zhu, B. Mukherjee, A. Pattavina, “Holding-time-aware dynamic traffic grooming,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, pp. 28–35, 2008. [CrossRef]
  16. Q.-D. Ho, M.-S. Lee, “Time-efficient near-optimal wavelength assignment in dynamically-reconfigurable WDM networks,” in Proc. of the IEEE Workshop on High Performance Switching and Routing, 2005, pp. 453–456.
  17. T.-T. N. Thi, T. T. Minh, Q.-D. Hos, M.-S. Lee, “A time and cost efficient dynamic traffic grooming algorithm for optical mesh networks,” in Proc. of the 2nd Int. IEEE/Create-Net Workshop on Traffic Grooming, 2005, pp. 315–320.
  18. C. Xin, “Dynamic traffic grooming in optical networks with wavelength conversion,” IEEE J. Sel. Areas Commun., vol. 25, no. 9, pp. 50–57, 2007. [CrossRef]
  19. A. Jaekel, A. Bari, Y. Chen, S. Bandyopadhyay, “New techniques for efficient traffic grooming in WDM mesh networks,” in Proc. of IEEE Int. Conf. on Computer Communications and Networks, 2007, pp. 303–308.
  20. Q.-D. Ho, M.-S. Lee, “A zone-based approach for scalable dynamic traffic grooming in large WDM mesh networks,” IEEE J. Lightwave Technol., vol. 25, no. 1, pp. 261–270, 2007. [CrossRef]
  21. K. Zhu, B. Mukherjee, “On-line approaches for provisioning connections of different bandwidth granuralities in WDM mesh networks,” in Optical Fiber Communication Conf., 2002, pp. 549–551.
  22. H. Zhu, H. Zang, K. Zhu, B. Mukherjee, “Dynamic traffic grooming in WDM mesh networks using a novel graph model,” Opt. Networks Mag., vol. 4, no. 3, pp. 65–75, Mar. 2003.
  23. R. Jain, The Art of Computer Systems Performance Analysis: Techniques for Experimental Design, Measurement, Simulation and Modeling. Wiley, 1991.
  24. A. C. Drummond, N. L. S. da Fonseca, “On-line dynamic traffic grooming algorithms for WDM mesh networks,” in IEEE Int. Conf. on Communications, 2009, pp. 1–5.

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.

Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited