I. Ali, N. Al-dhahir, J. E. Hershey, and A. H. Motorola, Predicting the visibility of LEO satellites. Aerospace and Electronic Systems, IEEE Transactions on, vol.35, issue.4, pp.1183-1190, 1999.

M. N. Allery and J. W. Ward, The potential for'store-and-forward' communications using small satellites in low earth orbits, ECSC- 3-European Conference on Satellite Communications, 3 rd, pp.230-235, 1993.

G. Almes, S. Kalidindi, and M. Zekauskas, RFC 2679 -a one-way delay metric for ippm, 1999.

G. Almes, S. Kalidindi, and M. Zekauskas, RFC 2680 -a one-way packet loss metric for ippm, 1999.

G. Almes, S. Kalidindi, and M. Zekauskas, Rfc 2681 -a round-trip delay metric for ippm, 1999.
DOI : 10.17487/rfc2681

P. Almquist, Rfc 793 -transmission control protocol, 1981.

P. Almquist, Rfc 1349 -type of service in the internet protocol suite, 1992.

K. Baker and D. Jansson, Space satellites from the world's garage-the story of AMSAT, Proceedings of National Aerospace and Electronics Conference (NAECON'94), pp.1174-1181, 1994.
DOI : 10.1109/NAECON.1994.332909

B. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

W. T. Brandon, A data courier satellite system concept, International Journal of Satellite Communications, vol.12, issue.6, pp.569-578, 1994.
DOI : 10.1002/sat.4600120606

E. Brewer, M. Demmer, B. Du, M. Ho, M. Kam et al., The case for technology in developing regions, COMPUTER, pp.25-38, 2005.

B. Bui-xuan, A. Ferreira, and A. Jarry, Evolving graphs and least cost journeys in dynamic networks, Proceedings of WiOpt'03 ? Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, pp.141-150, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00466676

S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf et al., Delay-tolerant networking: an approach to interplanetary Internet, IEEE Communications Magazine, vol.41, issue.6, pp.41128-136, 2003.
DOI : 10.1109/MCOM.2003.1204759

S. Burleigh and K. Scott, Internet draft, bundle protocol specification, 2006.

B. Burns, O. Brock, and B. N. Levine, MORA routing and capacity building in disruption-tolerant networks, Ad Hoc Networks, vol.6, issue.4, pp.600-620, 2008.
DOI : 10.1016/j.adhoc.2007.05.002

V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst et al., Delay tolerant network architecture, draft-irtf- dtnrg-arch-02, txt. Internet Research Task Force (IRTF), 2004.

V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst et al., Interplanetary Internet (IPN) : Architectural Definition . Voir http, 2001.

I. Chabini, Discrete Dynamic Shortest Path Problems in Transportation Applications: Complexity and Algorithms with Optimal Run Time, Transportation Research Record: Journal of the Transportation Research Board, vol.1645, issue.1, pp.1645170-175, 1998.
DOI : 10.3141/1645-21

. Cisco, Document id : 16406. enhanced interior gateway routing protocol, 2005.

K. L. Cooke and E. Halsey, The shortest route through a network with time-dependent internodal transit times, Journal of Mathematical Analysis and Applications, vol.14, issue.3, pp.493-498, 1996.
DOI : 10.1016/0022-247X(66)90009-6

H. Cruz-sanchez, L. Franck, and A. L. Beylot, Precomputed routing in a store and forward satellite constellation. Vehicular Technology Conference, pp.240-243, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00745161

H. Cruz-sanchez, L. Franck, and A. L. Beylot, Routing metrics in delay tolerant networks, 2007.

H. Cruz-sanchez, L. Franck, and A. L. Beylot, Use of store and forward metrics for service-oriented routing in satellite constellations, 2008 IEEE International Workshop on Satellite and Space Communications, p.8, 2008.
DOI : 10.1109/IWSSC.2008.4656753

H. Cruz-sanchez, L. Franck, and A. L. Beylot, Routing metrics for store and forward networks, Computer Networks

G. Desaulniers and D. Villeneuve, The shortest path problem with time windows ans linear waiting costs, Transportation Science, 2000.

M. Desrochers and F. Soumis, A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows, INFOR: Information Systems and Operational Research, vol.26, issue.3, 1988.
DOI : 10.1080/03155986.1988.11732063

J. Desrosiers, P. Pelletier, and F. Soumis, Plus court chemin avec contraintes d'horaires, RAIRO - Operations Research, vol.17, issue.4, 1983.
DOI : 10.1051/ro/1983170403571
URL : http://archive.numdam.org/article/RO_1983__17_4_357_0.pdf

R. J. Diersing and G. Jones, Low-earth-orbit store-and-forward satellites in the amateur radioservice, Telesystems Conference, 1992. NTC-92., National, p.8, 1992.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-2706, 1959.
DOI : 10.1007/BF01386390

M. Dodge, An Atlas of Cyberspaces, 2004.

S. E. Dreyfus, An Appraisal of Some Shortest-Path Algorithms, Operations Research, vol.17, issue.3, pp.395-412, 1969.
DOI : 10.1287/opre.17.3.395

A. Eiger, P. B. Mirchandani, and H. Soroush, Path Preferences and Optimal Paths in Probabilistic Networks, Transportation Science, vol.19, issue.1, pp.75-84, 1985.
DOI : 10.1287/trsc.19.1.75

S. Farrell and V. Cahill, Ltp-t : A generic delay tolerant transport protocol, 2005.

A. Ferreira, Building a reference combinatorial model for MANETs, IEEE Network, vol.18, issue.5, pp.24-29, 2004.
DOI : 10.1109/MNET.2004.1337732

R. Fletcher and A. Hasson, Daknet : rethinking connectivity in developing nations, Computer, vol.37, issue.1, pp.78-83, 2004.

H. Frank, Shortest Paths in Probabilistic Graphs, Operations Research, vol.17, issue.4, pp.583-599, 1969.
DOI : 10.1287/opre.17.4.583

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, 1979.

K. Goczyla and J. Cielatkowski, Optimal routing in a transportation network, European Journal of Operational Research, vol.87, issue.2, 1995.
DOI : 10.1016/0377-2217(95)00177-R

R. W. Hall, 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

]. C. Hedrick, Rfc 1058, routing information protocol (rip)

A. Hooke, The interplanetary Internet, Communications of the ACM, vol.44, issue.9, pp.38-40, 2001.
DOI : 10.1145/383694.383703

A. Hooke, Towards an Interplanetary Internet: A Proposed Strategy for Standardization, SpaceOps 2002 Conference, 2002.
DOI : 10.2514/6.2002-T5-34

W. Ivancic, W. M. Eddy, L. Wood, D. Stewart, C. Jackson et al., Delay/disruption-tolerant network testing using a leo satellite, Pumpkin Inc. Cubesat kit home Eighth Annual NASA Earth Science Technology Conference, 2008.

S. Jain, K. Fall, and R. Patra, Routing in a delay tolerant network, SIGCOMM '04 : Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp.145-158, 2004.

D. Johnson, Routing in ad hoc networks of mobile hosts, Workshop on Mobile Computing Systems and Applications, 1994.
DOI : 10.1109/MCSA.1994.513476

E. Jones, L. Li, and P. Ward, Practical Routing in Delay-Tolerant Networks, WDTN '05 : Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pp.237-243, 2005.
DOI : 10.1109/TMC.2007.1016

J. Leguay, T. Friedman, and V. Conan, DTN routing in a mobility pattern space, Proceeding of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking , WDTN '05, 2005.
DOI : 10.1145/1080139.1080146
URL : https://hal.archives-ouvertes.fr/hal-01487847

A. Lindgren and A. Doria, Probabilistic routing protocol for intermittently connected networks, 2006.
DOI : 10.17487/rfc6693
URL : http://soda.swedish-ict.se/5289/2/rfc6693.txt.pdf

A. Lindgren, A. Doria, and O. Schelén, Probabilistic routing in intermittently connected networks, ACM SIGMOBILE Mobile Computing and Communications Review, vol.7, issue.3, pp.19-20, 2003.
DOI : 10.1145/961268.961272
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.6027

R. P. Loui, Optimal paths in graphs with stochastic or multidimensional weights, Communications of the ACM, vol.26, issue.9, pp.670-676, 1983.
DOI : 10.1145/358172.358406

M. Lukac, L. Girod, and D. Estrin, Disruption tolerant shell, Proceedings of the 2006 SIGCOMM workshop on Challenged networks , CHANTS '06, pp.189-196, 2006.
DOI : 10.1145/1162654.1162655
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.5955

J. Mahdavi and V. Paxson, Rfc 2678 -ippm metrics for measuring connectivity, 1999.
DOI : 10.17487/rfc2498
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.9407

A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, Wireless sensor networks for habitat monitoring, Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications , WSNA '02, pp.88-97, 2002.
DOI : 10.1145/570738.570751

E. D. Miller, H. S. Mahmassani, and A. Ziliaskopoulos, Path search techniques for transportation networks with time-dependent, stochastic arc costs, Proceedings of IEEE International Conference on Systems, Man and Cybernetics, pp.1716-1721, 1986.
DOI : 10.1109/ICSMC.1994.400096

E. D. Miller-hooks, Optimal routing in time-varying, stochastic networks : Algorithms and implementations, 1997.

P. B. Mirchandani and H. Soroush, Optimal paths in probabilistic networks: A case with temporary preferences, Computers & Operations Research, vol.12, issue.4, pp.365-381, 1985.
DOI : 10.1016/0305-0548(85)90034-6

J. Moy, RFC 2338, Open Shortest Path First (OSPF) Version 2. Voir http, 1998.

I. Murthy and S. Sarkar, A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems, Transportation Science, vol.30, issue.3, pp.220-236, 1996.
DOI : 10.1287/trsc.30.3.220

I. Murthy and S. Sarkar, Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function, European Journal of Operational Research, vol.103, issue.1, pp.209-229, 1997.
DOI : 10.1016/S0377-2217(97)00264-6

I. Murthy and S. Sarkar, Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions, Management Science, vol.44, issue.11-part-2, pp.125-136, 1998.
DOI : 10.1287/mnsc.44.11.S125

I. Nason, J. Puig-suari, and R. Twiggs, Development of a family of picosatellite deployers based on the CubeSat standard, Proceedings, IEEE Aerospace Conference, pp.457-464, 2002.
DOI : 10.1109/AERO.2002.1036865

A. Orda and R. Rom, Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length, Journal of the ACM, vol.37, issue.3, pp.607-625, 1990.
DOI : 10.1145/79147.214078

A. Orda, R. Rom, and M. Sidi, Minimum delay routing in stochastic network, IEEE/ACM Transactions on Networking, vol.1, issue.2, pp.187-198, 1993.
DOI : 10.1109/90.222926

S. Pallottino and M. G. Scutella, Shortest Path Algorithms In Transportation Models: Classical and Innovative Aspects, 1997.
DOI : 10.1007/978-1-4615-5757-9_11

P. L. Palmer and Y. Mai, A fast prediction algorithm of satellite passes, 12th AIAA/USU Annual Conference on Small Satellites, 2000.

V. Paxson, G. Almes, J. Mahdavi, and M. Mathis, Rfc 2330 -framework for ip performance metrics, 1988.

C. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, ACM SIG- COMM'94 Conference on Communications Architectures, Protocols and Applications, pp.234-244, 1980.
DOI : 10.1145/190809.190336
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.555

W. B. Powell and Z. L. Chen, A generalized threshold algorithm for the shortest path problem with time windows. Network Design : Connectivity and Facilities Location : DIMACS Workshop, 1997.

J. Radzik and G. Maral, A methodology for rapidly evaluating the performance of some low Earth orbit satellite systems, IEEE Journal on Selected Areas in Communications, vol.13, issue.2, pp.301-309, 1995.
DOI : 10.1109/49.345874

M. Ramadas, S. Burleigh, and S. Farrell, Licklider transmission protocol specification, 2006.
DOI : 10.17487/rfc5326

J. Rice, Seaweb acoustic communication and navigation networks, Proceedings of the International Conference on Underwater Acoustic Measurements : Technologies & Results, 2005.

A. Seth, D. Kroeker, M. Zaharia, S. Guo, and S. Keshav, Low-cost communication for rural internet kiosks using mechanical backhaul, Proceedings of the 12th annual international conference on Mobile computing and networking , MobiCom '06, pp.334-345, 2006.
DOI : 10.1145/1161089.1161127

R. C. Shah, S. Roy, S. Jain, W. Brunette, I. Res et al., Data MULEs: modeling a three-tier architecture for sparse sensor networks, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003., pp.30-41, 2003.
DOI : 10.1109/SNPA.2003.1203354

M. Steenstrup, Routing in communications networks, 1995.

A. Tutorial, Version 1.1. Intel Research Berkeley, 2003.

M. Wellman, M. Ford, and K. Larson, Path planning under timedependent uncertainty, Proceedings of the 11th Annual Conference