✦ LIBER ✦

Randomized Throughput-Optimal Oblivious Routing for Torus Networks

✍ Scribed by Ramanujam, Rohit Sunkam; Lin, Bill

Book ID: 118194529
Publisher: IEEE
Year: 2013
Tongue: English
Weight: 373 KB
Volume: 62
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.2011.226

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Optimal Worst-Case Throughput Boun

A New Optimal Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network

✍ Sun, Guang; Chang, Chia-Wei; Lin, Bill 📂 Article 📅 2013 🏛 IEEE 🌐 English ⚖ 133 KB

An optimal time bound for oblivious rout

An optimal time bound for oblivious routing

✍ Ian Parberry 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 454 KB

Weighted Random Routing on Torus Network

Weighted Random Routing on Torus Networks

✍ Sunkam Ramanujam, R.; Lin, B. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 125 KB

There is no optimal routing policy for t

There is no optimal routing policy for the torus

✍ Loren Schwiebert 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 89 KB

A routing policy is the method used to select a specific output channel for a message from among a number of acceptable output channels. An optimal routing policy is a policy that maximizes the probability of a message reaching its destination without delays. Optimal routing policies have been propo

Topological properties and routing algor

Topological properties and routing algorithm for semi-diagonal torus networks

✍ Ya-gang WANG; Hui-min DU; Xu-bang SHEN 📂 Article 📅 2011 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 368 KB

Randomized self-routing algorithms for C

Randomized self-routing algorithms for Clos networks

✍ Abdou Youssef 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 747 KB