Offline Algorithms for Several Network Design, Clustering and QoS Optimization Problems

TL;DR

This paper introduces novel offline algorithms for various network design, clustering, and QoS optimization problems, providing optimal or near-optimal solutions for reliability, latency, and network topology design.

Contribution

It presents new offline algorithms for multiple network optimization problems, including reliability, latency, and clustering, many of which are optimal or near-optimal.

Findings

Algorithms for backup shortest paths improve reliability.

Network upgrades reduce path latency effectively.

Optimal clustering algorithms for static and mobile networks.

Abstract

In this paper we address several network design, clustering and Quality of Service (QoS) optimization problems and present novel, efficient, offline algorithms which compute optimal or near-optimal solutions. The QoS optimization problems consist of reliability improvement (by computing backup shortest paths) and network link upgrades (in order to reduce the latency on several paths). The network design problems consist of determining small diameter networks, as well as very well connected and regular network topologies. The network clustering problems consider only the restricted model of static and mobile path networks, for which we were able to develop optimal algorithms.