{"title":"Stable and Scalable Method Based on Application-Level for Improving Distributed Interactive Visual Applications' Performance","authors":"Genyuan Zhang, Zhao Lei","doi":"10.1109/ICIME.2009.118","DOIUrl":null,"url":null,"abstract":"virtual reality application such as second life and other multi-player game is a set of special Distributed Interactive Applications (DIAs), because a sender node forwards data to receivers due to their respective priorities. In general application level protocol is adopted to multicast: the significance-based directed minimum spanning tree was designed for these DIAs. In this paper we propose a novel application level algorithm: Quantificational Analysis and Prediction for Significance with directed minimum Spanning Tree (QAPSST), which can efficiently predict priorities for the receivers and quantize the predicted priorities to build a multicast distribution tree data structure. Furthermore, QAPSST can easily integrate the quantized significance into game environment and simplify significance deployment. Our significance-based directed minimum spanning tree has significance-efficient predict mechanism and the system consumes a tremendous amount of resource and still is stable and scalable when its size increases drastically. The experiment results show that QAPSST is able to efficiently make significance predict and keep system stable with huge amount of users.","PeriodicalId":445284,"journal":{"name":"2009 International Conference on Information Management and Engineering","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Information Management and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIME.2009.118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
virtual reality application such as second life and other multi-player game is a set of special Distributed Interactive Applications (DIAs), because a sender node forwards data to receivers due to their respective priorities. In general application level protocol is adopted to multicast: the significance-based directed minimum spanning tree was designed for these DIAs. In this paper we propose a novel application level algorithm: Quantificational Analysis and Prediction for Significance with directed minimum Spanning Tree (QAPSST), which can efficiently predict priorities for the receivers and quantize the predicted priorities to build a multicast distribution tree data structure. Furthermore, QAPSST can easily integrate the quantized significance into game environment and simplify significance deployment. Our significance-based directed minimum spanning tree has significance-efficient predict mechanism and the system consumes a tremendous amount of resource and still is stable and scalable when its size increases drastically. The experiment results show that QAPSST is able to efficiently make significance predict and keep system stable with huge amount of users.