2012 IEEE 20th International Workshop on Quality of Service最新文献_第2页

Maximizing the bandwidth multiplier effect for hybrid cloud-P2P content distribution 最大化混合云- p2p内容分发的带宽乘数效应

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245990

Zhenhua Li, Tieying Zhang, Yan Huang, Zhi-Li Zhang, Yafei Dai

{"title":"Maximizing the bandwidth multiplier effect for hybrid cloud-P2P content distribution","authors":"Zhenhua Li, Tieying Zhang, Yan Huang, Zhi-Li Zhang, Yafei Dai","doi":"10.1109/IWQoS.2012.6245990","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245990","url":null,"abstract":"Hybrid cloud-P2P content distribution (“CloudP2P”) provides a promising alternative to the conventional cloud-based or peer-to-peer (P2P)-based large-scale content distribution. It addresses the potential limitations of these two conventional approaches while inheriting their advantages. A key strength of CloudP2P lies in the so-called bandwidth multiplier effect: by appropriately allocating a small portion of cloud (server) bandwidth Si to a peer swarm i (consisting of users interested in the same content) to seed the content, the users in the peer swarm - with an aggregate download bandwidth Di - can then distribute the content among themselves; we refer to the ratio Di/Si as the bandwidth multiplier (for peer swarm i). A major problem in the design of a CloudP2P content distribution system is therefore how to allocate cloud (server) bandwidth to peer swarms so as to maximize the overall bandwidth multiplier effect of the system. In this paper, using real-world measurements, we identify the key factors that affect the bandwidth multipliers of peer swarms and thus construct a fine-grained performance model for addressing the optimal bandwidth allocation problem (OBAP). Then we develop a fast-convergent iterative algorithm to solve OBAP. Both trace-driven simulations and prototype implementation confirm the efficacy of our solution.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"19 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914468","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

AIST: Insights into queuing and loss on highly multiplexed links AIST:对高复用链路上的排队和损失的见解

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245974

Maxim Podlesny, Sergey Gorinsky, Balaji Rengarajan

{"title":"AIST: Insights into queuing and loss on highly multiplexed links","authors":"Maxim Podlesny, Sergey Gorinsky, Balaji Rengarajan","doi":"10.1109/IWQoS.2012.6245974","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245974","url":null,"abstract":"In explicit or delay-driven congestion control, a common objective is to sustain high throughput without long queues and large losses at the bottleneck link of the network path. Congestion control protocols strive to achieve this goal by transmitting smoothly in the steady state. The discovery of the appropriate steady-state transmission rates is a challenging task in itself and typically introduces additional queuing and losses. Seeking insights into the steady-state profiles of queuing and loss achievable by real protocols, this paper presents an AIST (Asynchronous arrivals with Ideally Smooth Transmission) model that abstracts away transient queuing and losses related to discovering the path capacity and redistributing it fairly among the packet flows on the bottleneck link. In AIST, the flows arrive asynchronously but transmit their packets at the same constant rate in the steady state. For the link with an overprovisioned buffer, our queuing-theoretic analysis and simulations for different smooth distributions of packet interarrival times agree that queuing under AIST with the target utilization of 1 is on the order of the square root of N, where N is the number of flows. With small buffers, our simulations of AIST show an ability to provide bounded loss rates regardless of the number of flows.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117214490","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

Approaching optimal compression with fast update for large scale routing tables 大规模路由表的快速更新逼近最优压缩

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245978

Tong Yang, Bo Yuan, Shenjiang Zhang, Ting Zhang, Ruian Duan, Yi Wang, B. Liu

{"title":"Approaching optimal compression with fast update for large scale routing tables","authors":"Tong Yang, Bo Yuan, Shenjiang Zhang, Ting Zhang, Ruian Duan, Yi Wang, B. Liu","doi":"10.1109/IWQoS.2012.6245978","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245978","url":null,"abstract":"With the fast development of Internet, the size of routing tables in the backbone routers keeps a rapid growth in recent years. An effective solution to control the memory occupation of the ever-increased huge routing table is the Forwarding Information Base (FIB) compression. Existing optimal FIB compression algorithm ORTC suffers from high computational complexity and poor update performance, due to the loss of essential structure information during its compression process. To address this problem, we present two suboptimal FIB compression algorithms - EAR-fast and EAR-slow, respectively, based on our proposed Election and Representative (EAR) algorithm which is an optimal FIB compression algorithm. The two suboptimal algorithms preserve the structure information, and support fast incremental updates while reducing computational complexity. Experiments on an 18-month real data set show that compared with ORTC, the proposed EAR-fast algorithm requires only 9.8% compression time and 37.7% memory space, but supports faster update while prolonging the recompression interval remarkably. All these performance advantages come at a cost of merely a 1.5% loss in compression ratio compared with the theoretical optimal ratio.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123614490","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}

引用次数: 14

Scheduling with outdated CSI: Effective service capacities of optimistic vs. pessimistic policies 过时CSI调度:乐观与悲观策略的有效服务能力

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245966

J. Gross

{"title":"Scheduling with outdated CSI: Effective service capacities of optimistic vs. pessimistic policies","authors":"J. Gross","doi":"10.1109/IWQoS.2012.6245966","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245966","url":null,"abstract":"The concept of the effective service capacity is an analytical framework for evaluating QoS-constrained queuing performance of communication systems. Recently, it has been applied to the analysis of different wireless systems like point-to-point systems or multi-user systems. In contrast to previous work, we consider in this work slot-based systems where a scheduler determines a packet size to be transmitted at the beginning of the slot. For this, the scheduler can utilize outdated channel state information. Based on a threshold error model, we derive the effective service capacity for different scheduling strategies that the scheduler might apply. We show that even slightly outdated channel state information leads to a significant loss in capacity in comparison to an ideal system with perfect channel state information available at the transmitter. This loss depends on the `risk-level' the scheduler is willing to take which is represented by an SNR margin. We show that for any QoS target and average link state there exists an optimal SNR margin improving the maximum sustainable rate. Typically, this SNR margin is around 3 dB but is sensible to the QoS target and average link quality. Finally, we can also show that adapting to the instantaneous channel state only pays off if the correlation between the channel estimate and the channel state is relatively high (with a coefficient above 0.9).","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131597571","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}

引用次数: 11

A service quality coordination model bridging QoS and QoE 连接QoS和QoE的服务质量协调模型

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245977

T. Yamazaki, T. Miyoshi, Masato Eguchi, K. Yamori

引用次数: 21

Enhancing AQM to combat wireless losses 加强空气质素监测，以减低无线信号的损失

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245989

Chengdi Lai, Ka-Cheong Leung, V. Li

引用次数: 4

Preventing TCP incast throughput collapse at the initiation, continuation, and termination 防止TCP连铸吞吐量在开始、继续和结束时崩溃

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245995

A. Tam, Kang Xi, Yang Xu, H. Jonathan Chao

{"title":"Preventing TCP incast throughput collapse at the initiation, continuation, and termination","authors":"A. Tam, Kang Xi, Yang Xu, H. Jonathan Chao","doi":"10.1109/IWQoS.2012.6245995","DOIUrl":"https://doi.org/10.1109/IWQoS.2012.6245995","url":null,"abstract":"Incast applications have grown in popularity with the advancement of data center technology. It is found that the TCP incast may suffer from the throughput collapse problem, as a consequence of TCP retransmission timeouts when the bottleneck buffer is overwhelmed and causes the packet losses. This is critical to the Quality of Service of cloud computing applications. While some previous literature has proposed solutions, we still see the problem not completely solved. In this paper, we investigate the three root causes for the poor performance of TCP incast flows and propose three solutions, one for each at the beginning, the middle and the end of a TCP connection. The three solutions are: admission control to TCP flows so that the flow population would not exceed the network's capacity; retransmission based on timestamp to detect loss of retransmitted packets; and reiterated FIN packets to keep the TCP connection active until the the termination of a session is acknowledged. The orchestration of these solutions prevents the throughput collapse. The main idea of these solutions is to ensure all the on-going TCP incast flows can maintain the self-clocking, thus eliminates the need to resort to retransmission timeout for recovery. We evaluate these solutions and find them work well in preventing the retransmission timeout of TCP incast flows, hence also preventing the throughput collapse.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124469733","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

CloudGPS: A scalable and ISP-friendly server selection scheme in cloud computing environments CloudGPS:云计算环境中可扩展且对isp友好的服务器选择方案

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245964

Cong Ding, Yang Chen, Tianyin Xu, Xiaoming Fu

引用次数: 33

Application dependency discovery using matrix factorization 使用矩阵分解发现应用程序依赖项

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245965

Min Ding, V. Singh, Yueping Zhang, Guofei Jiang

引用次数: 5

Session reconstruction for HTTP adaptive streaming: Laying the foundation for network-based QoE monitoring HTTP自适应流的会话重构:为基于网络的QoE监控奠定基础

2012 IEEE 20th International Workshop on Quality of Service Pub Date : 2012-06-04 DOI: 10.1109/IWQoS.2012.6245987

Rafael Huysegems, Bart De Vleeschauwer, Koen De Schepper, Chris Hawinkel, Tingyao Wu, K. Laevens, W. V. Leekwijck

引用次数: 25