Sciweavers

292 search results - page 14 / 59
» Scaling properties of the Internet graph
Sort
View
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 7 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
TON
2010
141views more  TON 2010»
13 years 6 months ago
Weighted spectral distribution for internet topology analysis: theory and applications
Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...
WWW
2007
ACM
14 years 8 months ago
Random web crawls
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
Toufik Bennouas, Fabien de Montgolfier
HT
2009
ACM
14 years 2 months ago
The scalable hyperlink store
This paper describes the Scalable Hyperlink Store, a distributed in-memory “database” for storing large portions of the web graph. SHS is an enabler for research on structural...
Marc Najork
FMCO
2007
Springer
129views Formal Methods» more  FMCO 2007»
14 years 1 months ago
Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project
As Internet applications become larger and more complex, the task of managing them becomes overwhelming. “Abnormal” events such as software updates, failures, attacks, and hots...
Peter Van Roy, Seif Haridi, Alexander Reinefeld, J...