Block renewal processes and their application to modeling

Hiroshi Toyoizumi; J. George Shanthikumar; Ronald W. Wolff

doi:10.15807/jorsj.41.53

Block renewal processes and their application to modeling

Hiroshi Toyoizumi^*, J. George Shanthikumar, Ronald W. Wolff

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

A new stochastic process called block renewal process (or G(m) process) is proposed for modeling auto-correlated arrival processes of queueing systems. This process can be modeled easily by the observable marginal distribution and global auto-correlation index of auto-correlated arrival process. This new process is very simple and tractable, so it is good for both simulation and numerical computation. We also discuss how to obtain analytically the steady-state distribution of queue length of a G(2)/M/1 queue.

Original language	English
Pages (from-to)	66-67
Number of pages	2
Journal	Journal of the Operations Research Society of Japan
Volume	41
Issue number	1
DOIs	https://doi.org/10.15807/jorsj.41.53
Publication status	Published - 1998 Mar
Externally published	Yes

ASJC Scopus subject areas

Decision Sciences(all)
Management Science and Operations Research

Access to Document

10.15807/jorsj.41.53

Cite this

@article{f737bb2444bd41688be118e371b047de,

title = "Block renewal processes and their application to modeling",

abstract = "A new stochastic process called block renewal process (or G(m) process) is proposed for modeling auto-correlated arrival processes of queueing systems. This process can be modeled easily by the observable marginal distribution and global auto-correlation index of auto-correlated arrival process. This new process is very simple and tractable, so it is good for both simulation and numerical computation. We also discuss how to obtain analytically the steady-state distribution of queue length of a G(2)/M/1 queue.",

author = "Hiroshi Toyoizumi and Shanthikumar, {J. George} and Wolff, {Ronald W.}",

year = "1998",

month = mar,

doi = "10.15807/jorsj.41.53",

language = "English",

volume = "41",

pages = "66--67",

journal = "Journal of the Operations Research Society of Japan",

issn = "0453-4514",

publisher = "Operations Research Society of Japan",

number = "1",

}

TY - JOUR

T1 - Block renewal processes and their application to modeling

AU - Toyoizumi, Hiroshi

AU - Shanthikumar, J. George

AU - Wolff, Ronald W.

PY - 1998/3

Y1 - 1998/3

N2 - A new stochastic process called block renewal process (or G(m) process) is proposed for modeling auto-correlated arrival processes of queueing systems. This process can be modeled easily by the observable marginal distribution and global auto-correlation index of auto-correlated arrival process. This new process is very simple and tractable, so it is good for both simulation and numerical computation. We also discuss how to obtain analytically the steady-state distribution of queue length of a G(2)/M/1 queue.

AB - A new stochastic process called block renewal process (or G(m) process) is proposed for modeling auto-correlated arrival processes of queueing systems. This process can be modeled easily by the observable marginal distribution and global auto-correlation index of auto-correlated arrival process. This new process is very simple and tractable, so it is good for both simulation and numerical computation. We also discuss how to obtain analytically the steady-state distribution of queue length of a G(2)/M/1 queue.

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

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

U2 - 10.15807/jorsj.41.53

DO - 10.15807/jorsj.41.53

M3 - Article

AN - SCOPUS:28844503276

SN - 0453-4514

VL - 41

SP - 66

EP - 67

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

IS - 1

ER -

Block renewal processes and their application to modeling

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this