3/2/2001Hanoch Levy, CS, TAU1 What Quality of Service is About Hanoch Levy Feb 2003.

Slides:



Advertisements
Similar presentations
APNOMS2003Fujitsu Laboratories Ltd.1 A QoS Control Method Cooperating with a Dynamic Load Balancing Mechanism Akiko Okamura, Koji Nakamichi, Hitoshi Yamada.
Advertisements

Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
3/3/2004Hanoch Levy, CS, TAU1 What Quality of Service is About Hanoch Levy Feb 2004.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
© R. Jayanthan, K. Gunasakera 1999 Quality of Service in Multiservice Networks for Digital Economy R. Jayanthan & Kithsiri Gunasakera National IT Conference.
Scheduling in Web Server Clusters CS 260 LECTURE 3 From: IBM Technical Report.
Roma 17/10/08 WORLD Project KO Meeting Laura Galluccio WORLD Project – KO Meeting University of Catania.
3/2/2001Hanoch Levy, CS, TAU1 Basic Communications Protocols Workshop on QoS Hanoch Levy Feb 2004.
Ye Wang, Xuan Li, Dongtao Liu, Maoke Chen ICCT2006 Guilin, China Optimizing Cost and Performance for Concurrent Multipath Transferring using extended shim6.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
Rarest First and Choke Algorithms are Enough Arnaud LEGOUT INRIA, Sophia Antipolis France G. Urvoy-Keller and P. Michiardi Institut Eurecom France.
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 – QoS.
Traffic Shaping Why traffic shaping? Isochronous shaping
Quality of Service Requirements
CPSC Topics in Multimedia Networking A Mechanism for Equitable Bandwidth Allocation under QoS and Budget Constraints D. Sivakumar IBM Almaden Research.
Motivation Due to the development of new Internet access technologies (DSL's and HFC's), VoD services have become increasingly popular Despite the continuous.
Detecting Network Intrusions via Sampling : A Game Theoretic Approach Presented By: Matt Vidal Murali Kodialam T.V. Lakshman July 22, 2003 Bell Labs, Lucent.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
Multicast Communication
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
Ch. 28 Q and A IS 333 Spring Q1 Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer data across.
CS332 Ch. 28 Spring 2014 Victor Norman. Access delay vs. Queuing Delay Q: What is the difference between access delay and queuing delay? A: I think the.
Maputo, Mozambique, April 2014 QoS Framework for Broadband Internet Service Country Case: Mauritius Roubee GADEVADOO, Engineer/Licensing Officer,
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
Tiziana FerrariQuality of Service for Remote Control in the High Energy Physics Experiments CHEP, 07 Feb Quality of Service for Remote Control in.
Switching Techniques Student: Blidaru Catalina Elena.
Bell Labs Advanced Technologies EMEAAT Proprietary Information © 2004 Lucent Technologies1 Overview contributions for D27 Lucent Netherlands Richa Malhotra.
E0262 MIS - Multimedia Playback Systems Anandi Giridharan Electrical Communication Engineering, Indian Institute of Science, Bangalore – , India.
Use Case for Distributed Data Center in SUPA
QOS مظفر بگ محمدی دانشگاه ایلام. 2 Why a New Service Model? Best effort clearly insufficient –Some applications need more assurances from the network.
Distributed Multimedia March 19, Distributed Multimedia What is Distributed Multimedia?  Large quantities of distributed data  Typically streamed.
Chapter 2 – X.25, Frame Relay & ATM. Switched Network Stations are not connected together necessarily by a single link Stations are typically far apart.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Aadil Zia Khan and Shahab Baqai LUMS School of Science and Engineering QoS Aware Path Selection in Content Centric Networks Fahad R. Dogar Carnegie Mellon.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Network Instruments VoIP Analysis. VoIP Basics  What is VoIP?  Packetized voice traffic sent over an IP network  Competes with other traffic on the.
© 2006 Cisco Systems, Inc. All rights reserved. Optimizing Converged Cisco Networks (ONT) Module 3: Introduction to IP QoS.
1 Measuring Congestion Responsiveness of Windows Streaming Media James Nichols Advisors: Prof. Mark Claypool Prof. Bob Kinicki Reader: Prof. David Finkel.
Multimedia streaming Application Anandi Giridharan Electrical Communication Engineering, Indian Institute of Science, Bangalore – , India Querying.
1 - CS7701 – Fall 2004 Review of: Detecting Network Intrusions via Sampling: A Game Theoretic Approach Paper by: – Murali Kodialam (Bell Labs) – T.V. Lakshman.
Uni Innsbruck Informatik - 1 Network Support for Grid Computing... a new research direction! Michael Welzl DPS NSG Team
EE 122: Lecture 15 (Quality of Service) Ion Stoica October 25, 2001.
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.
Loss-Bounded Analysis for Differentiated Services. By Alexander Kesselman and Yishay Mansour Presented By Sharon Lubasz
Reading TCP/IP Protocol. Training target: Read the following reading materials and use the reading skills mentioned in the passages above. You may also.
AIMS’99 Workshop Heidelberg, May 1999 Multimedia Services using IP over Bearer Networks: Quality of Service Aspects based on ACTS Guidelines SII.
Internet Telephony Conference and EXPO East An Overview of QoS for Multi-Service IP Networks Peter Thompson Chief Scientist U4EA Technologies Ltd.
Switching. Circuit switching Message switching Packet Switching – Datagrams – Virtual circuit – source routing Cell Switching – Cells, – Segmentation.
10. Mai 20061INF-3190: Multimedia Protocols Quality-of-Service Foreleser: Carsten Griwodz
3/2/2001Hanoch Levy, CS, TAU1 What Quality of Service is About Hanoch Levy March 2001.
-1- Georgia State UniversitySensorweb Research Laboratory CSC4220/6220 Computer Networks Dr. WenZhan Song Professor, Computer Science.
Chapter 28 Q and A IS 333 Spring A quiz question Q: What is network latency? 1.Changes in delay and duration of the changes 2.time required to transfer.
Chapter 30 Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Instructor Materials Chapter 6: Quality of Service
Confluent vs. Splittable Flows
Use Case for Distributed Data Center in SUPA
Congestion Control, Quality of Service, and Internetworking
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
TCP – UDP Protocols Senthilkumar. R / 12/27/2016 Overview Fundamentals
Measuring Service in Multi-Class Networks
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Provision of Multimedia Services in based Networks
Switching Techniques.
Internet: Quality of Service Mechanisms at Application Level
Switching.
Presentation transcript:

3/2/2001Hanoch Levy, CS, TAU1 What Quality of Service is About Hanoch Levy Feb 2003

3/2/2001Hanoch Levy, CS, TAU2 Outline What is Quality of Service on the Internet about What the aims of this workshop Structure of the course

3/2/2001Hanoch Levy, CS, TAU3 The Users and the service: What Communications Network serve User A and User B Placed in different locations Want to pass data of some type, from one to another. Want this to be done good/best/ASAP. Want to do it with certain minimal quality requirements.

3/2/2001Hanoch Levy, CS, TAU4 The Users and the service: The user point of view The single User is at the center of focus User is interested in getting the quality / performance it wants User does not care a bout other users

3/2/2001Hanoch Levy, CS, TAU5 The Scare Resource problem Resources are (are’nt?) limited Giving the user as much as it needs/ wants may be difficult due to limited resource problem. Subjects where there is not resource limitation – do not face Quality of service problem.

3/2/2001Hanoch Levy, CS, TAU6 The Scare Resource problem: Does it exist Are car-road resources limited? –Definitely, At least at large fractions of the day. Are Network resources limited: –Open question –A debated question –A subjective question: (cost-wise? Indirect- cost? Damage?)

3/2/2001Hanoch Levy, CS, TAU7 Communications Network and QoS :The network angle The network serves MANY users The network aims at providing good/Best quality to all of its users. The network must account for the needs of all users and achieve a mechanism that can meet them.

3/2/2001Hanoch Levy, CS, TAU8 Communications Network and QoS :The network angle Communications Network is like a set of car roads Communication applications are like streams of cars. QoS deals with how to operate these roads in order to provide the cars with good quality of service.

3/2/2001Hanoch Levy, CS, TAU9 How does it look like: the network from 10K feet

3/2/2001Hanoch Levy, CS, TAU10 The User perspective / The application perspective 1.Given the set of traffic rules used by the network user/ application want to: 1.Get the quality it wants (as good as possible, good above certain quality). 2.Pay as little as possible to get that quality. 2.User probably does not care about: 1.Other users (their quality) 2.Fairness to other users.

3/2/2001Hanoch Levy, CS, TAU11 The User perspective / The application perspective 1.The application: 1.May care or may not care about other users / their “fairness”, etc. 2.This depends with what perspective the application was built. 1.Social objective / or : 2.Selfishness

3/2/2001Hanoch Levy, CS, TAU12 The eternal race between the network and the users 1.There is an eternal race/game between the network and the users. 1.Network set up rules of operations 2.Users try to exploit them 3.Go back to 1. 2.The tighter the rules of operation the less freedom the user has. 3.The tighter the rules of operation the better quality is granted to the users.

3/2/2001Hanoch Levy, CS, TAU13 Tightness of operational rules: example1 : Car traffic 1.The Transport (car) system 1.Semi loose system 1.One CAN drive 200 KM/Hour 2.One Can cross red lights 3.  getting better performance one’s car 4.  on the account of others. 2.Still rules are strict enough 1.One cannot really do it for long time 2.Where is the looseness: 1.Rules are strict 2.Enforcement less strict.

3/2/2001Hanoch Levy, CS, TAU14 Tightness of operational rules: example1 : Car traffic 1.Most abuse is on speed / priority at junctions 2.No abuse at volume (bandwidth): 1.No limitation on the number of cars one can buy and send into the street. 2.Reason: 1.Not really necessary 2.Car is so expensive – one cannot really send many cars in.

3/2/2001Hanoch Levy, CS, TAU15 Tightness of operational rules: Example2: Telephony 1.The Telephone system 1.Very strict system: 2.User has almost NO CONTROL of how application behaves 3.User has almost no control of the resources she gets from the network 4.User gets VERY GOOD QUALITY

3/2/2001Hanoch Levy, CS, TAU16 Tightness of operational rules: Example3: Internet 1.The Internet system 1.Quite loose system: 2.Application has some freedom in the traffic it introduces to the network 1.The way it sends the data (later) 3.The user has freedom in how / how much it uses the application: 1.One can send as much as one wants. 2.One can hit the browser button as hard as one wants. 3.One can down load songs 24 hours a day.

3/2/2001Hanoch Levy, CS, TAU17 Objective of this workshop 1.To study and understand the quality of service issues of the Internet. 2.Understand the QoS problems 3.Understand the mechanisms that are used / can be used to provide QOS.

3/2/2001Hanoch Levy, CS, TAU18 Methodology and contents of the course 1.Theoretical background – will be provided at class. 2.Practical experience – at the lab. 3.Take the user (“thief”?) perspective: 1.Given the network and the network rules, client aims at maximizing its performance. 2.What can client do / how should client operate.

3/2/2001Hanoch Levy, CS, TAU19 Methodology : Project description 1.You have a client and your objective is to transfer (receive) X files from the network. 2.The files are distributed over N locations. 1.Some may appear in multiple locations. 2.The rate of downloading the files may depend on several parameters, some under your control.

3/2/2001Hanoch Levy, CS, TAU20 Methodology : Project description 2 1.Your aim is to download the files to your best satisfaction: 1.As fast as possible 2.At lowest Bandwidth consumption(?)

3/2/2001Hanoch Levy, CS, TAU21 Methodology : Project description Part I 1.You are given both the client and the server 2.You aim at building a mechanism (protocol) that will transfer from server to client at maximum “efficiency” 1.Only minimize time 2.Also minimize lost resources (lost packets)

3/2/2001Hanoch Levy, CS, TAU22 Methodology : Project description Part II 1.You are given the client only 2.K Servers are given and they operate according to their protocol (FTP) 3.Want to download the files efficiently from the servers 1.Only minimize time 2.Also minimize lost resources (lost packets)

3/2/2001Hanoch Levy, CS, TAU23 QOS Problems of Interest For network designer 1.Traffic classification and characterization –Properties of traffic –Requirements of the application / traffic –Requirements of the system –Impact on the system

3/2/2001Hanoch Levy, CS, TAU24 QOS Problems of Interest (Importance) 1.Traffic classification and characterization –Properties of traffic –Requirements of the application / traffic –Requirements of the system –Impact on the system

3/2/2001Hanoch Levy, CS, TAU25 QOS Problems of interest (cont): 2. Policing and shaping – Monitor traffic for obeying the rules –Location: typically at network entrance 3. Node (“Intersection”) design: –Create fast intersections –Introduce mechanisms of prioritization into the intersections –Guarantee QoS to a traffic stream despite interference of other streams (fair queuing) –Location: In the nodes

3/2/2001Hanoch Levy, CS, TAU26 QOS Problem of interest (cont) 4. Do not overflow your nodes (intersections) – estimate node capacity (Call Admission Control) 5. Efficient navigation of traffic (Routing) while obeying QoS 6. Managing your traffic: Virtual paths (transform your cars into trains…)

3/2/2001Hanoch Levy, CS, TAU27 QOS Problem of interest (cont) 7. Coordinate through network nodes (reservations): Traffic engineering. 8. Traffic characterization.