Sciweavers

301 search results - page 60 / 61
» p2p 2006
Sort
View
DEXAW
2006
IEEE
140views Database» more  DEXAW 2006»
14 years 13 days ago
String-Matching and Update through Algebraic Signatures in Scalable Distributed Data Structures
: Scalable Distributed Data Structures (SDDSs) store large scalable files over a distributed RAM of nodes in a grid or a P2P network. The files scale transparently for the applicat...
Riad Mokadem, Witold Litwin
INFOCOM
2006
IEEE
14 years 12 days ago
Minimum User-Perceived Interference Routing in Service Composition
— Service Composition is a promising technology for providing on-demand services in dynamic and loosely coupled peerto-peer (P2P) networks. Because of system dynamics, such as th...
Li Xiao, Klara Nahrstedt
INFOCOM
2006
IEEE
14 years 12 days ago
AnySee: Peer-to-Peer Live Streaming
— Efficient and scalable live-streaming overlay construction has become a hot topic recently. In order to improve the performance metrics, such as startup delay, source-to-end de...
Xiaofei Liao, Hai Jin, Yunhao Liu, Lionel M. Ni, D...
INFOCOM
2006
IEEE
14 years 12 days ago
Mistreatment in Distributed Caching Groups: Causes and Implications
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bes...
SIGCOMM
2006
ACM
14 years 9 days ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...