Paper Info
Title
VBMAR: Virtual Network Load Balanced Minimal Adaptive Routing
Abstract
Fully adaptive routing with less virtual channels is of technical trend in MPP interconnection network design. However, imbalance of load offsets performances of many schemes. In this paper we give a fully adaptive load balanced routing algorithm called VBMAR. A new design tool called crossed turn model (CTM) is proposed to solve complex deadlock problems across virtual networks while keep the load balanced. Non-deterministic finite automaton (NDFA) is used to model the routing process. The resulting algorithm features routing uniformity and channel priority. Concurrent architecture and parallel priority channel searching techniques are used in VBMAR router design, which make it cost effective. Four algorithms are compared to evaluate the performance of VBMAR. Simulations show that VBMAR can considerably increase network throughput and shorten network delay under both uniform and nonuniform traffic patterns. We argue that VBMAR is a very competitive routing scheme for future commercial MPP systems.
Year
DOI
Venue
1999
10.1109/IPPS.1999.760496
IPPS/SPDP
Keywords
Field
DocType
network delay,new design tool,mpp interconnection network design,minimal adaptive routing,virtual network,routing process,network throughput,competitive routing scheme,adaptive routing,virtual network load,load offsets performance,vbmar router design,algorithm design and analysis,throughput,cost efficiency,nondeterministic finite automaton,load balance,automata,resource allocation,routing
Multipath routing,Link-state routing protocol,Dynamic Source Routing,Hierarchical routing,Policy-based routing,Enhanced Interior Gateway Routing Protocol,Computer science,Static routing,Computer network,Routing table,Distributed computing
Conference
ISSN
ISBN
Citations 
1063-7133
0-7695-0143-5
2
PageRank 
References 
Authors
0.38
4
3
Name
Order
Citations
PageRank
Xicheng Liu173.20
Timothy J. Li251.48
Wen Gao311374741.77