1992
DOI: 10.3233/jhs-1992-1202
|View full text |Cite
|
Sign up to set email alerts
|

Congestion Control in High Speed Networks via Alternate Path Routing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
0
0

Year Published

1997
1997
2011
2011

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 7 publications
0
0
0
Order By: Relevance
“…Most of the research shows that Multipath Disjoint Routing will be the premier method for next generations of networks. There have already been many algorithms in which the disjointness of the paths are not considered [7][8] [9].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Most of the research shows that Multipath Disjoint Routing will be the premier method for next generations of networks. There have already been many algorithms in which the disjointness of the paths are not considered [7][8] [9].…”
Section: Introductionmentioning
confidence: 99%
“…This is called the k-shortest paths problem. There have already been many algorithms in which the disjointness of the paths are not considered [7][8] [9]. Some of the paths go through the same vertices, and others traverse the same arcs, hence they don't meet the condition of disjointness [10].…”
Section: Introductionmentioning
confidence: 99%