Presentation 1999/6/18
A diffusion approximation for branching Poisson process input queueing system
Yoshitaka Takahashi, Ken'ich Kawanishi,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper we propose a new mean-delay approximate formula for a single-server queueing system with branching Poisson process (BPP) input, arising out of teletraffic management server performance issues. It is hard to analyze the BPP input queueing system, since the BPP results in a non-renewal process. Here, applying a diffusion approximation technique enables us to obtain an explicit formula for the mean-delay time. We present numerical examples and comparisons with simulation as wrell as the previous approximation results.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) teletraffic server performance issues / branching Poisson process / queueing theory / diffusion approximation.
Paper # IN99-26
Date of Issue

Conference Information
Committee IN
Conference Date 1999/6/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Networks (IN)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A diffusion approximation for branching Poisson process input queueing system
Sub Title (in English)
Keyword(1) teletraffic server performance issues
Keyword(2) branching Poisson process
Keyword(3) queueing theory
Keyword(4) diffusion approximation.
1st Author's Name Yoshitaka Takahashi
1st Author's Affiliation NTT Service Integration Laboratories()
2nd Author's Name Ken'ich Kawanishi
2nd Author's Affiliation NTT Service Integration Laboratories
Date 1999/6/18
Paper # IN99-26
Volume (vol) vol.99
Number (no) 127
Page pp.pp.-
#Pages 7
Date of Issue