774 research outputs found
ECN verbose mode: a statistical method for network path congestion estimation
This article introduces a simple and effective methodology to determine the
level of congestion in a network with an ECN-like marking scheme. The purpose
of the ECN bit is to notify TCP sources of an imminent congestion in order to
react before losses occur. However, ECN is a binary indicator which does not
reflect the congestion level (i.e. the percentage of queued packets) of the
bottleneck, thus preventing any adapted reaction. In this study, we use a
counter in place of the traditional ECN marking scheme to assess the number of
times a packet has crossed a congested router. Thanks to this simple counter,
we drive a statistical analysis to accurately estimate the congestion level of
each router on a network path. We detail in this paper an analytical method
validated by some preliminary simulations which demonstrate the feasibility and
the accuracy of the concept proposed. We conclude this paper with possible
applications and expected future work
Transport congestion events detection (TCED): towards decorrelating congestion detection from TCP
TCP (Transmission Control Protocol) uses a loss-based algorithm to estimate whether the network is congested or not.
The main difficulty for this algorithm is to distinguish spurious from real network congestion events. Other research studies have proposed to enhance the reliability of this congestion estimation by modifying the internal TCP algorithm.
In this paper, we propose an original congestion event algorithm implemented independently of the TCP source code. Basically, we propose a modular architecture to implement a congestion event detection algorithm to cope with the increasing complexity of the TCP code and we use it to understand why some spurious congestion events might not be
detected in some complex cases. We show that our proposal is able to increase the reliability of TCP NewReno congestion detection algorithm that might help to the design of detection criterion independent of the TCP code. We find out that solutions based only on RTT (Round-Trip Time) estimation are not accurate enough to cover all existing cases.
Furthermore, we evaluate our algorithm with and without network reordering where other inaccuracies, not previously
identified, occur
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
Pre-Congestion Notification (PCN) Architecture
This document describes a general architecture for flow admission and termination based on pre-congestion information in order to protect the quality of service of established, inelastic flows within a single Diffserv domain.\u
TCP throughput guarantee in the DiffServ Assured Forwarding service: what about the results?
Since the proposition of Quality of Service architectures by the IETF, the
interaction between TCP and the QoS services has been intensively studied. This
paper proposes to look forward to the results obtained in terms of TCP
throughput guarantee in the DiffServ Assured Forwarding (DiffServ/AF) service
and to present an overview of the different proposals to solve the problem. It
has been demonstrated that the standardized IETF DiffServ conditioners such as
the token bucket color marker and the time sliding window color maker were not
good TCP traffic descriptors. Starting with this point, several propositions
have been made and most of them presents new marking schemes in order to
replace or improve the traditional token bucket color marker. The main problem
is that TCP congestion control is not designed to work with the AF service.
Indeed, both mechanisms are antagonists. TCP has the property to share in a
fair manner the bottleneck bandwidth between flows while DiffServ network
provides a level of service controllable and predictable. In this paper, we
build a classification of all the propositions made during these last years and
compare them. As a result, we will see that these conditioning schemes can be
separated in three sets of action level and that the conditioning at the
network edge level is the most accepted one. We conclude that the problem is
still unsolved and that TCP, conditioned or not conditioned, remains
inappropriate to the DiffServ/AF service
Pre-Congestion Notification Encoding Comparison
DiffServ mechanisms have been developed to support Quality of Service (QoS). However, the level of assurance that can be provided with DiffServ without substantial over-provisioning is limited. Pre-Congestion Notification (PCN) investigates the use of per-flow admission control to provide the required service guarantees for the admitted traffic. While admission control will protect the QoS under\ud
normal operating conditions, an additional flow termination mechanism is necessary in the times of heavy congestion (e.g. caused by route changes due to link or node failure).\ud
Encoding and their transport are required to carry the congestion and pre-congestion information from the congestion and pre-congestion points to the decision points. This document provides a survey of\ud
several encoding methods, using comparisons amongst them as a way to explain their strengths and weaknesses.\u
- …