632 search results - page 45 / 127 » On Routing in Circulant Graphs |
ICASSP
2010
IEEE
14 years 8 months ago
2010
IEEE
We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WS...
IPCO
2010
14 years 11 months ago
2010
Abstract. We study the quality of equilibrium in atomic splittable routing games. We show that in single-source single-sink games on seriesparallel graphs, the price of collusion -...
COMPLEX
2009
Springer
15 years 1 months ago
2009
Springer
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
GD
1997
Springer
15 years 2 months ago
1997
Springer
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
SIGECOM
2006
ACM
15 years 3 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...