A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning

Stan Zachary, Ilze Ziedins

Research output: Contribution to journalArticle

Abstract

This paper gives a refinement of the results of Hunt and Kurtz on the dynamical behavior of large loss networks. We introduce a Liapounov function technique which, under the limiting regime of Kelly, enables the unique identification of limiting dynamics in many applications. This technique considerably simplifies much previous work in this area. We further apply it to the study of the dynamical behavior of large single-resource loss systems under virtual partitioning, or dynamic trunk reservation, controls. We identify limiting dynamics under the above regime, describing the behavior of the number of calls of each type in the system. We show that all trajectories of these dynamics converge to a single fixed point, which we identify. We also identify limiting stationary behavior, including call acceptance probabilities.

Original languageEnglish
Pages (from-to)1-22
Number of pages22
JournalAnnals of Applied Probability
Volume12
Issue number1
Publication statusPublished - Feb 2002

Fingerprint

Trajectories

Keywords

  • Functional law of large numbers
  • Liapounov function
  • Loss network
  • Partitioning
  • Trunk reservation

Cite this

@article{c33fb244533f4fda84ccd44c98a9f425,
title = "A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning",
abstract = "This paper gives a refinement of the results of Hunt and Kurtz on the dynamical behavior of large loss networks. We introduce a Liapounov function technique which, under the limiting regime of Kelly, enables the unique identification of limiting dynamics in many applications. This technique considerably simplifies much previous work in this area. We further apply it to the study of the dynamical behavior of large single-resource loss systems under virtual partitioning, or dynamic trunk reservation, controls. We identify limiting dynamics under the above regime, describing the behavior of the number of calls of each type in the system. We show that all trajectories of these dynamics converge to a single fixed point, which we identify. We also identify limiting stationary behavior, including call acceptance probabilities.",
keywords = "Functional law of large numbers, Liapounov function, Loss network, Partitioning, Trunk reservation",
author = "Stan Zachary and Ilze Ziedins",
year = "2002",
month = "2",
language = "English",
volume = "12",
pages = "1--22",
journal = "Annals of Applied Probability",
issn = "1050-5164",
publisher = "Institute of Mathematical Statistics",
number = "1",

}

A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning. / Zachary, Stan; Ziedins, Ilze.

In: Annals of Applied Probability, Vol. 12, No. 1, 02.2002, p. 1-22.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning

AU - Zachary, Stan

AU - Ziedins, Ilze

PY - 2002/2

Y1 - 2002/2

N2 - This paper gives a refinement of the results of Hunt and Kurtz on the dynamical behavior of large loss networks. We introduce a Liapounov function technique which, under the limiting regime of Kelly, enables the unique identification of limiting dynamics in many applications. This technique considerably simplifies much previous work in this area. We further apply it to the study of the dynamical behavior of large single-resource loss systems under virtual partitioning, or dynamic trunk reservation, controls. We identify limiting dynamics under the above regime, describing the behavior of the number of calls of each type in the system. We show that all trajectories of these dynamics converge to a single fixed point, which we identify. We also identify limiting stationary behavior, including call acceptance probabilities.

AB - This paper gives a refinement of the results of Hunt and Kurtz on the dynamical behavior of large loss networks. We introduce a Liapounov function technique which, under the limiting regime of Kelly, enables the unique identification of limiting dynamics in many applications. This technique considerably simplifies much previous work in this area. We further apply it to the study of the dynamical behavior of large single-resource loss systems under virtual partitioning, or dynamic trunk reservation, controls. We identify limiting dynamics under the above regime, describing the behavior of the number of calls of each type in the system. We show that all trajectories of these dynamics converge to a single fixed point, which we identify. We also identify limiting stationary behavior, including call acceptance probabilities.

KW - Functional law of large numbers

KW - Liapounov function

KW - Loss network

KW - Partitioning

KW - Trunk reservation

UR - http://www.scopus.com/inward/record.url?scp=0036116140&partnerID=8YFLogxK

M3 - Article

VL - 12

SP - 1

EP - 22

JO - Annals of Applied Probability

JF - Annals of Applied Probability

SN - 1050-5164

IS - 1

ER -