Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Randomized algorithms
A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
The degree sequence of a scale-free random graph process
Random Structures & Algorithms
Approximation algorithms
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Using the small-world model to improve freenet performance
ACM SIGCOMM Computer Communication Review
Internet Collapses and Other InfoWorld Punditry
Internet Collapses and Other InfoWorld Punditry
Network topology generators: degree-based vs. structural
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Toward an optimization-driven framework for designing and generating realistic Internet topologies
ACM SIGCOMM Computer Communication Review
Stochastic models for the Web graph
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Short paths in expander graphs
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Random Evolution in Massive Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
On Certain Connectivity Properties of the Internet Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
Graphs and Hypergraphs
Quasi-random graphs with given degree sequences
Random Structures & Algorithms
Scaling properties of the Internet graph
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
On the scaling of congestion in the internet graph
ACM SIGCOMM Computer Communication Review
The internet AS-level topology: three data sources and one definitive metric
ACM SIGCOMM Computer Communication Review
Understanding internet topology: principles, models, and validation
IEEE/ACM Transactions on Networking (TON)
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Comprehensive view of a live network coding P2P system
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Detectives: detecting coalition hit inflation attacks in advertising networks streams
Proceedings of the 16th international conference on World Wide Web
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
IEEE Transactions on Parallel and Distributed Systems
On the hardness of optimization in power-law graphs
Theoretical Computer Science
Link privacy in social networks
Proceedings of the 17th ACM conference on Information and knowledge management
Analyzing and Modeling Router---Level Internet Topology
Information Networking. Towards Ubiquitous Networking and Services
A Dynamic Model for On-Line Social Networks
WAW '09 Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph
Detecting Overlapping Community Structures in Networks
World Wide Web
Liana: a decentralized load-dependent scheduler for performance-cost optimization of grid service
The Journal of Supercomputing
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
How to distribute antidote to control epidemics
Random Structures & Algorithms
Trust overlay networks for global reputation aggregation in P2P grid computing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On the hardness and inapproximability of optimization problems on power law graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Social networks spread rumors in sublogarithmic time
Proceedings of the forty-third annual ACM symposium on Theory of computing
Queuing network of scale free topology: on modelling large scale network
The Journal of Supercomputing
On the NP-Completeness of some graph cluster measures
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Analyzing and modeling router-level internet topology and application to routing control
Computer Communications
Computer Science Review
New techniques for approximating optimal substructure problems in power-law graphs
Theoretical Computer Science
Coalescing random walks and voting on graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Random Structures & Algorithms
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
On the discovery of critical links and nodes for assessing network vulnerability
IEEE/ACM Transactions on Networking (TON)
Approximability of the vertex cover problem in power-law graphs
Theoretical Computer Science
On the approximability of positive influence dominating set in social networks
Journal of Combinatorial Optimization
Hi-index | 0.00 |
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the performance of basic communication tasks that a network is presumed to support? How does performance scale with the size of the network? We study routing in families of sparse random graphs whose degrees follow heavy tailed distributions. Instantiations of such random graphs have been proposed as models for the topology of the Internet at the level of Autonomous Systems as well as at the level of routers. Let n be the number of nodes. Suppose that for each pair of nodes with degrees du and dv we have O(du dv) units of demand. Thus the total demand is O(n2). We argue analytically and experimentally that in the considered random graph model such demand patterns can be routed so that the flow through each link is at most O(n log2 n). This is to be compared with a bound O(n2) that holds for arbitrary graphs. Similar results were previously known for sparse random regular graphs, a.k.a. "expander graphs." The significance is that Internet-like topologies, which grow in a dynamic, decentralized fashion and appear highly inhomogeneous, can support routing with performance characteristics comparable to those of their regular counterparts, at least under the assumption of uniform demand and capacities. Our proof uses approximation algorithms for multicommodity flow and establishes strong bounds of a generalization of "expansion," namely "conductance." Besides routing, our bounds on conductance have further implications, most notably on the gap between first and second eigenvalues of the stochastic normalization of the adjacency matrix of the graph.