On selection of candidate paths for proportional routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm
IEEE Transactions on Parallel and Distributed Systems
Multipath routing algorithms for congestion minimization
IEEE/ACM Transactions on Networking (TON)
An In–Out Combined Dynamic Weighted Round-Robin Method for Network Load Balancing
The Computer Journal
Hi-index | 0.00 |
It has been widely recognized that the multipath routing can be fundamentally more efficient than the traditional approach of routing along single path. A self-adaptive traffic splitting algorithm, called Dynamic Weighted Round-Robin (DWRR), has been developed to distribute traffic fairly in term of the weight so as to obtain good performance of network load balance. In addition, DWRR can get lower end-to-end delay in multipath routing and may adapt to the path state to reduce the congestion. Result obtained from the simulations shows that DWRR is efficient in maintaining network load balance and gets high performance in reducing the end-to-end delay.