{"title":"PriceMyRoute: A competitive pricing strategy for Internet connectivity service providers","authors":"S. Rajkumar, P. Ramanathan","doi":"10.1109/IWQOS.2011.5931334","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931334","url":null,"abstract":"Traditional interdomain routing algorithms such as Border Gateway Protocol (BGP) rely on bilateral peering agreements between service providers to support end-to-end connectivity in the Internet. Network end users have very little control in the selection of these routes. Instead, network users are given a route to their destination with little or no assurances on its availability or performance. This traditional approach is not likely to work well for many rapidly growing streaming and gaming applications because their performance benefits significantly from better-than-best-effort connectivity. One possible approach for supporting such connectivity is to rely on a market-based mechanism through which network end users can shop and purchase interdomain routes of their choice. This paper envisions such a market in the near future. The paper then proposes a pricing strategy for connectivity service providers, called PriceMyRoute. The strategy allows multiple service providers to effectively compete with each other in order to offer the end-to-end connections requested by network users. The approach is likely to succeed because: (i) it offers monetary compensation to service providers for providing the routing flexibility to network users, and (ii) the improved performance is an incentive for network users to purchase better-than-best-effort end-to-end connectivity. The paper compares the effectiveness of the proposed strategy with that of RouteBazaar, a recent related scheme from literature [4]. The comparison shows that both service providers and network users are likely to be more satisfied using the proposed strategy as compared to RouteBazaar.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125659887","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 theoretical framework for developing distributed admissions control over delay-sensitive media flows","authors":"Jun Liu","doi":"10.1109/IWQOS.2011.5931317","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931317","url":null,"abstract":"The performance of most real-time streaming media applications is sensitive to transmission delays. This paper describes a distributed admissions control method to ensure the required sending rates for the real-time media streams. A utility function is first developed to model the satisfaction of delay-sensitive media streams. Then, the optimal admissions control on streams are formulated into a social optimum oriented network utility maximization (NUM) problem. The existence of an optimal solution to the NUM problem has been demonstrated through constructing a centralized algorithm for the determining the admissions for all streams. The centralized algorithm provides insights to find the optimal solution through a distributed algorithm. A distributed admissions control method can be developed based on the dual decomposition of the primal problem. The construction of this distributed admissions control method follows the DiffServ approach.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116557492","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":"Solve tree setup-break problem and minimize control overhead in delay-bounded distributed wireless multicast QoS routing","authors":"Ying-Hsin Liang, Ben-Jye Chang, Yan-Min Lin","doi":"10.1109/IWQOS.2011.5931318","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931318","url":null,"abstract":"In wireless networks, the multicast QoS routing is a key technique to increase bandwidth utilization, but the multicast routing is typically complicated and difficult because it belongs to the NP-complete problem. The main goal of a delay-bounded wireless multicast algorithm is to determine the optimal multicast tree that has the least cost while satisfying the delay-bounded requirement. However, previous studies suffer from the Tree setup-break and dangling node problems, and yield a large number of control messages. This paper thus proposes the adaptive distributed multicast routing (ADMR) algorithm to guarantee cycle-free, and to overcome these two problems while yielding the least-cost delay-bounded multicast tree for high-density member multicast networks. Numerical results indicate that ADMR significantly outperforms the Jia-based algorithms in number of control messages and setup convergent time.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127212518","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":"Dexferizer: A service for data transfer optimization","authors":"Ercan Ucan, Timothy Roscoe","doi":"10.1109/IWQOS.2011.5931343","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931343","url":null,"abstract":"We present an approach to optimizing the transfer of data objects within a user's collection of computers and personal devices, subject to a variety of user-defined quality metrics such as cost, power consumption, and latency. By abstracting object transfer as a high-level service, and employing declarative networking techniques to cast object transfer as a constrained optimization problem, we show how to transparently exploit techniques as diverse as swarming and multi-hop transfer through virtual machines. Using a data replication system as a driving application, we demonstrate that our approach can easily accommodate flexible policies not easily implemented with existing solutions, and can thereby result in savings in time, power, bandwidth, or other costs.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115207389","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":"Charging ratio model for quality-based VoIP charging mechanism","authors":"Younchan Jung, A. A. Ibanez","doi":"10.1109/IWQOS.2011.5931320","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931320","url":null,"abstract":"In this paper, we use a methodology of listening and identifying word-by-word in order to define ‘burst’, which enables users to identify if they are satisfied with their experiences in a short burst period which could be less than 1 second. Investigating the relationship between PESQ MOS and the gap ratio that can be easily obtained from the burst measurement, we derive the charging ratio that can be used as the proportion of quality-based prices to ‘delivered packet amount’-based prices. The charging ratio model can be used as a key component of quality-based VoIP charging mechanism.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123374575","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":"Auto-scaling emergency call centres using cloud resources to handle disasters","authors":"S. Venugopal, Han Li, P. Ray","doi":"10.1109/IWQOS.2011.5931344","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931344","url":null,"abstract":"The fixed-line and mobile telephony network is one of the crucial elements of an emergency response to a disaster event. However, frequently the phone network is overwhelmed in such situations and is disrupted. It is not cost-effective to maintain an over-provisioned IT infrastructure for such rare events. Cloud computing allows users to create resources on-demand and can enable an IT infrastructure that scales in response to the demands of disaster management. In this paper, we introduce a system that uses the Amazon EC2 service to automatically scale up a software telephony network in response to a large volume of calls and scale down in normal times. We demonstrate the efficacy of this system through experiments based on real-world data.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125268055","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}
N. Zotos, G. Xilouris, A. Kourtis, D. Renzi, Beilu Shao
{"title":"Performance evaluation of H264/SVC streaming system featuring real-time in-network adaptation","authors":"N. Zotos, G. Xilouris, A. Kourtis, D. Renzi, Beilu Shao","doi":"10.1109/IWQOS.2011.5931331","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931331","url":null,"abstract":"In the recent years one of the most active research topics in multimedia networking is the exploitation of the Scalable Video Coding (SVC) as a scalable solution for efficient network resources utilization. SVC introduces scalability by exploiting a layered encoding of the video stream, thus enabling real-time in-network adaptation by selectively allowing the transmission of appropriate layers. This paper presents an architecture that exploits SVC capabilities in order to provide end-to-end QoS assurance via in-network video adaptation. The adaptation system management is based on MPEG-21 framework while the network QoS mechanisms are based on DiffServ standard. The performance evaluation of the proposed architecture is performed over a real test-bed infrastructure.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132816590","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":"PERFUME: Power and performance guarantee with fuzzy MIMO control in virtualized servers","authors":"P. Lama, Xiaobo Zhou","doi":"10.1109/IWQOS.2011.5931340","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931340","url":null,"abstract":"It is important but challenging to assure the performance of multi-tier Internet applications with the power consumption cap of virtualized server clusters mainly due to system complexity of shared infrastructure and dynamic and bursty nature of workloads. This paper presents PERFUME, a system that simultaneously guarantees power and performance targets with flexible tradeoffs while assuring control accuracy and system stability. Based on the proposed fuzzy MIMO control technique, it accurately controls both the throughput and percentile-based response time of multi-tier applications due to its novel fuzzy modeling that integrates strengths of fuzzy logic, MIMO control and artificial neural network. It is self-adaptive to highly dynamic and bursty workloads due to online learning of control model parameters using a computationally efficient weighted recursive least-squares method. We implement PERFUME in a testbed of virtualized blade servers hosting two multi-tier RUBiS applications. Experimental results demonstrate its control accuracy, system stability, flexibility in selecting tradeoffs between conflicting targets and robustness against highly dynamic variation and burstiness in workloads. It outperforms a representative utility based approach in providing guarantee of the system throughput, percentile-based response time and power budget in the face of highly dynamic and bursty workloads.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125137523","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":"QoS routing algorithms using fully polynomial time approximation scheme","authors":"Jun Huang, Y. Tanaka","doi":"10.1109/IWQOS.2011.5931329","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931329","url":null,"abstract":"Routing with end-to-end Quality-of-Service (QoS) guarantees is a key to the widespread deployment of recent emerged services. Developing QoS routing algorithm in the network is an important open topic. This paper investigates the QoS routing related problems and proposes a Fully Polynomial Time Approximation Scheme (FPTAS) for QoS routing. In the proposed FPTAS, a graph-extending based dynamic programming approach is developed, and an extended version of the proposed algorithm is studied. The theoretical analyses show that the proposed algorithms outperform the previous best-known studies.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126092831","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":"On long-term social relationships in peer-to-peer systems","authors":"Haiyang Wang, Feng Wang, Jiangchuan Liu","doi":"10.1109/IWQOS.2011.5931242","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931242","url":null,"abstract":"BitTorrent, the most popular file delivery system over the Internet, has attracted attention from network operators and researchers for its wide deployment. Recent studies suggest that long-term relationships among BT peers could be explored for peer cooperation, as to achieve better sharing efficiency. However, whether such long-term relationships exist remain unknown. In this paper, we for the first time examine the feasibility of social network based content delivery through the study of Twitter initialized/shared torrents. We show that the peers in such swarms have stronger temporal locality, thus offering great opportunity for improving their degree of sharing. Based on the Hadamard Transform of peers' online behaviors, we develop a social index to quickly locate peers of common patterns. Preliminary PlanetLab experiments indicate that the incorporation of social relations remarkably accelerates the downloading time. The improvement remains noticeable even in a hybrid system with a small set of socially active peers only.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"651 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123970507","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}