Limited static and dynamic delivering capacity allocations in scale-free networks

N. Ben Haddou, H. Ez-Zahraouy () and A. Rachadi ()
Additional contact information
N. Ben Haddou: Laboratoire de Matière Condensée et Sciences Interdisciplinaires (LaMCScI), Faculty of Science, Mohammed V University, B. P. 1014, Rabat, Morocco
H. Ez-Zahraouy: Laboratoire de Matière Condensée et Sciences Interdisciplinaires (LaMCScI), Faculty of Science, Mohammed V University, B. P. 1014, Rabat, Morocco
A. Rachadi: Laboratoire de Matière Condensée et Sciences Interdisciplinaires (LaMCScI), Faculty of Science, Mohammed V University, B. P. 1014, Rabat, Morocco

International Journal of Modern Physics C (IJMPC), 2017, vol. 28, issue 11, 1-10

Abstract: In traffic networks, it is quite important to assign proper packet delivering capacities to the routers with minimum cost. In this respect, many allocation models based on static and dynamic properties have been proposed. In this paper, we are interested in the impact of limiting the packet delivering capacities already allocated to the routers; each node is assigned a packet delivering capacity limited by the maximal capacity Cmax of the routers. To study the limitation effect, we use two basic delivering capacity allocation models; static delivering capacity allocation (SDCA) and dynamic delivering capacity allocation (DDCA). In the SDCA, the capacity allocated is proportional to the node degree, and for DDCA, it is proportional to its queue length. We have studied and compared the limitation of both allocation models under the shortest path (SP) routing strategy as well as the efficient path (EP) routing protocol. In the SP case, we noted a similarity in the results; the network capacity increases with increasing Cmax. For the EP scheme, the network capacity stops increasing for relatively small packet delivering capability limit Cmax for both allocation strategies. However, it reaches high values under the limited DDCA before the saturation. We also find that in the DDCA case, the network capacity remains constant when the traffic information available to each router was updated after long period times τ.

Keywords: Maximal delivering capacity; efficient path routing; shortest path routing; scale-free network (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183117501406
Access to full text is restricted to subscribers

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:wsi:ijmpcx:v:28:y:2017:i:11:n:s0129183117501406

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183117501406

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().