Show simple item record

dc.contributor.authorKunzmann, Gerald
dc.contributor.editorMüller, Paul
dc.contributor.editorGotzhein, Reinhard
dc.contributor.editorSchmitt, Jens B.
dc.date.accessioned2019-10-11T09:44:16Z
dc.date.available2019-10-11T09:44:16Z
dc.date.issued2005
dc.identifier.isbn3-88579-390-3
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/28425
dc.description.abstractIn 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.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofKommunikation in Verteilten Systemen (KiVS)
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-61
dc.titleRecursive or iterative routing? Hybrid!en
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages189-192
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationKaiserslautern
mci.conference.date28. Februar bis 3. März 2005


Files in this item

Thumbnail

Show simple item record