Philippe Nain
ABSTRACT
We consider the problem of estimating the end-to-end latency of intermittently connected paths in disruption/delay tolerant networks. This is useful when performing source routing, in which a complete path is chosen for a packet to travel from source to destination (when intermediate nodes are really low complexity devices that can only forward packets but cannot perform route computations), or in linear network topologies. While computing the time to traverse such a path may be straightforward in fixed, static networks, doing so becomes much more challenging in dynamic networks, in which the state of an edge in one timeslot (i.e., its presence or absence) is random, and may depend on its state in the previous timeslot. The traversal time is due to both time spent waiting for edges to appear and time spent crossing them once they become available. We compute the expected traversal time (ETT) for a dynamic path in a number of special cases of stochastic edge dynamics models, and for three different edge failure models, culminating in a surprisingly nontrivial yet realistic ``hybrid network" setting in which the initial configuration of edge states for the entire path is known. We show that the ETT for this "initial configuration" setting can be computed in quadratic time (as a function of path length), by an algorithm based on probability generating functions. We also give several linear-time upper and lower bounds on the ETT, which we evaluate, along with our ETT algorithm, using numerical simulations.
- A. Bar-Noy, P. Basu, M. Johnson, P. Nain, D. Towsley, and F. Yu. Estimating Durations Under Changing Conditions. Technical report, Raytheon BBN Technologies, January 2012. Available at http://www.ir.bbn.com/pbasu/pubs/markovpath.pdf.Google Scholar
- A. E. F. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-markovian dynamic graphs. In PODC, Toronto, Canada, August 2008. Google ScholarDigital Library
- A. E. F. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Communication in dynamic radio networks. In PODC, Portland, OR, August 2007. Google ScholarDigital Library
- B. Eisenberg. On the expectation of the maximum of iid geometric random variables. Statistics and Probability Letters, 78:135--143, 2008.Google ScholarCross Ref
- A. Ferreira. Building a reference combinatorial model for manets. IEEE Network, 18(5):24--29, 2004. Google ScholarDigital Library
- G. Grimmett and D. Welsh. Probability: An Introduction. Oxford, 1986.Google Scholar
- S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. In SIGCOMM, pages 145--158, New York, NY, USA, 2004. Google ScholarDigital Library
- D. B. Johnson, D. A. Maltz, and J. Broch. DSR: the dynamic source routing protocol for multihop wireless ad hoc networks, pages 139--172. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, December 2000. Google ScholarDigital Library
- E. P. C. Jones, L. Li, and P. A. S. Ward. Practical routing in delay-tolerant networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, WDTN '05, pages 237--243, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- D. A. Levin, Y. Peres, and E. L. Wilmer. Markov Chains and Mixing Times. American Mathematical Society, 2008.Google ScholarCross Ref
- V. Manfredi, M. Crovella, and J. Kurose. Understanding stateful vs stateless communication strategies for ad hoc networks. In Proceedings of the 17th annual international conference on Mobile computing and networking, MobiCom '11, pages 313--324, New York, NY, USA, 2011. ACM. Google ScholarDigital Library
- E. Nikolova and D. R. Karger. Route planning under uncertainty: the canadian traveller problem. In AAAI, pages 969--974, 2008. Google ScholarDigital Library
- R. G. Ogier and V. Rutenburg. Minimum-expected-delay alternate routing. In INFOCOM, pages 617--625, 1992. Google ScholarDigital Library
- R. Ramanathan. Challenges: A radically new architecture for next generation mobile ad hoc networks. In Proc. of MOBICOM, Cologne, Germany, August 2005. Google ScholarDigital Library
- W. Szpankowski and V. Rego. Yet another application of binomial recurrence: order statistics. Computing, 43:401--410, 1990. Google ScholarDigital Library
Index Terms
- Estimating end-to-end delays under changing conditions
Recommendations
A path-oriented routing strategy for packet switching networks with end-to-end protocols
A path-oriented routing strategy is proposed for packet switching networks with end-to-end internal protocols. It allows switch pairs to communicate over multiple paths (for better network throughput), while maintaining knowledge of user connections at ...
A path-oriented routing strategy for packet switching networks with end-to-end protocols
SIGCOMM '85: Proceedings of the ninth symposium on Data communicationsA path-oriented routing strategy is proposed for packet switching networks with end-to-end internal protocols. It allows switch pairs to communicate over multiple paths (for better network throughput), while maintaining knowledge of user connections at ...
Shortest Path Tree Computation in Dynamic Graphs
Let G = (V, E, w) be a simple digraph, in which all edge weights are nonnegative real numbers. Let G^{\prime} be obtained from G by an application of a set of edge weight updates to G. Let s\in V and let T_{s} and T_{s}^{\prime} be Shortest Path Trees (...
Comments