Sciweavers

3116 search results - page 432 / 624
» Design and implementation of network puzzles
Sort
View
TVCG
2011
120views more  TVCG 2011»
15 years 1 months ago
Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming
—Metro maps are schematic diagrams of public transport networks that serve as visual aids for route planning and navigation tasks. It is a challenging problem in network visualiz...
Martin Nöllenburg, Alexander Wolff
USENIX
2001
15 years 7 months ago
A Waypoint Service Approach to Connect Heterogeneous Internet Address Spaces
The rapid growth of the Internet has made IP addresses a scarce resource. To get around this problem, today and in the foreseeable future, networks will be deployed with reusable-...
T. S. Eugene Ng, Ion Stoica, Hui Zhang
CONEXT
2009
ACM
15 years 7 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 11 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
SPAA
2003
ACM
15 years 11 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder