Vertical dimensioning: A novel DRR implementation for efficient fair queueing
نویسندگان
چکیده
منابع مشابه
Vertical dimensioning: A novel DRR implementation for efficient fair queueing
Fair bandwidth allocation is an important mechanism for traffic management in the Internet. Round robin schedulers, such as Deficit Round Robin (DRR), are well-suited for implementing fair queueing in multi-Gbps routers, as they schedule packets in constant time regardless of the total number of active flows. The main drawback of these schemes, however, lies in the maintenance of per flow queue...
متن کاملOn the Efficient Implementation of Fair Queueing
The performance of packet switched data networks is greatly influenced by the queue service discipline in routers and switches. In particular, the Fair Queueing discipline [1] has several advantages over the traditional first-come-first-served discipline. This paper studies data structures and algorithms for the efficient implementation of Fair Queueing. We present a novel performance evaluatio...
متن کاملAmudala Bhasker, Ajay Babu. Tiered-service Fair Queueing (tsfq): a Practical and Efficient Fair Queueing Algorithm. (under the Direction of Professor George Tiered-service Fair Queueing (tsfq): a Practical and Efficient Fair Queueing Algorithm Contents
AMUDALA BHASKER, AJAY BABU. Tiered-Service Fair Queueing (TSFQ): A Practical and Efficient Fair Queueing Algorithm. (Under the direction of Professor George N. Rouskas.) A router in today’s Internet has to satisfy two important properties in order to efficiently provide the Quality of Service (QoS) requested by the users. It should be fair among flows and also have low operational complexity. T...
متن کاملAmudala Bhasker, Ajay Babu. Tiered-service Fair Queueing (tsfq): a Practi- Cal and Efficient Fair Queueing Algorithm. (under the Direction of Professor George N. Tiered-service Fair Queueing (tsfq): a Practical and Efficient Fair Queueing Algorithm Contents
AMUDALA BHASKER, AJAY BABU. Tiered-Service Fair Queueing (TSFQ): A Practical and Efficient Fair Queueing Algorithm. (Under the direction of Professor George N. Rouskas.) A router in today’s Internet has to satisfy two important properties in order to efficiently provide the Quality of Service (QoS) requested by the users. It should be fair among flows and also have low operational complexity. T...
متن کاملFair and efficient network dimensioning with the reference point methodology
The dimensioning of telecommunication networks that carry elastic traffic requires the fulfillment of two conflicting goals: maximizing the total network throughput and providing fairness to all flows. Fairness in telecommunication network design is usually provided using the so-called max-min fairness (MMF) approach. However, this approach maximizes the performance of the worst (most expensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Communications
سال: 2008
ISSN: 0140-3664
DOI: 10.1016/j.comcom.2008.06.008