Flexible routing tables: Designing routing algorithms for overlays based on a total order on a routing table set

Nagao, Hiroya; Shudo, Kazuyuki

doi:10.1109/p2p.2011.6038664

Cited by 14 publications

(16 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Combinations of PFRT and other extensions should be examined. GFRT [14], an extension of FRT takes account of groups of nodes and reduces communication between nodes. It should work with PFRT.…”

Section: Discussionmentioning

confidence: 99%

“…FRT [14] is a method of designing routing algorithms for structured overlays. FRT-based algorithms inherit the identifier spaces and distances utilized by existing routing algorithms, as well as gaining the advantageous features of FRT, compatibility with other extensions and broadened application domains.…”

Section: Frt-chordmentioning

confidence: 99%

“…FRT-Chord [14] is an FRT-based algorithm based on Chord, and thus consistent hashing and greedy routing are employed. However, a node n in FRT-Chord maintains only a single routing table E containing entries e i (i = 1, 2, .…”

Section: Frt-chordmentioning

confidence: 99%

“…In LPRS-Chord [8], which is one of proximityaware routing algorithms, LPRS is nearly independent from a base algorithm (e.g., Chord [1]), but it needs modification to be applied to Pastry [4] and Tapestry [6]. Thus we propose Proximity-aware Flexible Routing Tables (PFRT), a methodology to design proximity-aware routing algorithms, that introduces network proximity into Flexible Routing Tables (FRT) [14]. It does PNS.…”

Section: Introductionmentioning

confidence: 99%

“…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.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Miyao

Nagao

Shudo

2013

2013 IEEE Symposium on Computers and Communications (ISCC)

Self Cite

View full text Add to dashboard Cite

Abstract-In many structured overlays, nodes strictly maintain their routing tables using node identifiers. However, building routing tables while taking account of the physical network is difficult. We propose proximity-aware flexible routing tables (PFRT) in this paper as a method to systematically design proximityaware routing algorithms for structured overlays. PFRT was developed by extending the flexible routing tables (FRT) method such that network proximity is considered. Routing tables in FRTand PFRT-based algorithms are updated according to the order of the set of all routing table patterns. FRT-based algorithms define a total order based on node identifiers, whereas PFRTbased algorithms define two total orders based on node identifiers and network proximity. Because PFRT is a simple extension of FRT, PFRT-based algorithms also have many of the advantageous features of FRT. We extended Chord to design PFRT-Chord, which is a PFRT-based algorithm. Experimental results showed that PFRT-Chord preserves the expected FRT-derived properties and it could take account of network proximity.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Frt-chordmentioning

confidence: 99%

Section: Frt-chordmentioning

confidence: 99%