Heavy-traffic approx­imations for a layered network with limited resources

  1. Angelos Aveklouris
  2. Maria Vlasiou
  3. Jiheng Zhang
  4. Bert Zwart

Abstract

 

HEAVY-TRAFFIC APPROXIMATIONS FOR A LAYERED NETWORK WITH LIMITED RESOURCES

Motivated by a web-server model, we present a queueing network consisting of two layers. The first layer incorporates the arrival of customers at a network of two single-server nodes. We assume that the interarrival and the service times have general distributions. Customers are served according to their arrival order at each node and after finishing their service they can re-enter at nodes several times for another service. At the second layer, active servers act as jobs that are served by a single server working at speed one in a processor-sharing fashion. We further assume that the degree of resource sharing is limited by choice, leading to a limited processor-sharing discipline. Our main result is a diffusion approximation for the process describing the number of customers in the system. Assuming a single bottleneck node and studying the system as it approaches heavy traffic, we prove a state-space collapse property.

 

Download article

This article

Probability and Mathematical Statistics

37, z. 2, 2017

Pages from 498 to 532

Other articles by author

Google Scholar

zamknij

Your cart (products: 0)

No products in cart

Your cart Checkout