LBSR: a load-balanced semiminimal routing algorithm in cellular routers

  • Authors:
  • Zuhui Yue;Youjian Zhao;Jianping Wu;Xiaoping Zhang

  • Affiliations:
  • Department of Computer Science, Tsinghua University, Beijing, P.R China;Department of Computer Science, Tsinghua University, Beijing, P.R China;Department of Computer Science, Tsinghua University, Beijing, P.R China;Department of Computer Science, Tsinghua University, Beijing, P.R China

  • Venue:
  • ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.