Ilya Nikolaevskiy

TL;DR: This paper embarked upon a systematic algorithmic study of the resiliency of forwarding tables in a variety of models (i.e., deterministic/probabilistic routing, with packets-header-rewriting, with packet-duplication), and shows that resiliencies to four simultaneous link failures, with limited path stretch, can be achieved without any packet modification/duplications or randomization.

TL;DR: This work embark upon a systematic algorithmic study of the resiliency of immediate failover in a variety of models (with/without packet marking/duplication, etc.) and leverages the findings to devise new schemes for immediate fail over and show that these outperform existing approaches.

TL;DR: In this article, the authors study the Static-Routing-Resiliency problem, motivated by routing on the Internet, and propose a randomized routing algorithm that has expected number of hops O(|V|k) if at most k-1 edges fail, which reduces to O(V|) if only a fraction t of the links fail.

TL;DR: A reference architectural model is studied that aims at intelligent utilization of personal mobile data in generic health services and employs the smart spaces paradigm with its prominent technologies adopted from the Internet of Things (IoT) and Semantic Web.

TL;DR: Both positive and negative results are presented that relate the edge-connectivity of a graph, i.e., the minimum number of edges whose deletion partitions $G$, to its resiliency.