ACM Home Page
Please provide us with feedback. Feedback
Conservative parallel simulation of ATM networks
Full text Publisher SitePublisher Site PdfPdf (705 KB)
Source Workshop on Parallel and Distributed Simulation archive
Proceedings of the tenth workshop on Parallel and distributed simulation table of contents
Philadelphia, Pennsylvania, United States
Pages: 30 - 38  
Year of Publication: 1996
ISBN:0-8186-7539-X
Also published in ...
Authors
John G. Cleary  Department of Computer Science, University of Waikato, New Zealand
Jya-Jang Tsai  Department of Computer Science, University of Waikato, New Zealand
Sponsors
IEEE-CS\TCSIM : TC on Simulation
SIGSIM: ACM Special Interest Group on Simulation and Modeling
SCS : Society for Computer Simulation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 4,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/238788.238807
What is a DOI?

ABSTRACT

A new Conservative algorithm for both parallel and sequential simulation of networks is described. The technique is motivated by the construction of a high performance simulator for ATM networks. It permits very fast execution of models of ATM systems, both sequentially and in parallel. A simple analysis of the performance of the system is made. Initial performance results from parallel and sequential implementations are presented and compared with comparable results from an optimistic TimeWarp based simulator. It is shown that the conservative simulator performs well when the "density" of messages in the simulated system is high, a condition which is likely to hold in many interesting ATM scenarios.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Arlitt, M., and Williamson, C.(1995a) "A Synthetic Workload Model for Internet Mosaic Traffic," Proc. Summer Computer Simulation Conf., Ottawa, June.
 
2
Arlitt, M., Chen, Y., Gurski, R., and Williamson, C.(1995b) "Traffic Modelling in the A TM- TN Telesim Project," Proc. Summer Computer Simulation Conf., Ottawa, June.
 
3
 
4
Cai, W., and Turner, S.J.(1990) "An Algorithm for Distributed Discrete Event Simulation," Proc. Distributed Simulation Conference, San Diego California, pp. 3-8, JanuaryJanuary.
 
5
Chandy, K.M., and Misra, J.(1979) "Distributed Simulation: a case study in design and verification of distributed programs," IEEE Trans.Software Eng., 5(5), pp. 440-452, September.
 
6
Chandy, K.M., and Sherman, R.(1989) "The conditional event approach to distributed simulation," Proc. Distributed Simulation Conference, San Diego, California, pp. 93-99, March.
7
 
8
 
9
Fujimoto, R.M.(1988) "Performance measurements of distributed simulation strategies," Proc. Distributed Simulation Conference, San Diego, California, pp. 14-20, February.
10
 
11
Jade Simulations International Corp.(1995) "Deliverable for ATM-TN Performance Project," Science Applications Internationl Corp., August.
12
13
14
 
15
16


Collaborative Colleagues:
John G. Cleary: colleagues
Jya-Jang Tsai: colleagues

Peer to Peer - Readers of this Article have also read: