Algorithmic Aspects of Several Data Transfer Service Optimization Problems

TL;DR

This paper investigates various optimization problems in data transfer services, proposing new algorithms for server placement, packet sequencing, and scheduling to improve efficiency in large-scale data management.

Contribution

It introduces novel algorithmic solutions for server location, packet sequencing, and scheduling problems in data transfer services, addressing key efficiency challenges.

Findings

New algorithms for server location in path networks

Optimized packet sequencing methods

Efficient packet scheduling with minimal makespan

Abstract

Optimized data transfer services are highly demanded nowadays, due to the large amounts of data which are frequently being produced and accessed. In this paper we consider several data transfer service optimization problems (optimal server location in path networks, optimal packet sequencing and minimum makespan packet scheduling), for which we provide novel algorithmic solutions.