Paper Info
Title
A Cost-Effective Load Balanced Adaptive Routing Scheme for Mesh-Connected Networks
Abstract
In this paper, a highly cost-effective adaptive routing algorithm for n-D meshes is designed. It employs only two virtual channels. The planar routing and the 2D VBMAR are used as constructs for it. Routing freedom is greatly enhanced to improve performance. As a result, the algorithm features load balance and high adaptivity. Deadlock freedom of the algorithm is proved. Extensive simulations show that it not only outperforms algorithms with equal virtual channels, but also excels the fully routing algorithm with much more virtual channels.
Year
DOI
Venue
2000
10.1109/MASCOT.2000.876581
MASCOTS
Keywords
Field
DocType
algorithm features load balance,equal virtual channel,high adaptivity,vbmar,adaptive routing,adaptive routing scheme,cost-effective adaptive,planar routing,mesh-connected networks,virtual channel,routing freedom,n-d mesh,cost-effective load,load balance,deadlock freedom,crossed turn model,extensive simulation,network performance,computer architecture,cost effectiveness,resource allocation,algorithm design and analysis,concurrency control,routing,adaptive systems,parallel processing,computational modeling,network routing,concurrent computing
Equal-cost multi-path routing,Multipath routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Parallel computing,Destination-Sequenced Distance Vector routing,Real-time computing,Routing table,Distance-vector routing protocol,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-0728-X
1
0.37
References 
Authors
15
3
Name
Order
Citations
PageRank
Xicheng Liu173.20
Sijing Zhang216323.40
Timothy J. Li351.48