Title
LBSR: a load-balanced semiminimal routing algorithm in cellular routers
Abstract
In the Internet, the exponential growth of user traffic is driving routers to run at increasing bit-rates and have a very large number of ports Traditional routers consist of line cards and centralized switching fabrics However, in such a router, the centralized switching fabric is becoming the bottleneck for its limited ports and complicated scheduling algorithms Interconnection networks, such as 3-D Torus topology, have been applied to routers They show excellent scalability and fault tolerance Unfortunately its scalability is limited in practice In this paper, we propose a novel architecture called Cellular Router (CR) and give a simple discussion of this architecture We introduce a load-balanced semiminimal routing algorithm (LBSR) for CRs This algorithm makes use of path diversity and shows high throughput on tornado and random traffic patterns We also discuss some other aspects of this algorithm, such as dropping ratio, effects of queue length and speedup.
Year
DOI
Venue
2006
10.1007/11919568_42
ICOIN
Keywords
Field
DocType
novel architecture,limited port,cellular router,load-balanced semiminimal,cellular routers,interconnection network,user traffic,centralized switching fabric,excellent scalability,ports traditional routers,random traffic pattern,3-d torus topology,scheduling algorithm,high throughput,exponential growth,fault tolerant,load balance
Bottleneck,Telecommunications network,Computer science,Scheduling (computing),Load balancing (computing),Computer network,Router,Mobile broadband modem,Speedup,Distributed computing,Scalability
Conference
Volume
ISSN
ISBN
3961
0302-9743
3-540-48563-5
Citations 
PageRank 
References 
1
0.36
11
Authors
4
Name
Order
Citations
PageRank
Zuhui Yue181.57
Youjian Zhao227332.53
Jianping Wu3743121.01
Xiaoping Zhang4276.83