title: Pheromone routing protocol on a scale-free network.
abstract: This paper proposes a routing strategy for network systems based on the local information of "pheromone." The overall traffic capacity of a network system can be evaluated by the critical packet generating rate R(c). Under this critical generating rate, the total packet number in the system first increases and then decreases to reach a balance state. The system behaves differently from that with a local routing strategy based on the node degree or shortest path routing strategy. Moreover, the pheromone routing strategy performs much better than the local routing strategy, which is demonstrated by a larger value of the critical generating rate. This protocol can be an alternation for superlarge networks, in which the global topology may not be available.
authors.affiliation: School of Engineering Science, University of Science and Technology of China, Hefei, People's Republic of China.
authors.forename: Xiang
authors.initials: X
authors.lastname: Ling
authors.forename: Mao-Bin
authors.initials: MB
authors.lastname: Hu
authors.forename: Rui
authors.initials: R
authors.lastname: Jiang
authors.forename: Ruili
authors.initials: R
authors.lastname: Wang
authors.forename: Xian-Bin
authors.initials: XB
authors.lastname: Cao
authors.forename: Qing-Song
authors.initials: QS
authors.lastname: Wu
mesh_terms: D000465:Algorithms; D001703:Biophysics / Q000379:methods*; D002947:Cities; D003195:Computer Communication Networks; D003198:Computer Simulation; D003201:Computers; D020407:Internet; D015233:Models, Statistical; D010675:Pheromones / Q000737:chemistry*; D013997:Time Factors; D014186:Transportation
chemical_list: D010675:Pheromones