{"title":"PIQI-RCP: Design and Analysis of Rate-Based Explicit Congestion Control","authors":"Saurabh Jain, D. Loguinov","doi":"10.1109/IWQOS.2007.376543","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376543","url":null,"abstract":"Recent research has created a significant interest [18], [19] in the design and development of a new global-scale communication network that can overcome the limitations of the current Internet. Among the many directions for improving networking technology, recent pursuit to design better flow control has led to the emergence of explicit congestion control methods that solicit active feedback from intermediate routers [5], [11], [22], [25], [26]. As a step towards understanding these methods, we analyze stability and transient performance of Rate Control Protocol (RCP) [5], which is a recent method that aims to emulate processor sharing and achieve quick flow completion. However, we find that RCP can become unstable in certain topologies and may exhibit very high buffering requirements at routers. To address these limitations, we propose a new controller called Proportional Integral Queue Independent RCP (PIQI-RCP), prove its stability under heterogeneous delay, and use ns2 simulations, as well as Linux experiments, to show that the new method has significantly better transient dynamics (i.e., much smaller link-capacity overshoot) and better stability properties in single-and multi-bottleneck scenarios.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129312501","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}
Manfred Georg, Christoph Jechlitschek, Sergey Gorinsky
{"title":"Improving Individual Flow Performance with Multiple Queue Fair Queuing","authors":"Manfred Georg, Christoph Jechlitschek, Sergey Gorinsky","doi":"10.1109/IWQOS.2007.376560","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376560","url":null,"abstract":"Fair Queuing (FQ) algorithms provide isolation between packet flows, allowing max-min fair sharing of a link even when flows misbehave. However, fairness comes at the expense of per-flow state. To keep the memory requirement independent of the flow count, the router can isolate aggregates of flows, rather than individual flows. We investigate the feasibility of protecting individual flows under such aggregate isolation in the context of Multiple Queue Fair Queuing (MQFQ), where the router maintains a fixed number of queues and allows each flow to access multiple queues. MQFQ places packets into the shortest queue associated with their flow. The extra queues protect the flow against congestion caused by a misbehaving flow in a shared queue. However, multiple per-flow queues also enable the misbehaving flow to increase its unfairly acquired fraction of the link capacity. We discuss avoidance of packet reordering within a flow and compare MQFQ with prior schemes for aggregate scheduling.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125654997","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}
Yan Gao, Yao Zhao, R. Schweller, Shobha Venkataraman, Yan Chen, D. Song, M. Kao
{"title":"Detecting Stealthy Spreaders Using Online Outdegree Histograms","authors":"Yan Gao, Yao Zhao, R. Schweller, Shobha Venkataraman, Yan Chen, D. Song, M. Kao","doi":"10.1109/IWQOS.2007.376561","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376561","url":null,"abstract":"We consider the problem of detecting the presence of a sufficiently large number of hosts that connect to more than a certain number of unique destinations within a given time window, over high-speed networks. We call such hosts stealthy spreaders. In practice, stealthy spreaders can be symptomatic of botnet scans or moderate worm propagation. Previous techniques have focused on detecting sources with an extremely large outdegree. However, such techniques fail to detect spreaders such as bot scans in which each scanning host scans only a moderate, fixed number of destinations. In contrast, our scheme maintains a small, fixed size memory usage, and is still able to detect stealthy spreader scenarios by approximating outdegree histograms from continuous traffic. To the best of our knowledge, we are the first to study the efficient outdegree histogram estimation and stealthy spreader detection problems. Evaluation based on real Internet traffic and botnet scan events show that our scheme is highly accurate and can operate online.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128250932","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}
M. Yuksel, K. Ramakrishnan, S. Kalyanaraman, Joseph D. Houle, Rita Sadhvani
{"title":"Value of Supporting Class-of-Service in IP Backbones","authors":"M. Yuksel, K. Ramakrishnan, S. Kalyanaraman, Joseph D. Houle, Rita Sadhvani","doi":"10.1109/IWQOS.2007.376555","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376555","url":null,"abstract":"The desire or ability of an ISP to provide differentiated service is a current hotly debated topic. In this paper, we quantify the value of having differentiated service (i.e., class-of-service (CoS)) support in an IP backbone. We compare the capacity requirements of a Diffserv environment providing service for applications that require delay or loss assurances in comparison to a network that provides classless (i.e., best-effort) service and still has to meet the same performance assurances. Our modeling framework first develops a link model that quantifies the required extra capacity (REC) in order for a classless link to provide the same level of performance as experienced by premium class traffic passing through a fixed capacity CoS link. We develop the REC calculations for the cases when average delay or the average loss probability is the target performance goal with Poisson or Markov modulated Poisson process (MMPP) input traffic. Our primary contribution is in quantifying the value of the CoS support in a network setting.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127265719","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":"Structuring Multi-Layer Scalable Streams to Maximize Cient-Perceived Quality","authors":"Cheng-Hsin Hsu, M. Hefeeda","doi":"10.1109/IWQOS.2007.376565","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376565","url":null,"abstract":"Video coders, such as H.264/SVC, can encode a video stream into multiple layers, each with a different rate. Moreover, each layer can either be coarse-grained scalable (CGS) or fine-grained scalable (FGS). FGS layers support wider ranges of client bandwidth than CGS layers, but suffer from higher coding inefficiency. Currently there are no systematic ways in the literature to determine the optimal stream structure that renders the best average quality for all clients. In this paper, we formulate an optimization problem to determine the optimal rate and encoding granularity (CGS or FGS) of each layer in a scalable video stream that maximizes a system-defined utility function for a given client distribution. We design an efficient, yet optimal, algorithm to solve this optimization problem. Our algorithm is general in the sense that it can employ arbitrary utility functions for clients. We implement our algorithm and verify its optimality. We show how various structuring of scalable video streams affect individual client utilities. We compare our algorithm against a heuristic algorithm that has been used before in the literature, and we show that our algorithm outperforms the other one in all cases.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130179684","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":"Competitive and Considerate Congestion Control for Bulk Data Transfers","authors":"Shao Liu, M. Vojnović, Dinan Gunawardena","doi":"10.1109/IWQOS.2007.376542","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376542","url":null,"abstract":"We propose a novel transport control protocol, Competitive and Considerate Congestion Control (4CP). This yields a fixed per-flow bandwidth to other connections (e.g. TCP) if the network can support this and uses the residual bandwidth for 4CP. The main contribution is a novel window based congestion controller that combines congestion phase detection and congestion window control to achieve the stated bandwidth sharing objective. 4CP may be viewed as a non strict low priority emulator. Consequently, 4CP does not suffer from bandwidth starvation when competing with a single TCP connection. Furthermore, when congestion is low, 4CP can utilise residual bandwidth. When congestion is high, 4CP will back-off. The properties of 4CP described above, suggest its applicability for bulk data transfer applications that must be considerate of competing traffic whilst still making transfer progress themselves. We present analytical results, simulation findings and Internet experiments that demonstrate validity of 4CP in addition to guidance on parameter setting.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122369373","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}
M. Hollick, P. Mogre, Christian Schott, R. Steinmetz
{"title":"Slow and Steady: Modelling and Performance Analysis of the Network Entry Process in IEEE 802.16","authors":"M. Hollick, P. Mogre, Christian Schott, R. Steinmetz","doi":"10.1109/IWQOS.2007.376558","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376558","url":null,"abstract":"The IEEE 802.16 standard represents the state-of-the-art for quality of service (QoS) aware broadband wireless access networks. Initially the standard provided sophisticated QoS mechanisms only for a static network (i.e. stationary subscribers), but recently the amendment IEEE 802.16e-2005 introduced mobility support for the individual subscriber stations. Network entry is the first step required for nodes to register themselves with the 802.16 network. The performance of the network entry process is crucial to support QoS, especially if node churn is high. In this paper, we develop an analytical model of the network entry process in IEEE 802.16. This model enables us to predict the effect and influence of important protocol parameters for joining the network. Using our model, we show that the selection of correct and appropriate protocol parameters is crucial to support setup-delay sensitive applications such as emergency services or IP-telephony. Our model can be used as a tool to derive the feasible range for individual network parameters in selected application scenarios.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121292580","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":"Designing networks with hop bounded protection paths","authors":"M. Alicherry, R. Bhatia, Yung-Chun Wan","doi":"10.1109/IWQOS.2007.376563","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376563","url":null,"abstract":"Network QoS is essential for supporting real time interactive services such as VoIP. In the differentiated services framework QoS is provided by marking packets to receive preferential forwarding treatment, at each network node. This per hop forwarding treatment at each node may however be ineffective in providing the delay and jitter guarantees unless bounds are also imposed on the number of hops in the service routing paths. Interactive services also require minimal interruptions from network disruptions. Routing on hop limited paths may however have an adverse impact on the proportion of network capacity dedicated for protection to guarantee recovery from failures. In this paper we analyze this tradeoff in the context of MPLS fast reroute when protection capacities are pre-provisioned. We show that the underlying optimization problem is NP hard. We design almost best possible approximation algorithms for the problem and show that they work well in practice as well.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115859212","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 the Stability Region of Linear-Memory Scheduling for Time Varying Channels","authors":"Mahdi Lotfinezhad, B. Liang, E. Sousa","doi":"10.1109/IWQOS.2007.376551","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376551","url":null,"abstract":"Throughput optimal scheduling policies in general require the solution of a complex optimization problem. The past literature has shown that the complexity of this optimization problem can be greatly reduced, but at the expense of memory requirement that is exponential with the number of users. In this paper, we study the stability region of a class of linear-memory scheduling policies for time varying channels, and investigate how the channel memory impacts the supportable input rates. The set of scheduling policies in this paper covers a wide spectrum of resource allocation algorithms, which allows us to study policies with different complexity levels. In particular, we are able to model a class of low-complexity scheduling policies with linear memory, which are suitable for practical implementation.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134377446","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":"Decentralized Replication Algorithms for Improving File Availability in P2P Networks","authors":"W. K. Lin, C. Ye, D. Chiu","doi":"10.1109/IWQOS.2007.376545","DOIUrl":"https://doi.org/10.1109/IWQOS.2007.376545","url":null,"abstract":"Being autonomous and scalable, peer-to-peer systems provide a paradigm for sharing files in the Internet. However, different from conventional structured replication systems like content distribution networks (CDN), peers in an unstructured P2P system may have different, sometimes low, online availability, and usually get only partial information about the resources of the system. Therefore, how to achieve good system level file availability by autonomous peers is an important goal in P2P replication systems. In this paper, we investigate decentralized and cooperative resource allocation algorithms in a class of P2P systems that provide replication service. We formulate this replication problem as an optimization problem, and propose several heuristic algorithms respectively. They include (a) a random algorithm, (b) a group partition algorithm that relies on peers' forming groups, and (c) a greedy search algorithm based on an estimated system-level file availability target. We compare and evaluate these algorithms by simulations, and observe that each of them has advantages depending on the system parameters.","PeriodicalId":139416,"journal":{"name":"2007 Fifteenth IEEE International Workshop on Quality of Service","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115438860","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}