We describe a model for competitive online scheduling algorithms. Two servers, each with a single observable queue, compete for customers. Upon arrival, each customer strategically chooses the queue with minimal expected wait time. Each scheduler wishes to maximize its number of customers, and can strategically select which scheduling algorithm, such as First-Come-First-Served (FCFS), to use fo...

Abstract The Internet-of-things (IoT) plays a significant role in healthcare monitoring, where the IoT Cloud integration introduces many new opportunities for real-time remote monitoring of patient. Task scheduling is one major challenges cloud environment. Solving that problem reduces delay, missed tasks, and failure rate, increases guarantee ratio. This paper proposes task allocation techniqu...

Recently it was shown that, contrary to expectations, the First-Come-First-Served (FCFS) scheduling algorithm can be stochastically improved upon by a called Nudge for light-tailed job size distributions. partitions jobs into 4 types based on their size, say small, medium, large and huge jobs. operates identical FCFS, except that whenever small arrives finds waiting at back of queue, swaps with...

Follicular cystic ovary (FCO) is one of the most frequently diagnosed ovarian diseases and is a major cause of reproductive failure in mammalian species. However, the mechanism by which FCO is induced remains unclear. Genetic alterations which affect the functioning of many kinds of cells and/or tissues could be present in cystic ovaries. In this study, we performed a comparison analysis of gen...

We study the packet dispersion phenomenon that a traffic flow experiences when it passes through a router. We show that when there are competing flows and the router schedules packets first-come-first-served (FCFS), the dispersion is not described well by the bottleneck spacing effect. We therefore introduce the term FCFS-spacing effect. We also show that for a router implementing weighted fair...

One-way Vehicle Sharing Systems (VSS), such as Vélib’ Paris, have a poor performance without regulation. We want to improve the efficiency of VSS using design strategies or pricing as incentive. Stochastic models are intractable for the size of systems we want to tackle. We therefore discuss a scenario-based approach, i.e. off-line deterministic optimization problems on a given stochastic reali...

IfN is a queueing network and cs is the mean service time at server s of N , de ne NC,FCFS (respectively, NE,FCFS) to be the queueing network N where the service time at server s is a constant cs (respectively, an independent exponentially distributed random variable with mean cs) and the packets are served in a rst-comerst-served order. Recently, Harchol-Balter and Wolfe introduced the problem...

Job scheduling in data centers can be considered from a cyber-physical point of view, as it affects the data center’s computing performance (i.e. the cyber aspect) and energy efficiency (the physical aspect). Driven by the growing needs to green contemporary data centers, this paper uses recent technological advances in data center virtualization and proposes cyber-physical, spatio-temporal (i....

This memo describes First-Come, First-Served Source Address Validation Improvement (FCFS SAVI), a mechanism that provides source address validation for IPv6 networks using the FCFS principle. The proposed mechanism is intended to complement ingress filtering techniques to help detect and prevent source address spoofing.