2497 search results - page 108 / 500 » Requirements for models of achievable routing |
113
click to vote
OPODIS
2008
15 years 3 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
133
click to vote
TIT
2010
14 years 8 months ago
2010
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
106
Voted
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
117
click to vote
WSC
2004
15 years 3 months ago
2004
As the Internet grows, traffic engineering has become a widely-used technique to control the flow of packets. For the inter-domain routing, traffic engineering relies on configura...
100
Voted
PET
2005
Springer
15 years 7 months ago
2005
Springer
We review threat models used in the evaluation of anonymity systems’ vulnerability to traffic analysis. We then suggest that, under the partial adversary model, if multiple packe...