Recursive or iterative routing? Hybrid!
dc.contributor.author | Kunzmann, Gerald | |
dc.contributor.editor | Müller, Paul | |
dc.contributor.editor | Gotzhein, Reinhard | |
dc.contributor.editor | Schmitt, Jens B. | |
dc.date.accessioned | 2019-10-11T09:44:16Z | |
dc.date.available | 2019-10-11T09:44:16Z | |
dc.date.issued | 2005 | |
dc.description.abstract | In our current work with the Chord protocol [SMK+01] we had to decide whether to use iterative or recursive routing. Iterative routing provides the initiating node with a lot of information and influence on the routing path. Recursive routing on the other hand is faster and results in less overhead, most notably in stable networks. We present a hybrid routing solution that inherits the advantages of both approaches without increasing the overhead or slowing down the lookup procedure. | en |
dc.identifier.isbn | 3-88579-390-3 | |
dc.identifier.pissn | 1617-5468 | |
dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/28425 | |
dc.language.iso | en | |
dc.publisher | Gesellschaft für Informatik e.V. | |
dc.relation.ispartof | Kommunikation in Verteilten Systemen (KiVS) | |
dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-61 | |
dc.title | Recursive or iterative routing? Hybrid! | en |
dc.type | Text/Conference Paper | |
gi.citation.endPage | 192 | |
gi.citation.publisherPlace | Bonn | |
gi.citation.startPage | 189 | |
gi.conference.date | 28. Februar bis 3. März 2005 | |
gi.conference.location | Kaiserslautern | |
gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1
Lade...
- Name:
- GI-Proceedings.61-27.pdf
- Größe:
- 230.32 KB
- Format:
- Adobe Portable Document Format