We consider an extremely broad class of M/G/1 scheduling policies called SOAP: Schedule
Ordered by Age-based Priority. The SOAP policies include almost all scheduling policies in …

Queueing delays are ubiquitous in many domains, including computer systems, service
systems, communication networks, supply chains, and transportation. Queueing and …

While the (Egalitarian) Processor-Sharing (PS) discipline offers crucial insights in the
performance of fair resource allocation mechanisms, it is inherently limited in analyzing and …

In many theoretical works, the benefits of size-based scheduling disciplines have been
proved. The Foreground–Background discipline (or Least Attained Service (LAS)) and the …

Data center networks undergo the coexistence of latency-sensitive mice flows and
bandwidth-intensive elephant flows. Jointly optimizing the performance of both traffic classes …

Aged based scheduling policies, as proposed for network routers or links, give priority to
packets belonging to connections having sent a smaller volume of data. Examples of such …

Size-based scheduling policies have been widely studied in the literature, and their interest
in networking applications has been huge in the last decade. These policies consist in …

Recently proposed approaches to minimize the Flow Completion Time (FCT) in data centers
do not require any a-priory information about the flow size, thus appear to be both practical …

We study the Processor Sharing queueing model with a hyper-exponential service time
distribution and Poisson batch arrival process. In the case of the hyper-exponential service …

In this paper we propose evaluation models and calculate range of potential gains for
enhancing the average web-browsing QoE of all the users in a mobile network with given …