Add to ORKGRecently 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
Simulation is a flexible means for assessment of the quality of service offered by a telecommunicatio...
A general loss network is considered in the limit as the arrival rates and link capacities become la...
Random access algorithms have proven to be very efficient in local area network environments with da...
Recently Rajasekaran and Ross [1] presented an algorithm that takes an expected 0(1) time to generat...
Random networks are frequently generated, for example, to investigate the effects of model parameter...
This paper considers simulation of large networks. The quantities of interest, such as system failur...
: We describe a new technique for simulations of large communication networks. This technique is bas...
Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phe...
The purpose of this work is to evaluate the perfonnance of a limited sensing random access algorithm...
One of the most fundamental and frequently used operations in the process of simulating a stochastic...
In modern packet-switched telecommunication systems, information (such as e-mail, sound, pictures) i...
Efficient stochastic simulation algorithms are of paramount importance to the study of spreading ph...
We consider a network supporting elastic traffic, where the service capacity is shared among the var...
This monograph focuses on rare events. Even though they are extremely unlikely, they can still occur...
This paper considers rare event simulation of large networks. Typical quantities of interest are sys...
Simulation is a flexible means for assessment of the quality of service offered by a telecommunicatio...
A general loss network is considered in the limit as the arrival rates and link capacities become la...
Random access algorithms have proven to be very efficient in local area network environments with da...
Recently Rajasekaran and Ross [1] presented an algorithm that takes an expected 0(1) time to generat...
Random networks are frequently generated, for example, to investigate the effects of model parameter...
This paper considers simulation of large networks. The quantities of interest, such as system failur...
: We describe a new technique for simulations of large communication networks. This technique is bas...
Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phe...
The purpose of this work is to evaluate the perfonnance of a limited sensing random access algorithm...
One of the most fundamental and frequently used operations in the process of simulating a stochastic...
In modern packet-switched telecommunication systems, information (such as e-mail, sound, pictures) i...
Efficient stochastic simulation algorithms are of paramount importance to the study of spreading ph...
We consider a network supporting elastic traffic, where the service capacity is shared among the var...
This monograph focuses on rare events. Even though they are extremely unlikely, they can still occur...
This paper considers rare event simulation of large networks. Typical quantities of interest are sys...
Simulation is a flexible means for assessment of the quality of service offered by a telecommunicatio...
A general loss network is considered in the limit as the arrival rates and link capacities become la...
Random access algorithms have proven to be very efficient in local area network environments with da...