{"title":"On the performance of TCP over throughput-optimal CSMA","authors":"Wei Chen, Yue Wang, Minghua Chen, S. Liew","doi":"10.1109/IWQOS.2011.5931354","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931354","url":null,"abstract":"An interesting distributed throughput-optimal CSMA MAC protocol, called adaptive CSMA, was proposed recently to schedule any strictly feasible rates inside the capacity region. Of particular interest is the fact that the adaptive CSMA can achieve a system utility arbitrarily close to that is achievable under a central scheduler. However, a specially designed transport-layer rate controller is needed for this result. An outstanding question is whether TCP Reno (one of the most mature versions of TCP) is compatible with adaptive CSMA and can achieve the same result. The answer to this question will determine how close to practical deployment adaptive CSMA is. Our answer is yes and no. First, we observe that running TCP Reno directly over adaptive CSMA results in severe starvation problems. Effectively, its performance is no better than that of TCP Reno over legacy CSMA (IEEE 802.11), and the potentials of adaptive CSMA cannot be realized. We then propose a multi-connection TCP solution with active queue management and prove that it can work with adaptive CSMA to achieve optimal utility. NS-2 simulations demonstrate that our solution can alleviate starvation and achieve fair and efficient rate allocation. We remark that multi-connection TCP can be implemented at either application or transport layer. Application-layer implementation requires no kernel modification, making the solution readily deployable in networks running adaptive CSMA. Our results show that adaptive CSMA can work well with only light-weight TCP modifications, bringing it a step closer to practicality.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"63 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":"123600868","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":"Future Internet video multicasting with essentially perfect resource utilization and QoS guarantees","authors":"T. Szymanski","doi":"10.1109/IWQOS.2011.5931336","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931336","url":null,"abstract":"The multicasting of aggregated digital video over a proposed Future Internet backbone network with essentially perfect throughput, resource-utilization and QoS guarantees is summarized. The Future Internet routers require only minor modifications to the existing router designs. Buffers in existing internet routers are partitioned into 2 traffic classes which can co-exist, the Essentially-Perfect QoS class and the Best-Effort class, i.e., no new buffers are required. Each router includes an FPGA-based Scheduler Lookup Table for the essentially perfect QoS class. RSVP-TE is used to provision the multicast trees in an MPLS-TE network. Each router computes an essentially-perfect transmission schedule for all its QoS-enabled traffic flows, which never experience interference or congestion. (This integer-programming scheduling problem is a long-standing unsolved problem.) The Best-Effort traffic is scheduled using the usual Best-Effort schedulers. It is shown that thousands of bursty self-similar video streams can be multicast across the proposed Future Internet with essentially-perfect link efficiencies and QoS guarantees. The technology (i) can be added into new Internet routers with minimal cost (i.e., a few FPGAs); (ii) it allows for the co-existence of the Essentially-Perfect QoS and the usual Best-Effort traffic classes; (iii) it is compatible with the existing IEFT DiffServ and MPLS-TE service models; (iv) it allows for Internet link efficiencies as high as 100%, and (v) it can reduce Internet router buffer and power requirements significantly.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"16 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":"126624740","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":"Restoration measurements on an IP/MPLS backbone: The effect of Fast Reroute on link failure","authors":"Gomathi Ramachandran, Len Ciavattone, A. Morton","doi":"10.1109/IWQOS.2011.5931348","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931348","url":null,"abstract":"In this paper we show data plane restoration measurements for restoration under backbone link failures for a large network with IP/MPLS OSPF routing and also for the same backbone with Traffic Engineering (TE) and Fast Reroute (FRR) deployed. Our study is unique as we analyzed a significant quantity of measurements obtained from a production network over a 14-month period encompassing many link failures. The results show that TE/FRR restoration reduces outage-induced loss-duration substantially as compared to OSPF restoration. We also note that for both OSPF and FRR the course of restoration is not as simple as is commonly believed. A detailed study of the data shows that while loss-duration and overall duration is much reduced, TE/FRR results in path changes with no detectable loss over a period of seconds. Thus implementation of TE/FRR in a network results in a vast improvement in behavior for all data flows.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"31 6 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":"125704404","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 policy verification for DiffServ networks","authors":"T. Samak, A. El-Atawy, E. Al-Shaer","doi":"10.1109/IWQOS.2011.5931332","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931332","url":null,"abstract":"Configuring routers and network devices to achieve quality of service (QoS) goals is a challenging task. In a DiffServ environment, traffic flows are assigned specific classes of service, and service level agreements (SLA) are enforced at routers within the domain. We present a model for QoS policy configurations that facilitates efficient property-based verification. Network configuration is given as a set of policies governing each device. The model efficiently checks the SLA against the current configuration using computation tree logic model checking. By following possible decision paths for a specific flow from source to destination, properties can be checked at each hop, and assessments can be made on how well configurations adhere to the specified agreement. The model also covers configuration debugging given a specific QoS violation.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"94 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":"133253138","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":"Measuring and enhancing the social connectivity of UGC video systems: A case study of YouKu","authors":"Zhenyu Li, Rong Gu, Gaogang Xie","doi":"10.1109/IWQOS.2011.5931346","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931346","url":null,"abstract":"The social connections among users have significant impacts on UGC video systems. The goal of this paper is to study the social connectivity of such systems by measuring YouKu, the most popular UGC video system in China. We have collected 627 thousand user profiles, 3 million social connections and 13.6 million videos' information. The analysis results have shown that the social connectivity is extremely weak and there are a considerable proportion of friend pairs sharing common semantic interests. These facts motivate us to enhance the connectivity by recommending semantically relevant users as friends. We thus propose a friend recommendation algorithm which locates potential friends quickly and accurately through the links to related videos, a unique feature of YouKu and similar sites. We apply the algorithm on our dataset of YouKu and evaluate it through one-hop video search. The social connectivity is greatly enhanced and the number of matched videos on friends is greatly increased. To the best of our knowledge, this work is the first to identify the semantic relevance of friend pairs in UGC video systems and to study the friend recommendation.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"19 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":"133851337","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":"Advanced Quality-of-Service signaling for IP multicast","authors":"R. Bless, M. Röhricht","doi":"10.1109/IWQOS.2011.5931345","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931345","url":null,"abstract":"Supporting Quality-of-Service resource reservations for IP multicast flows is especially advantageous for distributed multimedia applications like video conferencing, 3D tele-immersion, or multi-player online gaming. In response to various limitations of RSVP the IETF developed more flexible signaling protocols within the Next Steps in Signaling (NSIS) framework. But unlike RSVP, the NSIS protocols were designed to consider unicast flows only in order to reduce protocol complexity. This paper presents an extension of the NSIS signaling protocols that allow for QoS resource reservations of IP multicast data flows. We describe the main challenges and discuss the resulting design decisions in detail. Enhancements of an existing NSIS implementation show that the required changes are minimal and do neither affect the unicast protocol operation, nor increase the protocol's complexity significantly. Instead, all of the advanced features introduced by NSIS, like reliable signaling message transport or support for sender- and receiver-initiated reservations can also be used with IP multicast flows. Evaluation results confirm that the overhead introduced by supporting IP multicast in NSIS compared to unicast reservations is negligible and that the presented solutions also offers scalable sender-initiated reservations.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"46 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":"114536988","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":"Delay based feedback, transport protocols and small buffers","authors":"Praveen Raja, G. Raina","doi":"10.1109/IWQOS.2011.5931330","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931330","url":null,"abstract":"In this article we work with the class of transport protocols that use queuing delay as a primary feedback signal for flow and congestion control. Our focus will be on this class of transport protocols operating over small buffered networks; i.e., buffers that are of the order of tens of packets. We show that the performance of Vegas and FAST can be very sensitive to the precise choice of small buffer size. With Reno and Vegas, or Reno and FAST, operating together we also exhibit that AIMD Reno dominates the dynamics of flow control. Some guidelines are suggested that could help design and enhance protocol performance in small buffered networks.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"30 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":"114874159","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":"Trajectory-assisted Delay-Bounded routing with moving receivers in Vehicular Ad-hoc Networks","authors":"Xiaojun Feng, Jin Zhang, Qian Zhang","doi":"10.1109/IWQOS.2011.5931319","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931319","url":null,"abstract":"Vehicular Ad-hoc Networks(VANETs) can facilitate many applications such as road safety, intelligent transportation and advertising. These applications usually call for multi-hop data delivery from access points to moving vehicles with user specified delay requirements. However, most existing routing protocols for VANETs only focus on message forwarding from vehicles to access points or take no account of the delay constraint. In this paper, we focus on the development of a carry-and-forward scheme that delivers data from access points to vehicles. Utilizing the vehicle's trajectory obtained from the navigation system, we propose TaDB, a Trajectory-assisted Delay-Bounded Message Delivery Algorithm. To choose delivery route within delay constraint while minimizing transmission cost, TaDB uses a Cluster-Aware Link Delay Model to estimate link delay for both the Carry and the Forward strategies on each road segment. TaDB also leverages the vehicle's planned trajectory to estimate its future location. Simulation results show that TaDB can achieve a delivery ratio very close to optimal.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"38 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":"116195462","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":"OLIC: OnLine Information Compression for scalable hosting infrastructure monitoring","authors":"Yongmin Tan, Xiaohui Gu, V. Venkatesh","doi":"10.1109/IWQOS.2011.5931342","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931342","url":null,"abstract":"Quality-of-service (QoS) management often requires a continuous monitoring service to provide updated information about different hosts and network links in the managed system. However, it is a challenging task to achieve both scalability and precision for monitoring various intra-node and inter-node metrics (e.g., CPU, memory, disk, network delay) in a large-scale hosting infrastructure. In this paper, we present a novel OnLine Information Compression (OLIC) system to achieve scalable fine-grained hosting infrastructure monitoring. OLIC models continuous snapshots of a hosting infrastructure as a sequence of images and performs online monitoring data compression to significantly reduce the monitoring cost. We have implemented a prototype of the OLIC system and deployed it on the PlanetLab and NCSU's virtual computing lab (VCL). We have conducted extensive experiments using a set of real monitoring data from VCL, Planetlab, and a Google cluster as well as a real Internet traffic matrix trace. The experimental results show that OLIC can achieve much higher compression ratios with several orders of magnitude less overhead than previous approaches.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"22 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":"122990651","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":"MPCT: Minimum protection cost tree for IP fast reroute using Tunnel","authors":"Mingwei Xu, Qing Li, Lingtao Pan, Qi Li","doi":"10.1109/IWQOS.2011.5931326","DOIUrl":"https://doi.org/10.1109/IWQOS.2011.5931326","url":null,"abstract":"The demand for faster failure-recovery in the Internet has led to the development of several IP Fast Reroute (IPFRR) schemes, which are all too computationally expensive or unsatisfactory in protection coverage. In this paper, we propose Minimum Protection Cost Tree (MPCT) for IPFRR using Tunnel. By constructing an MPCT for each hypothetical failed neighbor, MPCT finds the protection paths for all the affected destinations. First, MPCT provides 100% single-node protection coverage by direct forwarding (DF) and re-protection. Second, the computational complexity of MPCT is less than one full shortest path first (SPF) calculation. Third, by simulation with the data from CERNET, Rocketfuel and Brite, we show that even without DF and re-protection, MPCT can provide more than 99.7% protection coverage for single-node failures. We believe that our scheme MPCT moves a big step towards practical deployment.","PeriodicalId":127279,"journal":{"name":"2011 IEEE Nineteenth IEEE International Workshop on Quality of Service","volume":"9 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":"131925051","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}