Sciweavers

1016 search results - page 150 / 204
» Optimized algorithms for multi-agent routing
Sort
View
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
14 years 9 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
15 years 10 months ago
The price of anarchy is independent of the network topology
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
Tim Roughgarden
SIGMETRICS
2005
ACM
100views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
On AS-level path inference
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...
Zhuoqing Morley Mao, Lili Qiu, Jia Wang, Yin Zhang
CN
2008
138views more  CN 2008»
14 years 9 months ago
Analysis of bandwidth efficiency in overlay multicasting
act 11 Overlay multicasting has been proposed for implementing multicast routing in the application layer as a practical alter12 native to IP multicasting. Since a packet in overla...
Changhan Kim, Younghoon Kim, Jae-Heon Yang, Ikjun ...
INFOCOM
2007
IEEE
15 years 4 months ago
Low-Complexity and Distributed Energy Minimization in Multi-Hop Wireless Networks
— In this work, we study the problem of minimizing the total power consumption in a multi-hop wireless network subject to a given offered load. It is well-known that the total po...
Longbi Lin, Xiaojun Lin, Ness B. Shroff