FRT-2-Chord: A DHT supporting seamless transition between one-hop and multi-hop lookups with symmetric Routing Table

Abstract

Abstract-FRT-2-Chord is a DHT based on Flexible RoutingTables, a method for designing routing algorithms for overlays. DHTs should consider the following factors when constructing overlay topologies: the number of nodes, identifier distance, network proximity and node groups. Existing DHTs either do not adapt to those factors or focus on only some of them. FRT-2-Chord is more adaptable and achieves efficient routing under a variety of conditions of those factors. Theoretical analysis and experimental results show the efficiency of FRT-2-Chord.

A structured overlay for non-uniform node identifier distribution based on flexible routing tables

“…FRT-Chord # is based on Flexible Routing Tables (FRT) [9], a method for designing structured overlays, and thus inherits advantageous features of FRT, that the existing overlays do not hold. Such features include extensibility [9], [10], arbitrary routing table capacity, and one-hop property [11]. GFRT [9] and PFRT [10] are examples of extensions to FRT-based structured overlays.…”

A method for designing proximity-aware routing algorithms for structured overlays

“…An FRT-based algorithm such as FRTChord [14], FRT-2-Chord [15] and one based on Kademlia [2] inherits the identifier spaces of its ancestor (e.g., Chord [1]) and defines a total order ≤ ID on the set of all routing table patterns based on node identifiers. And it works along the procedure defined by FRT.…”