Sciweavers

648 search results - page 66 / 130
» Lowness for Demuth Randomness
Sort
View
NETGAMES
2006
ACM
16 years 7 days ago
Comparing interest management algorithms for massively multiplayer games
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
Jean-Sébastien Boulanger, Jörg Kienzle...
IPPS
2005
IEEE
15 years 12 months ago
To Unify Structured and Unstructured P2P Systems
Most of current peer-to-peer designs build their own system overlays independent of the physical one. Nodes within unstructured systems form a random overlay, on the contrary, str...
Honghao Wang, Yingwu Zhu, Yiming Hu
ISPAN
2005
IEEE
15 years 12 months ago
Overlay networks with class
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...
GCC
2003
Springer
15 years 11 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu
INFOCOM
2000
IEEE
15 years 10 months ago
Stochastic Modeling of TCP over Lossy Links
—An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented. A Markovian approach is developed that allows us...
Alhussein A. Abouzeid, Sumit Roy, Murat Azizoglu