2005
DOI: 10.1093/ietcom/e88-b.12.4507
|View full text |Cite
|
Sign up to set email alerts
|

A Decentralized Optical Bursts Routing Based on Adaptive Load Splitting into Pre-Calculated Multiple Paths

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2008
2008
2010
2010

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…Most of the proposals are based on a static calculation of the set of equally important routes with Dijkstra's algorithm [17]. Then, the path selection proceeds adaptively according to some heuristic [3,18] or optimised cost function [19,20]. Both traffic splitting [21,22] and path ranking [23 -25] techniques are used in the path selection process.…”
Section: Review Of Routing Methods In Obs Networkmentioning
confidence: 99%
“…Most of the proposals are based on a static calculation of the set of equally important routes with Dijkstra's algorithm [17]. Then, the path selection proceeds adaptively according to some heuristic [3,18] or optimised cost function [19,20]. Both traffic splitting [21,22] and path ranking [23 -25] techniques are used in the path selection process.…”
Section: Review Of Routing Methods In Obs Networkmentioning
confidence: 99%
“…The results that we will present in next section are obtained by setting w 1 = 0.25, w 2 = 0. 75. More details of this adaptive burstification algorithm is presented in [5].…”
Section: Adaptive Burstification Algorithmmentioning
confidence: 99%
“…Most of the proposals are based on a static calculation of the set of equally-important routes (e.g., [81]). Then the path selection is performed adaptively and according to some heuristic [75,95] or optimised cost function [66,94]. Both traffic splitting [4,63] and path ranking [46,104] techniques are used in the path selection process.…”
Section: Introduction and State-of-the-artmentioning
confidence: 99%
“…In the two adaptive path selection mechanisms proposed in [20] and [28], the average transfer delay always exceeds that of the shortest-path routing because alternative paths with a larger transfer delay are also utilized in the multi-path routing. The paper [15] proposed a decentralized routing scheme based on multiple paths in which each source node splits the traffic load according to the measured loss rate instead of link utilization. Moreover, load splitting ratios for the multiple paths are autonomously adjusted to minimize the average transfer delay based on the condition that the required loss rate of optical bursts is satisfied.…”
Section: Previous Workmentioning
confidence: 99%
“…The routing method proposed also bears fairness-solving in mind, which distinguishes itself from the other adaptive routing mechanisms [15,20,28]. To achieve better fairness, it allows longer-hop bursts to have more routing choices.…”
Section: Hop-by-hop Proactive Routing Using Fcr and Neighborhood Linkmentioning
confidence: 99%