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 [Formula: see text] 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 [Formula: see text]. For the EP scheme, the network capacity stops increasing for relatively small packet delivering capability limit [Formula: see text] 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 [Formula: see text].
Maximization of Service Flows Rates as a Solution of Network Capacity Allocation Problem
