Routing design for transmission capacity maximization in complex networks

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)

1 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1482-1485
Volume2015-July
ISBN (Print)9781479983919
Publication statusPublished - 27 Jul 2015

Publication series

Name
Volume2015-July
ISSN (Print)0271-4310

Conference

Title2015 IEEE International Symposium on Circuits and Systems (ISCAS 2015)
LocationCultural Centre of Belém
PlacePortugal
CityLisbon
Period24 - 27 May 2015

Abstract

Many artificial networks in the real world have the power-law degree distribution. This feature causes a lot of difficulties in network design, such as robustness, reliability and other performance issues. In this paper, the congestion problem in power-law communication networks is focused. Since nodes with very large degree usually become the bottleneck in this kind of networks when shortest path routing is adopted, a new design of routing is proposed. A hybrid approach, that combines a genetic algorithm and a greedy approach, is designed to find the routing paths of the source-destination pairs. As shown by theoretical and simulation results, the transmission capacity can be improved with the new design which outperforms other existing routing schemes. It should also be emphasized that, though only scale-free network is discussed, the proposed approach is general and useful for other network types.

Citation Format(s)

Routing design for transmission capacity maximization in complex networks. / Yang, Cuili; Fan, Zhongyan; Tang, Wallace K.S.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 2015-July Institute of Electrical and Electronics Engineers Inc., 2015. p. 1482-1485 7168925.

Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45)32_Refereed conference paper (with ISBN/ISSN)