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

Supporting application network flows with multiple QoS constraints 支持具有多个QoS约束的应用网络流

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

Amit Mondal, P. Sharma, S. Banerjee, A. Kuzmanovic

{"title":"Supporting application network flows with multiple QoS constraints","authors":"Amit Mondal, P. Sharma, S. Banerjee, A. Kuzmanovic","doi":"10.1109/IWQoS.2009.5201401","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201401","url":null,"abstract":"There is a growing need to support real-time applications over the Internet. Real-time interactive applications often have multiple quality-of-service (QoS) requirements which are application specific. Traditional provisioning of QoS in the Internet through IP routing — Intserv or Diffserv — faces many technical challenges, and is also deterred by the huge deployment issues. As an alternative, application providers often build their own application-specific overlay networks to meet their QoS requirements. In this paper, we present a unified framework which can serve diverse applications with multiple QoS constraints. Our scalable flow route management architecture, called MCQoS, employs a hybrid approach using a path vector protocol to disseminate aggregated path information combined with on-demand path discovery to find paths that match the diverse QoS requirements. It uses a distributed algorithm to dynamically adapt to an alternate path when the current path fails to satisfy the required QoS constraints. We do large-scale simulation and analysis to show that our approach is both efficient and scalable, and that it substantially outperforms the state of the art protocols in accuracy. Our simulation results show that MCQoS can reduce the false negative percentage to less than 1% compared with 5–10% in other approaches, and eliminates false positives, whereas other schemes have false positive rates of 10–20% with minimal increase in protocol overhead. Finally, we implemented and deployed our system on the Planetlab testbed for evaluation in a real network environment.","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":"129246550","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

A framework for fast handoff in IEEE 802.11 based systems 在基于IEEE 802.11的系统中实现快速切换的框架

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

Sourav Pal, Sumantra R. Kundu, P. Ghosh, K. Basu, Sajal K. Das

{"title":"A framework for fast handoff in IEEE 802.11 based systems","authors":"Sourav Pal, Sumantra R. Kundu, P. Ghosh, K. Basu, Sajal K. Das","doi":"10.1109/IWQoS.2009.5201421","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201421","url":null,"abstract":"In standard IEEE 802.11 based systems, when the wireless client migrates away from the radio range of the currently associated access point (AP), network applications temporarily loose connectivity till the client is able to re-associate itself with a new AP. The delay that occurs during the break-off interval can vary from a few hundreds of microseconds to a few seconds. However, delay sensitive applications such as Voice over IP (VoIP) or streaming multimedia applications usually are unable to tolerate such long connectivity delays that fall beyond the range of 50 – 200 ms. This results in dropped calls or frozen video frames. In this paper we describe the design, implementation, and evaluation of a software based framework that facilitates seamless and transparent handoff between different APs in standard IEEE 802.11 based wireless local area networks (WLANs). Although different solutions are available in the literature that seek to address the handoff latency, most of them propose changes that are outside the purview of the current 802.11 standards. We have specifically kept such compatibility restrictions in mind and have devised a software based client side solution that is capable of reducing handoff delays to an average value of 20 ms. It is available as a driver update to the client and requires no additional support from the network. As part of our solution, we have successfully implemented and tested our proposed solution framework on Atheros AR5212 chipsets using the open source MadWifi driver.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"43 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":"134341916","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}

引用次数: 1

Client and server games in peer-to-peer networks 点对点网络中的客户机和服务器游戏

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

I. Koutsopoulos, L. Tassiulas, Lazaros Gkatzikis

{"title":"Client and server games in peer-to-peer networks","authors":"I. Koutsopoulos, L. Tassiulas, Lazaros Gkatzikis","doi":"10.1109/IWQoS.2009.5201412","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201412","url":null,"abstract":"We consider a content sharing network of non-cooperative peers. The strategy set of each peer comprises, (i) client strategies, namely feasible request load splits to servers, and (ii) server strategies, namely scheduling disciplines on requests. First, we consider the request load splitting game for given server strategies such as First-In-First-Out or given absolute priority policies. A peer splits its request load to servers to optimize its performance objective. We consider the class of best response load splitting policies residing between the following extremes: a truly selfish, or egotistic one, where a peer optimizes its own delay, and a pseudo-selfish or altruistic one, where a peer also considers incurred delays to others. We derive conditions for Nash equilibrium points (NEPs) and discuss convergence to NEP and properties of the NEP. For both the egotistic cases, the NEP is unique. For the altruistic case, each of the multiple NEPs is an optimum, a global one for the FIFO case and a local one otherwise. Next, we include scheduling in peer strategies. With its scheduling discipline, a peer cannot directly affect its delay, but it can affect the NEP after peers play the load splitting game. The idea is that peer i should offer high priority to (and thus attract traffic from) higher-priority peers that cause large delay to i at other servers. We devise two-stage game models, where, at a first stage, a peer selects a scheduling rule in terms of a convex combination of absolute priorities, and subsequently peers play the load splitting game. In the most sophisticated rule, a peer selects a scheduling discipline that minimizes its delay at equilibrium, after peers play the load splitting game. We also suggest various heuristics for picking the scheduling discipline. Our models and results capture the dual client-server peer role and aim at quantifying the impact of selfish peer interaction on equilibria.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"15 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":"131407481","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}

引用次数: 3

Co-Con: Coordinated control of power and application performance for virtualized server clusters Co-Con:对虚拟化服务器集群的功率和应用程序性能进行协调控制

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

Xiaorui Wang, Yefu Wang

{"title":"Co-Con: Coordinated control of power and application performance for virtualized server clusters","authors":"Xiaorui Wang, Yefu Wang","doi":"10.1109/IWQoS.2009.5201388","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201388","url":null,"abstract":"Today's data centers face two critical challenges. First, various customers need to be assured by meeting their required service-level agreements such as response time and throughput. Second, server power consumption must be controlled in order to avoid failures caused by power capacity overload or system overheating due to increasing high server density. However, existing work controls power and application-level performance separately and thus cannot simultaneously provide explicit guarantees on both. This paper proposes Co-Con, a novel cluster-level control architecture that coordinates individual power and performance control loops for virtualized server clusters. To emulate the current practice in data centers, the power control loop changes hardware power states with no regard to the application-level performance. The performance control loop is then designed for each virtual machine to achieve the desired performance even when the system model varies significantly due to the impact of power control. Co-Con configures the two control loops rigorously, based on feedback control theory, for theoretically guaranteed control accuracy and system stability. Empirical results demonstrate that Co-Con can simultaneously provide effective control on both application-level performance and underlying power consumption.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"65 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":"126272229","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}

引用次数: 58

SigLM: Signature-driven load management for cloud computing infrastructures SigLM:用于云计算基础设施的签名驱动负载管理

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

Zhenhuan Gong, P. Ramaswamy, Xiaohui Gu, Xiaosong Ma

{"title":"SigLM: Signature-driven load management for cloud computing infrastructures","authors":"Zhenhuan Gong, P. Ramaswamy, Xiaohui Gu, Xiaosong Ma","doi":"10.1109/IWQoS.2009.5201413","DOIUrl":"https://doi.org/10.1109/IWQoS.2009.5201413","url":null,"abstract":"Cloud computing has emerged as a promising platform that grants users with direct yet shared access to computing resources and services without worrying about the internal complex infrastructure. Unlike traditional batch service model, cloud service model adopts a pay-as-you-go form, which demands explicit and precise resource control. In this paper, we present SigLM, a novel Signature-driven Load Management system to achieve quality-aware service delivery in shared cloud computing infrastructures. SigLM dynamically captures fine-grained signatures of different application tasks and cloud nodes using time series patterns, and performs precise resource metering and allocation based on the extracted signatures. SigLM employs dynamic time warping algorithm and multi-dimensional time series indexing to achieve efficient signature pattern matching. Our experiments using real load traces collected on the PlanetLab show that SigLM can improve resource provisioning performance by 30–80% compared to existing approaches. SigLM is scalable and efficient, which imposes less than 1% overhead to the system and can perform signature matching within tens of milliseconds.","PeriodicalId":231103,"journal":{"name":"2009 17th International Workshop on Quality of Service","volume":"138 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":"121654852","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}

引用次数: 20

Paper list 论文列表

2009 17th International Workshop on Quality of Service Pub Date : 1900-01-01 DOI: 10.1109/isscs.2015.7203919

R. Shorten, Qian Wang, Kui Ren, Yuming Jiang, G. Hu, L. Xu, Gaurav Deshpande, Eric Rozner, Apurv Bhartia, Lili Qlu, R. Stanojevic, A. Schlote, Xinyuan Wang, Haining Wang, D. Wijesekera, L. Tassiulas, Xiaorui Wang

引用次数: 0