Sciweavers

423 search results - page 20 / 85
» Topology for Distributed Inference on Graphs
Sort
View
IPPS
2006
IEEE
15 years 5 months ago
Power consumption comparison for regular wireless topologies using fault-tolerant beacon vector routing
Fault-tolerant Beacon Vector Routing (FBVR) is an efficient technique for routing in the presence of node failures. Several common wireless topologies exist that can be used with...
Luke Demoracski, Dimiter R. Avresky
INFOCOM
1999
IEEE
15 years 4 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
ISPA
2004
Springer
15 years 5 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
AAAI
2007
15 years 2 months ago
Allocating Goods on a Graph to Eliminate Envy
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet
TROB
2008
159views more  TROB 2008»
14 years 11 months ago
Distributed Connectivity Control of Mobile Networks
Control of mobile networks raises fundamental and novel problems in controlling the structure of the resulting dynamic graphs. In particular, in applications involving mobile senso...
Michael M. Zavlanos, George J. Pappas