Sciweavers

295 search results - page 40 / 59
» Large scale content distribution protocols
Sort
View
ICNP
2005
IEEE
14 years 1 months ago
Intersection Characteristics of End-to-End Internet Paths and Trees
This paper focuses on understanding the scale and the distribution of “state overhead” (briefly load) that is incurred on the routers by various value-added network services,...
Sevcan Bilir, Kamil Saraç, Turgay Korkmaz
INFOCOM
1999
IEEE
13 years 11 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
GRID
2006
Springer
13 years 7 months ago
YA: Fast and Scalable Discovery of Idle CPUs in a P2P network
Discovery of large amounts of idle CPUs in fully distributed and shared Grid systems is needed in relevant applications and is still a challenging problem. In this paper we present...
Javier Celaya, Unai Arronategui
ICDCS
2000
IEEE
13 years 12 months ago
Highly Concurrent Shared Storage
1 Switched system-area networks enable thousands of storage devices to be shared and directly accessed by end hosts, promising databases and filesystems highly scalable, reliable ...
Khalil Amiri, Garth A. Gibson, Richard A. Golding
DBISP2P
2006
Springer
195views Database» more  DBISP2P 2006»
13 years 11 months ago
XML Query Routing in Structured P2P Systems
Abstract. This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. Our archit...
Leonidas Fegaras, Weimin He, Gautam Das, David Lev...