PH-graphs for analyzing shortest path problems with correlated traveling times, Computers & Operations Research, vol.59, pp.51-65, 2015. ,
DOI : 10.1016/j.cor.2015.01.001
Flooding time in edge-Markovian dynamic graphs, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.213-222, 2008. ,
DOI : 10.1145/1400751.1400781
Communication in dynamic radio networks, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.205-214, 2007. ,
DOI : 10.1145/1281100.1281131
Building a reference combinatorial model for MANETs, IEEE Network, vol.18, issue.5, pp.24-29, 2004. ,
DOI : 10.1109/MNET.2004.1337732
Characterizing continuous time random walks on time varying graphs, Proc. of joint ACM SIGMETRICS -Performance conf, pp.307-318, 2012. ,
DOI : 10.1145/2318857.2254794
URL : http://arxiv.org/abs/1112.5762
The Fastest Path through a Network with Random Time-Dependent Travel Times, Transportation Science, vol.20, issue.3, pp.182-188, 1986. ,
DOI : 10.1287/trsc.20.3.182
Routing in a delay tolerant network, Proc. of ACM SIGCOMM, pp.145-158, 2004. ,
DOI : 10.1145/1030194.1015484
A review of transient behavior in regular diffusion and birth-death processes. Part II, Journal of Applied Probability, vol.8, issue.02, pp.405-428, 1965. ,
DOI : 10.1007/BF01565412
Interactive Particle Systems, 1985. ,
Estimating end-to-end delays under changing conditions, Proceedings of the 8th ACM MobiCom workshop on Challenged networks, CHANTS '13, pp.1-6, 2013. ,
DOI : 10.1145/2505494.2505495
URL : https://hal.archives-ouvertes.fr/hal-00933322
Matrix-Geometric Solutions to Stochastic Models, 1981. ,
DOI : 10.1007/978-3-642-69546-9_91
Optimal Routing Policy Problems in Stochastic Time-Dependent Networks, Transportation Research Part B, vol.40, issue.2, pp.93-122, 2006. ,