{"title":"A Middleware Level Active Replication Manager for High Performance HLA-based Simulations on SMP Systems","authors":"F. Quaglia","doi":"10.1109/DS-RT.2006.2","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.2","url":null,"abstract":"In this paper we explore active replication in the context of advanced simulation systems, with the aim of improving the timeliness for the production of simulation output. Our proposal is framed by the high-level-architecture (HLA), i.e. the middleware based standard for interoperability of simulation packages. It results in the design and implementation of an active replication management layer (ARML) targeted to SMP computing systems, which supports the execution of (diversity-based) active replicas of a same simulation package in a totally transparent manner","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128475222","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}
D. Marshall, S. McLoone, D. Roberts, D. Delaney, Tomas E. Ward
{"title":"Exploring the Effect of Curvature on the Consistency of Dead Reckoned Paths for Different Error Threshold Metrics","authors":"D. Marshall, S. McLoone, D. Roberts, D. Delaney, Tomas E. Ward","doi":"10.1109/DS-RT.2006.17","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.17","url":null,"abstract":"Dead reckoning is widely employed as an entity update packet reduction technique in distributed interactive applications (DIAs). Such techniques reduce network bandwidth consumption and thus limit the effects of network latency on the consistency of networked simulations. A key component of the dead reckoning method is the underlying error threshold metric, as this directly determines when an entity update packet is to be sent between local and remote users. The most common metric is the spatial threshold, which is simply based on the distance between a local user's actual position and their predicted position. Other, recently proposed, metrics include the time-space threshold and the hybrid threshold, both of which are summarised within. This paper investigates the issue of user movement in relation to dead reckoning and each of the threshold metrics. In particular the relationship between the curvature of movement, the various threshold metrics and absolute consistency is studied. Experimental live trials across the Internet allow a comparative analysis of how users behave when different threshold metrics are used with varying degrees of curvature. The presented results provide justification for the use of a hybrid threshold approach when dead reckoning is employed in DIAs","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116039322","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":"Causality and Proactive Cancellation","authors":"Malolan Chetlur, P. Wilsey","doi":"10.1109/DS-RT.2006.12","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.12","url":null,"abstract":"Optimistic time warp simulators should stop the rapid propagation of incorrect events to avoid reaching a catastrophic state (a state where out of order event execution is always a step ahead of its corrective measures). A distributed cancellation mechanism using total clocks was proposed earlier to avoid such catastrophic states. In this paper, we present a proactive cancellation mechanism using a vector of event counter range to address the scalability issues with the previously defined solution. As opposed to total clocks, this timestamp mechanism (a.k.a. plausible total clocks) consists of constant size vectors and are independent of the number of simulation objects in the simulation. The events generated due to an out of order execution are pro-actively canceled by determining its causality relation with the already annihilated events. We present a proof of correctness of the distributed cancellation mechanism and also show that catastrophic states are avoided with this proactive cancellation mechanism. This cancellation mechanism assumes FIFO communication layer, static inter-connection topology, and logical processes consisting of several simulation objects","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856684","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 Model Composition using BOMs","authors":"F. Moradi, Peder Nordvaller, R. Ayani","doi":"10.1109/DS-RT.2006.34","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.34","url":null,"abstract":"Development of simulation models is a multi-disciplinary and time/resource consuming process. An approach to reduce the associated costs and improving the usability of the models is to compose simulation models through reuse of predefined and already existing, validated simulation components. Using this method the simulation model is built in a component-based fashion. The Base Object Model, BOM, is a new standard for defining reusable and composable simulation components. The introduction of BOMs into the simulation community opens up the possibility of component based simulation development approach that is faster and more efficient than today's simulation creation process. In this paper we describe a process that has been developed at the Swedish Defence Research Agency (FOI) with the aim to speed up and improve the development of simulation models. This process utilizes the BOM concept coupled with ontologies in simulation development, and employs SRML (Simulation Reference Markup Language) as a means to define a component based simulation on a high-level. We present our experimental results and findings based on our implementation of the proposed process. Our experience indicates that including ontological information in BOMs will further increase their usability","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131150402","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}
Fábio Reis Cecin, C. Geyer, S. Rabello, J. Barbosa
{"title":"A peer-to-peer simulation technique for instanced massively multiplayer games","authors":"Fábio Reis Cecin, C. Geyer, S. Rabello, J. Barbosa","doi":"10.1109/DS-RT.2006.4","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.4","url":null,"abstract":"We propose a peer-to-peer event ordering and simulation technique aimed at networked real-time action games. Partially based on replicated simulators, its goal is to support decentralized play out in small-scale game sessions on instanced action spaces while being resistant to collusion cheating. The action spaces are linked to persistent-state social spaces of larger scale which are supported by centralized simulation. Together, these two kinds of spaces offer support for massively multiplayer online games (MMOGs) that offer a mix of socialization on large-scale persistent environments and fast interaction on small-scale temporary ones. Although player nodes on action spaces are required to run a conservative and an optimistic simulator simultaneously, we show that 2.2 simultaneous simulation steps are executed on average and that 11.95 simultaneous steps occur as the average peak situation for 20-player sessions with 150 ms to 300 ms network delays between nodes, 5% probability of any late events introducing errors, and rollback and re-execution operations having their execution spreaded through 100 ms of real time or longer","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"162 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134331062","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":"Priority based Overlay Multicast with Filtering Mechanism for Distributed Interactive Applications","authors":"Jun-xiang Yu, Ling Chen, Gencai Chen","doi":"10.1109/DS-RT.2006.29","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.29","url":null,"abstract":"The \"priority-based directed minimum spanning tree\" (PST) is designed for distributed interactive applications (DIAs) in which the data are delivered to the receiver node according to their priority; however PST cannot balance the bandwidth usage among the nodes and the system will be unstable when its scale increases. This paper proposes a novel overlay multicast protocol named priority based overlay multicast (POM), which uses the priority, delay and available bandwidth to construct the multicast tree, besides a filtering mechanism is proposed to rebuild the tree when the available bandwidth shortage appears. The effectiveness of our protocol is demonstrated in the simulation results, showing that POM uses the available bandwidth efficiently, besides it keeps the system stable when its scale increases","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121951090","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":"EGRESS: Environment for Generating REalistic Scenarios for Simulations","authors":"K. Sridhar, Shuai Hao, M. Chan, A. Ananda","doi":"10.1109/DS-RT.2006.16","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.16","url":null,"abstract":"In MANETs, majority of performance studies are carried out via simulations, where node mobility and radio propagation models play a crucial role. However, popular simulation tools, like NS-2 and GloMoSim, use simplistic random mobility patterns and free space radio propagation models. Such simplification ignores many crucial details in environment where movements are not random and obstacles are common. To have a better understanding of MANET protocols, there is a need for a tool that can generate more realistic mobility scenarios and provide better radio propagation model. This paper presents EGRESS, which is built on top of NS-2 and consists of two major components: SGT and ORPM. SGT is a tool that generates node movements in an urban environment with buildings and pathways. ORPM is an obstructive radio propagation model, which enhances the existing radio models in NS-2 by taking into account obstacles in a 3D environment. We believe EGRESS is the first open source tool that provides such integrated and more realistic features for simulating urban environment. Our simulation results show that using more realistic scenarios can have a significant impact on network topology and performance of routing protocols","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129959973","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":"Adaptive Interest Management via Push-Pull Algorithms","authors":"Rob Minson, G. Theodoropoulos","doi":"10.1109/DS-RT.2006.8","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.8","url":null,"abstract":"Interest management in large-scale distributed applications aims to reduce the amount of extraneous broadcast communication between nodes in the system with the aim of increasing responsiveness and scalability. We present a middleware-layer interest management framework based on pattern prediction to inform the oscillation of the system's protocol for the processing of state updates between two competing modes. This framework is transparent to the application itself. We discuss various algorithms for performing the prediction and experimentally evaluate the effectiveness of these algorithms against each other and a set of optimal and sub-optimal baselines","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128063826","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}
Andrew Roczniak, Jamil Melhem, P. Lévy, Abdulmotaleb El Saddik
{"title":"Design of Distributed Collaborative Application through Service Aggregation","authors":"Andrew Roczniak, Jamil Melhem, P. Lévy, Abdulmotaleb El Saddik","doi":"10.1109/DS-RT.2006.14","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.14","url":null,"abstract":"The service oriented architecture (SOA) is used to support loosely-coupled integration of existing applications. We are investigating the possibility of creating entirely new applications based on SOA. We present a case study for a collaborative authoring application targeting groups of around five users collaborating over the Internet. We highlight the basic requirements of the application and show how these can be fulfilled by utilizing certain services accessed through standard HTTP, Jabber and JXTA set of protocols, and off-the-shelf techniques. By measuring the performance of the application in a heterogeneous environment and by providing details of an alternate service fulfilling the application's requirement, we show that SOA-based collaborative applications can be quickly designed and deployed","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116773246","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":"Performance Analysis of an Adaptive Dynamic Grid-Based Approach to Data Distribution Management","authors":"YunFeng Gu, A. Boukerche, R. B. Araujo","doi":"10.1109/DS-RT.2006.28","DOIUrl":"https://doi.org/10.1109/DS-RT.2006.28","url":null,"abstract":"Data distribution management (DDM) plays a key role in traffic volume control of large-scale distributed simulations. In recent years, several solutions have been devised to make DDM more efficient and adaptive to different traffic conditions. Examples of such systems include region-based, fixed grid-based, hybrid, and dynamic grid-based (DGB) schemes. However, less effort has been made to improve the processing performance of DDM techniques. This paper presents a novel DDM scheme called the adaptive dynamic grid-based (ADGB) scheme that optimizes DDM time through analysis of matching performance. ADGB uses an advertising scheme in which information about the target cell involved in the process of matching subscribers to publishers is known in advance. An important concept known as distribution rate (DR) is devised. DR represents the relative processing load and traffic volume generated at each federate. The matching performance and DR are used as part of the ADGB method to select, throughout the simulation, the devised advertisement scheme that achieves maximum gain with acceptable network traffic overhead. Performance estimation and analysis of ADGB have shown that given an ideal matching probability, an efficiency gain of a maximum of 66% over the DGB scheme can be achieved. The novelty of the ADGB scheme is its focus on improving performance, an important (and often forgotten) goal of DDM strategies","PeriodicalId":208795,"journal":{"name":"2006 Tenth IEEE International Symposium on Distributed Simulation and Real-Time Applications","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127522956","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}