Sciweavers

2262 search results - page 452 / 453
» Points with large quadrant-depth
Sort
View
WWW
2007
ACM
15 years 10 months ago
Is high-quality vod feasible using P2P swarming?
Peer-to-peer technologies are increasingly becoming the medium of choice for delivering media content, both professional and homegrown, to large user populations. Indeed, current ...
Siddhartha Annapureddy, Saikat Guha, Christos Gkan...
OSDI
2004
ACM
15 years 9 months ago
Improving the Reliability of Internet Paths with One-hop Source Routing
Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and pathmonitoring schemes, tr...
P. Krishna Gummadi, Harsha V. Madhyastha, Steven D...
GI
2004
Springer
15 years 2 months ago
Distributed Job Scheduling in a Peer-to-Peer Video Recording System
: Since the advent of Gnutella, Peer-to-Peer (P2P) protocols have matured towards a fundamental design element for large-scale, self-organising distributed systems. Many research e...
Curt Cramer, Kendy Kutzner, Thomas Fuhrmann
WSC
1997
14 years 10 months ago
A Framework for the Simulation Experimentation Process
Modeling and simulation of very large systems introduces a number of issues that are not seen in the modeling of simpler systems. These arise because the resource requirements for...
Thomas C. Fall
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Dial a Ride from k-forest
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath ...