Efficient Simulation of Large-Scale Loss Networks

Loading...
Thumbnail Image
Penn collection
Technical Reports (CIS)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Prindiville, Mark
Rajasekaran, Sanguthevar
Ross, Keith W
Contributor
Abstract

Recently Rajasekaran and Ross [1] presented an algorithm that takes an expected 0(1) time to generate a nonuniform discrete random variate. In this paper we discuss how this algorithm can be employed in the efficient simulation of large-scale telephone networks. In a simulation based upon a standard event-list approach, the generation of a new event in the systems take 0(log n) time. With this new algorithm, event generation becomes an 0(1) process, and simulation times for large networks can be reduced.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
1991-09-01
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
University of Pennsylvania Department of Computer and Information Sciences Technical Report No. MS-CIS-91-62.
Recommended citation
Collection