ACM Home Page
Please provide us with feedback. Feedback
On the lack of typical behavior in the global Web traffic network
Full text PdfPdf (4.69 MB)
Source International World Wide Web Conference archive
Proceedings of the 14th international conference on World Wide Web table of contents
Chiba, Japan
SESSION: Measurements and analysis table of contents
Pages: 510 - 518  
Year of Publication: 2005
ISBN:1-59593-046-9
Authors
Mark Meiss  Indiana University, Bloomington, IN
Filippo Menczer  Indiana University, Bloomington, IN
Alessandro Vespignani  Indiana University, Bloomington, IN
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 36,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1060745.1060820
What is a DOI?

ABSTRACT

We offer the first large-scale analysis of Web traffic based on network flow data. Using data collected on the Internet2 network, we constructed a weighted bipartite client-server host graph containing more than 18 x 106 vertices and 68 x 106 edges valued by relative traffic flows. When considered as a traffic map of the World-Wide Web, the generated graph provides valuable information on the statistical patterns that characterize the global information flow on the Web. Statistical analysis shows that client-server connections and traffic flows exhibit heavy-tailed probability distributions lacking any typical scale. In particular, the absence of an intrinsic average in some of the distributions implies the absence of a prototypical scale appropriate for server design, Web-centric network design, or traffic modeling. The inspection of the amount of traffic handled by clients and servers and their number of connections highlights non-trivial correlations between information flow and patterns of connectivity as well as the presence of anomalous statistical patterns related to the behavior of users on the Web. The results presented here may impact considerably the modeling, scalability analysis, and behavioral study of Web applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47--97, 2002.
 
3
R. Albert, H. Jeong, and A.-L. Barabási. Diameter of the World-Wide Web. Nature, 401:130--131, 1999.
 
4
L. Amaral, A. Scala, M. Barthélemy, and H. Stanley. Classes of small-world networks. Proc. Natl. Acad. Sci. USA, 97:11149, 2000.
 
5
A. Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani. The architecture of complex weighted networks. Proc. Natl. Acad. Sci. USA, 101:3747, 2004.
 
6
 
7
 
8
G. Chartrand and L. Lesniak. Graphs and Digraphs. Chapman & Hall/CRC, 1996.
 
9
S. Dorogovtsev and J. Mendes. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press, Oxford, UK, 2003.
10
 
11
B. Huberman. The Laws of the Web. MIT Press, 2001.
 
12
B. Huberman and R. Lukose. Social dilemmas and internet congestion. Science, 277:535, 1997.
 
13
B. Huberman, P. Pirolli, J. Pitkow, and R. Lukose. Strong regularities in World Wide Web surfing. Science, 280(5360):95--97, 1998.
 
14
 
15
L. Laura, S. Leonardi, S. Millozzi, U. Meyer, and J. Sibeyn. Algorithms and experiments for the Webgraph. In Proc. European Symposium on Algorithms, 2003.
 
16
M. Newman. Analysis of weighted networks. Technical report, http://arxiv.org/abs/cond-mat/0407503, 2004.
 
17
 
18
S. Shalunov and B. Teitelbaum. Internet2 TCP use and performance. Technical report, Internet2 Technical Report, 2001.


Collaborative Colleagues:
Mark Meiss: colleagues
Filippo Menczer: colleagues
Alessandro Vespignani: colleagues