Effective use of congestion in complex networks

Juan Echagüe, Vicent Cholvi, Dariusz R. Kowalski

Research output: Contribution to journalArticle

3 Scopus citations

Abstract

In this paper, we introduce a congestion-aware routing protocol that selects the paths according to the congestion of nodes in the network. The aim is twofold: on one hand, and in order to prevent the networks from collapsing, it provides a good tolerance to nodes’ overloads; on the other hand, and in order to guarantee efficient communication, it also incentivize the routes to follow short paths. We analyze the performance of our proposed routing strategy by means of a series of experiments carried out by using simulations. We show that it provides a tolerance to collapse close to the optimal value. Furthermore, the average length of the paths behaves optimally up to the certain value of packet generation rate ρ and it grows in a linear fashion with the increase of ρ.

Original languageEnglish (US)
Pages (from-to)574-580
Number of pages7
JournalPhysica A: Statistical Mechanics and its Applications
Volume494
DOIs
StatePublished - Mar 15 2018
Externally publishedYes

Keywords

  • Complex networks
  • Congestion control
  • Routing strategies

ASJC Scopus subject areas

  • Statistics and Probability
  • Condensed Matter Physics

Fingerprint Dive into the research topics of 'Effective use of congestion in complex networks'. Together they form a unique fingerprint.

  • Cite this