Optimal networks, congestion and Braess' paradox

Authors:
Raúl J. Mondragón C
Affiliations:
University of London, London, U.K.
Venue:
Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Year:
2006

Citing 6
Cited 0

Introduction to graph theory

Introduction to graph theory
Routing and wavelength assignment in all-optical networks

IEEE/ACM Transactions on Networking (TON)
Performance of data networks with random links

Mathematics and Computers in Simulation
Packet delay in models of data networks

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Network robustness and graph topology

ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Networks that are efficient and robust to failures tend to have either star-like or homogeneous structures in their connectivity. The choice of optimal structure depends on the network's load. The results presented in this paper are: (a) For source-routing networks the change from one structure to another is smooth and does not depends on network congestion. (b) The addition of extra links to the optimal network reduces its overall performance. This performance deterioration is small if the network structure has a narrow degree distribution centred around the mean. (c) If the network has a subset of nodes, which are more efficient in the delivery of traffic, the optimal network has a tier structure.