Potential based routing in B-P2i− architecture

The centralized switching fabric is increasingly becoming the performance bottleneck of the routers due to the constraints of the port size and the complexity of scheduling algorithm. In order to address scalability problem, interconnection networks have been widely used to build distributed switching fabrics. P2i is an asymptotically minimal node-degree interconnection network which has an ideal throughput of at least 2 under uniform traffic pattern for arbitrary node numbers. We propose B-P2i- architecture, which enhances the path diversity and shortens the network diameter of P2i. In order to balance the transmission efficiency under light load and the maximum throughput under heavy load, we present PB routing algorithm for B-P2i- architecture which is constructed by IQ routers. Our simulations using the modified BookSim simulator indicate that B-P2i- architecture using PB routing algorithm has good performance under adversary traffic patterns. The simulations also indicate that our architecture has an ideal scalability for constructing scalable routers with large capacity. To the best of our knowledge, this is the first time to utilize the concept of potential field to design adaptive routing algorithm for scalable router which is constructed by IQ routers with DIN topology.

[1]  Zu-Hui Yue,et al.  Implementation of Scalable Routers with Direct Networks , 2007 .

[2]  William J. Dally,et al.  Flattened butterfly: a cost-efficient topology for high-radix networks , 2007, ISCA '07.

[3]  Nick McKeown,et al.  The Tiny Tera: A Packet Switch Core , 1998, IEEE Micro.

[4]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[5]  Martin May,et al.  HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[6]  Nick McKeown,et al.  The iSLIP scheduling algorithm for input-queued switches , 1999, TNET.

[7]  William J. Dally,et al.  Technology-Driven, Highly-Scalable Dragonfly Topology , 2008, 2008 International Symposium on Computer Architecture.

[8]  Bernhard Plattner,et al.  Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Jianping Wu,et al.  Topological Properties and Routing Algorithms in Cellular Router , 2006, International conference on Networking and Services (ICNS'06).

[10]  Supratim Deb,et al.  Fast Matching Algorithms for Repetitive Optimization: An Application to Switch Scheduling , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[11]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[12]  John A. Chandy,et al.  2-dilated flattened butterfly: A nonblocking switching network , 2010, 2010 International Conference on High Performance Switching and Routing.

[13]  Zhenhua Liu,et al.  An Asymptotically Minimal Node-Degree Topology for Load-Balanced Architectures , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[14]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[15]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[16]  William J. Dally,et al.  Microarchitecture of a high radix router , 2005, 32nd International Symposium on Computer Architecture (ISCA'05).

[17]  Chuang Lin,et al.  Attribute-aware data aggregation using dynamic routing in wireless sensor networks , 2010, 2010 IEEE International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM).