DocumentCode
653257
Title
A Global Dynamic Queuing Strategy on Scale-Free Networks
Author
Pengcheng Xu ; Chen Hong
Author_Institution
Sch. of Electron. & Inf. Eng., Beihang Univ., Beijing, China
fYear
2013
fDate
20-23 Aug. 2013
Firstpage
856
Lastpage
859
Abstract
In this paper, a global dynamic queuing strategy is proposed to enhance the transportation efficiency on scale-free networks. We introduce a priority parameter in our queuing strategy. The packets waiting in the queue buffer are delivered according to the priority parameter combined with shortest-path-length-remained and global dynamic traffic information. Comparing the results with the traditional first-in-first-out (FIFO) queuing strategy, we found that the average traveling time can be shortened sharply, and the packet arrived rate is enhanced remarkably. Extensive simulations and discussions are carried out to prove the efficiency of our strategy.
Keywords
complex networks; graph theory; queueing theory; transportation; FIFO queuing strategy; first-in-first-out queuing strategy; global dynamic queuing strategy; global dynamic traffic information; packet arrived rate; priority parameter; queue buffer; scale-free networks; shortest-path-length-remained information; transportation efficiency; Barium; Complex networks; Educational institutions; Routing; Simulation; Telecommunication traffic; Transportation; global dynamic queuing strategy; scale-free networks; shortest path routing; traffic congestion;
fLanguage
English
Publisher
ieee
Conference_Titel
Green Computing and Communications (GreenCom), 2013 IEEE and Internet of Things (iThings/CPSCom), IEEE International Conference on and IEEE Cyber, Physical and Social Computing
Conference_Location
Beijing
Type
conf
DOI
10.1109/GreenCom-iThings-CPSCom.2013.150
Filename
6682164
Link To Document