1997Or TransactionsRequires access

Poisson Traffic Processes in RGSMP and Generalized Networks

Xuan Cheng

Open publisher page 0 citations

Abstract

In this paper, we present conditions under which the traffic processes in a generalized semi-Markov process with reallocation (RGSMP) are Poison processes, and givean easy-to-use criterion for the quasi-reversibility of queues which can be described byRGSMP's. By applying these results to a multiple class generalized network with generalservice time distributions, we prove that its stationary state distribution is of a productform and the traffic processes which represent the customers exiting the network arePoisson processes.

About this research paper

What this paper is about

In this paper, we present conditions under which the traffic processes in a generalized semi-Markov process with reallocation (RGSMP) are Poison processes, and givean easy-to-use criterion for the quasi-reversibility of queues which can be described byRGSMP's. By applying these results to a multiple class generalized network with generalservice time distributions, we prove that its stationary state distribution is of a productform and the traffic processes which represent the customers exiting the network arePoisson processes.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we present conditions under which the traffic processes in a generalized semi-Markov process with reallocation (RGSMP) are Poison processes, and givean easy-to-use criterion for the quasi-reversibility of queues which can be described byRGSMP's. By applying these results to a multiple class generalized network with generalservice time distributions, we prove that its stationary state distribution is of a productform and the traffic processes which represent the customers exiting the network arePoisson processes.

Key concepts: Queue, Poisson distribution, Markov process, Class (philosophy), Computer science, Traffic generation model, State (computer science), Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Poisson Traffic Processes in RGSMP and Generalized Networks — Research Paper | ScholarLens