EKAW
2010
Springer
13 years 11 months ago
2010
Springer
The World Wide Web has evolved into a distributed network of web applications facilitating the publication of information on a large scale. Judging whether such information can be ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
JOIN
2007
14 years 19 days ago
2007
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
DC
2010
14 years 24 days ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
ICPADS
2005
IEEE
14 years 6 months ago
2005
IEEE
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that fro...
INFOCOM
2006
IEEE
14 years 6 months ago
2006
IEEE
— Detecting coordinated attacks on Internet resources requires a distributed network monitoring infrastructure. Such an infrastructure will have two logically distinct elements: ...
DASFAA
2006
IEEE
14 years 6 months ago
2006
IEEE
Abstract. As networks continue to grow in size and complexity, distributed network monitoring and resource querying are becoming increasingly difficult. Our aim is to design, build...