Suiping Zhou, S. Turner, Wentong Cai, Hanfeng Zhao, Xiaolin Pang
{"title":"A utility model for timely state update in distributed wargame simulations","authors":"Suiping Zhou, S. Turner, Wentong Cai, Hanfeng Zhao, Xiaolin Pang","doi":"10.1145/1013329.1013347","DOIUrl":null,"url":null,"abstract":"In distributed wargame simulations, the states of simulation entities need to be updated and sent to other simulation nodes in a timely manner, which may incur high overhead on the network. Thus, how to efficiently use the limited bandwidth of the network is very important to the performance of distributed wargame simulations. In this paper, a utility model is proposed to evaluate the relative importance of a simulation entity. In our proposed utility model, the utility of an entity is determined by the number of entities on which this entity may have influence and the distances between this entity and the entities within its area of influence. Based on the utility model, we may devise some flexible updating mechanisms which can utilize the bandwidth more efficiently. For example, the state updates of an important entity which may have great influence on the simulation could be sent to other nodes with a high frequency; on the other hand, the state updates of an entity with little importance may be sent to other simulation nodes with a low frequency. In this paper, we focus on the utility computation of a simulation entity rather than the flexible state updating mechanisms for the simulation entities. Our proposed utility computation mechanism is general and can be easily implemented using the HLA services. Experimental results show that the utility computation mechanism incurs little overhead.","PeriodicalId":326595,"journal":{"name":"18th Workshop on Parallel and Distributed Simulation, 2004. PADS 2004.","volume":"143 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"18th Workshop on Parallel and Distributed Simulation, 2004. PADS 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1013329.1013347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
In distributed wargame simulations, the states of simulation entities need to be updated and sent to other simulation nodes in a timely manner, which may incur high overhead on the network. Thus, how to efficiently use the limited bandwidth of the network is very important to the performance of distributed wargame simulations. In this paper, a utility model is proposed to evaluate the relative importance of a simulation entity. In our proposed utility model, the utility of an entity is determined by the number of entities on which this entity may have influence and the distances between this entity and the entities within its area of influence. Based on the utility model, we may devise some flexible updating mechanisms which can utilize the bandwidth more efficiently. For example, the state updates of an important entity which may have great influence on the simulation could be sent to other nodes with a high frequency; on the other hand, the state updates of an entity with little importance may be sent to other simulation nodes with a low frequency. In this paper, we focus on the utility computation of a simulation entity rather than the flexible state updating mechanisms for the simulation entities. Our proposed utility computation mechanism is general and can be easily implemented using the HLA services. Experimental results show that the utility computation mechanism incurs little overhead.