Publication | Closed Access
Statistical optimization of dynamic importance sampling parameters for efficient simulation of communication networks
91
Citations
23
References
1993
Year
EngineeringNetwork PlanningNetwork AnalysisComplex SystemsSimulationStochastic AnalysisDiscrete-event SimulationQueueing TheoryDynamic ImportanceOperations ResearchStochastic SimulationDynamic NetworkStochastic ProcessesStochastic NetworkSystems EngineeringModeling And SimulationNetwork OptimizationRare EventsComputer EngineeringComputer ScienceCommunication NetworksStatistical OptimizationQueueing SystemsNetwork SimulationStochastic ModelingImportance SamplingNetwork SciencePerformance ModelingQueuing TheoryResource Optimization
Importance sampling (IS) is a powerful method for reducing simulation run times when estimating the probabilities of rare events in communication systems using Monte Carlo simulation and is made feasible and effective for the simulation of networks of queues by regenerative techniques. However, using the most favorable IS settings very often makes the length of regeneration cycles infinite or impractically long. To address this problem, a methodology that uses IS dynamically within each regeneration cycle to drive the system back to the regeneration state after an accurate estimate has been obtained is discussed. A statistically based technique for optimizing IS parameter values for simulations of queueing systems, including complex systems with bursty arrival processes, is formulated. A deterministic variant of stochastic simulated annealing (SA), called mean field annealing (MFA), is used to minimize statistical estimates of the IS estimator variance. The technique is demonstrated by evaluating blocking probabilities.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
| Year | Citations | |
|---|---|---|
Page 1
Page 1