Internet Real-Time Laboratory Wing Ho (Andy) Yuen Columbia University What is 7DS? 7DS is a peer-to-peer data sharing network that exploits node mobility for data dissemination. Any two nodes communicate when they are in proximity. Under this transmission constraint, any pair of nodes is intermittently connected as mobility shuffles node locations. Three Categories of Applications Upload: Mobile nodes anycast data to an AP e.g. delivery P2P: Data dissemination between mobile nodes e.g. mp3 file exchanges among iPod users Download: Content distribution of popular data e.g. movie and news video clip download For More detailed information about this project please contact Delivery Application A node generates an message to be delivered to an AP. Random delay ranges from hours to days Message delay of delivery can be drastically reduced through packet replication at node encounters Trade off message delay with resource consumption (storage cost and energy cost) Duplicated packet should be purged periodically to prevent buffer overflow Packet Purge Mechanisms Time-based (TB): A message is purged when the TTL field expires Hop-based (HB): Each message is appended with duple (b,h) to limit the breadth and depth of data dissemination tree Feedback (FB): When message is delivered to the network, 7DS may provide explicit feedback message to purge packets at all nodes Four schemes: TB, HB, TB-FB, HB-FB Assumptions Single message upload Discrete time model Poisson node encounter and AP encounter Number of nodes >> number of duplicated packets Notations X n number of duplicated packets at time n Y n number of offspring nodes receiving a packet copy at time n Z j,n number of offspring of node j at time n R n number of nodes that arrives at an AP at time n Performance Metrics Storage cost/ Energy cost (C TB and C HB ): Each packet replication incurs one unit of transmission cost at Tx node and one unit of storage cost at Rx node Storage-time cost (S TB and S HB ): sum of packet storage time over all nodes. Packet storage time of node j is given by  j =t e -t a, where t a is the time when node j receives the packet and t e is the time node j purge the packet Time Based X n+1 =X n +Y n -R n E[X n+1 ]=(1-  + ) n+1 Var[X n ]=(1+ ) n-1 ((1+ ) n -1) For  0 E[C TB ]=(1+ ) TTL E[S TB ]=((1+ ) TTL+1 -1)/ Var[C TB ]=(1+ ) TTL-1 ((1+ ) TTL -1) Var[S TB ]=((1+ ) 2TTL+1 -(1+ ) TTL (2TTL+1)-1)/ 2 Hop-Based For  =0 E[C HB ]=(b max hmax -1)(b max -1) Var[C HB ]=0 E[S HB ]=(b max hmax -1)(b max -1) b max / Var[S HB ]=(b max hmax -1)(b max -1) b max / 2 For  >0 E[C HB ]=(E[M] hmax+1 -1)(E[M]-1) IRT – Internet Real-Time Lab  Affiliated with the Computer Science Department at Columbia UniversityComputer Science DepartmentColumbia University  conducts research in the areas of Internet and multimedia services : Internet telephony, wireless and mobile networks, streaming, quality of service, resource reservation, dynamic pricing for the Internet, network measurement and reliability, service location, network security, media on demand, content distribution networks, multicast networks and ubiquitous and context-aware computing and communication. Project Title  Performance Evaluation of Time-based and Hop-based TTL Schemes in 7DS Systems Qualitative Comparison of TB and HB For >> , E[M]  b max, Hop-based scheme has storage cost and storage-time cost independent of node encounter rate; Variance of storage cost is negligible Both mean and variance of storage cost and storage- time cost of time-based scheme is exponential in TTL; a priori knowledge of node encounter rate and AP encounter rate is needed to compute minimal TTL that guarantees P d =1 Simulation Study Analysis compares TB and HB without feedback Simulations compare TB and HB with and without feedback Three scenarios:  =1/1000,1/2000 and 1/5000 per sec, (17, 33 and 83 minutes to AP on average) Node encounter rate = 1/20 (20 sec per encounter) For each scenario, select TB and HB schemes that has packet delivery ratio P d =1; then consider schemes with minimum h max for each b max Scenario I: (h max,b max )=(2,6),(3,4),(4,3),(7,2) yields P d =1 and consumes least overhead Quantitative Comparison of TB and HB With no feedback, mean and variance of storage cost and storage-time cost of TB scheme is much larger than HB schemes With feedback, mean and variance of storage cost and storage-time cost of TB scheme is on par with HB schemes Among all HB schemes, two hop scheme often yields the least storage and storage-time costs In practice, we can select smallest b max such that HB(b max,2) yields P d =1 Conclusion Although 7DS does not offer delay guarantee for packet delivery, reliable and expedite data delivery is still possible, at a moderate resource overhead All schemes under consideration have P d =1. Packet delivery time is at the order of 100sec for all schemes in scenario I. Storage cost = 50 packets without feedback, 18 packets with feedback