Paper Info
Title
rHALB: a new load-balanced routing algorithm for k-ary n-cube networks
Abstract
A new load-balanced routing algorithm for k-ary n-cube networks is proposed in this paper. The new algorithm, called rHALB (r Hop Aware Load-Balanced) routing algorithm, can efficiently balance traffic loads in k-ary ncube networks. It is based on the limited global information, which is a tradeoff between local and global information. rHALB makes use of the number of potential deadlocked packets to detect the congestion, and can direct the traffic to bypass any detected hotspots, thus balancing the traffic. Simulations are carried out on 2D torus networks by using OPNET. The results show that rHALB achieves a better performance (latency and throughput) under various traffic patterns than dimension order routing and Duato's algorithm, which are popularly used in commercial products, and ROMM, ACQ and GAL, which were proposed in literature recently.
Year
DOI
Venue
2007
10.1007/978-3-540-76837-1_43
APPT
Keywords
Field
DocType
global information,hop aware load-balanced,limited global information,k-ary n-cube network,various traffic pattern,new algorithm,dimension order routing,better performance,k-ary ncube network,new load-balanced routing algorithm,load balance
Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Destination-Sequenced Distance Vector routing,Computer network,Algorithm,Wireless Routing Protocol,Routing Information Protocol,Geographic routing,Distance-vector routing protocol,Distributed computing
Conference
Volume
ISSN
ISBN
4847
0302-9743
3-540-76836-X
Citations 
PageRank 
References 
1
0.37
15
Authors
4
Name
Order
Citations
PageRank
Huaxi Gu127151.52
Jie Zhang2677.02
Kun Wang37914.33
Changshan Wang441.44