2009 17th International Workshop on Quality of Service最新文献

Fast Resilient Jumbo frames in wireless LANs 无线局域网中的快速弹性巨型帧

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

A. Iyer, Gaurav Deshpande, Eric Rozner, Apurv Bhartia, L. Qiu

{"title":"Fast Resilient Jumbo frames in wireless LANs","authors":"A. Iyer, Gaurav Deshpande, Eric Rozner, Apurv Bhartia, L. Qiu","doi":"10.1109/IWQoS.2009.5201390","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201390","url":null,"abstract":"With the phenomenal growth of wireless networks and applications, it is increasingly important to deliver content efficiently and reliably over wireless links. However, wireless performance is still far from satisfactory due to limited wireless spectrum, inherent lossy wireless medium, and imperfect packet scheduling. While significant research has been done to improve wireless performance, much of the existing work focuses on individual design space. We take a holistic approach to optimizing wireless performance and resilience. We propose Fast Resilient Jumbo frames (FRJ), which exploit the synergy between three important design spaces: (i) frame size selection, (ii) partial packet recovery, and (iii) rate adaptation. While these design spaces are seemingly unrelated, we show that there are strong interactions between them and effectively leveraging these techniques can provide increased robustness and performance benefits in wireless LANs. FRJ uses jumbo frames to boost network throughput under good channel conditions and uses partial packet recovery to efficiently recover packet losses under bad channel conditions. FRJ also utilizes partial recovery aware rate adaptation to maximize throughput under partial recovery. Using real implementation and testbed experiments, we show that FRJ out-performs existing approaches in a wide range of scenarios.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"252 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":"122489304","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}

引用次数: 25

On optimal information capture by energy-constrained mobile sensor 能量约束移动传感器的最优信息捕获

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

Shibo He, Jiming Chen, Youxian Sun, David K. Y. Yau, N. Yip

引用次数: 8

Hybrid multi-channel multi-radio wireless mesh networks 混合多通道多无线电无线网状网络

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

Yong Ding, Kanthakumar Pongaliur, Li Xiao

引用次数: 41

Routing with QoS information aggregation in hierarchical networks 分层网络中具有QoS信息聚合的路由

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

Ronghui Hou, K. Lui, Ka-Cheong Leung, F. Baker

引用次数: 5

Online detection of network traffic anomalies using behavioral distance 使用行为距离在线检测网络流量异常

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

Hemant Sengar, Xinyuan Wang, Haining Wang, D. Wijesekera, S. Jajodia

{"title":"Online detection of network traffic anomalies using behavioral distance","authors":"Hemant Sengar, Xinyuan Wang, Haining Wang, D. Wijesekera, S. Jajodia","doi":"10.1109/IWQoS.2009.5201415","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201415","url":null,"abstract":"While network-wide anomaly analysis has been well studied, the on-line detection of network traffic anomalies at a vantage point inside the Internet still poses quite a challenge to network administrators. In this paper, we develop a behavioral distance based anomaly detection mechanism with the capability of performing on-line traffic analysis. To construct accurate online traffic profiles, we introduce horizontal and vertical distance metrics between various traffic features (i.e., packet header fields) in the traffic data streams. The significant advantages of the proposed approach lie in four aspects: (1) it is efficient and simple enough to process on-line traffic data; (2) it facilitates protocol behavioral analysis without maintaining per-flow state; (3) it is scalable to high speed traffic links because of the aggregation, and (4) using various combinations of packet features and measuring distances between them, it is capable for accurate on-line anomaly detection. We validate the efficacy of our proposed detection system by using network traffic traces collected at Abilene and MAWI high-speed links.","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":"128953483","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}

引用次数: 31

QoEScope: Adaptive IP service management for heterogeneous enterprise networks QoEScope:异构企业网络的自适应IP业务管理

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

Yueping Zhang, V. Singh, Yu Gu, Guofei Jiang, Yu Ru

{"title":"QoEScope: Adaptive IP service management for heterogeneous enterprise networks","authors":"Yueping Zhang, V. Singh, Yu Gu, Guofei Jiang, Yu Ru","doi":"10.1109/IWQoS.2009.5201414","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201414","url":null,"abstract":"In the recent years, a progressively growing number of computing and communication services have undertaken the migration from their conventional media to the new unified platform, IP networks. As a consequence, business success of service providers becomes largely determined by the effectiveness of their service management schemes, which require rapid identification of problems and resolution of network-related anomalies. However, this is a non-trivial task in heterogeneous enterprise networks due to service providers' invisibility of the health and performance of the underlying carrier network. In addition, the gap between quality of service (QoS) measurements reflecting network performance and quality of experience (QoE) metrics indicating user-perceived service quality further makes effective service management more challenging. In this paper, we present a unified service management system called QoEScope, which combines scalable end-to-end probing, accurate topology inference in the presence of implicit routers, adaptive bridging between QoS measurement and QoE metrics, and intelligent root cause analysis. Extensive testbed emulations and Internet experiments demonstrate that QoEScope is a highly practical and effective IP service management solution for heterogeneous enterprise networks.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"25 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":"122566690","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}

引用次数: 2

High quality P2P-Video-on-Demand with download bandwidth limitation 具有下载带宽限制的高质量p2p视频点播

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

Attila Korösi, Csaba Lukovszki, B. Székely, A. Császár

{"title":"High quality P2P-Video-on-Demand with download bandwidth limitation","authors":"Attila Korösi, Csaba Lukovszki, B. Székely, A. Császár","doi":"10.1109/IWQoS.2009.5201392","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201392","url":null,"abstract":"This paper investigates a VoD distribution architecture that exploits the increasing uplink and local storage capacities of customer equipment in a peer-to-peer (P2P) manner in order to offload the central video servers and the core network segment. We investigate an environment where (i) the peers' upload speeds vary in time and (ii) on the subscriber's downlink a strict bandwidth limit constrains the VoD delivery, and where (iii) this downlink limit is not significantly higher than the video's own bit rate while (iv) the subscribers' upload capacities are not cut down. In such an environment providing quality for a true VoD service requires carefully selected mechanisms. We show how the components (storage policy, uplink speed management) of a P2P-VoD system should be changed to be feasible under these conditions. The main component of the system determines the minimal required server speed as a function of the prebuffered content, the uploaders' behaviours, and the given play back fault probability. Additionally, by using simulation we investigate the optimal downlink bandwidth limit for a subscriber population with different average upload speeds.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"20 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":"125319981","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}

引用次数: 7

Adaptive admission control for web applications with variable capacity 可变容量web应用程序的自适应准入控制

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

Vipul Mathur, Preetam Patil, V. Apte, K. Moudgalya

{"title":"Adaptive admission control for web applications with variable capacity","authors":"Vipul Mathur, Preetam Patil, V. Apte, K. Moudgalya","doi":"10.1109/IWQoS.2009.5201411","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201411","url":null,"abstract":"The system capacity available to a multi-tier Web based application is often a dynamic quantity. Most static threshold-based overload control mechanisms are best suited to situations where the system's capacity is constant or the bottleneck resource is known. However, with varying capacity, the admission control mechanism needs to adapt dynamically. We propose and implement an adaptive admission control mechanism that adjusts the admitted load to compensate for changes in system capacity. The proposed solution is implemented as a proxy server between clients and front-end Web servers. The proxy monitors ‘black-box’ performance metrics-response time and rate of successfully completed requests (goodput). With these measurements as indicators of system state, we employ a control theory based feedback loop to dynamically determine the rate of admitted requests. The objective is to balance changes in response time and changes in goodput, while preventing overloads due to reduction in available system capacity. We evaluate our mechanism with experiments on a test-bed and find that it is able to maintain higher productivity than a static admission control scheme.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"220 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":"133376832","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}

引用次数: 8

Delay tolerant event collection for underground coal mine using mobile sinks 煤矿井下移动水槽容延迟事件采集

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

Ji Luo, Qian Zhang, Dan Wang

{"title":"Delay tolerant event collection for underground coal mine using mobile sinks","authors":"Ji Luo, Qian Zhang, Dan Wang","doi":"10.1109/IWQoS.2009.5201405","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201405","url":null,"abstract":"There is a growing interest in using wireless sensor networks for security monitoring in the underground coal mines. In such applications, the sensor nodes are deployed to detect interested events, e.g., the density of certain gas at some locations is higher than the predefined threshold. These events are then reported to the base station outside. Using conventional multi-hop routing for data reporting, however, will result in imbalance of energy consumption among the sensors. Even worse, the unfriendly communication condition underground makes the multi-hop data transmission challenging, if not impossible. In this paper, we thus propose to leverage tramcars as mobile sinks to assist event collection and delivery. We further observe that the sensor readings have spatial and temporal correlation. More precisely, the same event may be observed by multiple neighboring sensor nodes and/or at different time. Obviously, it can be more energy-efficient if the data are selectively reported. As such, we first provide a general, yet realistic definition on the events. We then transform the event collection problem into a set coverage problem; and our objective is to maximize the system lifetime with the coverage rate of events guaranteed. We show that the problem is NP-hard even when all the events are known in advance. We present an online scheme which leverages the spatial-temporal correlation of the events to balance the communication energy of the static sensor nodes. We prove that the expected event coverage rate can be guaranteed in theory. Through extensive simulation, we demonstrate that our scheme can significantly extend system lifetime, as compared to a stochastic collection scheme.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"47 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":"123246510","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

Succinct priority indexing structures for the management of large priority queues 用于管理大型优先级队列的简洁优先级索引结构

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

Hao Wang, Bill Lin

{"title":"Succinct priority indexing structures for the management of large priority queues","authors":"Hao Wang, Bill Lin","doi":"10.1109/IWQoS.2009.5201416","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201416","url":null,"abstract":"Priority queues are an essential building block for implementing advanced per-flow service disciplines at high-speed network links. In this paper, we propose novel solutions to the scalable implementation of priority queues by decomposing the problem into two parts, a succinct priority index in SRAM that can efficiently maintain a real-time sorting of priorities, coupled with a DRAM-based implementation of large packet buffers. In particular, we propose three related novel succinct priority index data structures for implementing high-speed priority indexes: a Priority-Index (PI), a Counting-Priority-Index (CPI), and a Pipelined Counting-Priority-Index (Pipelined CPI). We show that all three structures can be very compactly implemented in SRAM using only Θ(U) space, where U is the size of the universe required to implement the priority keys (timestamps). We also show that our proposed priority index structures can be implemented very efficiently as well by leveraging hardware-optimized instructions that are readily available in modern 64-bit microprocessors. The operations on the PI and CPI structures take Θ(logW U) time, where W is the processor word-length (i.e., W = 64 bits). Alternatively, operations on the Pipelined CPI structure take constant time with only Θ(logW U) pipeline stages. Finally, we show the application of our proposed priority index structures for scalable management of large packet buffers at line speeds.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"25 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":"116802619","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}

引用次数: 7