Conservation of alternative paths as a method to simplify large networks

Authors:
Ling Liu;Raúl J. Mondragón
Affiliations:
Queen Mary University of London, London, UK;Queen Mary University of London, London, UK
Venue:
Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners
Year:
2009

Citing 2
Cited 0

Why we don't know how to simulate the Internet

Proceedings of the 29th conference on Winter simulation
Enabling Large-Scale Simulation: Selective Abstraction Approach to the Study of Multicast Protocol

MASCOTS '98 Proceedings of the 6th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

We introduce an algorithm to reduce the size of a network conserving the number of alternative paths. The algorithm is based on node contraction and it can take into consideration properties like direction, capacity or flow that goes through the network's link. The algorithm is applied to the Internet network to detect bottlenecks in the number of alternative paths in parts of the network.