Analysis of Multi-Hop Traffic Grooming in WDM Mesh Networks

被引：0

作者：

Yao, Wang ^{[1
]}

Sahin, Gokhan

Li, Mengke ^{[1
]}

Ramamurthy, Byrav ^{[1
]}

机构：

[1] Univ Nebraska, Dept Comp Sci & Engn, Lincoln, NE 68588 USA

来源：

2ND INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS (BROADNETS 2005) | 2005年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Traffic grooming is an essential functionality of WDM optical networks to provision multi-granularity subwave-length connections. Depending on the number of lightpaths allowed in a connection route, traffic grooming can be classified as single-hop traffic grooming (SH-TG) and multi-hop traffic grooming (MH-TG). MH-TG is more general and resource-efficient than SH-TG, because it allows connections from different source-destination pairs to share the bandwidth of a lightpath. In this paper, we propose a MH-TG algorithm, namely the fixed-order multi-hop (FOMH) grooming algorithm, based on the fixed-alternate routing approach. We introduce the grooming node selection (GNS) problem in MH-TG and propose three grooming policies, namely exhaustive sequential (ES), limited-hop sequential (LHS) and load sharing (LS) policies, to address the GNS problem. Given that the analysis of MH-TG is a relatively unexplored area, we propose an analytical model to evaluate the blocking performance of MH-TG using FOMH and the LS grooming policy. To address the multi-layered routing and multi-rate connection characteristics of traffic grooming, we introduce a novel multi-level decomposition approach in our analytical model which decomposes traffic at four different levels, namely alternate path, connection route, lightpath and link levels. The Erlang fixed-point approximation method is used to solve the analytical model. Numerical results show that analytical results matches well with simulation results. We also evaluate the effect of the grooming policies, the number of virtual hops (lightpaths) within a connection route and the number of alternate paths on the performance of the grooming algorithm.

引用

页码：177 / +

页数：10

共 50 条

[11] Traffic grooming for survivable WDM mesh networks
Thiagarajan, S
Somani, AK
OPTICOMM 2001: OPTICAL NETWORKING AND COMMUNICATIONS, 2001, 4599 : 54 - 65
[12] Traffic grooming in mesh WDM optical networks - Performance analysis
Xin, CS
Qiao, CM
Dixit, S
GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 3732 - 3736
[13] Dynamic traffic grooming with multi-granularity traffic in WDM optical mesh networks
Huang, J
Zeng, QJ
Liu, JM
Xiao, PC
Liu, H
Xiao, SL
APOC 2003: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS; NETWORK ARCHITECTURES, MANAGEMENT, AND APPLICATIONS, PTS 1 AND 2, 2003, 5282 : 988 - 993
[14] Blocking analysis of dynamic traffic grooming in mesh WDM optical networks
Xin, Chunsheng
IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (03) : 721 - 733
[15] Multicast Traffic Grooming with Survivability in WDM Mesh Networks
Pradhan, Ashok Kumar
Das, Kunal
De, Tanmay
2ND INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND INTEGRATED NETWORKS (SPIN) 2015, 2015, : 1020 - 1025
[16] Survivable traffic grooming for anycasting in WDM mesh networks
She, Qingya
Huang, Xiaodong
Zhang, Qiong
Zhu, Yi
Jue, Jason P.
GLOBECOM 2007: 2007 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-11, 2007, : 2253 - +
[17] Throughput maximization in traffic grooming in WDM mesh networks
Srinivas, N
Murthy, CSR
JOURNAL OF HIGH SPEED NETWORKS, 2004, 13 (02) : 139 - 154
[18] Dynamic multicast traffic grooming in WDM mesh networks
Liao, Luhua
Li, Lemin
Wang, Sheng
2006 2ND CONFERENCE ON NEXT GENERATION INTERNET DESIGN AND ENGINEERING, 2006, : 366 - +
[19] Algorithms for multicast traffic grooming in WDM mesh networks
Kamal, Ahmed E.
IEEE COMMUNICATIONS MAGAZINE, 2006, 44 (11) : 96 - 105
[20] Traffic Grooming in WDM Mesh Networks with Guaranteed Survivability
Bari, A.
Rahman, Q.
Jaekel, A.
Bandyopadhyay, S.
2008 IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS & NETWORKS WITH FTCS & DCC, 2008, : 307 - 315

← 1 2 3 4 5 →