{"title":"Decay function model for resource configuration and adaptive allocation on Internet servers","authors":"Minghua Xu, Chengzhong Xu","doi":"10.1109/IWQOS.2004.1309355","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309355","url":null,"abstract":"Server-side resource configuration and allocation for QoS guarantee is a challenge in performance-critical Internet applications. To overcome the difficulties caused by the high-variability and burstiness of Internet traffic, this paper presents a decay function model of request scheduling algorithms for the resource configuration and allocation problem. Under the decay function model, request scheduling is modelled as a transfer-function based filter system that has an input process of requests and an output process of server load. Unlike conventional queueing network models that rely on mean-value analysis for input renewal or Markovian processes, this decay function model works for general time-series based or measurement based processes and hence facilitates the study of statistical correlations between the request traffic, server load, and QoS of requests. Based on the model, we apply filter design theories in signal processing in the optimality analysis of various scheduling algorithms. We reveal a relationship between the server capacity, scheduling policy, service deadline, and other request properties in a formalism and present the optimality condition with respect to the second moments of request properties for an important class of fixed-time scheduling policies. Simulation results verify the relationship and show that optimal fixed-time scheduling can effectively reduce the server workload variance and guarantee service deadlines with high robustness on the Internet.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116494935","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}
{"title":"Topology design for service overlay networks with bandwidth guarantees","authors":"S. Vieira, J. Liebeherr","doi":"10.1109/IWQOS.2004.1309384","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309384","url":null,"abstract":"The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traffic that traverses multiple autonomous systems (ASs) requires a level of cooperation between ASs that is difficult to achieve in the current architecture. Recently, service overlay networks have been considered as an approach to QoS deployment that avoids these difficulties. In this study, we address the problem of the topological synthesis of a service overlay network, where endsystems and nodes of the overlay network (provider nodes) are connected through ISPs that supports bandwidth reservations. We express the topology design problem as an optimization problem. Even though the design problem is related to the (in general NP-hard) quadratic assignment problem, we are able to show that relatively simple heuristic algorithms can deliver results that are sometimes close to the optimal solution.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129470644","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}
{"title":"Yaksha: a self-tuning controller for managing the performance of 3-tiered Web sites","authors":"A. Kamra, V. Misra, E. Nahum","doi":"10.1109/IWQOS.2004.1309356","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309356","url":null,"abstract":"Managing the performance of multiple-tiered Web sites under high client loads is a critical problem with the advent of dynamic content and database-driven servers on the Internet. This paper presents a control-theoretic approach for admission control in multitiered Web sites that both prevents overload and enforces absolute client response times, while still maintaining high throughput under load. We use classical control theoretic techniques to design a proportional integral (PI) controller for admission control of client HTTP requests. In addition, we present a processor-sharing model that is used to make the controller self-tuning, so that no parameter setting is required beyond a target response time. Our controller is implemented as a proxy, called Yaksha, which operates by taking simple external measurements of the client response times. Our design is noninvasive and requires minimal operator intervention. We evaluate our techniques experimentally using a 3-tiered dynamic content Web site as a testbed. Using the industry standard TPC-W client workload generator, we study the performance of the PI admission controller with extensive experiments. We show that the controller effectively bounds the response times of requests for dynamic content while still maintaining high throughput levels, even when the client request rate is many times that of the server's maximum processing rate. We demonstrate the effectiveness of our self-tuning mechanism, showing that it responds and adapts smoothly to changes in the workload.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134382122","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}
{"title":"Enhancing mobile QoS based on movement contracts","authors":"Frank A. Zdarsky, J. Schmitt","doi":"10.1109/IWQOS.2004.1309349","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309349","url":null,"abstract":"Resource management for individual flows can significantly improve quality of service (QoS) in mobile cellular networks. However, its efficiency depends on the availability of information about the movement of mobile terminals. Movement prediction can potentially provide this information, but is costly if performed by the network and usually assumes a certain movement model, which may not adequately reflect each individual user's behavior. Instead, we propose the concept of movement contracts, where a mobile terminal specifies its movement to the network, which in return provides a better QoS as long as the provided specification is sufficiently accurate. We describe approaches to specify the spatial and temporal aspects of movement with a parsimonious parameter set and evaluate these approaches through simulations. We find that movement contracts can significantly reduce both session blocking and handover dropping probability simultaneously, whereas existing approaches have to make a tradeoff between these.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124870290","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}
{"title":"A mechanism for equitable bandwidth allocation under QoS and budget constraints","authors":"Sreenivas Gollapudi, D. Sivakumar","doi":"10.1109/IWQOS.2004.1309370","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309370","url":null,"abstract":"Equitable bandwidth allocation is essential when QoS requirements and purchasing power vary among users. To this end, we present a mechanism for bandwidth allocation based on differential pricing. In our model, the QoS vs. cost trade-off induces a minimum acceptable allocation, a maximum acceptable allocation, and a unique optimal allocation for each user. We analyze the fairness and truthfulness properties of our mechanism from a game-theoretic perspective. We show that it produces allocations that provably satisfy a variant of the classical notion of max-min fairness. It ensures that flows with higher QoS requirements need to pay at higher rates to increase their likelihood of being served. Furthermore, the Nash equilibrium induced by our mechanism leads to allocations that are comparable to \"socially optimal\" allocations; hence users gain very little by being untruthful.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124042007","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}
D. Pezaros, D. Hutchison, Francisco J. García, R. Gardner, J. Sventek
{"title":"Service quality measurements for IPv6 inter-networks","authors":"D. Pezaros, D. Hutchison, Francisco J. García, R. Gardner, J. Sventek","doi":"10.1109/IWQOS.2004.1309369","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309369","url":null,"abstract":"Measurement-based performance evaluation of network traffic is becoming very important, especially for networks trying to provide differentiated levels of service quality to the different application flows. The nonidentical response of flows to the different types of network-imposed performance degradation raises the need for ubiquitous measurement mechanisms, able to measure numerous performance properties, and being equally applicable to different applications and transports. This paper presents a new measurement mechanism, facilitated by the steady introduction of IPv6 in network nodes and hosts, which exploits native features of the protocol to provide support for performance measurements at the network (IP) layer. IPv6 Extension Headers have been used to carry the triggers involving the measurement activity and the measurement data in-line with the payload data itself, providing a high level of probability that the behaviour of the real user traffic flows is observed. End-to-end one-way delay, jitter, loss, and throughput have been measured for applications operating on top of both reliable and unreliable transports, over different-capacity IPv6 network configurations. We conclude that this technique could form the basis for future Internet measurements that can be dynamically deployed where and when required in a multiservice IP environment.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131462754","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}
{"title":"Incentive mechanism for peer-to-peer media streaming","authors":"A. Habib, J. Chuang","doi":"10.1109/IWQOS.2004.1309377","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309377","url":null,"abstract":"We propose a rank-based peer-selection mechanism for peer-to-peer media streaming systems. The mechanism provides incentives for cooperation through service differentiation. Contributors to the system are rewarded with flexibility and choice in peer selection, resulting in high quality streaming sessions. Free-riders are given limited options in peer selection, if any, and hence receive low quality streaming. Through simulation and wide-area measurement studies, we verify that the mechanism can provide near optimal streaming quality to the cooperative users until the bottleneck shifts from the sources to the network.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122148938","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}
{"title":"Triage: performance isolation and differentiation for storage systems","authors":"M. Karlsson, C. Karamanolis, Xiaoyun Zhu","doi":"10.1109/IWQOS.2004.1309358","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309358","url":null,"abstract":"Ensuring performance isolation and differentiation among workloads that share a storage infrastructure is a basic requirement in consolidated data centers. Existing management tools rely on resource provisioning to meet performance goals; they require detailed knowledge of the system characteristics and the workloads. Provisioning is inherently slow to react to system and workload dynamics, and in the general case, it is impossible to provision for the worst case. We propose a software-only solution that ensures predictable performance for storage access. It is applicable to a wide range of storage systems and makes no assumptions about workload characteristics. We use an on-line feedback loop with an adaptive controller that throttles storage access requests to ensure that the available system throughput is shared among workloads according to their performance goals and their relative importance. The controller considers the system as a \"black box\" and adapts automatically to system and workload changes. The controller is distributed to ensure high availability under overload conditions, and it can be used for both block and file access protocols. The evaluation of Triage, our experimental prototype, demonstrates workload isolation and differentiation, in an overloaded cluster file-system where workloads and system components are changing.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130494420","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}
{"title":"Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks","authors":"T. Salonidis, L. Tassiulas","doi":"10.1109/IWQOS.2004.1309351","DOIUrl":"https://doi.org/10.1109/IWQOS.2004.1309351","url":null,"abstract":"This paper proposes an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed coordination method for schedule construction and modification for any wireless ad-hoc network operating under a schedule where transmissions at each slot are explicitly specified over a time period of length T. We first introduce a fluid model of the system where the conflict avoidance requirements of neighboring links are relaxed while the aspect of local channel sharing is captured. In this model we propose an algorithm where the nodes asynchronously re-adjust the rates allocated to their adjacent links using only local information. We prove that, from any initial condition, the algorithm finds the max-min fair rate allocation in the fluid model. Hence, if the iteration is performed constantly the rate allocation will track the optimal even in regimes of constant topology changes. Then we consider the slotted system and propose a modification method that applies directly on the slotted schedule, emulating the effect of the rate re-adjustment iteration of the fluid model. Through extensive experiments in networks with both fixed and time varying topologies we show that the latter algorithm achieves balanced rate allocations in the actual slotted system that are very close to the max-min fair rates. The experiments also show that the algorithm is very robust on topology variations, with very good tracking properties of the max-min fair rate allocation.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"17 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124308525","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}
{"title":"Provisioning servers in the application tier for e-commerce systems","authors":"D. Villela, P. Pradhan, D. Rubenstein","doi":"10.1145/1189740.1189747","DOIUrl":"https://doi.org/10.1145/1189740.1189747","url":null,"abstract":"Server providers that support e-commerce applications as a service to multiple e-commerce websites traditionally use a tiered server architecture. This architecture includes an application tier to process requests that require dynamically generated content. How this tier is provisioned can significantly impact a provider's profit margin. We study methods to provision servers in the application serving tier to increase a server provider's profits. First, we examine actual traces of request arrivals to the application tier of e-commerce sites, and show that the arrival process is effectively Poisson. Next, we construct an optimization problem in the context of a set of application servers modeled as M/G/l/PS queueing systems, and derive three simple methods to approximate the allocation that maximizes profits. Simulation results demonstrate that our approximation methods achieve profits that are close to optimal and are significantly higher than those achieved via simple heuristics.","PeriodicalId":266235,"journal":{"name":"Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004.","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122910918","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}