نتایج جستجو برای: random early detection red
تعداد نتایج: 1593679 فیلتر نتایج به سال:
We investigate the performance of TCP under three representatives of packet scheduling algorithms at the router. Our main focus is to investigate how fair service can be provided for elastic applications sharing the link. Packet scheduling algorithms that we consider are FIFO (First In First Out), RED (Random Early Detection), and DRR (Deficit Round Robin). Through simulation and analysis resul...
Random early detection (RED) is expected to eliminate global synchronization by random active packet drop. Its packet drop probability is decided by the maximum packet drop probability in its drop function, buffer thresholds, and average queue length. It has been observed that for a large number of connections, a small value of the maximum packet drop probability may not eliminate global synchr...
This project evaluates performance of of TCP RENO under Random Early Detection (RED) and Explicit Congestion Notification (ECN) -based schemes of congestion avoidance. The evaluation is done in a number of Wide Area Network (WAN) scenarios, which are analyzed for throughput, droprate and fairness.
In the last three decades, the development of communication and networking technology has rapidly increased and the use of the internet has become one of the tasks in our daily life. The revolution of the internet from transferring the data to the multimedia applications makes it one of the most important and quickest media for delivering the information in the world. On the other side, this re...
The IETF Differentiated Services Working Group has recently standardized the Assured Forwarding (AF) Per Hop Behavior (PHB). RFC 2597 recommends that an Active Queue Management (AQM) technique be used to realize the multiple levels of drop precedence required in the AF PHB. The most widely used AQM scheme is RED (Random Early Detection). There are several ways to extend RED to a Multilevel RED ...
The focus of this work is to study the behavior of various queue management algorithms, including RED (Random Early Detection), RIO (RED IN/OUT), SRR, SFB (Stochastic Fair Blue) and BLUE. The performance metrics of the comparison are Throughput (Quantity of Service), end–to–end delay (Quality of Service) and drop of packets. The simulation is done using NS-2. In this paper we have illustrated t...
Random Early Detection (RED) is the most promising Active Queue Management (AQM) mechanism. Its interaction with Transmission Control Protocol (TCP) can be modeled as a discrete-time dynamical system, which may exhibit complex bifurcation and chaos behavior. An improved RED algorithm is proposed by using a real-time, adaptive, model-independent (RTAMI) technique. Bifurcation analysis and numeri...
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
----------------------------------------------------------------------ABSTRACT------------------------------------------------------------------In wireless networks, resource management is a very complicated issue because of scarcity in resources. This paper presents a fuzzy based packet dropping scheme for wireless networks in the context of future generation cellular networks. In this scheme,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید