Sciweavers

1078 search results - page 12 / 216
» Networks with Small Stretch Number
Sort
View
CCR
2002
133views more  CCR 2002»
13 years 9 months ago
Crossover scaling effects in aggregated TCP traffic with congestion losses
We critically examine the claims that TCP congestion control contributes to the observed self-similar traffic rate correlations. A simulation model is designed to analyze aggregat...
Michael Liljenstam, Andrew T. Ogielski
WWW
2006
ACM
14 years 10 months ago
Efficient search for peer-to-peer information retrieval using semantic small world
This paper proposes a semantic overlay based on the small world phenomenon that facilitates efficient search for information retrieval in unstructured P2P systems. In the semantic...
Hai Jin, Xiaomin Ning, Hanhua Chen
INFOCOM
2009
IEEE
14 years 4 months ago
Fit a Spread Estimator in Small Memory
—The spread of a source host is the number of distinct destinations that it has sent packets to during a measurement period. A spread estimator is a software/hardware module on a...
MyungKeun Yoon, Tao Li, Shigang Chen, Jih-Kwon Pei...
INFOCOM
2006
IEEE
14 years 3 months ago
Routers with Very Small Buffers
Abstract— Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory ...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
WG
2010
Springer
13 years 8 months ago
Graphs with Large Obstacle Numbers
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
Padmini Mukkamala, János Pach, Deniz Sari&o...