A φ-Competitive Algorithm for Scheduling Packets with Deadlines

07/18/2018
by   Pavel Veselý, et al.
0

In the online packet scheduling problem with deadlines (PacketScheduling, for short), the goal is to schedule transmissions of packets that arrive over time in a network switch and need to be sent across a link. Each packet p has a deadline d_p, representing its urgency, and a non-negative weight w_p, that represents its priority. Only one packet can be transmitted in any time slot, so, if the system is overloaded, some packets will inevitably miss their deadlines and be dropped. In this scenario, the natural objective is to compute a transmission schedule that maximizes the total weight of packets which are successfully transmitted. The problem is inherently online, with the scheduling decisions made without the knowledge of future packet arrivals. The central problem concerning PacketScheduling, that has been a subject of intensive study since 2001, is to determine the optimal competitive ratio of online algorithms, namely the worst-case ratio between the optimum total weight of a schedule (computed by an offline algorithm) and the weight of a schedule computed by a (deterministic) online algorithm. We solve this open problem by presenting a ϕ-competitive online algorithm for PacketScheduling (where ϕ≈ 1.618 is the golden ratio), matching the previously established lower bound.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2020

Randomized Two-Valued Bounded Delay Online Buffer Management

In the bounded delay buffer management problem unit size packets arrive ...
research
11/30/2022

Two-sided Delay Constrained Scheduling: Managing Fresh and Stale Data

Energy or time-efficient scheduling is of particular interest in wireles...
research
05/07/2019

Online and Offline Greedy Algorithms for Routing with Switching Costs

Motivated by the use of high speed circuit switches in large scale data ...
research
04/28/2022

Weighted Packet Selection for Rechargeable Links: Complexity and Approximation

We consider a natural problem dealing with weighted packet selection acr...
research
06/30/2018

An optimal algorithm for 2-bounded delay buffer management with lookahead

The bounded delay buffer management problem, which was proposed by Kesse...
research
05/11/2023

Learning-Augmented Online Packet Scheduling with Deadlines

The modern network aims to prioritize critical traffic over non-critical...
research
05/17/2022

Scheduling in Wireless Networks using Whittle Index Theory

We consider the problem of scheduling packet transmissions in a wireless...

Please sign up or login with your details

Forgot password? Click here to reset