240 research outputs found

    FavorQueue: A parameterless active queue management to improve TCP traffic performance

    Get PDF
    This paper presents and analyzes the implementation of a novel active queue management (AQM) named FavorQueue that aims to improve delay transfer of short lived TCP flows over best-effort networks. The idea is to dequeue packets that do not belong to a flow previously enqueued first. The rationale is to mitigate the delay induced by long-lived TCP flows over the pace of short TCP data requests and to prevent dropped packets at the beginning of a connection and during recovery period. Although the main target of this AQM is to accelerate short TCP traffic, we show that FavorQueue does not only improve the performance of short TCP traffic but also improves the performance of all TCP traffic in terms of drop ratio and latency whatever the flow size. In particular, we demonstrate that FavorQueue reduces the loss of a retransmitted packet, decreases the number of dropped packets recovered by RTO and improves the latency up to 30% compared to DropTail. Finally, we show that this scheme remains compliant with recent TCP updates such as the increase of the initial slow-start value

    Towards an incremental deployment of ERN protocols: a proposal for an E2E-ERN hybrid protocol

    Get PDF
    We propose an architecture based on a hybrid E2E-ERN approach to allow incremental deployment of ERN (Explicit Rate Notification) protocols in heterogeneous networks. The proposed IP-ERN architecture combines E2E (End-to-End)and ERN protocols and uses the minimum between both congestion windows to perform. Without introducing complex operation, the resulting E2E-ERN protocol provides inter and intra protocol fairness and benefits from all ERN protocol advantages when possible. We detail the principle of this novel IP-ERN architecture and show that this architecture is highly adaptive to the network dynamic and is compliant with IPv4, IPv6 as well as IP-in-IP tunneling solutions

    Modeling and estimation techniques for understanding heterogeneous traffic behavior

    Get PDF
    The majority of current internet traffic is based on TCP. With the emergence of new applications, especially new multimedia applications, however, UDP-based traffic is expected to increase. Furthermore, multimedia applications have sparkled the development of protocols responding to congestion while behaving differently from TCP. As a result, network traffc is expected to become more and more diverse. The increasing link capacity further stimulates new applications utilizing higher bandwidths of future. Besides the traffic diversity, the network is also evolving around new technologies. These trends in the Internet motivate our research work. In this dissertation, modeling and estimation techniques of heterogeneous traffic at a router are presented. The idea of the presented techniques is that if the observed queue length and packet drop probability do not match the predictions from a model of responsive (TCP) traffic, then the error must come from non-responsive traffic; it can then be used for estimating the proportion of non-responsive traffic. The proposed scheme is based on the queue length history, packet drop history, expected TCP and queue dynamics. The effectiveness of the proposed techniques over a wide range of traffic scenarios is corroborated using NS-2 based simulations. Possible applications based on the estimation technique are discussed. The implementation of the estimation technique in the Linux kernel is presented in order to validate our estimation technique in a realistic network environment

    A variable structure control approach to active queue management for TCP with ECN

    Get PDF
    Cataloged from PDF version of article.It has been shown that the transmission control protocol (TCP) connections through the congested routers can be modeled as a feedback dynamic system. In this paper, we design a variable structure (VS) based control scheme in active queue management (AQM) supporting explicit congestion notification (ECN). By analyzing the robustness and performance of the control scheme for the nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness with respect to the uncertainties of the round-trip time (RTT) and the number of active TCP sessions, which are central to the notion of AQM. Implementation issues are discussed and ns simulations are provided to validate the design and compare its performance to other peer schemes’ in different scenarios. The results show that the proposed design significantly outperforms the peer AQM schemes in terms of packet loss ratio, throughput and buffer fluctuation

    Networking Mechanisms for Delay-Sensitive Applications

    Get PDF
    The diversity of applications served by the explosively growing Internet is increasing. In particular, applications that are sensitive to end-to-end packet delays become more common and include telephony, video conferencing, and networked games. While the single best-effort service of the current Internet favors throughput-greedy traffic by equipping congested links with large buffers, long queuing at the congested links hurts the delay-sensitive applications. Furthermore, while numerous alternative architectures have been proposed to offer diverse network services, the innovative alternatives failed to gain widespread end-to-end deployment. This dissertation explores different networking mechanisms for supporting low queueing delay required by delay-sensitive applications. In particular, it considers two different approaches. The first one assumes employing congestion control protocols for the traffic generated by the considered class of applications. The second approach relies on the router operation only and does not require support from end hosts

    Delay-oriented active queue management in TCP/IP networks

    Get PDF
    PhDInternet-based applications and services are pervading everyday life. Moreover, the growing popularity of real-time, time-critical and mission-critical applications set new challenges to the Internet community. The requirement for reducing response time, and therefore latency control is increasingly emphasized. This thesis seeks to reduce queueing delay through active queue management. While mathematical studies and research simulations reveal that complex trade-off relationships exist among performance indices such as throughput, packet loss ratio and delay, etc., this thesis intends to find an improved active queue management algorithm which emphasizes delay control without trading much on other performance indices such as throughput and packet loss ratio. The thesis observes that in TCP/IP network, packet loss ratio is a major reflection of congestion severity or load. With a properly functioning active queue management algorithm, traffic load will in general push the feedback system to an equilibrium point in terms of packet loss ratio and throughput. On the other hand, queue length is a determinant factor on system delay performance while has only a slight influence on the equilibrium. This observation suggests the possibility of reducing delay while maintaining throughput and packet loss ratio relatively unchanged. The thesis also observes that queue length fluctuation is a reflection of both load changes and natural fluctuation in arriving bit rate. Monitoring queue length fluctuation alone cannot distinguish the difference and identify congestion status; and yet identifying this difference is crucial in finding out situations where average queue size and hence queueing delay can be properly controlled and reasonably reduced. However, many existing active queue management algorithms only monitor queue length, and their control policies are solely based on this measurement. In our studies, our novel finding is that the arriving bit rate distribution of all sources contains information which can be a better indication of congestion status and has a correlation with traffic burstiness. And this thesis develops a simple and scalable way to measure its two most important characteristics, namely the mean ii and the variance of the arriving rate distribution. The measuring mechanism is based on a Zombie List mechanism originally proposed and deployed in Stabilized RED to estimate the number of flows and identify misbehaving flows. This thesis modifies the original zombie list measuring mechanism, makes it capable of measuring additional variables. Based on these additional measurements, this thesis proposes a novel modification to the RED algorithm. It utilizes a robust adaptive mechanism to ensure that the system reaches proper equilibrium operating points in terms of packet loss ratio and queueing delay under various loads. Furthermore, it identifies different congestion status where traffic is less bursty and adapts RED parameters in order to reduce average queue size and hence queueing delay accordingly. Using ns-2 simulation platform, this thesis runs simulations of a single bottleneck link scenario which represents an important and popular application scenario such as home access network or SoHo. Simulation results indicate that there are complex trade-off relationships among throughput, packet loss ratio and delay; and in these relationships delay can be substantially reduced whereas trade-offs on throughput and packet loss ratio are negligible. Simulation results show that our proposed active queue management algorithm can identify circumstances where traffic is less bursty and actively reduce queueing delay with hardly noticeable sacrifice on throughput and packet loss ratio performances. In conclusion, our novel approach enables the application of adaptive techniques to more RED parameters including those affecting queue occupancy and hence queueing delay. The new modification to RED algorithm is a scalable approach and does not introduce additional protocol overhead. In general it brings the benefit of substantially reduced delay at the cost of limited processing overhead and negligible degradation in throughput and packet loss ratio. However, our new algorithm is only tested on responsive flows and a single bottleneck scenario. Its effectiveness on a combination of responsive and non-responsive flows as well as in more complicated network topology scenarios is left for future work

    Performance Comparison of Queue Management Algorithms in LTE Networks using NS-3 Simulator

    Get PDF
    One of the most important issues accepted by researchers in LTE cellular systems is to develop Queue Management Algorithms for RLC (Radio Link Control). The performance of queue-management algorithms depends on parameters such as latency, packet dropping, and bandwidth usage. Simulation software is used to evaluate the queue-management algorithms developed and to test their performance. In the literature, active queue management algorithms have been compared with wired and wireless networks. In contrast to prior works, in this study, we have analyzed active queue management algorithms using the LTE model in the NS-3 network simulator. When the data and the results obtained from the simulations have been evaluated, it is concluded that the RED algorithm using probabilistic methods and the threshold value is more successful than the other algorithms in LTE networks

    Simulation and Evaluation of Wired and Wireless Networks with NS2, NS3 and OMNET++

    Get PDF
    Communication systems are emerging rapidly with the revolutionary growth in terms of networking protocols, wired and wireless technologies, user applications and other IEEE standards. Numbers of industrial as well as academic organizations around the globe are bringing in light new innovations and ideas in the field of communication systems. These innovations and ideas require intense evaluation at initial phases of development with the use of real systems in place. Usually the real systems are expensive and not affordable for the evaluation. In this case, network simulators provide a complete cost-effective testbed for the simulation and evaluation of the underlined innovations and ideas. In past, numerous studies were conducted for the performance evaluation of network simulators based on CPU and memory utilization. However, performance evaluation based on other metrics such as congestion window, throughput, delay, packet delivery ratio and packet loss ratio was not conducted intensively. In this thesis, network simulators such as NS2, NS3 and OMNET++ will be evaluated and compared for wired and wireless networks based on congestion window, throughput, delay, packet delivery and packet loss ratio. In the theoretical part, information will be provided about the wired and wireless networks and mathematical interpretation of various components used for these networks. Furthermore, technical details about the network simulators will be presented including architectural design, programming languages and platform libraries. Advantages and disadvantages of these network simulators will also be highlighted. In the last part, the details about the experiments and analysis conducted for wired and wireless networks will be provided. At the end, findings will be concluded and future prospects of the study will be advised.fi=OpinnÀytetyö kokotekstinÀ PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=LÀrdomsprov tillgÀngligt som fulltext i PDF-format
    • 

    corecore