Sciweavers

3908 search results - page 633 / 782
» A model for service-oriented communication systems
Sort
View
201
Voted
INFOCOM
2008
IEEE
16 years 1 months ago
Link Lifetimes and Randomized Neighbor Selection in DHTs
—Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to clas...
Zhongmei Yao, Dmitri Loguinov
INFOCOM
2006
IEEE
16 years 1 months 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
PODC
2006
ACM
16 years 1 months ago
Quorum placement in networks: minimizing network congestion
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements ...
Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Flor...
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 8 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
INFOCOM
2011
IEEE
14 years 10 months ago
Describing and forecasting video access patterns
Abstract—Computer systems are increasingly driven by workloads that reflect large-scale social behavior, such as rapid changes in the popularity of media items like videos. Capa...
Gonca Gürsun, Mark Crovella, Ibrahim Matta