Refine
Year of publication
- 2013 (1)
Document Type
- Master's Thesis (1)
Language
- English (1)
Has Fulltext
- yes (1)
Is part of the Bibliography
- no (1)
Institute
We present our implementation of Flexible Routing Tables (FRT) in the distributed
key-value store Scalaris. Classic routing table generators like Chord structure routing
tables by considering node identifiers only. Secondary requirements such as latency
properties are considered after the general structure, eliminating potential performance
gains. FRT aims to allow multiple requirements when creating routing tables. The concept
is based on lazy routing table entries learning and filtering entries when a routing table
is full. Entries are filtered such that the resulting table is best among all other
possible tables where one node was filtered. FRT uses a total order to define which of the
possible routing tables is best. We implemented two instances of FRT, namely FRT-Chord and
grouped FRT-Chord (GFRT-Chord). We compare our implementation with the existing
implementation of Chord in Scalaris and evaluate the advantages and disadvantages of more
flexible routing schemes.