Sciweavers

460 search results - page 57 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
BERTINORO
2005
Springer
14 years 2 months ago
Emergent Consensus in Decentralised Systems Using Collaborative Reinforcement Learning
Abstract. This paper describes the application of a decentralised coordination algorithm, called Collaborative Reinforcement Learning (CRL), to two different distributed system pr...
Jim Dowling, Raymond Cunningham, Anthony Harringto...
INFOCOM
2010
IEEE
13 years 7 months ago
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
TCOM
2010
167views more  TCOM 2010»
13 years 7 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
14 years 2 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
INFOCOM
2012
IEEE
11 years 11 months ago
Submodular game for distributed application allocation in shared sensor networks
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...
Chengjie Wu, You Xu, Yixin Chen, Chenyang Lu