With the advances in computer technology, many systems have been developed for educational and instructional purposes. In particular, a computer-based system is very attractive in sports instruction and training as compared to the traditional human coaching approach, saving time, space, and cost. Among several important technical issues to be resolved in such sports instructional systems, motion or gesture capture and the organization of the database are the major ones. Of course, the most successful implementations are the systems from the gaming industry. In this work, we briefly discuss these commercial technologies and systems. A prototype system for learning tennis is introduced. Various techniques for motion capture are described and discussed. An event-based motion detecting and matching algorithm for capturing tennis swings from people of different size is presented. Finally, a framework for a Web-based generic sport system is presented.
{"title":"The Design of a Web-Based Multimedia Sport Instructional System","authors":"Kosuke Takano, K. F. Li, M. G. Johnson","doi":"10.1109/WAINA.2011.141","DOIUrl":"https://doi.org/10.1109/WAINA.2011.141","url":null,"abstract":"With the advances in computer technology, many systems have been developed for educational and instructional purposes. In particular, a computer-based system is very attractive in sports instruction and training as compared to the traditional human coaching approach, saving time, space, and cost. Among several important technical issues to be resolved in such sports instructional systems, motion or gesture capture and the organization of the database are the major ones. Of course, the most successful implementations are the systems from the gaming industry. In this work, we briefly discuss these commercial technologies and systems. A prototype system for learning tennis is introduced. Various techniques for motion capture are described and discussed. An event-based motion detecting and matching algorithm for capturing tennis swings from people of different size is presented. Finally, a framework for a Web-based generic sport system is presented.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"10 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131750521","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}
Cloud computing has been evolved as a key computing platform for sharing resources and services. People should have a relatively convenient environment and life for handling home-appliances. This study designs and develops a Web 2.0 Service Platform (WSP) for DPWS-based Home-appliances in the Cloud environment, which is composed of mobile users, home appliances and the cloud environment. WSP automatically records and observes user's behaviors to adapt related home-appliances based on the ontology technique. A mobile user can use a smart phone to control and handle home-appliances through Web2.0 Blog-based interfaces. Finally, WSP can be an inference model for researchers when developing home-appliance controllers in the future.
{"title":"Design and Implementation of a Web 2.0 Service Platform for DPWS-Based Home-Appliances in the Cloud Environment","authors":"Chung-Ming Huang, Hao-Hsiang Ku, Yen-Wen Chen","doi":"10.1109/WAINA.2011.32","DOIUrl":"https://doi.org/10.1109/WAINA.2011.32","url":null,"abstract":"Cloud computing has been evolved as a key computing platform for sharing resources and services. People should have a relatively convenient environment and life for handling home-appliances. This study designs and develops a Web 2.0 Service Platform (WSP) for DPWS-based Home-appliances in the Cloud environment, which is composed of mobile users, home appliances and the cloud environment. WSP automatically records and observes user's behaviors to adapt related home-appliances based on the ontology technique. A mobile user can use a smart phone to control and handle home-appliances through Web2.0 Blog-based interfaces. Finally, WSP can be an inference model for researchers when developing home-appliance controllers in the future.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131667977","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}
Numerous researches about Mobile IPv6 (MIPv6) have been proposed recently and the handover delay of the Mobile Nodes (MNs) among different networks is surely a worthy noticing issue. There are three major reasons for the MIPv6 handover delay: Movement Detection, Duplicate Address Detection (DAD), and Binding Update (BU), in, which DAD occupies most of the MIPv6 handover delay and influences real-time services greatly. No previous paper mentions how to reconfigure another unique Care of Address (CoA) when the generated CoA is used by other nodes during the DAD, and how to generate a unique CoA to accelerate the handover, reduce the handover delay and avoid the packet loss during the handover. To avert the problems that worsen the handover latency and the packet loss, this paper presents a Fast-Reconfigure Address Mechanism (F-RAM) to generate a unique CoA rapidly when duplicate address occurs, to evade the occurrence of the second duplication, and to reconfigure a unique address quickly. Our experiment results prove that our proposed scheme indeed reduces the handover delay and the packet loss when the CoA is duplicated.
近年来，人们对移动IPv6 (MIPv6)进行了大量的研究，其中移动节点(MNs)在不同网络之间的切换延迟是一个值得关注的问题。造成MIPv6切换延迟的原因主要有三个:运动检测、重复地址检测和绑定更新。其中，绑定更新占据了MIPv6切换延迟的大部分，对实时业务影响较大。之前没有论文提到如何在DAD过程中，当生成的CoA被其他节点使用时，重新配置另一个唯一的CoA (Care of Address)，以及如何生成唯一的CoA来加速切换，减少切换延迟，避免切换过程中的丢包。为了避免切换延迟和丢包问题，本文提出了一种快速重配置地址机制(F-RAM)，在出现重复地址时快速生成唯一CoA，避免第二次重复的发生，并快速重新配置唯一地址。实验结果表明，该方案确实降低了重复CoA时的切换延迟和丢包。
{"title":"A Novel Mechanism to Improve Handover Efficiency Considering the Duplicate Address Occurs in HMIPv6","authors":"Yuhan Chen, T. Wu, Wei-Tsong Lee","doi":"10.1109/WAINA.2011.65","DOIUrl":"https://doi.org/10.1109/WAINA.2011.65","url":null,"abstract":"Numerous researches about Mobile IPv6 (MIPv6) have been proposed recently and the handover delay of the Mobile Nodes (MNs) among different networks is surely a worthy noticing issue. There are three major reasons for the MIPv6 handover delay: Movement Detection, Duplicate Address Detection (DAD), and Binding Update (BU), in, which DAD occupies most of the MIPv6 handover delay and influences real-time services greatly. No previous paper mentions how to reconfigure another unique Care of Address (CoA) when the generated CoA is used by other nodes during the DAD, and how to generate a unique CoA to accelerate the handover, reduce the handover delay and avoid the packet loss during the handover. To avert the problems that worsen the handover latency and the packet loss, this paper presents a Fast-Reconfigure Address Mechanism (F-RAM) to generate a unique CoA rapidly when duplicate address occurs, to evade the occurrence of the second duplication, and to reconfigure a unique address quickly. Our experiment results prove that our proposed scheme indeed reduces the handover delay and the packet loss when the CoA is duplicated.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131963953","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}
Many TCP protocol variants have demonstrated better performance in simulation and several limited network experiments. However, practical use in real applications of these protocols is still very limited because of the implementation and installation difficulties. On the other hand, users who need to transfer bulk data (e.g., ingrid/cloud computing) usually turn to application level solutions where these variants do not fair well. Among protocols considered in the application level solutions are UDP-based protocols, such as UDT (UDP-based DataTransport Protocol). UDT is considered one of the most recently developed new transport protocols with congestion control algorithms. It was developed to support next generation high-speed networks, including wide area optical networks. It is considered a state-of-the-art protocol, which promptly addresses various infrastructure requirements for transmitting data in high-speed networks. Its development, however, creates new vulnerabilities because like many other protocols, it is designed to rely solely on existing security mechanisms for existing protocols such as the Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). Some of these security mechanisms cannot be used to absolutely protect UDT, just as security mechanisms devised for wired networks cannot be used to protect unwired ones. Both the recently developed UDT and the decades-old TCP/UDP lack a well-thought-out security architecture that addresses problems in today’snetworks. In this paper, we extend our previous work and implement our developed security methodology that can assist network and security investigators, designers, and users who consider and incorporate security when implementing UDT across wide area networks. These can support security architectural designs of UDP-based protocols as well as assist in the future development of other state-of-the-art fast data transfer protocols.
{"title":"Empirical Survey: Experimentation and Implementations of High Speed Protocol Data Transfer for GRID","authors":"D. Bernardo, D. Hoang","doi":"10.1109/WAINA.2011.42","DOIUrl":"https://doi.org/10.1109/WAINA.2011.42","url":null,"abstract":"Many TCP protocol variants have demonstrated better performance in simulation and several limited network experiments. However, practical use in real applications of these protocols is still very limited because of the implementation and installation difficulties. On the other hand, users who need to transfer bulk data (e.g., ingrid/cloud computing) usually turn to application level solutions where these variants do not fair well. Among protocols considered in the application level solutions are UDP-based protocols, such as UDT (UDP-based DataTransport Protocol). UDT is considered one of the most recently developed new transport protocols with congestion control algorithms. It was developed to support next generation high-speed networks, including wide area optical networks. It is considered a state-of-the-art protocol, which promptly addresses various infrastructure requirements for transmitting data in high-speed networks. Its development, however, creates new vulnerabilities because like many other protocols, it is designed to rely solely on existing security mechanisms for existing protocols such as the Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). Some of these security mechanisms cannot be used to absolutely protect UDT, just as security mechanisms devised for wired networks cannot be used to protect unwired ones. Both the recently developed UDT and the decades-old TCP/UDP lack a well-thought-out security architecture that addresses problems in today’snetworks. In this paper, we extend our previous work and implement our developed security methodology that can assist network and security investigators, designers, and users who consider and incorporate security when implementing UDT across wide area networks. These can support security architectural designs of UDP-based protocols as well as assist in the future development of other state-of-the-art fast data transfer protocols.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132183594","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}
In this study, we have proposed an extraction method for inaccurate example sentences using a Web search engine for multilingual parallel texts. We developed a multilingual parallel-text sharing system named Tack Pad for multilingual communication in the medical field. However, it should be noted that parallel texts created by people can be inaccurate. Hence, we cannot use these parallel texts in fields where high levels of accuracy are required. Moreover, it is difficult for people to evaluate the parallel texts enough because these are large in number. Therefore, we proposed and evaluated an extraction method for inaccurate example sentences. This method uses the contents on the Web as wisdom of crowds. It splits an example sentence into n-grams and uses the Web search engine to locate the split words. Moreover, this method uses two thresholds to detect several mistakes which are typographical errors, grammatical errors, and so on. The contributions of this paper are the following results: (1) We proposed an extraction method that improves the accuracy of the example sentences using the Web search engine and (2) We showed an improvement in the accuracy of the example sentences using two thresholds.
{"title":"Proposal and Evaluation of an Extraction Method for Inaccurate Example Sentences Using a Web Search Engine for Multilingual Parallel Texts","authors":"T. Fukushima, T. Yoshino, Aguri Shigeno","doi":"10.1109/WAINA.2011.97","DOIUrl":"https://doi.org/10.1109/WAINA.2011.97","url":null,"abstract":"In this study, we have proposed an extraction method for inaccurate example sentences using a Web search engine for multilingual parallel texts. We developed a multilingual parallel-text sharing system named Tack Pad for multilingual communication in the medical field. However, it should be noted that parallel texts created by people can be inaccurate. Hence, we cannot use these parallel texts in fields where high levels of accuracy are required. Moreover, it is difficult for people to evaluate the parallel texts enough because these are large in number. Therefore, we proposed and evaluated an extraction method for inaccurate example sentences. This method uses the contents on the Web as wisdom of crowds. It splits an example sentence into n-grams and uses the Web search engine to locate the split words. Moreover, this method uses two thresholds to detect several mistakes which are typographical errors, grammatical errors, and so on. The contributions of this paper are the following results: (1) We proposed an extraction method that improves the accuracy of the example sentences using the Web search engine and (2) We showed an improvement in the accuracy of the example sentences using two thresholds.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117155748","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}
Z. Maamar, Sami Bhiri, S. Tata, Khouloud Boukadi, W. Mansoor
This paper examines capacity-driven Web services from a transactional perspective. Such services are empowered with different sets of operations that are selectively triggered in response to requirements posed on them and hence, need to be satisfied. Each set of operations forms a capacity that either fails or succeeds at run-time. In case of failure and for the sake of business continuity, a capacity driven Web service binds to some transactional properties such as pivot, retriable, and compensatable, and behaves in accordance with the guidelines that each transactional property sets. This paper, also, shows that the particular nature of capacity-driven Web services calls for reviewing these transactional properties’ guidelines.
{"title":"Conceptual Analysis of Transactional-, Capacity-Driven Web Services","authors":"Z. Maamar, Sami Bhiri, S. Tata, Khouloud Boukadi, W. Mansoor","doi":"10.1109/WAINA.2011.54","DOIUrl":"https://doi.org/10.1109/WAINA.2011.54","url":null,"abstract":"This paper examines capacity-driven Web services from a transactional perspective. Such services are empowered with different sets of operations that are selectively triggered in response to requirements posed on them and hence, need to be satisfied. Each set of operations forms a capacity that either fails or succeeds at run-time. In case of failure and for the sake of business continuity, a capacity driven Web service binds to some transactional properties such as pivot, retriable, and compensatable, and behaves in accordance with the guidelines that each transactional property sets. This paper, also, shows that the particular nature of capacity-driven Web services calls for reviewing these transactional properties’ guidelines.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955497","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}
This paper presents an application of Natural Language Tool (NLT) to support the VPRG extraction of text based vulnerability description. The NLT is used to analyze the text-based vulnerability descriptions to retrieve vulnerability properties and evaluate their relationships. Then, a graph based VPRG model that describes the vulnerability can be established. Finally, with fine-tuning from domain expertise, the VPRG model can be useful for analyzing and evaluating web-based vulnerabilities. This approach is proposed to support automatic VPRG extraction from several online database resources as well as vulnerability analysis.
{"title":"Using Natural Language Tool to Assist VPRG Automated Extraction from Textual Vulnerability Description","authors":"H. Le, P. Loh","doi":"10.1109/WAINA.2011.56","DOIUrl":"https://doi.org/10.1109/WAINA.2011.56","url":null,"abstract":"This paper presents an application of Natural Language Tool (NLT) to support the VPRG extraction of text based vulnerability description. The NLT is used to analyze the text-based vulnerability descriptions to retrieve vulnerability properties and evaluate their relationships. Then, a graph based VPRG model that describes the vulnerability can be established. Finally, with fine-tuning from domain expertise, the VPRG model can be useful for analyzing and evaluating web-based vulnerabilities. This approach is proposed to support automatic VPRG extraction from several online database resources as well as vulnerability analysis.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121260052","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}
In 2008, Izu et al. introduced a concept of the sanitizable and deletable signature as a combination of the sanitizable signature and the deletable signature in which the partial information (e.g. privacy information) can be sanitized or deleted with keeping the integrity of disclosed parts. They also constructed two concrete sanitizable and deletable signature schemes SDS1 and SDS2. based on the deletable signature by Miyazaki et al. One of the distinguishing property of their schemes is that each subdocument has a status such as `SADP' (Sanitization is Allowed, but Deletion is Prohibited). Among 7 possible status, SDS1 supports only 4, while SDS2 does 6. This paper proposes a new sanitizable and deletable signature which supports all possible status with keeping the security and efficiency. In addition, we construct another sanitizable and deletable signature which supports 5 status.
{"title":"Yet Another Sanitizable and Deletable Signatures","authors":"T. Izu, Masami Izumi, N. Kunihiro, K. Ohta","doi":"10.1109/WAINA.2011.117","DOIUrl":"https://doi.org/10.1109/WAINA.2011.117","url":null,"abstract":"In 2008, Izu et al. introduced a concept of the sanitizable and deletable signature as a combination of the sanitizable signature and the deletable signature in which the partial information (e.g. privacy information) can be sanitized or deleted with keeping the integrity of disclosed parts. They also constructed two concrete sanitizable and deletable signature schemes SDS1 and SDS2. based on the deletable signature by Miyazaki et al. One of the distinguishing property of their schemes is that each subdocument has a status such as `SADP' (Sanitization is Allowed, but Deletion is Prohibited). Among 7 possible status, SDS1 supports only 4, while SDS2 does 6. This paper proposes a new sanitizable and deletable signature which supports all possible status with keeping the security and efficiency. In addition, we construct another sanitizable and deletable signature which supports 5 status.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115467587","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}
Cloud computing is one of the emerging technologies that will lead to the next generation of Internet. It provides optimized and efficient computing through enhanced collaboration, agility, scalability, and availability. In this paper, the evolution of the Cloud is discussed, the cloud computing model is explained, a set of cloud computing infrastructure metrics is listed, the cloud service model architectures are described, exemplary implementations of cloud service models are analyzed, and intriguing facts about cloud computing status and future are shared.
{"title":"Analysis of Cloud Computing Delivery Architecture Models","authors":"Irena Bojanova, Augustine Samba","doi":"10.1109/WAINA.2011.74","DOIUrl":"https://doi.org/10.1109/WAINA.2011.74","url":null,"abstract":"Cloud computing is one of the emerging technologies that will lead to the next generation of Internet. It provides optimized and efficient computing through enhanced collaboration, agility, scalability, and availability. In this paper, the evolution of the Cloud is discussed, the cloud computing model is explained, a set of cloud computing infrastructure metrics is listed, the cloud service model architectures are described, exemplary implementations of cloud service models are analyzed, and intriguing facts about cloud computing status and future are shared.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130897117","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}
When using replication as a technique for achieving high performance and scalability, optimistic replication is the natural choice. But optimistic replication introduces uncertainty that may lead to confusion in the clients. For example consecutive requests from the same client may be processed out of order, or the answer from a query might be too old to be useful to the client, or an operation may cause unwanted side-effect in the system when the client times out due to long response time. In such situations the clients can benefit from being allowed to specify their tolerable levels of uncertainty, in other words their desired quality-of-service (QoS) from the system. This paper introduces a novel optimistic replication protocol QRep with its QoS-aware middleware that allows the clients' to specify the following three QoS parameters: (1) session guarantee, (2) freshness and (3) deadline. QRep attempts to fulfill the specified QoS while processing the requests. QRep supports both synchronous and asynchronous clients. We carried out experiments to demonstrate the effectiveness of the protocol in terms of both QoS fulfillment and scalability. We also demonstrated that there is no significant performance penalty for providing the QoS.
{"title":"QoS-Aware Middleware for Scalable Replication","authors":"Raihan Al-Ekram, R. Holt","doi":"10.1109/WAINA.2011.33","DOIUrl":"https://doi.org/10.1109/WAINA.2011.33","url":null,"abstract":"When using replication as a technique for achieving high performance and scalability, optimistic replication is the natural choice. But optimistic replication introduces uncertainty that may lead to confusion in the clients. For example consecutive requests from the same client may be processed out of order, or the answer from a query might be too old to be useful to the client, or an operation may cause unwanted side-effect in the system when the client times out due to long response time. In such situations the clients can benefit from being allowed to specify their tolerable levels of uncertainty, in other words their desired quality-of-service (QoS) from the system. This paper introduces a novel optimistic replication protocol QRep with its QoS-aware middleware that allows the clients' to specify the following three QoS parameters: (1) session guarantee, (2) freshness and (3) deadline. QRep attempts to fulfill the specified QoS while processing the requests. QRep supports both synchronous and asynchronous clients. We carried out experiments to demonstrate the effectiveness of the protocol in terms of both QoS fulfillment and scalability. We also demonstrated that there is no significant performance penalty for providing the QoS.","PeriodicalId":355789,"journal":{"name":"2011 IEEE Workshops of International Conference on Advanced Information Networking and Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128949062","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：