Non-Asymptotic Performance Analysis of Size-Based Routing Policies

A class of equivalent idle-time-order-based routing policies for heterogeneous multi-server systems

We consider an M/M/N/K/FCFS system (N>0, K>=N), where the servers operate at (possibly) heterogeneous service rates. In this situation, the steady state behavior depends on the routing policy that is used to select which idle server serves the next job in queue. We define a class of idle-time-order-based policies (including, for example, Longest Idle Server First (LISF)) and show that all policies in this class result in the same steady state behavior. In particular, they are all equivalent to the naive Random routing policy.

Optimal routing in two-queue polling systems

We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a Poisson process. We study the control problem of how arrivals should be routed to the two queues in order to minimize expected waiting costs and characterize individually and socially optimal routing policies under three scenari…

Universal Routing in Multi-hop Radio Networks

In this article we introduce a new model to study stability in multi-hop wireless networks in the framework of adversarial queueing. In such a model, a routing protocol consists of three components: a transmission policy, a scheduling policy to select the packet to transmit form a set of packets parked at a node, and a hearing control mechanism to coordinate transmissions with scheduling. For such a setting, we propose a definition of universal stability that takes into account not only the scheduling policies (as in the standard wireline adversarial model), but also the transmission policies.…

Sensitivity of Mean-Field Fluctuations in Erlang loss models with randomized routing

In this paper, we study a large system of $N$ servers each with capacity to process at most $C$ simultaneous jobs and an incoming job is routed to a server if it has the lowest occupancy amongst $d$ (out of N) randomly selected servers. A job that is routed to a server with no vacancy is assumed to be blocked and lost. Such randomized policies are referred to JSQ(d) (Join the Shortest Queue out of $d$) policies. Under the assumption that jobs arrive according to a Poisson process with rate $Nλ^{(N)}$ where $λ^{(N)}=σ-\fracβ{\sqrt{N}}$, $σ\in\mb{R}_+$ and $β\in\mb{R}$, we establish functional c…

利用跨数据中心广域网络的自适应路由以最小化流完成时间

Minimizing Flow Completion Times using Adaptive Routing over Inter-Datacenter Wide Area Networks

本文提出一种自适应路由方法，通过根据网络状态和流属性动态分配路径，减少带宽使用和流完成时间，提升跨数据中心网络效率。