Sciweavers

366 search results - page 69 / 74
» A routing underlay for overlay networks
Sort
View
ISCAPDCS
2003
13 years 8 months ago
A Super-Peer Based Lookup in Structured Peer-to-Peer Systems
All existing lookup algorithms in structured peerto-peer (P2P) systems assume that all peers are uniform in resources (e.g., network bandwidth, storage and CPU). Messages are rout...
Yingwu Zhu, Honghao Wang, Yiming Hu
SIGCOMM
2004
ACM
14 years 27 days ago
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...
Ningning Hu, Erran L. Li, Zhuoqing Morley Mao, Pet...
PAM
2009
Springer
14 years 2 months ago
Queen: Estimating Packet Loss Rate between Arbitrary Internet Hosts
Estimate of packet-loss rates between arbitrary Internet hosts is critical for many large-scale distributed applications, including overlay routing, P2P media streaming, VoIP, and ...
Angela Wang, Cheng Huang, Jin Li, Keith W. Ross
SIGMETRICS
2003
ACM
113views Hardware» more  SIGMETRICS 2003»
14 years 22 days ago
An empirical evaluation of wide-area internet bottlenecks
Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network – i.e last mile connectivity to users, or access links of s...
Aditya Akella, Srinivasan Seshan, Anees Shaikh
PC
2007
118views Management» more  PC 2007»
13 years 7 months ago
Peer-to-peer systems for discovering resources in a dynamic grid
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutio...
Moreno Marzolla, Matteo Mordacchini, Salvatore Orl...