A framework for topology-based traffic grooming with restoration in optical networks

被引:0
|
作者
Sheela, Divakaran [1 ]
Chellamuthu, Chinnagounder [2 ]
机构
[1] Department of Electronics and Communication Engineering, Tagore Engineering College, Chennai
[2] Department of Electrical and Electronics Engineering, R.M.K. Engineering College, Kavaraipettai
关键词
Availability; Grooming; Link utilisation; Loss of traffic; Network cost; Restoration; Survivability; Topology; Transponder; Wavelength division multiplexing; WDM;
D O I
10.1504/IJHPCN.2015.072787
中图分类号
学科分类号
摘要
Traffic grooming refers to the technique that aggregates low speed data streams onto high speed lightpaths at a reduced cost. Survivable traffic grooming in optical networks becomes increasingly important for emerging network technologies, since a single link failure may result in a huge amount of traffic loss and revenue. Survivability is classified as protection and restoration. The research in survivable traffic grooming generally deals with protection methods in optical networks. But, the traffic grooming with restoration is still an emerging area of research. The topological parameters of a network play a major role in the resource requirement and survivability, which are the two goals to be achieved in survivable traffic grooming. This paper incorporates the topological parameters in grooming with restoration, and proposes a framework that integrates the above mentioned features, aiming at cost reduction and improved resilience. The topological features are considered in local and global scales. This framework can serve as a reference for traffic grooming to provide the right selection scheme for trade-off between survivability and network cost as required. © 2015 Inderscience Enterprises Ltd.
引用
收藏
页码:358 / 369
页数:11
相关论文
共 50 条
  • [31] Modeling Traffic Congestion Spreading Using a Topology-Based SIR Epidemic Model
    Kozhabek, Assemgul
    Chai, Wei Koong
    Zheng, Ge
    IEEE ACCESS, 2024, 12 : 35813 - 35826
  • [32] A Genetic Algorithm Based Approach for Traffic Grooming, Routing and Wavelength Assignment in Optical WDM Mesh Networks
    De, Tanmay
    Jain, Puneet
    Pal, Ajit
    Sengupta, Indranil
    PROCEEDINGS OF THE 2008 16TH INTERNATIONAL CONFERENCE ON NETWORKS, 2008, : 61 - 66
  • [33] Modified Multiobjective Metaheuristics for Sparse Traffic Grooming in Optical WDM Mesh Networks
    Shinde, Sandip
    Patil, S. H.
    Gulwani, Manasi
    3RD INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING 2015 (ICRTC-2015), 2015, 57 : 980 - 987
  • [34] Multi-domain traffic partition grooming in mixed granularity optical networks
    Hou, Weigang
    Guo, Lei
    Lu, Jianxin
    OPTICAL SWITCHING AND NETWORKING, 2015, 17 : 25 - 37
  • [35] Analysis of single-hop traffic grooming in mesh WDM optical networks
    Xin, CS
    Qia, CM
    Dixit, S
    OPTICOMM 2003: OPTICAL NETWORKING AND COMMUNICATIONS, 2003, 5285 : 91 - 101
  • [36] Grooming of Arbitrary Traffic in Optical WDM Mesh Networks Using a Genetic Algorithm
    Yueguang Jiao
    Bingkun Zhou
    Hanyi Zhang
    Yili Guo
    Photonic Network Communications, 2005, 10 : 193 - 198
  • [37] Prioritized traffic restoration in connection oriented QoS based networks
    Jæger, B
    Tipper, D
    COMPUTER COMMUNICATIONS, 2003, 26 (18) : 2025 - 2036
  • [38] Grooming of arbitrary traffic in optical WDM mesh networks using a genetic algorithm
    Jiao, YG
    Zhou, BK
    Zhang, HY
    Guo, YL
    PHOTONIC NETWORK COMMUNICATIONS, 2005, 10 (02) : 193 - 198
  • [39] Green traffic grooming in IP-over-WDM satellite optical networks
    Liu, Yu
    Li, Xin
    Zheng, Zhennan
    Li, Daixuan
    Liu, Tianhao
    Ruan, Feiyang
    Zhao, Chenyu
    Huang, Shanguo
    JOURNAL OF OPTICAL COMMUNICATIONS AND NETWORKING, 2024, 16 (12) : 1275 - 1287
  • [40] Fault Tolerant System for Sparse Traffic Grooming in Optical WDM Mesh Networks Using Combiner Queue
    Shinde, Sandip R.
    Patil, Suhas H.
    Roslin, S. Emalda
    Shinde, Archana S.
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2016, 7 (03) : 176 - 180