2010 IEEE Global Telecommunications Conference GLOBECOM 2010 2010
DOI: 10.1109/glocom.2010.5684023
|View full text |Cite
|
Sign up to set email alerts
|

Load Balancing for Holding-Time-Aware Dynamic Traffic Grooming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
10
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 8 publications
0
10
0
Order By: Relevance
“…In some cases, it is assumed that a request may occupy only a fraction of a full wavelength capacity, see [5] and [6] among others, whereas in [4,7] and [8], both full and subwavelength requests are considered.…”
Section: Related Workmentioning
confidence: 99%
“…In some cases, it is assumed that a request may occupy only a fraction of a full wavelength capacity, see [5] and [6] among others, whereas in [4,7] and [8], both full and subwavelength requests are considered.…”
Section: Related Workmentioning
confidence: 99%
“…In a dynamic environment, the connection requests arrive one at a time with different starting time and holding period. In [14][15][16] dynamic traffic grooming algorithms that jointly employs knowledge of holding-times and the network bandwidth availability are developed in order to balance the traffic loading and avoid creation of bottlenecks. Consequently, this has improved bandwidth blocking probability for WDM networks.…”
Section: Related Workmentioning
confidence: 99%
“…The fast development of path computation element and generalised multi‐protocol label switching increases network online service ability, which enables the sensing of service holding‐time at the arrival of services [17]. Thus, information on the holding‐time of services can be used at the arrival of a service to determine the service departure‐time [18, 19]. By the arrival‐time and service holding‐time, the departure‐time of one service can be obtained, just as shown in (5).…”
Section: Service Holding‐time‐based Path Computationmentioning
confidence: 99%