Name
Abstract | ||
|---|---|---|
This paper presents a congestion control scheme based on alternate path routing. In the scheme, if a node encounters congestion or loses its preferred neighbor on its primary path to a destination, it sends data packets to that destination over precomputed alternate paths. The scheme ensures that data packets do not travel in loops and limits the spread of congestion to neighboring nodes. Simulations of the scheme show that alternate path routing reduces the number of dropped packets, achieves a more uniform link utilization and alleviates congestion in networks under light to moderate loading. When using alternate path routing, it is observed that the loss ratio closely follows the load ratio which is not true when using shortest path routing. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.3233/JHS-1992-1202 | J. High Speed Networks |
Keywords | Field | DocType |
alternate path routing,alternate paths,computer networks,congestion control,routing in networks | Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Path vector protocol,Computer science,Static routing,Destination-Sequenced Distance Vector routing,Computer network,Private Network-to-Network Interface,Geographic routing | Journal |
Volume | Issue | Citations |
1 | 2 | 1 |
PageRank | References | Authors |
0.36 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepinder P. Sidhu | 1 | 534 | 161.66 |
| Shukri Abdallah | 2 | 74 | 30.36 |
| Raj Nair | 3 | 121 | 35.03 |