Sciweavers

Share
ASPLOS
2010
ACM
10 years 3 months ago
A power-efficient all-optical on-chip interconnect using wavelength-based oblivious routing
We present an all-optical approach to constructing data networks on chip that combines the following key features: (1) Wavelengthbased routing, where the route followed by a packe...
Nevin Kirman, José F. Martínez
ESA
1998
Springer
95views Algorithms» more  ESA 1998»
10 years 4 months ago
New Bounds for Oblivious Mesh Routing
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...
Kazuo Iwama, Yahiko Kambayashi, Eiji Miyano
SPAA
2003
ACM
10 years 5 months ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
SPAA
2005
ACM
10 years 5 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
SPAA
2006
ACM
10 years 5 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
10 years 6 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
ISCA
2009
IEEE
186views Hardware» more  ISCA 2009»
10 years 6 months ago
Application-aware deadlock-free oblivious routing
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
Michel A. Kinsy, Myong Hyon Cho, Tina Wen, G. Edwa...
NOCS
2009
IEEE
10 years 6 months ago
Static virtual channel allocation in oblivious routing
Most virtual channel routers have multiple virtual channels to mitigate the effects of head-of-line blocking. When there are more flows than virtual channels at a link, packets o...
Keun Sup Shim, Myong Hyon Cho, Michel A. Kinsy, Ti...
CLUSTER
2009
IEEE
10 years 6 months ago
Oblivious routing schemes in extended generalized Fat Tree networks
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
Germán Rodríguez, Cyriel Minkenberg,...
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
11 years 3 days ago
Oblivious routing in directed graphs with random demands
Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leig...
books