Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
975883 | Physica A: Statistical Mechanics and its Applications | 2013 | 8 Pages |
Abstract
With rapid economic and social development, the problem of traffic congestion is getting more and more serious. Accordingly, network traffic models have attracted extensive attention. In this paper, we introduce a shortest-remaining-path-first queuing strategy into a network traffic model on Barabási–Albert scale-free networks under efficient routing protocol, where one packet’s delivery priority is related to its current distance to the destination. Compared with the traditional first-in-first-out queuing strategy, although the network capacity has no evident changes, some other indexes reflecting transportation efficiency are significantly improved in the congestion state. Extensive simulation results and discussions are carried out to explain the phenomena. Our work may be helpful for the designing of optimal networked-traffic systems.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematical Physics
Authors
Wen-Bo Du, Zhi-Xi Wu, Kai-Quan Cai,