Datacenters are the main infrastructure on top of which cloud computing services are offered. Such infrastructure may be shared by a large number of tenants and applications generating a spectrum of datacenter traffic. Delay sensitive applications and applications with specific Service Level Agreements (SLAs), generate deadline constrained flows, while other applications initiate flows that are...

In this paper, we derive a statistical delay guarantee of the generalized Virtual Clock scheduling algorithm. We define the concept of an equivalent fluid and packet source and prove a theorem that relates the departure time of a packet in a fluid FCFS multiplexor to its departure time in a packet multiplexor that uses generalized Virtual Clock algorithm for scheduling packets. This theorem ena...

All intensively studied and widely applied inventory control policies satisfy demand in accordance with the First-Come-First-Served (FCFS) rule, whether this demand is in backorder or not. Interestingly, this rule is sub-optimal when the fill-rate is constrained or when the backorder cost structure includes fixed costs per backorder and costs per backorder per unit time. In this paper we study ...

Consider two servers of equal service capacity, one serving in a first-come first-served order (FCFS), and the other serving its queue in random order. Customers arrive as a Poisson process and each arriving customer observes the length of the two queues and then chooses to join the queue that minimizes its expected queueing time. Assuming exponentially distributed service times, we numerically...

We present upper and lower bounds for the tail distribution of the stationary waiting time D in the stable GI/GI/s FCFS queue. These bounds depend on the value of the traffic load ρ which is the ratio of mean service and mean interarrival times. For service times with intermediate regularly varying tail distribution the bounds are exact up to a constant, and we are able to establish a “principl...

We apply simulation to evaluate the performance of scheduling according to an alternating FCFS/SJF service order, in particular concerning performance metrics other than delay. Metrics related to social justice, also referred to as quantitative fairness measures, are investigated. We focus on two types of situations that have been previously identified to provoke and increase queued customers’ ...

In this paper we study the eeect of the output link scheduling discipline of an ATM switch on the ability of an ATM LAN to admit real-time connections. Three output link scheduling policies are studied: First Come First Served (FCFS), Round Robin (RR), and Packet-by-packet Generalized Processor Sharing (PGPS). We derive connection admission criteria for the three scheduling policies. To evaluat...

In 2022, a new sea lock at IJmuiden is expected to open, permitting an increase in marine traffic of larger ships from the port. interest facilitating operations, we evaluate impact current first-come, first-served (FCFS) admittance policy context berth allocation for wet bulk terminal Four model types are constructed: optimal FCFS; no FCFS with fixed arrival times; 48-h time relaxation; and co...