An Erlang loss queue with time-phased batch arrivals as a model for traffic control in communication networks
type: Item
instance of: scholarly article
title: An Erlang loss queue with time-phased batch arrivals as a model for traffic control in communication networks
zbMATH Open document ID: 1162.90402
DOI: 10.1155/2008/814740
author: J. Martínez
published in: Mathematical Problems in Engineering
publication date: 2009-06-11T00:00:00Z
full work available at URL: https://eudml.org/doc/55483
review text: Summary: A multiserver queueing model that does not have a buffer but has batch arrival of customers is considered. In contrast to the standard batch arrival, in which the entire batch arrives at the system during a single epoch, we assume that the customers of a batch (flow) arrive individually in exponentially distributed times. The service time is exponentially distributed. Flows arrive according to a stationary Poisson arrival process. The flow size distribution is geometric. The number of flows that can be simultaneously admitted to the system is under control. The loss of any customer from an admitted flow, with a fixed probability, implies termination of the flow arrival. Analysis of the sojourn time and loss probability of an arbitrary flow is performed.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 5564133
Wikidata QID: Q58646272
MaRDI profile type: Publication
OpenAlex ID: W1974539200
cites work: Erlang loss queueing system with batch arrivals operating in a random environment
cites work: Lack of invariant property of the Erlang loss model in case of MAP input
cites work: Q5393268
cites work: Q3256589
cites work: Q3227147
cites work: Q5818478
description: scientific article; zbMATH DE number 5564133