Abstract
When transporting data packets on communication networks, the local routing protocols are often preferred because of the large-scale and complicated property of many realistic network structures such as Internet. Based on a local routing protocol with a navigation parameter proposed in a previous paper [W. X. Wang et al., Phys. Rev. E73, 026111 (2006)], this paper numerically investigates the distribution of travel time for transporting data packets from the origin to the destination in complex networks, including random networks, small-world networks and scale-free networks. Numerical results show that exponential distributions of travel time with various values of exponent in complex networks are obtained. Furthermore, the different values of the exponent can also intuitively prove the previous result for the optimal local routing strategy. Finally, violations of the First-Departure-First-Arrival situation in complex networks are discussed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
