Sciweavers

1204 search results - page 240 / 241
» Optimal Routing in a Small-World Network
Sort
View
ATAL
2008
Springer
13 years 7 months ago
No-regret learning and a mechanism for distributed multiagent planning
We develop a novel mechanism for coordinated, distributed multiagent planning. We consider problems stated as a collection of single-agent planning problems coupled by common soft...
Jan-P. Calliess, Geoffrey J. Gordon
SPAA
2005
ACM
13 years 11 months ago
Admission control to minimize rejections and online set cover with repetitions
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
Noga Alon, Yossi Azar, Shai Gutner
COCOON
2005
Springer
13 years 10 months ago
Share the Multicast Payment Fairly
Multicast routing uses a structure, either a tree or a mesh, to connect the receivers to the source, thus saving the bandwidth. How to share the cost among the receivers in a certa...
Weizhao Wang, Xiang-Yang Li, Zheng Sun
ISPA
2004
Springer
13 years 10 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
SIGMETRICS
2010
ACM
187views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Can multipath mitigate power law delays?: effects of parallelism on tail performance
—Parallelism has often been used to improve the reliability and efficiency of a variety of different engineering systems. In this paper, we quantify the efficiency of paralleli...
Jian Tan, Wei Wei, Bo Jiang, Ness Shroff, Donald F...