Optimizing Service Differentiation Scheme with Sized-based Queue Management in DiffServ Networks

In this paper we introduced Modified Sized-based Queue Management as a dropping scheme that aims to fairly prioritize and allocate more service to VoIP traffic over bulk data like FTP as the former one usually has small packet size with less impact to the network congestion. In the same time, we want to guarantee that this prioritization is fair enough for both traffic types. On the other hand we study the total link delay over the congestive link with the attempt to alleviate this congestion as much as possible at the by function of early congestion notification. Our M-SQM scheme has been evaluated with NS2 experiments to measure the packets received from both and total link-delay for different traffic. The performance evaluation results of M-SQM have been validated and graphically compared with the performance of other three legacy AQMs (RED, RIO, and PI). It is depicted that our M-SQM outperformed these AQMs in providing QoS level of service differentiation.Comment: 10 pages, 9 figures, 1 table, Submitted to Journal of Telecommunication

Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Providing proportional TCP performance by fixed-point approximations over bandwidth on demand satellite networks

In this paper we focus on the provision of propor- tional class-based service differentiation to transmission control protocol (TCP) flows in the context of bandwidth on demand(BoD) split-TCP geostationary (GEO) satellite networks. Our approach involves the joint configuration of TCP-Performance Enhancing Proxy (TCP-PEP) agents at the transport layer and the scheduling algorithm controlling the resource allocation at the Medium Access Control (MAC) layer. We show that the two differentiation mechanisms exhibit complementary behavior in achieving the desired differentiation throughout the traffic load space: the TCP-PEPs control differentiation at low and medium system utilization, whereas the MAC scheduler becomes the dominant differentiation factor under high traffic load. The main challenge for the satellite operator is to appropriately configure those two mechanisms to achieve a specific differentiation target for the different classes of TCP flows. To this end, we propose a fixed-point framework to analytically approximate the achieved differentiated TCP performance. We validate the predictive capacity of our analytical method via simulations and show that our approximations closely match the performance of different classes of TCP flows under various scenarios for the network traffic load and configuration of the MAC scheduler and TCP-PEP agent. Satellite network operators could use our approximations as an analytical tool to tune their network

A quality of service architecture for WLAN-wired networks to enhance multimedia support

Includes abstract.Includes bibliographical references (leaves 77-84).The use of WLAN for the provision of IP multimedia services faces a number of challenges which include quality of service (QoS). Because WLAN users access multimedia services usually over a wired backbone, attention must be paid to QoS over the integrated WLAN-wired network. This research focuses on the provision of QoS to WLAN users accessing multimedia services over a wired backbone. In this thesis, the IEEE 802.11-2007 enhanced data channel access (EDCA) mechanism is used to provide prioritized QoS on the WLAN media access control (MAC) layer, while weighted round robin (WRR) queue scheduling is used to provide prioritized QoS at the IP layer. The inter-working of the EDCA scheme in the WLAN and the WRR scheduling scheme in the wired network provides end-to-end QoS on a WLAN-wired IP network. A mapping module is introduced to enable the inter-working of the EDCA and WRR mechanisms

Analytical Model of TCP Relentless Congestion Control

We introduce a model of the Relentless Congestion Control proposed by Matt Mathis. Relentless Congestion Control (RCC) is a modification of the AIMD (Additive Increase Multiplicative Decrease) congestion control which consists in decreasing the TCP congestion window by the number of lost segments instead of halving it. Despite some on-going discussions at the ICCRG IRTF-group, this congestion control has, to the best of our knowledge, never been modeled. In this paper, we provide an analytical model of this novel congestion control and propose an implementation of RCC for the commonly-used network simulator ns-2. We also improve RCC with the addition of a loss retransmission detection scheme (based on SACK+) to prevent RTO caused by a loss of a retransmission and called this new version RCC+. The proposed models describe both the original RCC algorithm and RCC+ improvement and would allow to better assess the impact of this new congestion control scheme over the network traffic.Comment: Extended version of the one presented at 6th International Workshop on Verification and Evaluation of Computer and Communication Systems (Vecos 2012