Randomized Throughput-Optimal Oblivious Routing for Torus Networks

被引:5
|
作者
Ramanujam, Rohit Sunkam [1 ]
Lin, Bill [2 ]
机构
[1] Juniper Networks, Santa Clara, CA 95054 USA
[2] Univ Calif San Diego, La Jolla, CA 90293 USA
关键词
On-chip Networks; interconnection networks; torus networks; oblivious routing;
D O I
10.1109/TC.2011.226
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we study the problem of optimal oblivious routing for 1D and 2D torus networks. 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. Restricting the maximum number of turns in routing paths to just two enables a simple deadlock-free implementation of W2TURN. In terms of average hop count, W2TURN outperforms the best previously known closed-form worst-case throughput optimal routing algorithm called IVAL [19]. When the network radix is odd, W2TURN achieves the minimum average hop count that can be achieved with 2-turn paths while remaining worst-case throughput optimal. When the network radix is even, W2TURN comes very close to achieving the minimum average hop count while remaining worst-case throughput optimal, within just 0.72 percent on a 12 x 12 torus. We also describe another routing algorithm based on weighted random selection of paths with at most two turns called I2TURN and show that I2TURN is equivalent to IVAL. However, I2TURN eliminates the need for loop removal at runtime and provides a closed-form analytical expression for evaluating the average hop count. The latter enables us to demonstrate analytically that W2TURN strictly outperforms IVAL (and I2TURN) in average hop count. Finally, we present a new optimal weighted random routing algorithm for rings called Weighted Random Direction (WRD). WRD provides a closed-form expression for the optimal distribution of traffic along the minimal and nonminimal directions in a ring topology to achieve minimum average hop count while guaranteeing optimal worst-case throughput. Based on our evaluations, in addition to being worst-case throughput optimal, W2TURN and WRD also perform well in the average case, and outperform the best previously known worst-case throughput optimal routing algorithms with closed-form descriptions in latency and throughput over a wide range of traffic patterns.
引用
收藏
页码:561 / 574
页数:14
相关论文
共 50 条
  • [1] Asynchronous Throughput-Optimal Routing in Malicious Networks
    Bunn, Paul
    Ostrovsky, Rafail
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT II, 2010, 6199 : 236 - 248
  • [2] Fair and Throughput-Optimal Routing in Multimodal Underwater Networks
    Diamant, Roee
    Casari, Paolo
    Campagnaro, Filippo
    Kebkal, Oleksiy
    Kebkal, Veronika
    Zorzi, Michele
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (03) : 1738 - 1754
  • [3] Uniform Minimal First: Latency Reduction in Throughput-Optimal Oblivious Routing for Mesh-Based Networks-on-Chip
    Song, Yang
    Lin, Bill
    [J]. IEEE EMBEDDED SYSTEMS LETTERS, 2019, 11 (03) : 81 - 84
  • [4] Routing in Multi-Modal Underwater Networks: a Throughput-optimal Approach
    Diamant, Roee
    Casari, Paolo
    Campagnaro, Filippo
    Zorzi, Michele
    [J]. 2017 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2017, : 205 - 210
  • [5] Towards a throughput-optimal routing algorithm for data collection on satellite networks
    Chen, Jianzhou
    Liu, Lixiang
    Hu, Xiaohui
    [J]. INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2016, 12 (07)
  • [6] Throughput-Optimal Configuration of Fixed Wireless Networks
    Karnik, Aditya
    Iyer, Aravind
    Rosenberg, Catherine
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2008, 16 (05) : 1161 - 1174
  • [7] Throughput-Optimal Joint Routing and Scheduling for Low-Earth-Orbit Satellite Networks
    Kondrateva, Olga
    Doebler, Holger
    Sparka, Hagen
    Freimann, Andreas
    Scheuermann, Bjoern
    Schilling, Klaus
    [J]. 2018 14TH ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES (WONS), 2018, : 59 - 66
  • [8] Optimal Oblivious Routing for Structured Networks
    Supittayapornpong, Sucha
    Namyar, Pooria
    Zhang, Mingyang
    Yu, Minlan
    Govindan, Ramesh
    [J]. IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 1988 - 1997
  • [9] Throughput-Optimal Broadcast in Wireless Networks with Dynamic Topology
    Sinha, Abhishek
    Tassiulas, Leandros
    Modiano, Eytan
    [J]. MOBIHOC '16: PROCEEDINGS OF THE 17TH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2016, : 21 - 30
  • [10] A Throughput-Optimal Scheduling Policy for Wireless Relay Networks
    Park, Daeyoung
    [J]. 2010 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC 2010), 2010,