Weighted Random Routing on Torus Networks

Authors:
Rohit Sunkam Ramanujam;Bill Lin
Affiliations:
University of California San Diego, La Jolla;University of California San Diego, La Jolla
Venue:
IEEE Computer Architecture Letters
Year:
2009

Citing 0
Cited 2

Localized QoS routing algorithm based on residual bandwidth

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Weighted random oblivious routing on torus networks

Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new closed-form oblivious routing algorithm called W2TURN that is worst-case throughput optimal for 2D-torus networks. W2TURN is based on a weighted random selection of paths that contain at most two turns. In terms of average hop count, W2TURN outperforms the best previously known closed-form worst-case throughput optimal routing algorithm called IVAL. In addition, we present a new optimal weighted random routing algorithm for rings called WRD.