Design and Analysis of Queuing Delay Control for End-to-End Rate Control Algorithm

نویسندگان

  • Jin-Ru CHEN
  • Yaw-Chung CHEN
چکیده

A distributed congestion avoidance scheme, the End-to-End Rate Control Algorithm (EERCA), has been proposed [5] for Available Bit Rate (ABR) service. In this work, we enhance EERCA by replacing the Queue Occupancy Reduction with the queuing delay control (QDC), which manipulates the queue occupancy more efficiently with less functional complexity. Furthermore, it alleviates per-VC accounting requirement and thus reduces the complexity of a switch. From both the analysis and the simulation, it shows that the proposed virtual queue occupancy precisely reflects the variation of the actual queue occupancy. This enhanced EERCA features higher efficiency and more stable queue occupancy than the original algorithm. key words: EERCA, queuing delay-control

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controlling Queuing Delays for Real-Time Communication: The Interplay of E2E and AQM Algorithms

Real-time media communication requires not only congestion control, but also minimization of queuing delays to provide interactivity. In this work we consider the case of real-time communication between web browsers (WebRTC) and we focus on the interplay of an end-to-end delay-based congestion control algorithm, i.e. the Google congestion control (GCC), with two delay-based AQM algorithms, name...

متن کامل

New Delay Analysis in High Speed Networks

The implementation of bounded-delay services over integrated services networks relies admission control mechanisms that in turn use end-to-end delay computation algorithms. For guaranteed-rate scheduling algorithms, such as fair queueing, delay computation based on Cruz' service curve model performs very well. Many currently deployed networks, be they packet-switched or ATM based, rely on non-g...

متن کامل

Delay Differentiation without Rate Tinkering

Link buffering is a key element in packet-switched networks to absorb temporary traffic bursts without excessive dropping. The resulting queuing delay is a critical performance factor. Research on buffer management typically studies differentiated buffer allocation to control forwarding rates or buffer size management to control the overall queuing delay. On the other hand, delay differentiatio...

متن کامل

Comparative Analysis of CODEL and LEDBAT to Overcome Bufferbloat Problem

Bufferbloat is a problem in a packet-switched network which can occur due to increase in the size of buffer with increase in internet traffic. This creates high latency in network which ultimately degrades the performance of the network. The usage of oversized buffer in the networks results in increasing the queuing delay. Researcher has made two types of suggestions to solve the bufferbloat pr...

متن کامل

A Differentiated Pricing Framework for Improving the Performance of the Elastic Traffics in Data Networks

Rate allocation has become a demanding task in data networks as diversity in users and traffics proliferate. Most commonly used algorithm in end hosts is TCP. This is a loss based scheme therefore it exhibits oscillatory behavior which reduces network performance. Moreover, since the price for all sessions is based on the aggregate throughput, losses that are caused by TCP affect other sessions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999