DocumentCode
1922000
Title
Potential based routing in B-P2i− architecture
Author
Menghan Li ; Xiaoping Zhang ; Yupeng Tian ; Haixiang Zhang
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
fYear
2013
fDate
28-30 Jan. 2013
Firstpage
71
Lastpage
76
Abstract
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.
Keywords
scheduling; telecommunication network reliability; telecommunication network routing; telecommunication network topology; telecommunication switching; telecommunication traffic; B-P2i- architecture; DIN topology; IQ router; PB routing algorithm; adaptive routing algorithm; arbitrary node number; asymptotically minimal node-degree interconnection network; centralized switching fabric; distributed switching fabric; maximum throughput; modified BookSim simulator; path diversity enhancement; potential based routing algorithm; scalability problem; scheduling algorithm; transmission efficiency; uniform adversary traffic pattern; Algorithm design and analysis; Computer architecture; Force; Network topology; Routing; Throughput; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Networking (ICOIN), 2013 International Conference on
Conference_Location
Bangkok
ISSN
1976-7684
Print_ISBN
978-1-4673-5740-1
Electronic_ISBN
1976-7684
Type
conf
DOI
10.1109/ICOIN.2013.6496354
Filename
6496354
Link To Document