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

Simple item page
dc.creatorLiua, Zonghua
dc.creatorMa, Weichuan
dc.creatorZhang, Huan
dc.creatorSun, Yin
dc.creatorHui, P. M.
dc.date2008-06-11
dc.date.accessioned2026-07-07T09:43:58Z
dc.date.available2026-07-07T09:43:58Z
dc.descriptionWe 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.
dc.description7 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/0806.1845
dc.identifierhttp://arxiv.org/abs/0806.1845
dc.identifierdoi:10.1016/j.physa.2006.02.021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162705
dc.subjectNetworking and Internet Architecture
dc.titleAn efficient approach of controlling traffic congestion in scale-free networks
dc.typetext

Files

Collections

arXiv