Comparison and Analysis of FIFO, PQ, and WFQ Disciplines on multimedia

Slides:



Advertisements
Similar presentations
1 CNPA B Nasser S. Abouzakhar Queuing Disciplines Week 8 – Lecture 2 16 th November, 2009.
Advertisements

Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
Fundamentals of Python: From First Programs Through Data Structures
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 25 Multimedia.
CSE331: Introduction to Networks and Security Lecture 13 Fall 2002.
CS 408 Computer Networks Congestion Control (from Chapter 05)
High Speed Networks and Internets : Multimedia Transportation and Quality of Service Meejeong Lee.
Networking Issues in LAN Telephony Brian Yang
1 Solutions to Performance Problems in VOIP over Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi.
Channel Allocation for the GPRS Design and Performance Study Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science and Information Engineering.
Efficient Internet Traffic Delivery over Wireless Networks Sandhya Sumathy.
Computer Networking Lecture 17 – Queue Management As usual: Thanks to Srini Seshan and Dave Anderson.
School of Information Technologies IP Quality of Service NETS3303/3603 Weeks
CSc 461/561 CSc 461/561 Multimedia Systems Part C: 3. QoS.
7/15/2015HY220: Ιάκωβος Μαυροειδής1 HY220 Schedulers.
CS144, Stanford University Error in Q3-7. CS144, Stanford University Using longest prefix matching, the IP address will match which entry? a /8.
Localized Asynchronous Packet Scheduling for Buffered Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York Stony Brook.
Understanding QoS Fundamentals. The basic overview for QoS is “Who goes 1 st? ” from an exit perspective on a switch or router. ‘Evil Villains’ in the.
© 2006 Cisco Systems, Inc. All rights reserved. QOS Lecture 4 - Introducing QOS.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 4: Implement the DiffServ QoS Model.
CIS679: Scheduling, Resource Configuration and Admission Control r Review of Last lecture r Scheduling r Resource configuration r Admission control.
Computer Networks Laboratory Utility-Based Adaptive Video Streaming Mechanisms Paolo V. Encomienda Nestor Michael C. Tiglao University of the Philippines.
CSE QoS in IP. CSE Improving QOS in IP Networks Thus far: “making the best of best effort”
An Integrated IP Packet Shaper and Scheduler for Edge Routers MSEE Project Presentation Student: Yuqing Deng Advisor: Dr. Belle Wei Spring 2002.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Oppenheimer.
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
Link Scheduling & Queuing COS 461: Computer Networks
Network Instruments VoIP Analysis. VoIP Basics  What is VoIP?  Packetized voice traffic sent over an IP network  Competes with other traffic on the.
CS 447 Network & Data Communication QoS (Quality of Service) & DiffServ Introduction Department of Computer Science Southern Illinois University Edwardsville.
ﺑﺴﻢﺍﷲﺍﻠﺭﺣﻣﻥﺍﻠﺭﺣﻳﻡ. Group Members Nadia Malik01 Malik Fawad03.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS.
March 29 Scheduling ?. What is Packet Scheduling? Decide when and what packet to send on output link 1 2 Scheduler flow 1 flow 2 flow n Buffer management.
Wireless communications and mobile computing conference, p.p , July 2011.
Analysis of QoS Arjuna Mithra Sreenivasan. Objectives Explain the different queuing techniques. Describe factors affecting network voice quality. Analyse.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNP 1 v3.0 Module 1 Overview of Scalable Internetworks.
Internet multimedia: simplest approach audio, video not streamed: r no, “pipelining,” long delays until playout! r audio or video stored in file r files.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS.
Mr. Mark Welton.  Quality of Service is deployed to prevent data from saturating a link to the point that other data cannot gain access to it  QoS allows.
Queuing Delay 1. Access Delay Some protocols require a sender to “gain access” to the channel –The channel is shared and some time is used trying to determine.
© 2006 Cisco Systems, Inc. All rights reserved. Module 4: Implement the DiffServ QoS Model Lesson 4.3: Introducing Queuing Implementations.
Queue Scheduling Disciplines
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
© 2006 Cisco Systems, Inc. All rights reserved. 3.2: Implementing QoS.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
Queue Management Mike Freedman COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Providing QoS in IP Networks
Univ. of TehranIntroduction to Computer Network1 An Introduction Computer Networks An Introduction to Computer Networks University of Tehran Dept. of EE.
Scheduling Mechanisms Applied to Packets in a Network Flow CSC /15/03 By Chris Hare, Ricky Johnson, and Fulviu Borcan.
Chapter 30 Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Congestion Control in Data Networks and Internets
Instructor Materials Chapter 6: Quality of Service
Why Is There a Need to Implement a Weighted Fair Queue?
QoS & Queuing Theory CS352.
Topics discussed in this section:
An IP-based multimedia traffic generator
Empirically Characterizing the Buffer Behaviour of Real Devices
Chapter 6 Queuing Disciplines
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Congestion Control in Data Networks and Internets
OPNET Simulation of Different Queuing Mechanisms
Quality of Service What is QoS? When is it needed?
COS 461: Computer Networks
Network Simulation NET441
Congestion Control Reasons:
Introduction to Packet Scheduling
Introduction to Packet Scheduling
Presentation transcript:

Comparison and Analysis of FIFO, PQ, and WFQ Disciplines on multimedia Tahani aljehani

Introduction With recent advancements in greater network speeds and higher bandwidths, the online use of applications that support services such as VoIP, video conferencing, and File Sharing Protocol (FTP) have become more prevalent While some applications such as web browsing (HTTP), email, and FTP are insensitive to the delay of transmitted information, VoIP and video conferencing are very sensitive to delay, packet losses, and jitter

Queuing disciplines Queuing disciplines are therefore implemented in routers to govern, control, sort, and to prioritize packets in the buffers prior to their transmission

Queuing disciplines The following project will attempt to study the effects and performances of three different queuing disciplines (FIFO, PQ, and WFQ) as applied towards some of the supported OPNET applications (FTP, voice, and video conferencing). Each queuing discipline considered will constitute a scenario in OPNET and the three applications of FTP, voice and video conferencing will be studied separately under each scenario.

First-in, First-out Queues (FIFO) FIFO, or First-In, First-Out queuing is the simplest of the queuing disciplines studied. In FIFO queuing, the first packet to arrive at the buffer is the first packet to be transmitted. It is also important to mention that under this queuing technique, all packets are treated equally regardless of the application that is being utilized, and regardless of the importance of the packets

First-in, First-out Queues (FIFO)

Priority Queues (PQ) Priority Queues are based on FIFO queues with an important distinction; while packets are treated equally under the FIFO queues; PQs sort packets in the buffer according a priority tag which reflects the importance and urgency required in the transmission of packets. Furthermore, in contrast to FIFO Queues, Priority Queues are not made up of a single buffer.

Priority Queues (PQ) Real-time applications such as VoIP and video conferencing should in theory observe less delay under this queuing discipline

Weighted Fair Queuing (WFQ) Similar to Priority Queues, arriving packets are tagged and placed into the appropriate buffers as they wait to be serviced. One important difference between this queuing discipline and the former method is that all buffers are serviced in a circular manner by a WFQ scheduler

Weighted Fair Queuing (WFQ)

IP Traffic Dropped the number of IP datagrams or packets dropped per second was found to be the highest for the FIFO queuing method, while PQ and WFQ showed fewer drop in packets across all IP interfaces during the simulation. The results obtained could be explained in terms of the queue sizes of each of the queuing disciplines employed. Since FIFO has just one queue, the number of packets dropped is expected to rise as the queue becomes full. PQ and WFQ, on the other hand, employ multiple queues and so the number of packets dropped will be fewer if either of those methods is employed

Video Conferencing Traffic Received: WFQ started to drop packets roughly about 135 seconds of network operation while reaching a maximum of about 235,000 bytes of data. PQ’s drop of data was seen earlier at around 105 seconds and with a much lower traffic of about 85,000 bytes at its peak. FIFO reached a maximum of about 250,000 bytes and then started losing packets and fluctuating between 30,000 and 130,000 bytes. PQ’s performance was found to be the worst, as it is only a simple variation of the FIFO queuing method.

Voice Traffic Received: The results obtained show that the traffic received under FIFO was the less than both PQ and WFQ, this result was also expected and it shows that a higher volume of traffic could be obtained under either PQ or WFQ than FIFO. This is especially important for voice applications as any loss would adversely affect the overall quality of the voice signal

Analyzes the following 1- Apply all step of the OPNET lab , and print screen every step Analyzes the following: FTP FTP: Time Average in Traffic Sent (bytes/ s) Voice Voice: Time Average in End-to-End Delay( s) Voice: Jitter ( s) Voice: Traffic Sent ( bytes / s) Voice: Traffic Received (bytes / s) Video Video : Time Average in End-to-End Delay( s) Video : Traffic Sent ( bytes / s) Video : Traffic Received (bytes / s)