Sciweavers

11242 search results - page 2128 / 2249
» Designing a Super-Peer Network
Sort
View
186
Voted
ICS
2005
Tsinghua U.
15 years 10 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
IMC
2004
ACM
15 years 10 months ago
Characterizing the query behavior in peer-to-peer file sharing systems
This paper characterizes the query behavior of peers in a peer-topeer (P2P) file sharing system. In contrast to previous work, which provides various aggregate workload statistics...
Alexander Klemm, Christoph Lindemann, Mary K. Vern...
SIGCOMM
2004
ACM
15 years 10 months ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown
SIGCOMM
2004
ACM
15 years 10 months ago
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. ...
SPAA
2004
ACM
15 years 10 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
« Prev « First page 2128 / 2249 Last » Next »