1578 search results - page 36 / 316 » Direct Routing: Algorithms and Complexity |
ICNP
2006
IEEE
14 years 2 months ago
2006
IEEE
— Routing in multi-hop wireless networks involves the indirection from a persistent name (or ID) to a locator. Concepts such as coordinate space embedding help reduce the number ...
CAL
2004
13 years 8 months ago
2004
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...
COCO
2008
Springer
13 years 10 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
ICC
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—In this paper we propose non-regenerative multicarrier multiple-input multiple-output (MIMO) relay techniques that minimize the mean-squared error (MSE) of the signal wa...