skip to main content
10.1145/1167253.1167257acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
Article

Cross-layer path computation for dynamic traffic grooming: in mesh WDM optical networks

Published: 18 March 2005 Publication History

Abstract

Traffic grooming in wavelength division multiplexing (WDM) optical networks is an operation to consolidate multiple low-speed traffic streams onto high-speed lightpaths. Traffic grooming of dynamic traffic over a dynamic logical topology, where lightpaths (logical links) are dynamically set up and torn down, is called dynamic traffic grooming, where a major task is to find a path (a list of adjacent lightpaths) in the dynamic logical topology to carry an incoming call. Dynamic traffic grooming is a significant issue in WDM optical networks due to the customer's need of the "bandwidth-on-demand" service. This paper studies path computation in dynamic traffic grooming, using various link cost functions. We propose a path computation approach utilizing the resource usage information in both logical and physical layers. We have evaluated the performance of this cross layer path computation approach, compared with the approach using the resource usage information in the logical layer only. The numerical results show that the cross layer path computation approach can achieve 10% - 20% lower blocking probability.

References

[1]
D. Banerjee and B. Mukherjee, "A practical approach for routing and wavelength assignment in large wavelength-routed optical networks," IEEE Journal on Selected Areas in Communications, Vol. 14, No. 5, pp. 903--908, 1996.
[2]
H. Zhu, H. Zang, K. Zhu and B. Mukherje, "A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks," IEEE/ACM Trans. Networking, vol. 11(2), pp. 285--99, Apr. 2003.
[3]
R. Ramaswami and K. Sivarajan, "Design of logical topologies for wavelength-routed optical networks," IEEE J. Select. Areas Commun., vol. 14, pp.840--851, June 1996.
[4]
C. Xin, C. Qiao and S. Dixit, "Analysis of single-hop traffic grooming in mesh WDM optical networks," in Proc. of SPIE, vol. 5285, Opticomm 2003, Oct. 2003, Dallas, TX, USA, pp. 91--101.
[5]
C. Xin and C. Qiao, "Performance analysis of multi-hop traffic grooming in mesh WDM optical networks," in Proc. IEEE IC3N, 2003, pp. 237--242.
[6]
C. Xin, C. Qiao and S. Dixit, "Traffic grooming in the mesh WDM optical network - performance analysis," IEEE J. Select. Area. Commun., vol. 22 (9), Nov. 2004.
[7]
C. Xin, "Blocking analysis of dynamic traffic grooming on mesh WDM optical networks," submitted to IEEE Trans. Networking.
[8]
J. Yen. "Finding the K shortest loopless paths in a network," Management Science, vol 17(11), pp. 712--716, Jul. 1971.

Cited By

View all
  • (2021)Search of the Shortest Path in a Communication Network with Fuzzy Cost FunctionsSymmetry10.3390/sym1308153413:8(1534)Online publication date: 20-Aug-2021
  • (2007)Traffic grooming, routing, and wavelength assignment in WDM transport networks with sparse grooming resourcesComputer Communications10.1016/j.comcom.2007.08.03030:18(3508-3524)Online publication date: Dec-2007

Index Terms

  1. Cross-layer path computation for dynamic traffic grooming: in mesh WDM optical networks

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    ACMSE '05 vol 2: Proceedings of the 43rd annual ACM Southeast Conference - Volume 2
    March 2005
    430 pages
    ISBN:1595930590
    DOI:10.1145/1167253
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 18 March 2005

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. WDM networks
    2. path computation
    3. traffic grooming

    Qualifiers

    • Article

    Conference

    ACM SE05
    Sponsor:
    ACM SE05: ACM Southeast Regional Conference 2005
    March 18 - 20, 2005
    Georgia, Kennesaw

    Acceptance Rates

    Overall Acceptance Rate 502 of 1,023 submissions, 49%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2021)Search of the Shortest Path in a Communication Network with Fuzzy Cost FunctionsSymmetry10.3390/sym1308153413:8(1534)Online publication date: 20-Aug-2021
    • (2007)Traffic grooming, routing, and wavelength assignment in WDM transport networks with sparse grooming resourcesComputer Communications10.1016/j.comcom.2007.08.03030:18(3508-3524)Online publication date: Dec-2007

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media