2009 17th International Workshop on Quality of Service最新文献_第2页

Cooperative multicast scheduling with random network coding in WiMAX WiMAX随机网络编码下的协同组播调度

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201384

Jin Jin, Baochun Li

{"title":"Cooperative multicast scheduling with random network coding in WiMAX","authors":"Jin Jin, Baochun Li","doi":"10.1109/IWQoS.2009.5201384","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201384","url":null,"abstract":"The Multicast and Broadcast Service (MBS) in WiMAX has emerged as the next-generation wireless infrastructure to broadcast data or digital video. Multicast scheduling protocols play a critical role in achieving efficient multicast transmissions in MBS. However, the current state-of-the-art protocols, based on the shared-channel single-hop transmission model, do not exploit any potential advantages provided by the channel and cooperative diversity in multicast sessions, even while WiMAX OFDMA provides such convenience. The inefficient multicast transmission leads to the under-utilization of scarce wireless bandwidth. In this paper, we revisit the multicast scheduling problem, but with a new perspective in the specific case of MBS in WiMAX, considering the use of multiple ODFMA channels, multiple hops, and multiple paths simultaneously. Participating users in the multicast session are dynamically enabled as relays and concurrently communicate with others to supply more data. During the transmission, random network coding is adopted, which helps to significantly reduce the overhead. We design practical scheduling protocols by jointly studying the problems of channel and power allocation on relays, which are very critical for efficient cooperative communication. Protocols that are theoretically and practically feasible are provided to optimize multicast rates and to efficiently allocate resources in the network. Finally, with simulation studies, we evaluate our proposed protocols to highlight the effectiveness of cooperative communication and random network coding in multicast scheduling with respect to improving performance.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131510562","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}

引用次数: 33

Ensuring data storage security in Cloud Computing 确保云计算环境下的数据存储安全

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201385

Rampal Singh, Sawan Kumar, Shani Kumar Agrahari

{"title":"Ensuring data storage security in Cloud Computing","authors":"Rampal Singh, Sawan Kumar, Shani Kumar Agrahari","doi":"10.1109/IWQoS.2009.5201385","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201385","url":null,"abstract":"Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, Cloud Computing moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this article, we focus on cloud data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in the cloud, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server colluding attacks.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126750548","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}

引用次数: 1114

Reliable navigation of mobile sensors in wireless sensor networks without localization service 无定位服务无线传感器网络中移动传感器的可靠导航

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201398

Qingjun Xiao, Bin Xiao, Jiaqing Luo, Guobin Liu

{"title":"Reliable navigation of mobile sensors in wireless sensor networks without localization service","authors":"Qingjun Xiao, Bin Xiao, Jiaqing Luo, Guobin Liu","doi":"10.1109/IWQoS.2009.5201398","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201398","url":null,"abstract":"This paper deals with the problem of guiding mobile sensors (or robots) to a phenomenon across a region covered by static sensors. We present a distributed, reliable and energy-efficient algorithm to construct a smoothed moving trajectory for a mobile robot. The reliable trajectory is realized by first constructing among static sensors a distributed hop count based artificial potential field (DH-APF) with only one local minimum near the phenomenon, and then navigating the robot to that minimum by an attractive force following the reversed gradient of the constructed field. Besides the attractive force towards the phenomenon, our algorithm adopts an additional repulsive force to push the robot away from obstacles, exploiting the fast sensing devices carried by the robot. Compared with previous navigation algorithms that guide the robot along a planned path, our algorithm can (1) tolerate the potential deviation from a planned path, since the DH-APF covers the entire deployment region; (2) mitigate the trajectory oscillation problem; (3) avoid the potential collision with obstacles; (4) save the precious energy of static sensors by configuring a large moving step size, which is not possible for algorithms neglecting the issue of navigation reliability. Our theoretical analysis of the above features considers practical sensor network issues including radio irregularity, packet loss and radio conflict. We implement the proposed algorithm over TinyOS and test its performance on the simulation platform with a high fidelity provided by TOSSIM and Tython. Simulation results verify the reliability and energy efficiency of the proposed mobile sensor navigation algorithm.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115042885","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}

引用次数: 10

Efficient server provisioning with end-to-end delay guarantee on multi-tier clusters 高效的服务器配置，在多层集群上提供端到端延迟保证

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201420

P. Lama, Xiaobo Zhou

{"title":"Efficient server provisioning with end-to-end delay guarantee on multi-tier clusters","authors":"P. Lama, Xiaobo Zhou","doi":"10.1109/IWQoS.2009.5201420","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201420","url":null,"abstract":"Dynamic server provisioning is critical to quality-of-service assurance for multi-tier Internet applications. In this paper, we address three important and challenging problems. First, we propose an efficient server provisioning approach on multi-tier clusters based on an end-to-end resource allocation optimization model. It is to minimize the number of servers allocated to the system while the average end-to-end delay guarantee is satisfied. Second, we design a model-independent fuzzy controller for bounding an important performance metric, the 90th-percentile delay of requests flowing through the multi-tier architecture. Third, to compensate for the latency due to the dynamic addition of servers, we design a self-tuning component that adaptively adjusts the output scaling factor of the fuzzy controller according to the transient behavior of the end-to-end delay. Extensive simulation results, using one representative customer behavior model in a typical three-tier web cluster, demonstrate that the provisioning approach is able to significantly reduce the server utilization compared to an existing representative approach. The approach integrated with the model-independent self-tuning fuzzy controller can efficiently assure the average and the 90th-percentile end-to-end delay guarantees on multi-tier server clusters.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134516331","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}

引用次数: 30

Uncovering global icebergs in distributed monitors 在分布式监视器中发现全球冰山

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201394

Guanyao Huang, Ashwin Lall, C. Chuah, Jun Xu

引用次数: 9

Congestion location detection: Methodology, algorithm, and performance 拥塞位置检测:方法论、算法和性能

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201404

Shao Liu, M. Chiang, M. Jourdain, Jin Li

引用次数: 8

Generalized distributed rate limiting 广义分布速率限制

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201389

R. Stanojevic, R. Shorten

引用次数: 15

On generalized low-rate denial-of-quality attack against Internet services 针对互联网服务的广义低速率拒绝质量攻击

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201419

Yajuan Tang, Xiapu Luo, Qing Hui, R. Chang

引用次数: 7

HOBRP: A hardware optimized packet scheduler that provides tunable end-to-end delay bound HOBRP:硬件优化的包调度程序，提供可调的端到端延迟绑定

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201397

Ruisheng Wang, Youjian Zhao, Hong-Tao Guan, Guanghui Yang

{"title":"HOBRP: A hardware optimized packet scheduler that provides tunable end-to-end delay bound","authors":"Ruisheng Wang, Youjian Zhao, Hong-Tao Guan, Guanghui Yang","doi":"10.1109/IWQoS.2009.5201397","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201397","url":null,"abstract":"A packet scheduler is a primary component of the improved Quality of Service (QoS) model for today's Internet. Although many fair packet schedulers have been proposed through theoretical consideration, practical high-speed packet schedulers remain elementary. The disparity arises because existent schedulers either lack of necessary QoS guarantee or have an unacceptable cost of computation and storage. In this paper, we propose a simple and efficient packet scheduler called Hardware Optimized Bit Reversal Permutation (HOBRP) based scheduler. Besides some common merits including low time- and space-complexity, bounded end-to-end delay guarantee and constant fairness index that many well-known schedulers have already owned, our HOBRP still possesses two additional features: One is that the end-to-end delay bound of HOBRP is tunable, which makes itself flexible enough to provide different levels of delay bounds for diverse types of application flows. The other is that all the operations and structures used by HOBRP are very simple and easy to be pipelined and paralleled, which benefits an intuitive high-speed hardware design scheme.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130330638","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}

引用次数: 0

HiDRA: Statistical multi-dimensional resource discovery for large-scale systems 大规模系统的统计多维资源发现

2009 17th International Workshop on Quality of Service Pub Date : 2009-07-13 DOI: 10.1109/IWQoS.2009.5201408

Michael Cardosa, A. Chandra

引用次数: 1