2010
DOI: 10.1016/j.osn.2010.01.001
|View full text |Cite
|
Sign up to set email alerts
|

An overview of routing methods in optical burst switching networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
2
2

Relationship

2
6

Authors

Journals

citations
Cited by 38 publications
(23 citation statements)
references
References 32 publications
0
23
0
Order By: Relevance
“…The second hypothesis is that selecting, within the set of shortest paths, a subset that allows to balance the load of each link in the network [23,24] reduces the global blocking probability of the network. Consequently, the method mostly used to establish routes is the "Shortest Path Balanced Routing" (SPBR) one [25,26,27,12,28,29,30,31,32,33].…”
Section: State Of the Artmentioning
confidence: 99%
“…The second hypothesis is that selecting, within the set of shortest paths, a subset that allows to balance the load of each link in the network [23,24] reduces the global blocking probability of the network. Consequently, the method mostly used to establish routes is the "Shortest Path Balanced Routing" (SPBR) one [25,26,27,12,28,29,30,31,32,33].…”
Section: State Of the Artmentioning
confidence: 99%
“…The routing model that we consider is based on a Linear Programming (LP) algorithm presented in [11]. To be precise, the authors consider a multi-path routing (MPR) approach (i.e., splittable routing) to solve the routing problem.…”
Section: Routing Problemmentioning
confidence: 99%
“…In the study here presented, by contrast, we consider unsplittable (non-bifurcated) routing by forcing routing variables to be binary, and hence, we eventually solve the resulting MILP problem. However, due to space limitations, we do not include the formulation of the routing algorithm and refer the reader to Section 4.2 in [11] for more details.…”
Section: Routing Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…To achieve it we make use of the Linear Programming (LP)-based multipath routing algorithm presented in Section 4.2 in [14]. To find a single path p d for each demand d, we modify the LP formulation by forcing routing variables to be binary and then solve the resulting Mixed Integer Linear Programming (MILP) problem.…”
Section: ) Link Congestion Reduction-oriented (Lcr) Selectionmentioning
confidence: 99%