{"title":"虚拟世界的推拉式兴趣管理","authors":"Rob Minson, G. Theodoropoulos","doi":"10.1109/ISORC.2008.82","DOIUrl":null,"url":null,"abstract":"Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Push-Pull Interest Management for Virtual Worlds\",\"authors\":\"Rob Minson, G. Theodoropoulos\",\"doi\":\"10.1109/ISORC.2008.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem.\",\"PeriodicalId\":378715,\"journal\":{\"name\":\"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISORC.2008.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.2008.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem.