Proceedings 33rd Annual Simulation Symposium (SS 2000)最新文献

{"title":"IRLSim: a general purpose packet level network simulator","authors":"A. Terzis, Konstantinos Nikoloudakis, Lan Wang, Lixia Zhang","doi":"10.1109/SIMSYM.2000.844907","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844907","url":null,"abstract":"Simulation is the main tool for studying networking protocols before deploying them in a wide scale, or for understanding how they are expected to behave under various conditions. IRLSim is a new packet level network simulator that we developed in the hope to study several Internet protocols. From its modest inception as a simulator for the RSVP signaling protocol, IRLSim has evolved into a more general purpose, easy to use, scalable simulator that can be used as a guide for studying existing network protocols as well as a research tool for developing new protocols. This paper describes the architecture of IRLSim in detail, presents its use in the study of a few specific networking problems and argues about its usefuless amongst the variety of other simulators.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114639697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Proactive fault-management in software systems","authors":"Kishor S. Trivedi","doi":"10.1109/SIMSYM.2000.844894","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844894","url":null,"abstract":"Hardware redundancy is a time-honored technique to enhance reliability. However, when applied to software systems, it is inherently expensive to implement due to the need to employ design diversity. Furthermore, recent studies have reported the transient nature of software failures for which design diversity is not very helpful. Transient failures typically occur because of design faults in software, which result in unacceptable erroneous states in the OS environment of the process. Hence, environment diversity, a generalization of system restart, has been proposed as a cheap yet effective technique for software fault-tolerance. The basic idea here is to modify the operating environment of the running process. Recently, the phenomenon of ?software aging?, one in which the state of the software system degrades with time, has been reported. The primary causes of this degradation are the exhaustion of operating system resources, data corruption and numerical error accumulation. This may eventually lead to performance degradation of the software or crash/hang failure or both. Software aging has been reported in widely used software like Netscape and xrn. Aging in the AT&T telecommunication software has known to have resulted in packet loss. Numerous other examples exist, in systems with high availability requirements and also in safety-critical systems. To counteract this phenomenon, a proactive approach of fault management, called ?software rejuvenation? has been proposed. This essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. This process removes the accumulated errors and frees up operating system resources. The preventive action can be done at optimal times (for example, when the load on the system is low) so that the overhead due to planned system downtime is minimal. This method therefore avoids unplanned and potentially expensive system outages due to software aging. A basic assumption here is that the overhead involved in the planned downtime and performing the clean-up operation is considerably less than the cost incurred due to unplanned system outages.In this talk, we will discuss methods of evaluating the effectiveness of proactive fault management in operational software systems and determining optimal times to perform rejuvenation, for different scenarios. Developing stochastic models which tradeoff the cost of unexpected failures due to software aging with the overhead of proactive fault management does this. We use a Markov regenerative process model with a subordinated non-homogeneous Markov chain. The stochastic models have both theoretical and practical value. Depending on the failure characteristics of the software and the preventive maintenance policies, the appropriate model can be used to obtain optimal rejuvenation intervals based on several criteria. The second half the talk will deal with measurement-based models, which are constructed using workload and resou","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115400421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Mean estimation based on phi-mixing sequences","authors":"E. Chen, W. Kelton","doi":"10.1109/SIMSYM.2000.844921","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844921","url":null,"abstract":"This paper discusses the implementation of two sequential procedures to construct confidence intervals for a simulation estimator of the steady-state mean of a stochastic process. Our quasi-independent-mean (QIM) methods attempt to obtain i.i.d. samples. We show that our sequential procedures give valid confidence intervals. The two assumptions required are that the stochastic-process output sequence is continuous and satisfies the /spl phi/-mixing conditions. The algorithm dynamically increases the simulation run length so that the mean estimate satisfies a pre-specified precision requirement.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"15 9-10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131488433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Approaches to cognitive system simulation: architectures and animations","authors":"K. Reilly, N. Bray, Michael Jackson","doi":"10.1109/SIMSYM.2000.844917","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844917","url":null,"abstract":"A coordinated animation (CA) depicts the (internal) operations of a model along with action in the modeled domain. This paper's CA involves neural network models as the internal system to animate. A range of situations, mainly for the movement of objects in a laboratory setting, constitute the modeled domain, effecting a model-domain combination that may be \"ideal\" for realizing CA in practice. The modeled domain entails human subjects or robots being given a set of assigned tasks that is too large to remember and carry out without an \"external\" memory aid or strategy; strategies are not given, but rather are to be learned. Animations depict cycles of activity subjects go through during learning. The capabilities of CA for verification and validation, for training in a context of multiple models, multiple studied domains, and in multi-disciplinary research are discussed.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124374526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A state-based scheduling algorithm for time warp synchronization","authors":"F. Quaglia","doi":"10.1109/SIMSYM.2000.844896","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844896","url":null,"abstract":"Presents a state-based scheduling algorithm for the selection of the next logical process (LP) to be run on a processor in a time-warp synchronized parallel discrete event simulation. In our solution, state information related to the LPs in the intermediate predecessor set of a given LP is used to compute its scheduling priority. This distances our algorithm from previous solutions where the scheduling priority was assigned based exclusively on local state information related to the LPs sharing the processor. As a system to spread the required state information, we use a classical piggybacking technique (i.e. state information is attached to any message carrying a simulation event/anti-event). This solution adds negligible overhead but does not prevent state information from becoming stale. To tackle staleness, we introduce a notion of information filtering and present an iterative procedure for the selection of an adequate value for the filter length that determines the amount of (and also what) state information is actually relevant for computing the priority of any LP. An empirical study of a classical benchmark is reported for a comparison with the lowest-timestamp-first algorithm. The obtained data show the effectiveness of our algorithm in the reduction of the amount of rollback, which in turn leads to faster execution of the simulation.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130372692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Grid-based data management in distributed simulation","authors":"Gary S. H. Tan, R. Ayani, Yusong Zhang, F. Moradi","doi":"10.1109/SIMSYM.2000.844895","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844895","url":null,"abstract":"The data distribution management (DDM) service provided by the High Level Architecture (HLA) run-time infrastructure (RTI) is aimed at making data communication more efficient by sending data only to those federates who need the data, as opposed to the broadcasting mechanism employed by distributed interactive simulation (DIS). Several DDM methods, including class-, region and grid-based, have appeared in the literature. This paper discusses grid-based DDM and presents a simulation platform developed and implemented for investigating the impact of grid-based filtering on performance. Our experimental results show that the choice of the grid cell size has a substantial impact on the performance of distributed simulation. The optimal cell size depends on the characteristics of the application and the underlying computer system. In many practical simulations, it is not easy to determine the optimal cell size. Our experience indicates that in such a case, one should use larger cells rather than very small ones.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127911207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multiresolution behavioral modeling in a virtual environment","authors":"G. Koldaş, Volkan Isler","doi":"10.1109/SIMSYM.2000.844916","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844916","url":null,"abstract":"This paper aims to speed up physical simulation of a complex model by making use of several levels of simulation details, which are determined according to the observer position. Multiple dynamically simulated sailing boats in a virtual lake are created as a test environment for the implementation. Both consistency and completeness are satisfied in the proposed method of simulation.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129316583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Simulation of a telecommunication system using SimML","authors":"N. Speirs, L. Arief","doi":"10.1109/SIMSYM.2000.844909","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844909","url":null,"abstract":"The cost of building a new system is usually quite high and without a proper design, a mismatch might occur between the proposed system and the actual system delivered. One aspect that is important to be investigated prior to the system implementation is its performance. A simulation program could be built to obtain the performance characteristics of the new system, but constructing such a program is not a trivial task. Therefore, it is useful to have a tool that can generate a simulation program automatically from a design notation. We have developed a generic syntax based on the UML design notation which is transformable into a simulation program. A tool that performs the transformation automatically has also been built, and we present our experience in designing a new telecommunication system using our syntax and tool.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121795475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Development of an object oriented simulation engine for on-line simulation and optimization","authors":"A. I. Sivakumar, C. Chong","doi":"10.1109/SIMSYM.2000.844927","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844927","url":null,"abstract":"An object oriented (OO), discrete event simulation engine for on-line simulation applications has been conceptualized, designed, developed and tested. This paper describes the concepts, the advantages of OO simulation and results achieved in a near-real-time application. Flexibility to customize, real time state initiation, and capability for modeling complex resource and process relationships are some of the salient features. The objective of the work is to demonstrate the use of the developed OO simulation engine in the semiconductor backend manufacturing operation for dynamic scheduling applications, and optimization of equipment utilization cycle time and delivery performance. Capability for \"what if\" analysis and auto generation of simulation models at a desired frequency are examples of other features considered in the development.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133313226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A comparative evaluation of sorted priority algorithms and class based queuing using simulation","authors":"P. Callinan, M. Witwit, F. Ball","doi":"10.1109/SIMSYM.2000.844906","DOIUrl":"https://doi.org/10.1109/SIMSYM.2000.844906","url":null,"abstract":"This paper present results from a simulation study aimed at evaluating the comparative performance of two resource control mechanisms viz. weighted fair queueing (WFQ) and class based queueing (CBQ). The purpose of this work is to assess their relative suitability for supporting multiservice in future packet switched networks. The experiment described in this paper compares their respective response time delay characteristics when each is presented with identical traffic profiles.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130246178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}