Holding-Time-Aware Dynamic Traffic Grooming

Online traffic grooming using timing information in WDM–TDM networks

“…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.…”

Dynamic anycasting over wavelength routed networks with lightpath switching

“…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.…”

“…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.…”

“…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].…”

“…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.…”