Sciweavers

867 search results - page 111 / 174
» Network Robustness and Graph Topology
Sort
View
ICHIT
2009
Springer
15 years 8 months ago
An efficient algorithm for AS path inferring
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
Guoqiang Yang, Wenhua Dou
WASA
2009
Springer
103views Algorithms» more  WASA 2009»
15 years 6 months ago
Void Avoidance in Three-Dimensional Mobile Underwater Sensor Networks
Mobile underwater sensor networks are usually featured with three-dimensional topology, high node mobility and long propagation delays. For such networks, geographic routing has be...
Peng Xie, Zhong Zhou, Zheng Peng, Jun-Hong Cui, Zh...
AVI
2006
15 years 2 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
TCC
2009
Springer
132views Cryptology» more  TCC 2009»
16 years 2 months ago
Authenticated Adversarial Routing
: The aim of this paper is to demonstrate the feasibility of authenticated throughput-ecient routing in an unreliable and dynamically changing synchronous network in which the majo...
Yair Amir, Paul Bunn, Rafail Ostrovsky
WWW
2005
ACM
16 years 2 months ago
On the lack of typical behavior in the global Web traffic network
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 clientserver ...
Mark Meiss, Filippo Menczer, Alessandro Vespignani