Optimal routing in gossip networks

In this paper, we introduce the Gossip Network model where travelers can obtain information about the state of dynamic networks by gossiping with peer travelers using ad hoc communication. Travelers then use the gossip information to recourse their path and find the shortest path to their destination. We study optimal routing in stochastic, time-independent gossip networks, and demonstrate that an optimal routing policy may direct travelers to make detours to gather information. A dynamic programming equation that produces the optimal policy for routing in gossip networks is presented. In general, the dynamic programming algorithm is intractable; however, for two special cases a polynomial optimal solution is presented. We show that ordinarily gossiping helps travelers decrease their expected path cost. However, in some scenarios, depending on the network parameters, gossiping could increase the expected path cost. The parameters that determine the effect of gossiping on the path costs are identified and their influence is analyzed. This dependency is fairly complex and was confirmed numerically on grid networks.

[1]  Hermann Rohling,et al.  A SELF-ORGANIZED RADIO NETWORK FOR AUTOMOTIVE APPLICATIONS , 2001 .

[2]  Deborah Estrin,et al.  Rumor routing algorthim for sensor networks , 2002, WSNA '02.

[3]  Linda Briesemeister,et al.  Group membership and communication in highly mobile ad hoc networks , 2001 .

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  S. Pallottino,et al.  Shortest Path Algorithms in Transportation models: classical and innovative aspects , 1997 .

[6]  Haris N. Koutsopoulos,et al.  Simulation Laboratory for Evaluating Dynamic Traffic Management Systems , 1997 .

[7]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[8]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[9]  J. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996 .

[10]  Michel Bierlaire,et al.  DynaMIT: a simulation-based system for traffic prediction and guidance generation , 1998 .

[11]  Peter Wagner,et al.  A TRAFFIC INFORMATION SYSTEM BY MEANS OF REAL-TIME FLOATING-CAR DATA , 2002 .

[12]  E. Todeva.  Networks , 2007 .

[13]  Wendi B. Heinzelman,et al.  Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks , 2002, Wirel. Networks.

[14]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[15]  John N. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996, Networks.

[16]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[17]  Giovanni Andreatta,et al.  Stochastic shortest paths with recourse , 1988, Networks.

[18]  S. Travis Waller,et al.  On the online shortest path problem with limited arc cost dependencies , 2002, Networks.

[19]  Ariel Orda,et al.  Minimum delay routing in stochastic networks , 1993, TNET.

[20]  Richard Bellman,et al.  Adaptive Control Processes: A Guided Tour , 1961, The Mathematical Gazette.

[21]  Robert Tappan Morris,et al.  CarNet: a scalable ad hoc wireless network system , 2000, ACM SIGOPS European Workshop.