Simulating large-scale networks with analytical models

International Journal of Simulation: Systems, Science and Technology

Volumn 6, Issue 1-2, 2005, Pages 24-31

  Scheidegger, Matthias ^a   Baumgartner, Florian ^a   Braun, Torsten ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Analytical and numerical simulation; Queuing systems and network models; Stochastic simulation

Indexed keywords

DISCRETE EVENT SIMULATION; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

EVALUATION RESULTS; HIGH-LEVEL ABSTRACTION; LARGE-SCALE NETWORK; MODEL APPROACH; NETWORK MODELS; PACKET-BASED; SCALABILITY ISSUE; STOCHASTIC SIMULATIONS;

ANALYTICAL MODELS;

EID: 72449133128     PISSN: 14738031     EISSN: 1473804X     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Ahn J. S. and Danzig P. B. 1996, “Packet network simulation: speedup and accuracy versus timing granularity.” In IEEE/ACM Transactions on Networking 4, No. 5, 743-757.
2. Ammar M. H., Riley G. F., and Fujimoto R. M. 1999, “A generic framework for parallelization of network simulations.” In MASCOTS’99 (College Park, MD).
3. Bartoli M., Baumgartner F., Christof B., Braun T., Kardos S., Olandi F., Scheidegger M. and Seger J. 2004, “The intermon simulation framework.” In Vidács, A., ed.: International Workshop on Inter- Domain Performance and Simulations, Budapest, Hungary, 130-139
4. Chandy K. M. and Misra J. 1981, “Asynchronous distributed simulation via a sequence of parallel computations.” In Communications of the ACM 11, No. 24, 198-205.
5. Cooley J. W. and Tukey J. W. 1965, “An algorithm for machine calculation of complex Fourier series.” In Math. Comp 19, 297-301.
6. Floyd S. and Jacobson V. 1993, “Random early detection gateways for congestion avoidance.” In IEEE/ACM Transactions on Networking.
7. Guo Y., Gong W., and Towsley D. 2000, “Timestepped hybrid simulation (TSHS) for large scale networks.” In Proceedings of IEEE Infocom.
8. Heindl A. and Telek M. 2002, “Output models of MAP/PH/1(/K) queues for an efficient network decomposition.” In Performance Evaluation 49, 321-339.
9. Klemm A., Lindemann C., and Lohmann M. 2003, “Modeling IP traffic using the Batch Markovian Arrival Process.” In Performance Evaluation 52, 149-173.
10. Liu B., Guo Y., Kurose J., Towsley D., and Gong W. 1999, “Fluid simulation of large scale networks: Issues and tradeoffs.” In PDPTA’99 (Las Vegas, NV), 2136-2142.
11. Liu B., Figueirido D. R., Guo Y., J. Kurose, and Towsley D. 2001, “A study of networks simulation efficiency: Fluid simulation vs. packet-level simulation.” In Proceedings of IEEE Infocom.
12. Sadre R., Haverkort B., and Ost A. 1999, “An efficient and accurate decomposition method for open finite and infinite-buffer queueing networks.” In Proceedings of the Third International Workshop on Numerical Solution of Markov Chains, 1-20.
13. Yan A. and Gong W. B. 1999, “Fluid simulation for high speed networks with flow-based routing.” IEEE Transactions on Information Theory 1588-1599.