Sciweavers

269 search results - page 22 / 54
» Online oblivious routing
Sort
View
MOBISYS
2005
ACM
14 years 7 months ago
Horde: separating network striping policy from mechanism
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping syste...
Asfandyar Qureshi, John V. Guttag
IJRR
2007
67views more  IJRR 2007»
13 years 7 months ago
Transfer Time Complexity of Conflict-free Vehicle Routing with no Communications
jr.sagepub.com/cgi/content/abstract/26/3/255 The online version of this article can be found at: Published by: http://www.sagepublications.com On behalf of: Multimedia Archives can...
Vikrant Sharma, Michael A. Savchenko, Emilio Frazz...
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 1 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
ICNP
2002
IEEE
14 years 14 days ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman