Breaking the VLB Barrier for Oblivious Reconfigurable Networks

T Wilson, D Amir, N Saran, R Kleinberg… - Proceedings of the 56th …, 2024 - dl.acm.org
In a landmark 1981 paper, Valiant and Brebner gave birth to the study of oblivious routing
and, simultaneously, introduced its most powerful and ubiquitous method: Valiant load …

[PDF][PDF] Polylog-Competitive Deterministic Local Routing and Scheduling

B Haeupler, S Patel, A Roeyskoe, C Stein… - Proceedings of the 56th …, 2024 - dl.acm.org
This paper addresses point-to-point packet routing in undirected networks, which is the most
important communication primitive in most networks. The main result proves the existence of …

Electrical Flows for Polylogarithmic Competitive Oblivious Routing

G Goranci, M Henzinger, H Räcke, S Sachdeva… - arXiv preprint arXiv …, 2023 - arxiv.org
Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for
selecting routing paths within a network. Existing oblivious routing schemes with …

Improving Oblivious Reconfigurable Networks with High Probability

T Wilson, D Amir, V Shrivastav, R Kleinberg… - arXiv preprint arXiv …, 2023 - arxiv.org
Oblivious Reconfigurable Networks (ORNs) use rapidly reconfiguring switches to create a
dynamic time-varying topology. Prior theoretical work on ORNs has focused on the tradeoff …

Throughput and Latency in Reconfigurable Networks

T Wilson - 2024 - search.proquest.com
Oblivious routing has a long history in both the theory and practice of networking. In this
dissertation, we initialize the formal study of oblivious routing in the context of reconfigurable …

Reduced Competitive Ratio of Sparse Semi-oblivious Routing Using Social Spider Algorithm

A Dhiman, S Thakur, A Kumar, DP Mahato - International Conference on …, 2023 - Springer
Significant network performance and congestion management implications make efficient
packet routing in computer networks a fundamental challenge. An approach to tackle this is …