Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Dynamic Scheduling of Survivable Connections with Delay Tolerance in WDM Networks
Computer Engineering Department, Istanbul Technical University.
Computer Engineering Department, Istanbul Technical University.
Computer Science Department, University of California.
Computer Science Department, University of California.
2009 (English)In: Proceedings: IEEE INFOCOM, 2009Conference paper, Published paper (Refereed)
Abstract [en]

In optical wavelength-division multiplexing (WDM) networks, recent technological progress is enabling dynamic optical transport in which leasable circuits (connections) can be set up and released for a specific duration of time, providing large capacity to bandwidth-hungry applications. Set-up times can be flexible or fixed, depending on the type of the application. Since the interruption of a high-speed optical connection could lead to huge loss of data, such connections need to be protected against failures. We study the problem of dynamic provisioning of user-controlled connection requests that have specified holding times and particular delay tolerances with shared path protection. The metric of delay tolerance is a measure of customer patience, and it is defined as the time 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. We show that a reduction of up to 50 percent can be achieved on blocking probability by exploiting delay tolerance in networks without using extra backup capacity. In this study we explore different queuing policies for impatient customers. Different dynamic scheduling algorithms are applied and compared by giving priority to connections according to their arrival rates, delay tolerances and holding times alternatively.

Place, publisher, year, edition, pages
2009.
Keyword [en]
Optical network, survivability, dynamic connection provisioning, availability guarantee, connection holding time, connection delay tolerance, shared-path protection, sliding scheduled traffic
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-91451DOI: 10.1109/INFCOMW.2009.5072134ISI: 000272170100018OAI: oai:DiVA.org:kth-91451DiVA: diva2:510322
Conference
IEEE INFOCOM 2009, High Speed Networks Workshop
Note
QC 20120327Available from: 2012-03-15 Created: 2012-03-15 Last updated: 2012-03-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Cavdar, CicekTornatore, MassimoMukherjee, Biswanath
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 27 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf