Traffic dynamics in scale-free networks with limited packet-delivering capacity
نویسندگان
چکیده
منابع مشابه
Traffic dynamics in scale-free networks with limited packet-delivering capacity
We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node’s packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node i is proportional to k i , where ki is the degree of node i and φ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the...
متن کاملThe Effects of Link and Node Capacity on Traffic Dynamics in Weighted Scale-Free Networks
The effect of link and node capacity on traffic dynamics are investigated in weighted scale-free networks by adopting a traffic routing model with local node strength information: Pl→i = S i ∑
متن کاملPacket Transport on Scale-Free Networks
We introduce a model of information packet transport on networks in which the packets are posted by a given rate and move in parallel according to a local search algorithm. By performing a number of simulations we investigate the major kinetic properties of the transport as a function of the network geometry, the packet input rate and the buffer size. We find long-range correlations in the powe...
متن کاملCooperation in scale-free networks with limited associative capacities.
In this work we study the effect of limiting the number of interactions (the associative capacity) that a node can establish per round of a prisoner's dilemma game. We focus on the way this limitation influences the level of cooperation sustained by scale-free networks. We show that when the game includes cooperation costs, limiting the associative capacity of nodes to a fixed quantity renders ...
متن کاملEfficient routing strategies in scale-free networks with limited bandwidth
We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we argue that if we drop this rule, the overall throughput of the network can be remarkably enhanced. We propose some efficient routing strategies that do not st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2008
ISSN: 0378-4371
DOI: 10.1016/j.physa.2008.09.016