Sciweavers

1511 search results - page 167 / 303
» Randomness, lowness and degrees
Sort
View
ACSC
2006
IEEE
16 years 15 days ago
Throughput fairness in k-ary n-cube networks
The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered ...
Cruz Izu
NETGAMES
2006
ACM
16 years 11 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
16 years 17 hour 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
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