Sciweavers

468 search results - page 52 / 94
» Distributed Worm Simulation with a Realistic Internet Model
Sort
View
WSC
2008
15 years 4 months ago
Measuring the effectiveness of the s-metric to produce better network models
Recent research has shown that while many complex networks follow a power-law distribution for their node degrees, it is not sufficient to model these networks based only on their...
Isabel Beichl, Brian Cloteaux
122
Voted
WWW
2005
ACM
16 years 3 months ago
Application networking on peer-to-peer networks
This paper proposes the AN.P2P architecture to facilitate efficient peer-to-peer content delivery with heterogeneous presentation requirements. In general, the AN.P2P enables a pe...
Mu Su, Chi-Hung Chi
SIGMETRICS
2008
ACM
124views Hardware» more  SIGMETRICS 2008»
15 years 2 months ago
Class-of-service in ip backbones: informing the network neutrality debate
The benefit of Class-of-Service (CoS) is an important topic in the "Network Neutrality" debate. Proponents of network neutrality suggest that over-provisioning is a viab...
Murat Yuksel, Kadangode K. Ramakrishnan, Shivkumar...
119
Voted
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 2 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
IPPS
2003
IEEE
15 years 7 months ago
UMR: A Multi-Round Algorithm for Scheduling Divisible Workloads
In this paper we present an algorithm for scheduling parallel applications that consist of a divisible workload. Our algorithm uses multiple rounds to overlap communication and co...
Yang Yang, Henri Casanova