Performance of data networks with random links

Abstract

We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these net works. In general, the impact of additional random links on the performance of the network strongly depends on the routing algorithm used in the network. Significant performance gains can be achieved if the routing is based on "geometrical distance" or shortest path reduced table routing. With shortest path full table routing degradation of performance is observed.

20 pages, 10 figures

References in corpus (1)

• Hot and repulsive traffic flow

Cited by in corpus (13)

• Communication Bottlenecks in Scale-Free Networks
• An adaptive routing strategy for packet delivery in complex networks
• Congestion and decongestion in a communication network
• An efficient approach of controlling traffic congestion in scale-free networks
• Nature-Inspired Interconnects for Self-Assembled Large-Scale Network-on-Chip Designs
• The Dynamics of Internet Traffic: Self-Similarity, Self-Organization, and Complex Phenomena
• Network traffic behaviour near phase transition point
• Impact of network structure on the capacity of wireless multihop ad hoc communication
• Packet delay in models of data networks
• Cross-over behaviour in a communication network
• The Gradient Mechanism in a Communication Network
• Queue-length synchronization in a communication networks
• A Mean-Field Theory of Cellular Automata Model for Distributed Packet Networks