TL;DR
This paper presents a livelock-free routing algorithm applicable to any network, ensuring bounded delivery times, near-optimal performance under light loads, and graceful operation during congestion, with a focus on mathematical rigor.
Contribution
The paper introduces a mathematically rigorous livelock-free routing scheme that guarantees bounded delivery times and efficient performance across various network conditions.
Findings
Packets have an absolute upper bound on delivery time.
Under light loads, packets are delivered nearly optimally.
Network performance recovers gracefully after congestion clears.
Abstract
We give a livelock free routing algorithm for any allowed network. Unlike some other solutions to this problem: 1) packets entering the network have an absolute upper bound on the time to reach their destination; 2) under light loads, packets are delivered to their destinations in nearly optimal time; 3) packets with desired paths far away from congested areas will have routing times far shorter than packets wanting to access congested areas; 4) if the network becomes congested and later clears, the network operates just as it would have when it was initially under a light load. The main ideas of this note appear in a different form in my 1994 patent 5,369,745. This note adds to those results and makes them more mathematical.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Mobile Ad Hoc Networks · Cooperative Communication and Network Coding