Sciweavers

96 search results - page 6 / 20
» On the scaling of congestion in the internet graph
Sort
View
MICS
2010
134views more  MICS 2010»
13 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
SIGMETRICS
2010
ACM
139views Hardware» more  SIGMETRICS 2010»
14 years 9 days ago
On the flow-level dynamics of a packet-switched network
: The packet is the fundamental unit of transportation in modern communication networks such as the Internet. Physical layer scheduling decisions are made at the level of packets, ...
Ciamac Cyrus Moallemi, Devavrat Shah
INFOCOM
2005
IEEE
14 years 1 months ago
TCP-Africa: an adaptive and fair rapid increase rule for scalable TCP
— High capacity data transfers over the Internet routinely fail to meet end-to-end performance expectations. The default transport control protocol for best effort data traffic ...
R. King, Richard G. Baraniuk, Rudolf H. Riedi
OPODIS
2004
13 years 8 months ago
Comparison of Failures and Attacks on Random and Scale-Free Networks
Abstract. It appeared recently that some statistical properties of complex networks like the Internet, the World Wide Web or Peer-to-Peer systems have an important influence on the...
Jean-Loup Guillaume, Matthieu Latapy, Cléme...
WWW
2005
ACM
14 years 8 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras