Abstract
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.
Highlights
Works to measure and analyze throughput and packet average delay
Our analysis is first initiated with switch size N = 4 and with each VOQij is set to 200 cells
The simulation was done using NS2 and the results of the both fairness and starvation was studied by combining both Weighted Fair Queueing (WFQ) and Low Latency Queuing (LLQ)
Summary
Works to measure and analyze throughput and packet average delay. In this work, throughput and delay of the. The rapid growth of the Internet and quick implementation of the technology in recent years packet has been studied extensively in the context of ATM switching fabrics for fixed length packets Output queued switches can Increasing the link speed and data rates needs large provide 100% throughput and arbitrary QoS efficiently, buffer size. Under buffered switches leads to packet loss, in turn suffer quality of service degradation especially but they are infeasible (Awedeh and Mouftah, 1995) to implement at high speeds and high port densities due to for audio and video applications. The proposed scheduling and queuing algorithms were works with an implicit assumption of infinite buffer space to achieve 100% throughput with degradation in average latency. Our proposed Framed Low Latency Weighted Fair Queueing (FL2WFQ) measures throughput and packet delay in finite size Virtual queue buffers. Low Latency Queuing (LLQ) gives priority to real-time traffic such as video, audio datas.LLQ especially dequeue packets with highest priority queue first
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
