The modern network aims to prioritize critical traffic over non-critical traffic and effectively
manage traffic flow. This necessitates proper buffer management to prevent the loss of …

In the online packet scheduling problem with deadlines (, for short), the goal is to schedule
transmissions of packets that arrive over time in a network switch and need to be sent across …

The knowledge of future partial information in the form of a lookahead to design efficient
online algorithms is a theoretically-efficient and realistic approach to solving computational …

Online packet scheduling with deadlines is one of the fundamental models in buffer
management. Recently, the author together with Chrobak, Jez, and Sgall (SODA 2019) …

Two packet scheduling algorithms for rechargeable sensor networks are proposed based on
the signal to interference plus noise ratio model. They allocate different transmission slots to …

Uncertainty surrounds us daily, indicating the need for effective decision-making strategies.
In recent years, the large amount of available data has accelerated the development of …

In an one-way currency trading model, a player trades all his dollars to yen with the objective
of maximizing the total amount of yen got at the end of this game. Exchange rates from dollar …

The bounded delay buffer management problem, which was proposed by Kesselman et
al.(STOC 2001 and SIAM Journal on Computing 33 (3), 2004), is an online problem focusing …

요 약본 논문은 동일한 실행시간 (processing time) 과 마감시간 (deadline) 을 가지는 가중치
작업들이 시간이 지남에 따라도착할 때 하나의 머신 (machine) 에 스케줄 하는 문제를 다룬다 …

We study online scheduling policies for buffer management models, in which packets are
arriving over time to a buffer of a network switch to be sent through its single output port …