SearcharxivSearch

arXiv subjects

Victor Grishchenko

Publications and source records attributed to Victor Grishchenko.

3 recordsLinked to original sources

Swarm consensus

The strength of gnomes lies in their coordinated action. Being small and subtle creatures themselves, the forest gnomes can form large swarms acting as one giant creature. This unusual defense strategy requires a lot of skill and training. Directing a swarm is not an easy task! Initially, gnomes used leader-based control algorithms, although those have been proven to be vulnerable to abuse and failure. After thorough research and study, gnomes developed their own leaderless consensus algorithm based on very simple rules. It is based on gossip in a network of a known diameter $d$. One of the gnomes proposes a plan which then spreads gnome to gnome. If there is an agreement, gnomes act \emph{all at once}. If there are conflicting plans (an extreme rarity), they try again. The resulting upper bound on the swarm's reaction time is its round-trip time $2dt$, where $t$ is the command relay time. The original algorithm is non-Byzantine; all gnomes must be sane and sober. While working on the algorithm, gnomes discovered \emph{swarm time}, a sibling concept to L.Lamport's logical time. That led to a Byzantine-ready version of the algorithm.

cs.DS

Chronofold: a data structure for versioned text

Chronofold is a replicated data structure for versioned text. It is designed for use in collaborative editors and revision control systems. Past models of this kind either retrofitted local linear orders to a distributed system (the OT approach) or employed distributed data models locally (the CRDT approach). That caused either extreme fragility in a distributed setting or egregious overheads in local use. Overall, that local/distributed impedance mismatch is cognitively taxing and causes lots of complexity. We solve that by using subjective linear orders locally at each replica, while inter-replica communication uses a distributed model. A separate translation layer insulates local data structures from the distributed environment. We modify the Lamport timestamping scheme to make that translation as trivial as possible. We believe our approach has applications beyond the domain of collaborative editing.

cs.DS

Locator/identifier split using the data link layer

The locator/identifier split approach assumes separating functions of a locator (i.e. topology--dependent attachment point address) and identifier (topology-independent unique identifier) currently both served by an IP address. This work is an attempt to redefine semantics of MAC address to make it a pure layer-2 locator instead of a pure globally-unique identifier. Such an exercise might be interesting from the standpoint of Ethernet scaling and Metro Ethernet technologies. From the global routing perspective, introduction of multihoming, traffic engineering and failover at the 2nd layer may reduce pressure on the 3rd layer.

cs.NI