Sciweavers

625 search results - page 106 / 125
» Latency Insensitive Protocols
Sort
View
QSHINE
2005
IEEE
14 years 1 months ago
Grido- An Architecture for a Grid-based Overlay Network
— Grido is an architecture that targets a network operator intending to provide enhanced services to its customers. This is achieved by setting up a “backbone” overlay networ...
Shirshanka Das, Alok Nandan, Michael G. Parker, Gi...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
IPTPS
2005
Springer
14 years 1 months ago
Locality Prediction for Oblivious Clients
To improve performance, large-scale Internet systems require clients to access nearby servers. While centralized systems can leverage static topology maps for rough network distan...
Kevin P. Shanahan, Michael J. Freedman
NOSSDAV
2005
Springer
14 years 1 months ago
Peer-to-peer internet telephony using SIP
P2P systems inherently have high scalability, robustness and fault tolerance because there is no centralized server and the network self-organizes itself. This is achieved at the ...
Kundan Singh, Henning Schulzrinne
ASPLOS
2004
ACM
14 years 1 months ago
D-SPTF: decentralized request distribution in brick-based storage systems
Distributed Shortest-Positioning Time First (D-SPTF) is a request distribution protocol for decentralized systems of storage servers. D-SPTF exploits high-speed interconnects to d...
Christopher R. Lumb, Richard A. Golding