Practical Routing for Delay Tolerant Networks Evan Jones Lily Li - PowerPoint PPT Presentation

Practical Routing for Delay Tolerant Networks Evan Jones Lily Li Paul Ward

The Problem: Routing in DTNs Get data from the source to the destination without an end-to-end connection

Previous Work: Epidemic Routing � Eventually, all buffers contain the same messages Advantages: � Very robust � Zero knowledge Disadvantages: � Many messages exchanged � Need large buffer

Previous Work: Shortest Paths � Minimize metric to minimize resources consumed Advantages: � Few transmissions � Low buffer requirements Disadvantage: � Requires predictable schedules

Design Goals � Deployable � Self con fi guring � Robust to changes and failures � Ef fi cient use of buffer and network resources � Reliable delivery

Optimization Criteria Maximize delivery ratio � Minimize delay � Minimize buffer consumption � Minimize number of transmissions �

Path Metrics: Expected Delay Minimum Expected Delay (MED) � Compute the expected delay for each hop � Minimize end-to-end expected delay � Minimum Estimated Expected Delay (MEED) � Compute expected delay for the observed history �

Topology Distribution: Link State Natural match for epidemic protocol Link state: fl ood link state to all nodes � Epidemic: propagate a message to all nodes � Complete update after a single exchange �

Routing Decision Time Source routing � Cannot react to topology changes � Per hop routing � If messages wait for a long time, same problem � Per contact routing � Recompute routing for all messages on each connection � Takes advantage of opportunistic connectivity � Frequently recompute routing table �

Short Circuiting When link is up: link cost = link latency Permits messages to take advantage of good timing �

Short Circuiting

Loop Free Routing � Must make decisions with the same state Traditional networks � State does not change while data is in transit Delay tolerant networks � Want to be able to adapt while data is in transit

Performance Evaluation � Compare fi ve protocols: � Earliest Delivery (ED) � Minimum Expected Delay (MED) � MED Per Contact � Epidemic � Minimum Estimated Expected Delay (MEED) � Network layer simulator

Scenario � Based on wireless LAN usage traces from Dartmouth College � More than 2000 users � More than 500 access points � 2 years � Represents mobile users forming an ad-hoc DTN � “Random” mobility with statistical regularity

Dartmouth Data

Scenario Generation Too much data! Only use one month of data � Select 30 connected users � Pick a node at random 1. Put its “good” neighbours in a set 2. Select node at random from the set 3. Repeat 2 until you have N nodes 4.

Simulation Parameters � 30 nodes � 10 topologies � Bidirectional traf fi c � Each node sends 12 messages every 12 hours � 10 000 bytes per message

Delivery Ratio Over Buffer Size

Latency Over Buffer

Conclusions � Link state is an excellent fi t with epidemic � MEED: Reasonable performance without schedule � Epidemic performance is buffer limited � Close to optimal with lots of resources � Per-contact routing � Decreases delay

Future Work � Different data sets � Multiple copies � Experimental deployments of DTNs � Better metrics � Use topology for directed multiple copy routing

Questions?

Practical Routing for Delay Tolerant Networks Evan Jones Lily Li - PowerPoint PPT Presentation

Practical Routing for Delay Tolerant Networks Evan Jones Lily Li Paul Ward The Problem: Routing in DTNs Get data from the source to the destination without an end-to-end connection Previous Work: Epidemic Routing Eventually, all buffers

Delay and Disruption Tolerant Networks An Overview NASA through the Delay Tolerant Network

Introduction to Delay/Disruption Tolerant Networking Part I Ioannis Komnios

Delay-tolerant Networking Routing Protocol Development With The One Simulator Jonathan Humphrey

Fragmented Data Routing Based on Exponentially Distributed Contacts in Delay Tolerant Networks

Authenticated Resource Management in Delay-Tolerant Networks using Proxy Signatures Dominik Sch

Forward Secure Delay-Tolerant Networking Signe R usch, Dominik Sch urmann, R udiger

Improving performance in delay/disruption tolerant networks through passive relay points Saeed

D UE to the characteristic of challenged environment suf- algorithms designed for MANETs from

digital Stadium Delay Tolerant Networks in the Real World Overview Introduce the team and the

XOR Network Coding for Data Mule Delay Tolerant Networks (Invited Paper for IEEE/CIC ICCC 2015)

MobiT: A Distributed and Congestion- Resilient Trajectory Based Routing Algorithm for Vehicular

Behavioral Detection and Containment of Proximity Malware in Delay Tolerant Networks Wei Peng,

Opportunistic Routing Algorithms in Delay T olerant Networks Eyuphan Bulut Rensselaer

Data Elevators Applying the Bundle Protocol in Delay Tolerant Wireless Sensor Networks

Moving data in DTNs with HTTP and MIME Making use of HTTP for delay- and disruption-tolerant

Routing, reminder Forward IP packets between networks according to destination Practical

Agenda Item 7: Missing FPL Operational Statistics (Presented by ASECNA ) 1 1. INTRODUCTION

On-Demand Mass Transit Andrei Greenawalt Vice President, Public Policy andrei@ridewithvia.com

Counting-sort and Routing in a Single Hop Radio Network ALGOSENSORS2007 Maciej G ebala

Mechanism for Network-on-Chip Architectures University of Cyprus The Multicore Computer

Bosnia and Herzegovina Nicosia, November 13 14, 2018. Content Price regulation in Bosnia

REGIONAL PLANNING CONSORTIUMS LONG ISLAND PARTNERSHIP OCTOBER STAKEHOLDER MEETING 1 James

Commuter Service Feasibility Study STEERING COMMITTEE MEETING #3 June 20, 2019 Agenda 1.

90 days and counting 90 days and counting after a repeat of the after a repeat of the 1868