S2006-IPI: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| (13 intermediate revisions by 5 users not shown) | |||
| Line 1: | Line 1: | ||
==6. DTN Routing (2): Probabilistic / Un-Planned / Unknown Connectivity Pattern== |
==[[6-DTN-Routing | 6. DTN Routing (2): Probabilistic / Un-Planned / Unknown Connectivity Pattern]]== |
||
==[[8-DTN-Multicasting | 8. DTN Multicasting]]== |
|||
==9. Smart Routing Algorithms == |
|||
'''Topics''' |
'''Topics''' |
||
* [[Erasure-Coding Based Routing for Opportunistic Networks]] |
|||
* [[CAR | CAR - Context-aware Adaptive Routing]] |
|||
* [[Network Coding for Efficient Communication in Extreme Networks]] |
|||
* [[MEED | MEED - Minimum estimated expected delay]] |
|||
* SWIM |
|||
* PROPHET |
|||
[[Media:dtn2slides.pdf| Presentation slides]] |
|||
<br> |
|||
==10. Data Retrieval in Intermittedly Connected Networks== |
==10. Data Retrieval in Intermittedly Connected Networks== |
||
'''Topics''' |
|||
So you´ve got the net, now what about the data it should deliver? After examining different aspects of DTNs from TCP replacements over routing to network coding, this section deals with the actual transport of data. We have a look at two interesting papers: the first one presents a rather new approach to delivery of data, the other one identifies some flaws in the current (2006) DTN architecture that affect data delivery and proposes some enhancements to correct these. |
|||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
| ⚫ | |||
* [[Media:Vortrag_10_SoSe2006.pdf | Information Retrieval slides]] |
|||
| ⚫ | |||
First, I'll try to clarify some DTN-related things and buzzwords, to be able to explain which flaws of the current design EDIFY tries to correct. I'll concentrate on aspects that relate to EDIFY. |
|||
The [http://www.dtnrg.org/docs/tutorials/warthman-1.1.pdf concept] of the [http://www.dtnrg.org DTN research group] views as DTN as a network of networks, as some sort of overlay on top of other nets, being able to support communication between these (maybe diverse) nets. These possibly diverse nets are also called '''region''' in DTN terminology ([http://www.cs.berkeley.edu/~kfall/dtn-icir.pdf]). |
|||
DTN-wide addressing is now done via a tuple '''(region,locator)''', where ''region'' marks a network and ''locator'' a node belonging to this network. Note that addressing ''within'' a region/network can be completely different, it's up to the network how this is done. The (R,L)-addresses are specific to the overlying DTN, used to do inter-group addressing. |
|||
To actually be able to communicate with different regions, each region possesses at least one special '''gateway''' node, translating between the region's own protocol and DTN-speak and resolving global (R,L)-style DTN names into local, region-specific ones. |
|||
While this addressing scheme is quite fine with static regions, it is unable to deal with ''ad hoc'' or ''mobile'' regions. |
|||
First, why are ''ad-hoc'' regions not supported: The assumption that is made is that nodes within a region are always able to communicate with their region members, gateway nodes being the most crucial ones. |
|||
But in reality, this isn't true: regions/networks can be split, i.e. the communication within the region can be disrupted (imagine a platoon of soldiers having to split due to enemy fire). Now there are a number of region members that are unable to talk to their region's gateway. Therefore these nodes are now unreachable from other parts of the DTN... |
|||
Another mere management problem is the joining of regions: The traditional approach makes no statements about merging of networks, not answering some important questions: How is the new region called? Does it get the name of the first or the second region coming together? More important: Who is going to be the new region's gateway? |
|||
Second, there are problems with ''mobile'' regions: Imagine a whole region/network moving around (e.g. some people in a plane). The traditional approach assumes static, non-moving regions/networks and so are it's assumptions about routing. However, with a moving network, one has to think about new aspects of routing data... |
|||
| ⚫ | |||
==[[15-Security-DTN | 15. Security in DTN]]== |
|||
These are more or less the core problems that EDIFY tries to solve. They do this mainly using a new naming scheme for DTNs. I tried to summarize the whole story from problems to solution in in a talk, with the slides being downloadable [http://www2.informatik.hu-berlin.de/~beier/pdfs/iplanet-06-edify.pdf here]. |
|||
Latest revision as of 23:05, 23 October 2007
6. DTN Routing (2): Probabilistic / Un-Planned / Unknown Connectivity Pattern
8. DTN Multicasting
9. Smart Routing Algorithms
Topics
- Erasure-Coding Based Routing for Opportunistic Networks
- Network Coding for Efficient Communication in Extreme Networks
10. Data Retrieval in Intermittedly Connected Networks
Topics
Introductory Speech Slides (PDF)