Sciweavers

1734 search results - page 172 / 347
» The Multimedia Multicasting Problem
Sort
View
SIGCOMM
2006
ACM
16 years 1 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
183
Voted
NOSSDAV
2005
Springer
16 years 19 days ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
221
Voted
ICDCSW
2003
IEEE
16 years 13 days ago
Gateway: A Message Hub with Store-and-Forward Messaging in Mobile Networks
To obtain good performance in messaging over mobile networks, we have developed a Gateway. Gateway is a message hub that transmits information using store-and-forward messaging an...
Eiko Yoneki, Jean Bacon
IMC
2003
ACM
16 years 12 days ago
Some findings on the network performance of broadband hosts
With the rapid growth in the popularity of and the research interest in peer-to-peer (P2P) systems, an interesting question is what the quality of network connectivity between pee...
Karthik Lakshminarayanan, Venkata N. Padmanabhan
EUROCRYPT
1999
Springer
15 years 11 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold