From: CRDGW2::CRDGW2::MRGATE::"SMTP::PREP.AI.MIT.EDU::OWNER-INFO-G++" 22-AUG-1990 21:32:58.90 To: MRGATE::"ARISIA::EVERHART" CC: Subj: Re: discrete-event simulation in C++ Received: by crdgw1.ge.com (5.57/GE 1.70) id AA25043; Wed, 22 Aug 90 21:17:00 EDT Received: by life.ai.mit.edu (4.1/AI-4.10) id AA24681; Wed, 22 Aug 90 15:12:23 EDT Return-Path: Received: from tut.cis.ohio-state.edu by life.ai.mit.edu (4.1/AI-4.10) id AA24611; Wed, 22 Aug 90 15:09:14 EDT Received: by tut.cis.ohio-state.edu (5.61-kk/5.900605) id AA04320; Wed, 22 Aug 90 15:01:43 -0400 Received: from USENET by tut.cis.ohio-state.edu with netnews for info-g++@prep.ai.mit.edu (info-g++@prep.ai.mit.edu) (contact usenet@tut.cis.ohio-state.edu if you have questions) Date: 22 Aug 90 18:40:26 GMT From: ubc-cs!alberta!pawel@beaver.cs.washington.edu (Pawel Gburzynski) Organization: University of Alberta, Edmonton, Alberta, Canada Subject: Re: discrete-event simulation in C++ Message-Id: <1990Aug22.184026.24600@cs.UAlberta.CA> References: <2533@ryn.esg.dec.com> Sender: info-g++-request@prep.ai.mit.edu To: info-g++@prep.ai.mit.edu From article <2533@ryn.esg.dec.com>, by zavgren@hpsrad.enet.dec.com (John Zavgren): > I am about to write a discrete-event simulation of a communications > network. The object-oriented paradigm looks like it should save a lot > of programming time, but I have never programmed in an object-oriented > language, let alone C++. Can anyone furnish me with a few well-written > well-commented C++ programs that I can use to get started with this project? > I am especially interested in queueing network simulations. > > RSVP > John Zavgren I am currently developing a package for modelling communication networks in g++. The package is called SMURPH and descends from LANSF -- an earlier version of the package written in plain C. For all practical purposes SMURPH is ready, but still undocumented. I anticipate to have a distributable version by the end of September. It is my intention to distribute SMURPH for FREE. There may be some subtle problems, though, as SMURPH will be used in my book on protocol design and Prentice Hall may have some objections. Anyway, I believe that individual cases can be handled without problems. In some sense SMURPH is both event-driven and process-driven. The user sees only the process driven part. If anybody is interested, I can provide some related papers (including examples of networks and protocols programmed in SMURPH). Moreover, LANSF (the SMURPH's predecessor) is available without restrictions and, of course, it is absolutely free. You can copy it using anonymous ftp from menaik.cs.ualberta.ca (pub/lansf.2.11.tar.Z). It comes with a (somewhat lengthy) manual that must be processed by LaTeX. Pawel Gburzynski Department of Computing Science University of Alberta 615 GSB Edmonton, Alberta, Canada T6G 2H1