Asymptotic analysis of loss probability in a finite queue where one packet occupies as many places as its length

Bara Kim, Jeongsim Kim, In Suk Wee, Bong Dae Choi

Research output: Contribution to journalArticle

Abstract

We consider a discrete-time single server queue which models the input buffer of an IP switch/router. The packets arrive according to a batch Bernoulli process and the packet lengths (service times) are independent and identically distributed with a general distribution. We assume that the system has a finite buffer of size K. In contrast to ordinary queues where one packet occupies one place in the buffer, we assume that one packet occupies as many places as its length. We study an asymptotic behavior of the loss probability for this queueing system as the buffer size K tends to infinity, and then use this result to approximate the exact loss probability. Numerical examples show that the approximation is very accurate.

Original languageEnglish
Pages (from-to)209-223
Number of pages15
JournalPerformance Evaluation
Volume54
Issue number3
DOIs
Publication statusPublished - 2003 Nov

Keywords

  • Asymptotic analysis
  • Discrete-time queue
  • IP packet
  • IP switch/router
  • Loss probability
  • Packets of variable length

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Asymptotic analysis of loss probability in a finite queue where one packet occupies as many places as its length'. Together they form a unique fingerprint.

Cite this