Efficient routing on small complex networks without buffers

J. Smiljanić and I. Stanković

Physica A: Statistical Mechanics and its Applications, 2013, vol. 392, issue 9, 2294-2301

Abstract: In this paper, we are exploring strategies for the reduction of the congestion in the complex networks. The nodes without buffers are considered, so, if the congestion occurs, the information packets will be dropped. The focus is on the efficient routing. The routing strategies are compared using two generic models, i.e., Barabàsi–Albert scale-free network and scale-free network on lattice, and the academic router networks of the Netherlands and France. We propose a dynamic deflection routing algorithm which automatically extends path of the packet before it arrives at congested node. The simulation results indicate that the dynamic routing strategy can further reduce the number of dropped packets in a combination with the efficient path routing proposed by Yan et al. [5].

Keywords: Scale-free networks; Routing; Network capacity (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037843711300068X
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:392:y:2013:i:9:p:2294-2301

DOI: 10.1016/j.physa.2013.01.033

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().