1 / 16

Changing the paradigm in forwarding : How transform daemons to angels?

Explore the shift from traditional forwarding methods to innovative strategies like network coding and collaboration incentives. Learn how to optimize utility functions, address congestion, and enforce collaboration in challenging networking environments. Discover effective approaches to forwarding that prioritize efficiency and cooperation over redundancy and selfish behavior.

simmonsb
Download Presentation

Changing the paradigm in forwarding : How transform daemons to angels?

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Changing the paradigm in forwarding : How transform daemons to angels? Kavé Salamatian Lancaster University

  2. Nowadays … Thank you but you are in the opposite direction! I can also carry for you! I have 100M bytes of data, who can carry for me? Give it to me, I have 1G bytes phone flash. Don’t give to me! I am running out of storage. Reach an access point. There is one in my pocket… Internet Search La Bonheme.mp3 for me Finally, it arrive… Search La Bonheme.mp3 for me Search La Bonheme.mp3 for me

  3. Classical forwarding ?

  4. DTN, pocket networks forwarding ?

  5. Why to forward ? • Let’s define for each packet a set of attributes Ai • Destination address D(Pi) • Some Attributes are extracted from packet, some are coming from local context • Let’s define a utility function U(Ai, D(Pi), ID, A) • The utility of forwarding message i destinated to D(Pi) to node ID with context A • The utility function capture the selfishness of the node • Forwarding scheme : • Calculate for each packet in buffer its utility • Forward the largest utility ID,A A1 A2 An

  6. Utility functions • Classical routing : Assign the utility function 1 if the node ID is on the path to destination D(Pi)null otherwise • PROPHET: The delivery likelihood is the utility • Self Limiting Epidemic forwarding: The utility is scaled down everytime a packet is received or forwarded. • Community or content networking :Give a higher utility to some contents or community. • What if the utility doesn’t depend on destination adress ? • Results in epidemic forwarding • Might construct utility function changing over time and adapting to information increase • Spray and focus • Move from opportunistic to infrastructure mode

  7. Random utility • Utility is hard to assess, we might do mistakes • U(Ai, D(Pi), ID, A)=Û(Ai, D(Pi), ID, A)+noise • Knowing a set of estimed utility {Ûi} what is the probability that choice j is the real best choice ? • Noise should follow a Gumble distribution • Forwarding scheme • Choose packets to forward following above distibution

  8. Forwarding for challenging environments • Very mobile, very dynamic environments • No prediction on future encounters • No bias in the utility function based on destination address • Results in epidemic forwarding • Flooding is evil ! • Generate lots of redundancy • Reduce injection rate • Going from point to point capacity bound to broadcast capacity bounds • But …. Flooding is great • Shortest path • No need for global information • Will work whenever communication is possible. • Is it possible to male flooding less evil ? • Controlling the redundancy • Controlling the scope

  9. Controlling the redundancy • Let’s forward in place of a packet a linear combination of packets : Network coding ! • Reduce the redundancy • Use feedback to indicate received packets • How to do this feedback ?

  10. Issues • Generation problem • How to ensure that the number of variables do not grow faster than the number of equation: congestion ! • Congestion control needed • How to ? • Incentives/punishment? • How to deal with selfish nodes • Node that are just sending their packets and not forwarding others

  11. Collaboration Incentives • Nodes are selfish • Send as most a possible their own messages • Just forward message when there is a benefit • They are pragmatic and rational • They have a limited patience and resources

  12. Limited resources • A node do not want to use more than K buffer space for forwarding • Out of these can k be undecoded and K-k are decoded • A node piggyback • its capacity • List of packet decoded • List of packet received • List of packet non decoded is derived from the two above • Neighbor should take care of this capacity in forwarding • A neighbor have no incentive to go higher than the advertised capacity • A node have no incentive to lie about its capacity

  13. Enforcing collaboration • Finite buffer space for forwarding • Informs other about your capacity • Neighbor take care of your constraint for their own sake • Mixing packets help neighbors in solving their equations and freeing space for sending your packets • Results in a Pareto-Optimal cooperation mechanism • Being social becomes helpful • Entangling your transmission with others is a way of enforcing collaboration • Totally antagonistic with QoS • Cooperation by punishment not by incentives

  14. Performances

  15. Infocom 2006 scenario

  16. Infocom Scenario

More Related