On the Resiliency of Randomized Routing Against Multiple Edge Failures
We study the Static-Routing-Resiliency problem, motivated by routing on the Internet: Given a graph G = (V,E), a unique destination vertex d, and an integer constant c > 0, does there exist a static and destination-based routing scheme such that the correct delivery of packets from any source s t...
| 主要な著者: | , , , , , , |
|---|---|
| その他の著者: | |
| フォーマット: | 論文 |
| 言語: | en_US |
| 出版事項: |
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
2018
|
| オンライン･アクセス: | http://hdl.handle.net/1721.1/113892 https://orcid.org/0000-0003-0536-0323 |