GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference 2009
DOI: 10.1109/glocom.2009.5426139
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling Bursts Using Interval Graphs in Optical Burst Switching Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…The proposed algorithms will reduce the number of channels or void checks and thus the overall scheduling complexity. Cao et al (2009) have proposed novel algorithms for batch scheduling in OBS networks with different optimization criteria. The algorithms effectively consider the strong correlations among the multiple bursts and employ the proposed interval graphs and min-cost circular flow techniques to achieve optimized network performance in terms of data loss rate in the network.…”
Section: Previous Workmentioning
confidence: 99%
“…The proposed algorithms will reduce the number of channels or void checks and thus the overall scheduling complexity. Cao et al (2009) have proposed novel algorithms for batch scheduling in OBS networks with different optimization criteria. The algorithms effectively consider the strong correlations among the multiple bursts and employ the proposed interval graphs and min-cost circular flow techniques to achieve optimized network performance in terms of data loss rate in the network.…”
Section: Previous Workmentioning
confidence: 99%