Random Walks in Routing Landscapes
T. Michalareas, L. Sacks
Abstract
In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how they can help us on the evaluation of the problem difficulty and the generation of effective algorithms. We also present the random walk statistical technique to evaluate the main properties of those landscapes and a number of examples to demonstrate the use of the method.
Create a lesson
Related papers
Tutorial on Closed-Loop and Application-Aware Digital Twins for Future Wireless Networks
Yuchen Liu, Sara Garcia Sanchez, Mingzhe Chen et al.
Clock-Free Stochastic Scheduling for Real-Time Synchronized Content Delivery
Xuan Wang, Xiaoyi Wu, Ying Sun et al.
Conflict-Aware Autonomous Resource Orchestration for 5G Edge Slicing Using Multi-Agent Systems and LLMs
Nathan R. Prediger, Rodrigo Moreira, Juliano Araujo Wickboldt et al.
Stackelberg Game with Multi-Agent Transformer for ISRS-Aware Resource Re-optimization in Multi-Band Optical Networks
Jiaxin Liu, Rentao Gu, Miao Zhu et al.
Energy-Aware Agentic Orchestration for Multi-Site Service Deployment
Rodrigo Moreira, Alisson Chaves, Larissa F. Rodrigues Moreira et al.
RADIUS-Assisted Companion PSK Discovery: Enabling WPA3-SAE in Externally Authenticated Multi-PSK (ePSK / MPSK / DPSK / iPSK / PPSK) Deployments
Azif Abdul Salam Kolisam Beevi, Anil Kumar Reddy, Niraj Lochan Mahapatra