Sciweavers

945 search results - page 103 / 189
» On Equivalence Between Network Topologies
Sort
View
WWW
2005
ACM
14 years 8 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
IPPS
2008
IEEE
14 years 2 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
INFOCOM
2002
IEEE
14 years 20 days ago
Gossip-based ad hoc routing
— Many ad hoc routing protocols are based on (some variant of) flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossipin...
Zygmunt J. Haas, Joseph Y. Halpern, Erran L. Li
CONEXT
2005
ACM
13 years 9 months ago
TIE breaking: tunable interdomain egress selection
— The separation of intradomain and interdomain routing has been a key feature of the Internet’s routing architecture from the early days of the ARPAnet. However, the appropria...
Renata Teixeira, Timothy G. Griffin, Mauricio G. C...
CCA
2009
Springer
14 years 2 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi