1,986 research outputs found
Comparative Study Of Congestion Control Techniques In High Speed Networks
Congestion in network occurs due to exceed in aggregate demand as compared to
the accessible capacity of the resources. Network congestion will increase as
network speed increases and new effective congestion control methods are
needed, especially to handle bursty traffic of todays very high speed networks.
Since late 90s numerous schemes i.e. [1]...[10] etc. have been proposed. This
paper concentrates on comparative study of the different congestion control
schemes based on some key performance metrics. An effort has been made to judge
the performance of Maximum Entropy (ME) based solution for a steady state
GE/GE/1/N censored queues with partial buffer sharing scheme against these key
performance metrics.Comment: 10 pages IEEE format, International Journal of Computer Science and
Information Security, IJCSIS November 2009, ISSN 1947 5500,
http://sites.google.com/site/ijcsis
Evaluation Study for Delay and Link Utilization with the New-Additive Increase Multiplicative Decrease Congestion Avoidance and Control Algorithm
As the Internet becomes increasingly heterogeneous, the issue of congestion
avoidance and control becomes ever more important. And the queue length,
end-to-end delays and link utilization is some of the important things in term
of congestion avoidance and control mechanisms. In this work we continue to
study the performances of the New-AIMD (Additive Increase Multiplicative
Decrease) mechanism as one of the core protocols for TCP congestion avoidance
and control algorithm, we want to evaluate the effect of using the AIMD
algorithm after developing it to find a new approach, as we called it the
New-AIMD algorithm to measure the Queue length, delay and bottleneck link
utilization, and use the NCTUns simulator to get the results after make the
modification for the mechanism. And we will use the Droptail mechanism as the
active queue management mechanism (AQM) in the bottleneck router. After
implementation of our new approach with different number of flows, we expect
the delay will less when we measure the delay dependent on the throughput for
all the system, and also we expect to get end-to-end delay less. And we will
measure the second type of delay a (queuing delay), as we shown in the figure 1
bellow. Also we will measure the bottleneck link utilization, and we expect to
get high utilization for bottleneck link with using this mechanism, and avoid
the collisions in the link
Active Queue Management for Fair Resource Allocation in Wireless Networks
This paper investigates the interaction between end-to-end flow control and MAC-layer scheduling on wireless links. We consider a wireless network with multiple users receiving information from a common access point; each user suffers fading, and a scheduler allocates the channel based on channel quality,but subject to fairness and latency considerations. We show that the fairness property of the scheduler is compromised by the transport layer flow control of TCP New Reno. We provide a receiver-side control algorithm, CLAMP, that remedies this situation. CLAMP works at a receiver to control a TCP sender by setting the TCP receiver's advertised window limit, and this allows the scheduler to allocate bandwidth fairly between the users
- …