%0 Book Section %1 statphys23_1115 %A Kim, K.H. %A Kahng, B. %A Kim, D. %B Abstract Book of the XXIII IUPAP International Conference on Statistical Physics %C Genova, Italy %D 2007 %E Pietronero, Luciano %E Loreto, Vittorio %E Zapperi, Stefano %K jamming mean priority rate statphys23 success time topic-11 transition travel %T Packet transport in the Internet with priority-based protocol %U http://st23.statphys23.org/webservices/abstract/preview_pop.php?ID_PAPER=1115 %X We study a packet transport on a scale-free network in which packets are composed of two types, being assigned priority or not. The priority-assigned packets are treated firstly in each queue compared with priority-not-assigned packets, and its fraction $q$ is controlled. We find that when the number of generated packets $n$ is small, the mean travel time between every pair of nodes is not affected by whether packets are assigned the priority or not. However, it is significantly different when $n$ is large beyond the jamming transition point. The mean travel time is reduced drastically for packets with priority, however, it remains unchanged for those without priority. We find that there exists a critical value $q_c$, under which priority-assigned packets do not experience jammed. Hence the new protocol based on the priority enhances the capability of packet transport in the Internet and could be applied to commercial download services or paid mail delivery system and so on.

@incollection{statphys23_1115, abstract = {We study a packet transport on a scale-free network in which packets are composed of two types, being assigned priority or not. The priority-assigned packets are treated firstly in each queue compared with priority-not-assigned packets, and its fraction $q$ is controlled. We find that when the number of generated packets $n$ is small, the mean travel time between every pair of nodes is not affected by whether packets are assigned the priority or not. However, it is significantly different when $n$ is large beyond the jamming transition point. The mean travel time is reduced drastically for packets with priority, however, it remains unchanged for those without priority. We find that there exists a critical value $q_c$, under which priority-assigned packets do not experience jammed. Hence the new protocol based on the priority enhances the capability of packet transport in the Internet and could be applied to commercial download services or paid mail delivery system and so on.}, added-at = {2007-06-20T10:16:09.000+0200}, address = {Genova, Italy}, author = {Kim, K.H. and Kahng, B. and Kim, D.}, biburl = {https://www.bibsonomy.org/bibtex/2b8cc22b1d9f8a39d3048e7462e502a47/statphys23}, booktitle = {Abstract Book of the XXIII IUPAP International Conference on Statistical Physics}, editor = {Pietronero, Luciano and Loreto, Vittorio and Zapperi, Stefano}, interhash = {5426295e0dce69c75f84e28373292d69}, intrahash = {b8cc22b1d9f8a39d3048e7462e502a47}, keywords = {jamming mean priority rate statphys23 success time topic-11 transition travel}, month = {9-13 July}, timestamp = {2007-06-20T10:16:39.000+0200}, title = {Packet transport in the Internet with priority-based protocol}, url = {http://st23.statphys23.org/webservices/abstract/preview_pop.php?ID_PAPER=1115}, year = 2007 }