An efficient approach of controlling traffic congestion in scale-free networks

Abstract

We propose and study a model of traffic in communication networks. The underlying network has a structure that is tunable between a scale-free growing network with preferential attachments and a random growing network. To model realistic situations where different nodes in a network may have different capabilities, the message or packet creation and delivering rates at a node are assumed to depend on the degree of the node. Noting that congestions are more likely to take place at the nodes with high degrees in networks with scale-free character, an efficient approach of selectively enhancing the message-processing capability of a small fraction (e.g. 3%) of the nodes is shown to perform just as good as enhancing the capability of all nodes. The interplay between the creation rate and the delivering rate in determining non-congested or congested traffic in a network is studied more numerically and analytically.

arXiv comment7 pages, 5 figures

References in corpus (20)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• Lethality and centrality in protein networks
• The diameter of the world wide web
• Mean-field theory for scale-free random networks
• Dynamical and correlation properties of the Internet
• The Web of Human Sexual Contacts
• Scale-free topology of e-mail networks
• Cascade control and defense in complex networks
• Large-scale topological and dynamical properties of Internet
• Optimal network topologies for local search with congestion
• Communication in networks with hierarchical branching
• Improved routing strategies for Internet traffic delivery
• Critical load and congestion instabilities in scale-free networks
• Dynamical properties of model communication networks
• Performance of data networks with random links
• Human Sexual Contact Network as a Bipartite Graph
• Communication and optimal hierarchical networks
• Search and Congestion in Complex Networks
• Robustness of the in-degree exponent for the world-wide web

Cited by in corpus (9)

• Critical phenomena in complex networks
• An adaptive routing strategy for packet delivery in complex networks
• Efficient routing strategies in scale-free networks with limited bandwidth
• Traffic dynamics in scale-free networks with limited packet-delivering capacity
• Percolation on feature-enriched interconnected systems
• Scaling behavior of an artificial traffic model on scale-free networks
• The Gradient Mechanism in a Communication Network
• Preferential Detachment in Broadcast Signaling Networks: Connectivity and Cost Trade-off
• Traffic properties for stochastic routings on scale-free networks