Sciweavers

460 search results - page 25 / 92
» Bounding the locality of distributed routing algorithms
Sort
View
TPDS
2010
126views more  TPDS 2010»
13 years 2 months ago
Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing
Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe scheme...
Silvia Bianchi, Pascal Felber, Maria Gradinariu Po...
CDC
2009
IEEE
211views Control Systems» more  CDC 2009»
14 years 13 days ago
An event-triggered distributed primal-dual algorithm for Network Utility maximization
Abstract— Many problems associated with networked systems can be formulated as network utility maximization (NUM) problems. NUM problems maximize a global separable measure of ne...
Pu Wan, Michael D. Lemmon
SPAA
2003
ACM
14 years 29 days ago
Analysis of link reversal routing algorithms for mobile ad hoc networks
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
Costas Busch, Srikanth Surapaneni, Srikanta Tirtha...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 2 months ago
Maximizing Throughput in Layered Peer-to-Peer Streaming
—Layered streaming is an effective solution to address the receiver heterogeneity in peer-to-peer (P2P) multimedia distribution. This paper targets a fundamental challenge in thi...
Liang Dai, Yi Cui, Yuan Xue
IPPS
2005
IEEE
14 years 1 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou