{"title":"Why we STILL Don't Know How to Simulate Networks","authors":"M. Ammar","doi":"10.1109/ANSS.2005.45","DOIUrl":"https://doi.org/10.1109/ANSS.2005.45","url":null,"abstract":"Summary form only given. Discrete event simulation has been used in the evaluation of computer communications networks for three or four decades. Over this period of time our simulation capability has improved significantly due to the efforts of the simulation research community. There has also been significant progress over the years by the networking research community in understanding the use of simulation in the design and evaluation of network architectures, protocols and services. I will argue in this talk that, despite these advances, we still do not have an acceptable and widely-used methodology to simulate networks which often leads to the questioning of the credibility of simulation results. This can be attributed to many reasons, including 1) confusion and uncertainty within the networking community regarding the role that simulation plays in networking research, 2) fundamental limits that make it basically impossible to simulate Internet-scale networks, 3) the difficulty in building realistic network models and 4) the lack of acceptable standards for validity and repeatability of simulation experiments. I will suggest a high-level research agenda that addresses these issues with the ultimate aim of enriching the networking research community's ability to use simulation as a meaningful tool for performance evaluation and prediction.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"128 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120985080","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":"Model verification in λΣ: a type inference approach","authors":"E. Kortright","doi":"10.1145/106073.306874","DOIUrl":"https://doi.org/10.1145/106073.306874","url":null,"abstract":"In this paper we describe a number of model analysis and verification operations based on type inference in the Xa simulation language. Ag is a simulation language based on the typed X-calculus. Xa entities correspond to typed X-expressions, while Xa activities correspond to subtypes. Thus, entities can be generated by means of type-introduction rules, and operations can be defined on entities by means of type elimination and equality rules. Premises of the form e E r in an introduction rule used to create a new entity can be satisfied by substituting for e any entity of type r in a neighboring activity. It is then possible to perform a number of model analysis and verification operations using type inference algorithms available for the typed X-calculus.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115217388","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":"Supercritical speedup","authors":"D. Jefferson, P. Reiher","doi":"10.1145/106073.306854","DOIUrl":"https://doi.org/10.1145/106073.306854","url":null,"abstract":"The notions of the critical path of events and critical rime of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critical time of any event in a simulation is a lower bound on the time it takes to execute a simulation using any conservative simulation mechanism, and is also a lower bound on the time taken by some optimistic methods. However, at least one optimistic mechanismis able to beat the critical path bound in a nontrivial way. bounded by its length and when it is not. We show (again) that no conservative mechanism can beat the critical path bound, but we also show that at least four known optimistic mechanisms, Time Warp with lazy cancellation, Time Warp with lazy rollback, Time Warp with phase decomposition, and the Chandy-Sherman space-time family of mechanisms, all can do so. As a result, we say that those mechanisms are capable of super-","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133864095","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-based approach to design a multi-stage flow-shop in steel works","authors":"N. Ueno, S. Sotojima, J. Takeda","doi":"10.1145/106073.306884","DOIUrl":"https://doi.org/10.1145/106073.306884","url":null,"abstract":"This paper describes a new simulation-based approach for redesign of a multi-stage flow-shop production line. A performance measure which represents an 'actual' production rate of a machine is defined in order to identify bottlenecks. A simulation procedure based on the proposed measure is developed in order to determine how best to alleviate the bottlenecks. This new approach is applied for redesigning an actual large-scale multi-stage flow-shop production line in the authors' steelworks and they can determine the proper specifications of this line which can achieve an increase of productivity with a minimal investment. This approach is practical and powerful for redesign of a multi-stage flow-shop production line. >","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129556021","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":"Application of extreme value theory to the analysis of a network simulation","authors":"I. Berberana","doi":"10.1145/99633.99651","DOIUrl":"https://doi.org/10.1145/99633.99651","url":null,"abstract":"In this paper we present an application of the extreme value theory to the results of a GPSS simulation of a network of queues which is not suitable to be modeled by a product form and, so, to be treated by operational analysis. The objective of this work is to estimate the finite buffer size of the queues such that packets (elements) arriving to the system at a lower rate than one fixed have a very low probability — usually, less than 10-8 — to be rejected (because the buffer is full). To carry out this task only by means of simulation would require a large amount of computational effort. Extreme value theory is employed to estimate, from the results of a reduced simulation, which buffer size corresponds to this loss probability.\u0000The extreme value theory is presented and the way it can be applied to the simulation analysis is explained. Further refinements, in order to extend its extrapolative capability, are introduced, and also the way to calculate confidence intervals. Numerical results are presented.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126138367","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}
S. Gibbons, J. Rullo, R. Gilson, Margaret H. Thomas
{"title":"Training templates utilizing advanced simulation","authors":"S. Gibbons, J. Rullo, R. Gilson, Margaret H. Thomas","doi":"10.1145/317755.317776","DOIUrl":"https://doi.org/10.1145/317755.317776","url":null,"abstract":"The feasibility of coupling direct practice with simultaneous exposure to a proficient model's behavior was tested using advanced simulation. A new technique was developed which optically superimposes an optimal flight path of an expert onto the trainees' display screen as they are attempting to perform the same maneuver. This method of presentation is called Simulation Model Overlay Display (S-MOD).\u0000The S-MOD method was compared to a Traditional Modeling approach and two other simultaneous exposure techniques, i.e., a Pursuit Tracking Model (subject is in formation behind an expert's lead aircraft) and a Window Model (subject is presented with a small window depicting the expert's view of the same task). Subjects, 57 university undergraduates, attempted to learn pitch and altitude manipulations as demonstrated by an expert during an approach to landing, using these various training methods. The S-MOD subjects attained the same level of performance as traditionally trained groups with less available training time.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131570362","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":"Using simulation techniques to improve skeletal plans for the control of a vertical internal grinding machine","authors":"B. Roberts, David C. Brown","doi":"10.1145/317755.317772","DOIUrl":"https://doi.org/10.1145/317755.317772","url":null,"abstract":"This research investigates the use of simulation techniques for the improvement of skeletal plans selected by a planner. These plans are used for control of a vertical internal grinding machine. Plans are selected using a description of the grinding task. These plans reflect the machinist's grinding knowledge. Once selected the plan is instantiated with the proper parameter values. The instantiated plans are passed to the grinding simulation where simulated force sensor readings emulate real-time signals. Feedback from the simulation is used by a knowledge-based system to modify successful plans and to identify failed plans.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"25 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126991193","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 distributed database simulation language","authors":"H. Rubinovitz, F. Maryanski","doi":"10.1145/317755.317780","DOIUrl":"https://doi.org/10.1145/317755.317780","url":null,"abstract":"This paper presents a software modeling environment for estimating the performance of distributed database systems. This tool supports a simulation language, HGPSS, which comprises various simulation primitives, contains a collection of network modules, and allows for the collection of statistics. This provides an overview of the HGPSS environment emphasizing its applicability to the modeling of distributed databases.","PeriodicalId":186490,"journal":{"name":"Annual Simulation Symposium","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114427018","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}