18 search results - page 2 / 4 » O(n) routing in rearrangeable networks |
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
PODC
2003
ACM
13 years 10 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
ISCC
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper presents a new concept to improve Ad Hoc Routing Protocols exploiting IEEE 802.11a Link Adaptation information. The IEEE 802.11a Link Adaptation information is used to ...
JSAC
2006
13 years 5 months ago
2006
A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new con...
ICC
2009
IEEE
13 years 3 months ago
2009
IEEE
We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. We consider a network wit...