未来网络 CCN DONA Data-Oritened.pptVIP

* * * * * * * * * * MED == Minimized expected delay E[everything over time] ED, EDLQ, EDAQ: Dijkstra w/ different weight fn If ED - EDLQ immediate Weakness: all require pretty good contact knowledge NOTE: FC missing from slides * Long delays could be incurred if the contacts selected don’t see the destination in the near future. * High-level overview. However, in reality, we need to take those factors into consideration. We plan to look at these issues in future work. * * * * * Message Abstraction Network protocol data unit: bundles “postal-like” message delivery coarse-grained CoS [4 classes] origination and useful life time [assumes sync’d clocks] source, destination, and respond-to EIDs Options: return receipt, “traceroute”-like function, alternative reply-to field, custody transfer fragmentation capability overlay atop TCP/IP or other (link) layers [layer ‘agnostic’] Applications send/receive messages “Application data units” (ADUs) of possibly-large size Adaptation to underlying protocols via ‘convergence layer’ API includes persistent registrations DTN Routing DTN Routers form an overlay network only selected/configured nodes participate nodes have persistent storage DTN routing topology is a time-varying multigraph Links come and go, sometimes predictably Use any/all links that can possibly help (multi) Scheduled, Predicted, or Unscheduled Links May be direction specific [e.g. ISP dialup] May learn from history to predict schedule Messages fragmented based on dynamics Proactive fragmentation: optimize contact volume Reactive fragmentation: resume where you failed * Example Routing Problem * Village Internet City bike 2 3 1 Example Graph Abstraction * time (days) bike (data mule) intermittent high capacity Geo satellite medium/low capacity dial-up link low capacity City Village 1 Village 2 Connectivity: Village 1 – City bandwidth bike satellite phone The DTN Routing Problem Inputs: topology (multi)graph, vertex buffer limits, contact set, mess