2007
DOI: 10.1109/jlt.2007.901332
|View full text |Cite
|
Sign up to set email alerts
|

Contour-Based Priority Scheduling in Optical Burst Switched Networks

Abstract: Abstract-Optical burst switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over dense wavelength division multiplexing links. Although several quality-of-service (QoS) schemes have been proposed for OBS networks, how to provide QoS at the high speed required by the OBS network is still an open question. In this paper, we propose a novel O(1) runtime contour-based priority algorithm that provides complete priority isolation among different priorities. This … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2009
2009
2014
2014

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 15 publications
0
9
0
Order By: Relevance
“…scheduling algorithms without void filling [15][16][17]20] and scheduling algorithms with void filling [16][17][18][19][20] .…”
Section: ⅳ Proposed Algorithm For a Limited Number Of Twcs And Intermentioning
confidence: 99%
See 2 more Smart Citations
“…scheduling algorithms without void filling [15][16][17]20] and scheduling algorithms with void filling [16][17][18][19][20] .…”
Section: ⅳ Proposed Algorithm For a Limited Number Of Twcs And Intermentioning
confidence: 99%
“…For this reason, efforts are required to increase buffer capacity in an optical packet switch with a limited number of FDLs [7][8][9][10][11][12][13][14] . For asynchronous and variable-length packets, scheduling algorithms without void filling as well as those with void filling can be used to allocate incoming packets in each output channel using an FDL buffer [15][16][17][18][19][20] .…”
Section: ⅰ Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Consider, for example, a system with 16 inputs and 64 wavelengths per fiber, each operating at 10 Gb/s. In order to support an average burst length of 100 kBytes the system would have to be able to process a control packet every 78 ns [15].…”
Section: Burst Scheduling Algorithmsmentioning
confidence: 99%
“…where m is the total number of voids for all wavelengths. Efficient implementations of the LAUC-VF algorithm [14,16] report a complexity equal to O(log m) but require 10 log m memory accesses per burst scheduling request, which means that they can take up to a few microseconds to schedule a single burst [15].…”
Section: Burst Scheduling Algorithmsmentioning
confidence: 99%