Sciweavers

1391 search results - page 164 / 279
» Distributed routing in networks using affinity propagation
Sort
View
MIDDLEWARE
2005
Springer
16 years 5 hour ago
MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...
Fengyun Cao, Jaswinder Pal Singh
ICDCS
2010
IEEE
15 years 10 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
OOPSLA
2010
Springer
15 years 4 months ago
G-Finder: routing programming questions closer to the experts
Programming forums are becoming the primary tools for programmers to find answers for their programming problems. Our empirical study of popular programming forums shows that the...
Wei Li, Charles Zhang, Songlin Hu
P2P
2009
IEEE
114views Communications» more  P2P 2009»
16 years 1 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
ICDCS
2008
IEEE
16 years 29 days ago
Sensor Node Localization Using Uncontrolled Events
Many event-driven localization methods have been proposed as low cost, energy efficient solutions for wireless senor networks. In order to eliminate the requirement of accurately...
Ziguo Zhong, Dan Wang, Tian He