Home // ICNS 2023, The Nineteenth International Conference on Networking and Services // View article

A Topology Aggregation-based Approach for the Unsplittable Shortest Path Routing Problem

Authors:
Hamza Ben-Ammar
Jean-Michel Sanner

Keywords: Traffic engineering; Mixed Integer Linear Programming; Topology Aggregation; Algorithms.

Abstract:
The Unsplittable Shortest Path Routing (USPR) problem is one of the optimization problems that has been well studied in the field of traffic engineering for IP networks due to its importance for improving the network's Quality of Service (QoS). Given a directed graph representing the IP network and a set of commodities depicting the demands to be sent between its nodes, the USPR problem consists in identifying a set of routing paths and the associated administrative weights such that each commodity is routed along the unique shortest path between its origin and its destination following these weights. Due to the NP-hardness of this problem, we propose a topology aggregation-based approach to solve it, which consists in efficiently aggregating the network's graph to make the solving process more scalable. The experimental results show the efficiency of this proposal in terms of scalability and network's maximum load reduction compared to other methods from the state-of-the-art.

Pages: 1 to 6

Copyright: Copyright (c) IARIA, 2023

Publication date: March 13, 2023

Published in: conference

ISSN: 2308-4006

ISBN: 978-1-68558-052-0

Location: Barcelona, Spain

Dates: from March 13, 2023 to March 17, 2023