ترکیبی از زمان تاخیرکم و وزن متوسط صف بندی براساس برنامه ریزی یک ورودی در صف سوئیچ
A COMBINED LOW LATENCY AND WEIGHTED FAIR QUEUING BASED SCHEDULING OF AN INPUT-QUEUED SWITCH
نویسندگان |
این بخش تنها برای اعضا قابل مشاهده است ورودعضویت |
اطلاعات مجله |
thescipub.com |
سال انتشار |
2014 |
فرمت فایل |
PDF |
کد مقاله |
23986 |
پس از پرداخت آنلاین، فوراً لینک دانلود مقاله به شما نمایش داده می شود.
چکیده (انگلیسی):
Input queuing has become dominant and popular building blocks for high speed crossbar switches with
many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued
switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average
delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm manages
the size of the queues and drops packets when necessary or appropriate. Scheduling algorithms determine
next packet to transfer and solves conflicts with the switching fabric. Fairness and Starvation are another
two properties of IQ switches and it is analyzed in finite VOQ in this works. Fairness performs fair
allocation of bandwidth among flows and prevents flows from misbehaving flows. Starvation of VOQ
prevents serving High priority queue. The motivation behind this study is to schedule the HoL packets
queued in finite VOQs by Framing with Low Latency Queuing (LLQ) and Weighted Fair Queueing (WFQ).
This queueing technique of VOQ is measured in terms of throughput and average delay by fair allocation of
bandwidth with WFQ and Starvation-free queue with LLQ.
Input queuing has become dominant and popular building blocks for high speed crossbar switches with
many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued
switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average
delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm manages
the size of the queues and drops packets when necessary or appropriate. Scheduling algorithms determine
next packet to transfer and solves conflicts with the switching fabric. Fairness and Starvation are another
two properties of IQ switches and it is analyzed in finite VOQ in this works. Fairness performs fair
allocation of bandwidth among flows and prevents flows from misbehaving flows. Starvation of VOQ
prevents serving High priority queue. The motivation behind this study is to schedule the HoL packets
queued in finite VOQs by Framing with Low Latency Queuing (LLQ) and Weighted Fair Queueing (WFQ).
This queueing technique of VOQ is measured in terms of throughput and average delay by fair allocation of
bandwidth with WFQ and Starvation-free queue with LLQ.
کلمات کلیدی مقاله (فارسی):
ورودي صف سوئيچ ، زمانبندي ، صف بندي ، زمان تاخير کم صف ، وزن متوسط صف
کلمات کلیدی مقاله (انگلیسی):
Keywords: Input Queued Switch, Scheduling, Queuing, Low Latency Queueing, Weighted Fair Queueing
پس از پرداخت آنلاین، فوراً لینک دانلود مقاله به شما نمایش داده می شود.