Skip to main navigation Skip to search Skip to main content

Queue size in a BMAP queue with finite buffer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Citations (Scopus)

Abstract

The paper presents an analysis of the queue size distribution in a finite-buffer queue fed by a BMAP (Batch Markovian Arrival Process). In particular, the time-dependent and steady-state solutions are given as closed-form formulas. In addition, computational issues are discussed and a numerical example based on IP traffic is presented1.

Original languageEnglish
Title of host publicationNext Generation Teletraffic and Wired/Wireless Advanced Networking, 6th International Conference, NEW2AN 2006, Proceedings
PublisherSpringer Verlag
Pages200-210
Number of pages11
ISBN (Print)3540344292, 9783540344292
DOIs
Publication statusPublished - 2006
Event6th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking, NEW2AN 2006 - St. Petersburg, Russian Federation
Duration: 29 May 2005 → 2 Jun 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4003 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking, NEW2AN 2006
Country/TerritoryRussian Federation
CitySt. Petersburg
Period29/05/05 → 2/06/05

Keywords

  • BMAP
  • Finite-buffer queue
  • Performance evaluation
  • Teletraffic modeling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Queue size in a BMAP queue with finite buffer'. Together they form a unique fingerprint.

Cite this