Paper Info
Title
Topological Properties and Routing Algorithms in Cellular Router
Abstract
The rapid growth of user traffic in the Internet is driving routers to run at increasing bit-rates and have a very large number of ports. However, it is becoming more difficult to just increase the speed of ports. In a router, the centralized switching fabric is the single point of failure (SPF). As the number of line cards increases, the centralized switching fabrics become the bottleneck of the router for limited ports and complicated scheduling algorithms. Cellular router (CR) is a novel architecture and with some modifications it shows excellent scalability. We first give a glimpse at its topological properties. We then develop two deterministic minimal routing algorithms and a load-balanced minimal routing (LBMR) algorithm. Extensive simulations show that the LBMR algorithm has competitively high performance on two certain traffic patterns
Year
DOI
Venue
2006
10.1109/ICNS.2006.112
ICNS
Keywords
Field
DocType
telecommunication switching,user traffic,load-balanced minimal routing,certain traffic pattern,single point of failure,topological properties,complicated scheduling algorithm,cellular router,telecommunication network topology,large number,single point,internet,routing algorithms,centralized switching fabric,telecommunication traffic,telecommunication network routing,deterministic minimal routing algorithms,lbmr algorithm,load-balanced minimal routing algorithm,deterministic minimal routing algorithm,routing,optical switches,network topology,scheduling algorithm,load balance,scalability,scheduling,chromium
Topology,Single point of failure,Computer science,Computer network,Network topology,Core router,Mobile broadband modem,Router,Metrics,One-armed router,Distributed computing,Scalability
Conference
ISBN
Citations 
PageRank 
0-7695-2622-5
3
0.41
References 
Authors
11
4
Name
Order
Citations
PageRank
Youjian Zhao127332.53
Zuhui Yue281.57
Jianping Wu340853.61
Xiaoping Zhang4276.83