TY - JOUR
T1 - Shared-path protection with delay tolerance (SDT) in optical WDM mesh networks
AU - Cavdar, Cicek
AU - Tornatore, Massimo
AU - Buzluca, Feza
AU - Mukherjee, Biswanath
PY - 2010
Y1 - 2010
N2 - Optical wavelength-division-multiplexing (WDM) networks have emerged as an ideal backbone for the dynamic transport of bandwidth-intensive applications. Most emerging applications require end-to-end survivable connections to be set up for specific time durations that have sliding or fixed setup times (such as IPTV, grid computing backup storage). It is critical for the development of future network infrastructure that user-centric, dynamic, and end-to-end management and control mechanisms are devised to bridge the gap between the transport capacity and the needs of new applications at the customer edges. In this paper, we study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and delay tolerances. Delay tolerance is a measure of customer patience, and it is defined as the duration a connection request can be held until it is set up. A connection that cannot be established at the instant of its request could potentially be set up in the remaining duration of its delay tolerance. In this study, different dynamic scheduling algorithms are developed and compared by giving priority to connections according to their arrival rates, delay tolerances, and holding times. Using a mathematical model for impatient requests and simulation experiments, we show that delay tolerance flexibility in the traffic model provides a reduction of up to 50% on blocking probability, without the use of extra backup capacity.
AB - Optical wavelength-division-multiplexing (WDM) networks have emerged as an ideal backbone for the dynamic transport of bandwidth-intensive applications. Most emerging applications require end-to-end survivable connections to be set up for specific time durations that have sliding or fixed setup times (such as IPTV, grid computing backup storage). It is critical for the development of future network infrastructure that user-centric, dynamic, and end-to-end management and control mechanisms are devised to bridge the gap between the transport capacity and the needs of new applications at the customer edges. In this paper, we study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and delay tolerances. Delay tolerance is a measure of customer patience, and it is defined as the duration a connection request can be held until it is set up. A connection that cannot be established at the instant of its request could potentially be set up in the remaining duration of its delay tolerance. In this study, different dynamic scheduling algorithms are developed and compared by giving priority to connections according to their arrival rates, delay tolerances, and holding times. Using a mathematical model for impatient requests and simulation experiments, we show that delay tolerance flexibility in the traffic model provides a reduction of up to 50% on blocking probability, without the use of extra backup capacity.
KW - Connection delay tolerance
KW - connection holding time
KW - dynamic connection provisioning
KW - optical network
KW - shared-path protection (SPP)
KW - sliding scheduled traffic
KW - survivability
UR - http://www.scopus.com/inward/record.url?scp=77954867899&partnerID=8YFLogxK
U2 - 10.1109/JLT.2010.2051414
DO - 10.1109/JLT.2010.2051414
M3 - Article
AN - SCOPUS:77954867899
SN - 0733-8724
VL - 28
SP - 2068
EP - 2076
JO - Journal of Lightwave Technology
JF - Journal of Lightwave Technology
IS - 14
M1 - 5473061
ER -