Re-routing in circuit switched networks
Research output: Journal Publications and Reviews › RGC 22 - Publication in policy or professional journal
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 1373-1379 |
| Journal / Publication | Proceedings - IEEE INFOCOM |
| Volume | 3 |
| Publication status | Published - 1997 |
Conference
| Title | Proceedings of the 1997 16th IEEE Annual Conference on Computer Communications, INFOCOM. Part 1 (of 3) |
|---|---|
| City | Kobe, Jpn |
| Period | 7 - 12 April 1997 |
Link(s)
Abstract
Dynamic routing has been adopted in many circuit switched networks in many parts of the world. A number of dynamic routing schemes have been designed and studied with the aim of maximizing the network throughput. The Least Loaded Routing (LLR) is simple and efficient, while other more elaborate routing schemes can only provide marginal throughput gain over that of LLR. Re-routing is the practice of routing calls on alternate paths to direct paths or other less congested alternate paths. It allows the continuous redistribution of network loads so that the congestion on direct paths can be relieved. In this paper, we study a re-routing scheme based on LLR. An original analysis of re-routing is performed and numerical examples confirm the significant throughput gain over LLR routing.
Citation Format(s)
Re-routing in circuit switched networks. / Wong, Eric W M; Chan, Andy K M; Yum, Tak Shing Peter.
In: Proceedings - IEEE INFOCOM, Vol. 3, 1997, p. 1373-1379.
In: Proceedings - IEEE INFOCOM, Vol. 3, 1997, p. 1373-1379.
Research output: Journal Publications and Reviews › RGC 22 - Publication in policy or professional journal
