Holding-Time-Aware Dynamic Traffic Grooming

Tornatore, Massimo; Baruffaldi, A.; Zhu, Hongyue; Mukherjee, Biswanath; Pattavina, Achille

doi:10.1109/jsac-ocn.2008.031307

Cited by 40 publications

(18 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

Online traffic grooming using timing information in WDM–TDM networks

Mohamed

Khalaf

2013

Ain Shams Engineering Journal

View full text Add to dashboard Cite

In this paper, the effect of holding time awareness on the process of time slot assignment in WDM-TDM is considered. Use has been made of Markov model in order to predict the wavelength congestion. A routing algorithm is developed based on the Markov modeling. The results are compared with existing algorithms--ASP, WSP and OTGA. Validation results have shown that the performance of the system is significantly improved in terms of bandwidth blocking ratio, network utilization and fairness.

show abstract

Section: Related Workmentioning

confidence: 99%

Online traffic grooming using timing information in WDM–TDM networks

Mohamed

Khalaf

2013

Ain Shams Engineering Journal

View full text Add to dashboard Cite

show abstract

“…In [6] the authors discuss several policies, based on which an anycast destination is selected in IP-over-optical networks. There are a number of papers that address HTA traffic, among others see [2]. Advance reservation, or scheduled demands, is related to HTA traffic.…”

Section: Related Workmentioning

confidence: 99%

“…In Fig. 5(c) we compare that the number of lightpath switches 2 In [3] we proposed LPS, which is a more flexible version of the UCS communication paradigm. It allows a request to be serviced by using lightpath-switching.…”

Section: Performance Evaluationmentioning

confidence: 99%

“…One is dynamic with an unknown holding-time duration, where each request uses network resources for an unspecified amount of time, and the other is dynamic with a known duration where requests specify a holding time when they arrive. This is also known as holding-time-aware (HTA) traffic [2].…”

Section: Introductionmentioning

confidence: 99%

“…t i + d i = t i+1(6)Assuming that a schedule has n segments, we can explain the above constraints as follows: Constraint (1) states that there must be at least one segment and there can be at most of τ segments in the schedule (2). states, that if we employ lightpath switching we must have at least k = 2-shortest paths used in the computation of the schedules.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Dynamic anycasting over wavelength routed networks with lightpath switching

Ramaprasad

Gadkar

Vokkarane

2011

2011 IEEE 12th International Conference on High Performance Switching and Routing

View full text Add to dashboard Cite

In this paper we investigate the problem of provisioning dynamic anycast holding-time-aware (HTA) lightpaths in all-optical wavelength division multiplexed (WDM) networks. We employ a technique called lightpath switching (LPS) wherein the data transmission may begin on one lightpath and switch to a different lightpath at a later time. We propose two heuristics to solve the anycast routing and wavelength assignment (RWA) problem: anycast with continuous segment (ACS) and anycast with lightpath switching (ALPS). We first compare the performance of ACS to ALPS and observe that ALPS achieves better blocking than ACS. Furthermore, we also compare the performance of these two anycast RWA algorithms to the traditional unicast RWA algorithm. We show that the anycast RWA algorithms presented here significantly out-perform the traditional unicast RWA algorithms.

show abstract