Self-Refining Skip Graph: A Structured Overlay Approaching to Ideal Skip Graph
| Autor: | Ryohei Banno, Masashi Hojo, Kazuyuki Shudo, Takafumi Kawaguchi |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Theoretical computer science
Ideal (set theory) Computer science Routing table Ordered graph Overlay network 020206 networking & telecommunications Topology (electrical circuits) 0102 computer and information sciences 02 engineering and technology Skip graph 01 natural sciences Computer Science::Hardware Architecture Graph bandwidth 010201 computation theory & mathematics Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering Node (circuits) Folded cube graph Hardware_ARITHMETICANDLOGICSTRUCTURES |
| Zdroj: | 2016 IEEE 40th Annual Computer Software and Applications Conference (COMPSAC). |
| DOI: | 10.1109/compsac.2016.188 |
| Popis: | In Skip Graph, each node constructs its routing table by choosing neighbor nodes based on its membership vector when a node joins or leaves. However, membership vectors are determined randomly, so nodes do not always compose an ideal topology of Skip Graph. This causes route length to be long. Therefore, we propose Self-Refining Skip Graph, a structured overlay where each node refines its routing table for an ideal topology of Skip Graph. Our proposed method shows shorter route length as approaching to an ideal topology while keeping the robustness caused by membership vectors. We confirmed in the evaluation that the topology approaches to an ideal one and the route length becomes shorter than Skip Graph. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|