Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T01:48:11.444Z Has data issue: false hasContentIssue false

On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory

Published online by Cambridge University Press:  01 July 2016

Benjamin Melamed*
Affiliation:
Northwestern University
*
∗ Postal address: Department of Industrial Engineering and Management Science, Northwestern University, Evanston, Illinois 60201, U.S.A.

Abstract

This paper considers a regular Markov process with continuous parameter, countable state space, and stationary transition probabilities, and defines a class of traffic processes over it. The possibility that multiple traffic processes constitute mutually independent Poisson processes is investigated.

A variety of independence conditions on a traffic process and the underlying Markov process are shown to lead to Poisson-related properties; these conditions include weak pointwise independence, and pointwise independence. Some examples of queueing-theoretic applications are given.

For the class of traffic processes considered here in a queueing-theoretic context, Muntz's MM property, Gelenbe and Muntz's notion of completeness, and Kelly's notion of quasi-reversibility are shown to be essentially equivalent to pointwise independence of traffic and state. The relevance of the theory to queueing network decomposition is pointed out.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 1979 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable