Certification of Compact Low-Stretch Routing Schemes

Alkida Balliu, Pierre Fraigniaud

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Abstract

On the one hand, the correctness of routing protocols in networks is an issue of utmost importance for guaranteeing the delivery of messages from any source to any target. On the other hand, a large collection of routing schemes have been proposed during the last two decades, with the objective of transmitting messages along short routes, while keeping the routing tables small. Regrettably, all these schemes share the property that an adversary may modify the content of the routing tables with the objective of, e.g. blocking the delivery of messages between some pairs of nodes, without being detected by any node. In this paper, we present a simple certification mechanism which enables the nodes to locally detect any alteration of their routing tables.In particular, we show how to locally verify the stretch-3 routing scheme by Thorup and Zwick, presented in SPAA in 2001, by adding certificates of the same order of magnitude as the original routing tables. We also propose a new name-independent routing scheme using routing tables of size O˜(n−−√) bits at each node in n-node networks. This new routing scheme can be locally verified using certificates of O˜(n−−√) bits. Its stretch is 3 if using handshaking, and 5 otherwise.
Original languageEnglish
Pages (from-to)730-746
Number of pages17
JournalThe Computer Journal
Volume62
Issue number5
DOIs
Publication statusPublished - 2018
MoE publication typeA1 Journal article-refereed

Fingerprint

Dive into the research topics of 'Certification of Compact Low-Stretch Routing Schemes'. Together they form a unique fingerprint.

Cite this