Robustness of the Rotor–Router Mechanism
- Submitting institution
-
King's College London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 87274655
- Type
- D - Journal article
- DOI
-
10.1007/s00453-016-0179-y
- Title of journal
- ALGORITHMICA
- Article number
- -
- First page
- 869
- Volume
- 78
- Issue
- -
- ISSN
- 0178-4617
- Open access status
- Compliant
- Month of publication
- June
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
6
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The rotor-router mechanisms (a.k.a ‘Edge Ant Walk’ or ‘Propp Machine’) was proposed in 1990's as a deterministic alternative to random walks in graphs and has been applied to load balancing in distributed computing and graph exploration. This paper is a detailed study of the convergence time of rotor-router under various scenarios of partial control over the parameters of the process and potential faults, providing a number of new convergence bounds. This research informed work on applications of rotor-router (e.g. Erasmus School of Economics research paper EI2020-06 on decentralized policies for dispatching vehicles in a public transit system).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -