7 search results - page 1 / 2 » Near-Optimal Worst-Case Throughput Routing for Two-Dimension... |
ISCA
2005
IEEE
13 years 10 months ago
2005
IEEE
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...
JSAC
2006
13 years 4 months ago
2006
Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. E...
CAL
2008
13 years 5 months ago
2008
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
ICCD
2008
IEEE
14 years 1 months ago
2008
IEEE
— The increasing viability of three dimensional (3D) silicon integration technology has opened new opportunities for chip architecture innovations. One direction is in the extens...
TON
2010
12 years 11 months ago
2010
Abstract--We present a number of significant engineering insights on what makes a good configuration for medium- to largesize wireless mesh networks (WMNs) when the objective funct...