ScholarlyCommons

Title

Fast Algorithms for Generating Discrete Random Variates With Changing Distributions

Author(s)

Sanguthevar Rajasekaran, University of Pennsylvania
Keith W. Ross, University of Pennsylvania

Document Type

Technical Report

Date of this Version

July 1991

Comments

University of Pennsylvania Department of Comptuer and Information Science Tecchnical Report No. MS-CIS-91-52.

Abstract

One of the most fundamental and frequently used operations in the process of simulating a stochastic discrete event system is the generation of a nonuniform discrete random variate. The simplest form of this operation can be stated as follows: Generate a random variable X which is distributed over the integers 1,2,...,n such that P(X = i) = p_i. A more difficult problem is to generate X when the p_i's change with time. For this case, there is a well-known algorithm which takes O(log n) time to generate each variate. Recently Fox [4] presented an algorithm that takes an expected o(log n) time to generate each variate under assumptions restricting the way the p_i's can change.

In this paper we present algorithm for discrete random variate generation that take an expected O(1) time to generate each variate. Furthermore, our assumptions on how the p_i's change are less restrictive than those of Fox. The algorithms are quite simple and can be fine-tuned to suit a wide variety of application. The application to the simulation of queueing networks is discussed in some detail.

Keywords

simulation, queueing networks, randomized algorithms

Recommended Citation

Sanguthevar Rajasekaran and Keith W. Ross, "Fast Algorithms for Generating Discrete Random Variates With Changing Distributions", . July 1991.