Analysis of join-the-shortest-queue routing for web server farms

Gupta, Varun; Balter, Mor Harchol; Sigman, Karl; Whitt, Ward

doi:10.1016/j.peva.2007.06.012

Cited by 194 publications

(151 citation statements)

References 31 publications

Supporting

Mentioning

145

Contrasting

Order By: Relevance

“…There exists an extensive literature on dispatching policies and their optimality [9,26,27,35,36,37,42,46]. Among the dispatching policies, the join-the-shortest-queue (JSQ) policy has received considerable attention [5,6,10,19,20,23,24,28,30,44,45]. The JSQ policy in some scenarios has been proven to be the optimal policy; on the one hand it minimizes the customers mean waiting time [25] and on the other hand it stochastically maximizes the number of customers served by time t, t > 0 [43].…”

Section: Introductionmentioning

confidence: 99%

The shorter queue polling model

et al. 2013

View full text Add to dashboard Cite

We consider a two-queue polling model in which customers upon arrival join the shorter of two queues. Customers arrive according to a Poisson process and the service times in both queues are independent and identically distributed random variables having the exponential distribution. The two-dimensional process of the numbers of customers at the queue where the server is and at the other queue is a two-dimensional Markov process. We derive its equilibrium distribution using two methodologies: the compensation approach and a reduction to a boundary value problem.

show abstract

Section: Introductionmentioning

confidence: 99%

The shorter queue polling model

et al. 2013

View full text Add to dashboard Cite

show abstract

“…This property of JSQ was first observed and heavily investigated in [22] (for a system without background streams). Obviously using our file splitting rule and taking α = 0 or 1 yields two multi-class PS queues which are known to be exactly insensitive (one of the two queues is single class).…”

Section: Mean Behaviormentioning

confidence: 88%

“…In [22], the authors investigate the same queueing model in the context of web-server farms. A slight difference is that they do not consider background streams.…”

Section: Related Workmentioning

confidence: 99%

Optimal File Splitting for Wireless Networks with Concurrent Access

Hoekstra

Mei

Nazarathy

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The fundamental limits on channel capacity form a barrier to the sustained growth on the use of wireless networks. To cope with this, multi-path communication solutions provide a promising means to improve reliability and boost Quality of Service (QoS) in areas that are covered by a multitude of wireless access networks. Today, little is known about how to effectively exploit this potential. Motivated by this, we consider N parallel communication networks, each of which is modeled as a processor sharing (PS) queue that handles two types of traffic: foreground and background. We consider a foreground traffic stream of files, each of which is split into N fragments according to a fixed splitting rule (α1, . . . , αN ), where P αi = 1 and αi ≥ 0 is the fraction of the file that is directed to network i. Upon completion of transmission of all fragments of a file, it is re-assembled at the receiving end. The background streams use dedicated networks without being split. We study the sojourn time tail behavior of the foreground traffic. For the case of light foreground traffic and regularly varying foreground filesize distributions, we obtain a reduced-load approximation (RLA) for the sojourn times, similar to that of a single PS-queue. An important implication of the RLA is that the tail-optimal splitting rule is simply to choose αi proportional to ci − ρi, where ci is the capacity of network i and ρi is the load offered to network i by the corresponding background stream. This result provides a theoretical foundation for the effectiveness of such a simple splitting rule. Extensive simulations demonstrate that this simple rule indeed performs well, not only with respect to the tail asymptotics, but also with respect to the mean sojourn times. The simulations further support our conjecture that the same splitting rule is also tail-optimal for non-light foreground traffic. Finally, we observe near-insensitivity of the mean sojourn times with respect to the file-size distribution.

show abstract

“…One of these dynamic algorithms, Joint Shortest Queue (JSQ), is an often used selection algorithm for server farms [28] which only considers the server queue size. When a request arrives on a selection component it is assigned to the server with the least requests in its queue to minimize the mean response time on every server [29].…”

Section: Benchmark Algorithmsmentioning

confidence: 99%

QuLa: Service Selection and Forwarding Table Population in Service-Centric Networking Using Real-Life Topologies

Smet

Dhoedt

Simoens

2016

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

View full text Add to dashboard Cite

Abstract-The amount of services located in the network has drastically increased over the last decade which is why more and more datacenters are located at the network edge, closer to the users. In the current Internet it is up to the client to select a destination using a resolution service (Domain Name System, Content Delivery Networks ...). In the last few years, research on Information-Centric Networking (ICN) suggests to put this selection responsibility at the network components; routers ¿nd the closest copy of a content object using the content name as input.We extend the principle of ICN to services; service routers forward requests to service instances located in datacenters spread across the network edge. To solve this problem, we ¿rst present a service selection algorithm based on both server and network metrics. Next, we describe a method to reduce the state required in service routers while minimizing the performance loss caused by this data reduction. Simulation results based on real-life networks show that we are able to ¿nd a near-optimal load distribution with only minimal state required in the service routers.

show abstract

Analysis of join-the-shortest-queue routing for web server farms

Cited by 194 publications

References 31 publications

The shorter queue polling model

The shorter queue polling model

Optimal File Splitting for Wireless Networks with Concurrent Access

QuLa: Service Selection and Forwarding Table Population in Service-Centric Networking Using Real-Life Topologies

Contact Info

Product

Resources

About