The heterogeneity of inter-contact time distributions: its importance for routing in delay tolerant networks Vania Conan*, J´er´emie Leguay*+ , Timur Friedman+ *Thales Communications + Universit´ e Pierre et Marie Cur

Source URL: jeremie.leguay.free.fr

• Delay-tolerant networking
• Network architecture
• Routing
• Exponential distribution
• Statistics
• Network theory
• Routing in delay-tolerant networking
• Network protocols
• Computing
• Computer architecture

e. STAIN Malikussaleh Lhokseumawe Jl. Tgk Chik Ditiro No. 9 Lhokseumawe Aceh Utara Telp[removed]Faks[removed]f. STAIN Zawiyah Cot Kala Langsa Jl. AP. Meurandeh Langsa Timur Aceh Timur Nangroe Aceh Darussalam g.

Source URL: spmb-ptain.ac.id

Osmosis in Pocket Switched Networks Pan Hui∗† , J´er´emie Leguay‡§ , Jon Crowcroft∗ , James Scott† , Timur Friedman‡ , Vania Conan§ ∗ University of Cambridge Intel Research Cambridge

Source URL: jeremie.leguay.free.fr

• Distributed data storage
• Concurrent computing
• Diffusion
• Osmosis
• File sharing
• Peer-to-peer
• Gnutella
• Osmotic pressure
• ANts P2P
• File sharing networks
• Water technology
• Computing

Describing and Simulating Internet Routes J´er´emie Leguay, Timur Friedman, Kav´e Salamatian LIP6 – CNRS and Universit´e Pierre et Marie Curie 8, rue du Capitaine Scott, 75015 Paris, France Tel. +[removed],

Source URL: jeremie.leguay.free.fr

• Routing algorithms
• Network theory
• Routing
• Distributed data storage
• Shortest path problem
• Scale-free network
• Network topology
• Degree distribution
• Routing protocols
• Graph theory
• Mathematics
• Theoretical computer science

Describing and Simulating Internet Routes J´er´emie Leguay1 , Matthieu Latapy2 , Timur Friedman1 , and Kav´e Salamatian1 1 LIP6 – CNRS and Universit´e Pierre et Marie Curie, 8, rue du Capitaine Scott, 75015 Paris,

Source URL: jeremie.leguay.free.fr

• Network theory
• Shortest path problem
• Routing
• Shortest path tree
• Graph
• Degree distribution
• Distance
• Breadth-first search
• Centrality
• Mathematics
• Graph theory
• Theoretical computer science

MobySpace : Mobility Pattern Space Routing for DTNs Jérémie Leguay1,2, Timur Friedman1, Vania Conan2 Basic concept Problem:

Source URL: jeremie.leguay.free.fr

• Delay-tolerant networking
• Network architecture
• Computing
• Computer architecture
• Bundle
• Routing
• Mathematics
• Routing in delay-tolerant networking
• Fiber bundles
• Network protocols
• Distributed data storage

DTN Routing in a Mobility Pattern Space Jérémie Leguay WDTN’05 With: Timur Friedman (LIP6), Vania Conan (Thales Communications) Outline

Source URL: jeremie.leguay.free.fr

• Computer architecture
• Computing
• Routing
• Wireless networking
• Routing in delay-tolerant networking
• Network protocols
• Network architecture
• Delay-tolerant networking

Connectivity Aware Routing in Ad-Hoc Networks Jérémie Leguay PWC’05 With: Timur Friedman (LIP6), Vania Conan(Thales), Serge Fdida (LIP6), André Cotton(Thales) Corporate Communications

Source URL: jeremie.leguay.free.fr

• Technology
• Computing
• Link-state routing protocol
• Optimized Link State Routing Protocol
• Routing
• Wireless ad-hoc network
• Adaptive quality of service multi-hop routing
• Wireless networking
• Routing algorithms
• Network architecture

Characterizing Pairwise Inter-contact Patterns in Delay Tolerant Networks Vania Conan,∗ J´er´emie Leguay,∗ Timur Friedman† ∗ †

Source URL: jeremie.leguay.free.fr

• Delay-tolerant networking
• Power law
• Routing
• Normal distribution
• Mathematical analysis
• Probability and statistics
• Network protocols
• Network architecture
• Statistics

Describing and Simulating Internet Routes Jérémie Leguay Université Pierre et Marie Curie (LIP6 /CNRS) Collaboration with: Matthieu Latapy, Timur Friedman, Kavé Salamatian

Source URL: jeremie.leguay.free.fr

• Network theory
• Theoretical computer science
• Routing
• Shortest path problem
• Routing protocol
• Link-state routing protocol
• Network architecture
• Routing algorithms
• Mathematics