延迟容忍网络的路由.pptVIP

Routing in Delay Tolerant Network Qing Ye EDIFY Group of Lehigh University Outline Introduction Routing Issue and the Model DTN Routing Approaches Gossiping-like Shortest-path-like Summary and Our view Introduction – Concept Delay Tolerant Networks: networks suffer from frequent, long duration partitioning and the lack of guaranteed end-to-end path Introduction – Characteristics Heterogeneity: A hybrid of wired and wireless links Bandwidth, delay and capacity of links may vary Different types end-devices Node may move or not Routing Issue Conventional Routing: Internet: distance vector and link state Wireless Ad hoc networks: table-driven and source-initiated on-demand Find and take advantage of the best current available end-to-end path between source and destination DTN Routing Model DTN ? a multigraph G(E, N), multiple paths may exist according to different types of links DTN Routing Approaches – First Contact (FC) Basic idea: a message is forwarded along a contact chosen randomly among all current available contacts. Or the first available contact is selected Similar approach: Gossiping Routing Properties: Simple: routing is based on a local view Small control overhead Not a loop-free approach Unreliable: routing decision may be incorrect DTN Routing Approaches – Minimum Expected Delay (MED) Assumptions: the up and down schedules as well as the delays of overall contacts between the source and the destination are known the overall message sizes are known Next-hop delay = waiting delay + average propagation delay + average transmission delay Basic idea: Dijkstra’s shortest path algorithm is applied choose the path with the overall smallest next-hop delays Properties: Achieve the minimum average delays Loop-free Superior contact happens later would be ignored Congestion may happen since the route is fixed, no load balancing DTN Routing Approaches – Earliest Delivery (ED) Assumptions: same as the MED approach Basic idea: calculate the next-hop delay in a real-time