An Empirical Study of Delay Jitter Management Policies D. Stone and K. Jeffay Computer Science Department University of North Carolina, Chapel Hill ACM.

Slides:



Advertisements
Similar presentations
Display Power Management Policies in Practice Stephen P. Tarzia Peter A. Dinda Robert P. Dick Gokhan Memik Presented by: Andrew Hahn.
Advertisements

1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
The Network Layer Functions: Congestion Control
Review: Routing algorithms Distance Vector algorithm. –What information is maintained in each router? –How to distribute the global network information?
Comp Spring 2003 Delay Jitter Ketan Mayer-Patel.
NUS.SOC.CS5248 Ooi Wei Tsang 1 Adaptive Playout. NUS.SOC.CS5248 Ooi Wei Tsang 2 You are Here Network Encoder Sender Middlebox Receiver Decoder.
RTP: A Transport Protocol for Real-Time Applications Provides end-to-end delivery services for data with real-time characteristics, such as interactive.
The Good, the Bad and the Muffled: the Impact of Different Degradations on Internet Speech Anna Watson and M. Angela Sasse Department of CS University.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli University of Calif, Berkeley and Lawrence Berkeley National Laboratory SIGCOMM.
1 NUS.SOC.CS5248 OOI WEI TSANG Playout Buffer Management.
NUS.SOC.CS Roger Zimmermann (based in part on slides by Ooi Wei Tsang) 1 Adaptive Playout.
Chapter 6 outline r 6.1 Multimedia Networking Applications r 6.2 Streaming stored audio and video m RTSP r 6.3 Real-time, Interactive Multimedia: Internet.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
An Empirical Study of Real Audio Traffic A. Mena and J. Heidemann USC/Information Sciences Institute In Proceedings of IEEE Infocom Tel-Aviv, Israel March.
CStream: Neighborhood Bandwidth Aggregation For Better Video Streaming Thangam Vedagiri Seenivasan Advisor: Mark Claypool Reader: Robert Kinicki 1 M.S.
IP Telephony Project By: Liane Lewin Shahar Eytan Guided By: Ran Cohen - IBM Vitali Sokhin - Technion.
A Case for Relative Differentiated Services and the Proportional Differentiation Model Constantinos Dovrolis Parameswaran Ramanathan University of Wisconsin-Madison.
The Good, the Bad and the Muffled: the Impact of Different Degradations on Internet Speech Anna Watson and M. Angela Sasse Dept. of CS University College.
Multimedia Streaming Gateway With Jitter Detection Siu-Ping Chan, Chi-Wah Kok Albert K. Wong IEEE TRANSACTIONS ON MULTIMEDIA, June 2005.
1 Fall 2005 Hardware Addressing and Frame Identification Qutaibah Malluhi CSE Department Qatar University.
ABE: Providing a Low Delay within Best Effort P. Hurley, M. Kara, J. Le Boudec, and P. Thiran ICA, Swiss Federal Institute of Technology, Lausanne, Switzerland.
1 Cross-Layer Scheduling for Power Efficiency in Wireless Sensor Networks Mihail L. Sichitiu Department of Electrical and Computer Engineering North Carolina.
A New Adaptive FEC Loss Control Algorithm for Voice Over IP Applications Chinmay Padhye, Kenneth Christensen and Wilfirdo Moreno Department of Computer.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.
Successful Multiparty Audio Communication over the Internet Vicky Hardman, M. Angela Sasse and Isidor Kouvelas Department of Computer Science University.
Packet audio playout delay adjustment Performance bounds and algorithms Moon, Kurose, Towsley.
Adaptive Playout Scheduling Using Time-scale Modification Yi Liang, Nikolaus Färber Bernd Girod, Balaji Prabhakar.
LYU9802 Quality of Service in Wired/Wireless Communication Networks: Techniques and Evaluation Supervisor: Dr. Michael R. Lyu Marker: Dr. W.K. Kan Wan.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
The Effects of Jitter on the Perceptual Quality of Video Mark Claypool and Jonathan Tanner Computer Science Department Worcester Polytechnic Institute.
Using Redundancy and Interleaving to Ameliorate the Effects of Packet Loss in a Video Stream Yali Zhu, Mark Claypool and Yanlin Liu Department of Computer.
Successful Multiparty Audio Communication over the Internet Vicky Hardman, M. Angela Sasse and Isidor Kouvelas Department of Computer Science University.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
A Selective Retransmission Protocol for Multimedia on the Internet Mike Piecuch, Ken French, George Oprica and Mark Claypool Computer Science Department.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
Chapter 3 part II Data and Signals
Design of Cooperative Vehicle Safety Systems Based on Tight Coupling of Communication, Computing and Physical Vehicle Dynamics Yaser P. Fallah, ChingLing.
1 Physical Clocks need for time in distributed systems physical clocks and their problems synchronizing physical clocks u coordinated universal time (UTC)
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
Dynamic versus Static Traffic Policing: A New Approach for Videoconference Traffic over Wireless Cellular Networks Author: Polychronis Koutsakis Anukrati.
Introduction to Networks CS587x Lecture 1 Department of Computer Science Iowa State University.
An Empirical Evaluation of VoIP Playout Buffer Dimensioning in Skype, Google Talk, and MSN Messenger Chen-Chi Wu, Kuan-Ta Chen, Yu-Chun Chang, and Chin-Laung.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
1 Measuring Congestion Responsiveness of Windows Streaming Media James Nichols Advisors: Prof. Mark Claypool Prof. Bob Kinicki Reader: Prof. David Finkel.
An optimal power-saving class II for VoIP traffic and its performance evaluations in IEEE e JungRyun Lee School of Electrical and Electronics Eng,Chung-Ang.
Competitive Queue Policies for Differentiated Services Seminar in Packet Networks1 Competitive Queue Policies for Differentiated Services William.
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
9.7 Other Congestion Related Issues Outline Queuing Discipline Avoiding Congestion.
Vertical Optimization Of Data Transmission For Mobile Wireless Terminals MICHAEL METHFESSEL, KAI F. DOMBROWSKI, PETER LANGENDORFER, HORST FRANKENFELDT,
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Analysis of RED Goal: impact of RED on loss and delay of bursty (TCP) and less bursty or smooth (UDP) traffic RED eliminates loss bias against bursty traffic.
1 An Adaptive Energy-Efficient MAC Protocol for Wireless Sensor Networks Tijs van Dam, Koen Langendoen In ACM SenSys /1/2005 Hong-Shi Wang.
Lecture Network layer -- May Congestion control Algorithms.
Efficient Gigabit Ethernet Switch Models for Large-Scale Simulation Dong (Kevin) Jin David Nicol Matthew Caesar University of Illinois.
Bluetooth: Quality of Service Reference: “QoS based scheduling for incorporating variable rate coded voice in Bluetooth”; Chawla, S.; Saran, H.; Singh,
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.
Page Buffering, I. Pages to be replaced are kept in main memory for a while to guard against poorly performing replacement algorithms such as FIFO Two.
1 Buffering Strategies in ATM Switches Carey Williamson Department of Computer Science University of Calgary.
RTP and playout delay compensation Henning Schulzrinne Dept. of Computer Science Columbia University Fall 2003.
Building A Network: Cost Effective Resource Sharing
Topics discussed in this section:
Neha Jain Shashwat Yadav
3 | Analyzing Server, Network, and Client Health
Adaptive Playout.
CONGESTION CONTROL.
COMPUTER NETWORKS CS610 Lecture-10 Hammad Khalid Khan.
Building A Network: Cost Effective Resource Sharing
CS4470 Computer Networking Protocols
Presentation transcript:

An Empirical Study of Delay Jitter Management Policies D. Stone and K. Jeffay Computer Science Department University of North Carolina, Chapel Hill ACM Multimedia Systems Volume 2, Number 6 January 1995

Introduction Want to support interactive audio “Last mile” is LAN (including bridges, hubs) to desktop –Study that –(Me: 1995 LANs looked a lot like today’s WANs) Transition times vary, causing gaps in playout –Can ameliorate with display queue (buffer)

(Frames) Display latency – time from acquisition at sender to display at receiver (gap occurs if > previous frame) End-to-end delay – time from acquisition to decompression –Varies in time (transmit + (de)compress), delay jitter Queuing delay – time from buffer to display (change size) Introduction

Gaps vs. Delay Can prevent gaps by having constant delay –Network reserves buffers –Ala telephone networks –But not today’s Internet Plus –will still have LAN as “last mile” –OS and (de)compress can still cause jitter Thus, tradeoff between gaps and delay must be explicitly managed by conferencing system –Change size of display queue –The larger the queuing, the larger the delay and the fewer the gaps and vice versa

This Paper Evaluates 3 policies for managing display queue –I-policy, E-policy from [NK92] (I is for late data ignored, E is for expand time) –Queue Monitoring from this paper Empirical study –Audioconference on a LAN –Capture traces Simulator to compute delay and gaps

Outline Introduction(done) The I- and E-policies (next) The Queue Monitoring policy Evaluation The Study Summary

The Effect of Delay Jitter If display latency worse than largest end-to- end latency, then no gaps –(When is this not what we want?) Playout with low latency and some gaps preferable to high-latency and no gaps What if a frame arrives after its playout time? Two choices: –I-Policy – single fixed latency, so discard –E-Policy – late frames always displayed, so expand playout time

I-Policy (Queue parameter is 2) (3 gaps, display latency of 2)

E-Policy (1 gap, display latency of 3 at end)

I-Policy (2) One event, but latency still low (e, f, g, …)

E-Policy (2) One event, latency higher

Policy Summary Display latency chosen implicitly with E-policy Choose it explicitly with I-policy What is the right display latency amount? –Depends on application Example: surgeon viewing operation vs. televised lecture –Depends on network and machines Can vary across long run So, need a policy that allows display latency to be chosen dynamically

Outline Introduction(done) The I- and E-policies (done) The Queue Monitoring policy (next) Evaluation The Study Summary

Adjusting Display Latency Audioconference with silence detection can be modeled as series of talkspurts –Sound and then silence Adjust display latency between talkspurts NK92 said observe last m fragments, discard k largest delays and choose display latency as greatest delay –Recommend m>40 and k=0.07*m (Other approaches proposed, since)

Monitor the Queue Measuring the end-to-end latency is difficult because needs synchronized clocks Instead, observe length of display queue over time –If end-to-end delay constant, queue size will remain the same –If end-to-end delay increases, queue shrinks –If end-to-end delay decreases, queue expands If queue length > 2 for some time, can reduce queue without (hopefully) causing a gap –“some time” is parameter, n, in frame times –Implement with counters for each of m frames in queue –If any m times > n, discard frame and reset (keep queue at least 2) –Use QM-120 as default (about 2 seconds)

Outline Introduction(done) The I- and E-policies (done) The Queue Monitoring policy (done) Evaluation(next) The Study Summary

Comparing Policies If A has lower latency and gaps than B, then better If A lower latency, but higher gaps than which is better? –Depends upon relative amounts resolution application requirements –Few standards

Comparing Policies Assume: –Differences in latency of 15ms or more significant –Difference in gap rate of 1 per minute significant A is better than B if either gap or latency better and the other is the same Equal if same in both dimensions Incomparable if each is better in one dimension Note, for I-policy, synchronized clocks difficult. –Instead, delay first packet for amount of time (try 2 and 3 frames in this paper)

Outline Introduction(done) The I- and E-policies (done) The Queue Monitoring policy (done) Evaluation (done) The Study(next) Summary

The Study Run videoconference –Use audio only Record end-to-end delay Input into simulator to evaluate policy

Videoconference Built at UNC Runs on IBM PS/2 Uses UDP IBM-Intel ActionMedia 750 –30 fps, 256x240, 8-bit color (6-8k frames) –Audio 60 fps, 128 kb/second into 16.5ms frames (266 byte packets)

Network 10 Mb Ethernets and 16 Mb token rings 400 Unix workstations and Macs NFS and AFS Send machine  token-ring  gateway  department ethernet  bridge  department ethernet  gateway  token-ring  display machine

Data Gather data for 10 minute interval 24 runs between 6am and 5pm 4 runs between midnight and 1am Record: –Acquisition times –Display times –Adjust times for clock difference and drift Input traces into simulator –Outputs average display latency –Outputs average gap rate

Basic Data (Comments?)

Two Example Runs Low jitter High jitter

Results QM-120 better than I-2 for all but 11 (I-2 has gap per 2 seconds vs per 11 seconds)

Results Better than I-3 for all but 15 Latency of QM-120 better than that of I-3 Better than E for low jitter runs

Summary Results If want low latency, not large gap rate  QM out-performs all I policies, E-policies

Threshold as a Parameter Vary thresholds for adjusting queue latency 30 frame times (.5s) 60 frame times (1s) 120 frame times (2s) 600 frame times (10s) 3600 frame times (1 min)

Results Comments?

Summary QM-600 is the best relative to QM-120 QM-120 better than all the others (Me, what about in between? Should be optimal for each setting.) Also, –QM-3600 similar to E-policy –QM-30 and QM-60 similar to I-2

Decay Thresholds Want to converge slowly to lowest latency Base threshold for queue length of 2 Decay factor for other queue lengths Base of 3600, decay of 2 would have: –3600 for 3, 1800 for 4, 900 for 5 …

Results

Summary Results QM-(120,2) didn’t help QM-(600,2) better than QM-120 –Also better than QM-600 by decreasing latency and gap rate almost the same QM-(3600,2) better than QM-120 –Also better than QM-3600 So, decay is useful for large base thresholds, but may hurt for small base thresholds

Summary Will always be delay –From network or OS or … Need to adjust queue latency –QM-(600,2) is the best, QM-120 almost as good Queue monitoring can be effective –35-40 ms delay, variation up to 200ms, even 80ms when quiet Run 3 Best vs. E –E: 140ms,.9 gaps/min –QM-(600,2): 68ms, 1.4 gaps/min Run 24 Best vs. I –I; 93 ms, 15 gaps/min –QM-(600,2): 90ms, 4 gaps/min QM is flexible, can be tuned to app or user

Future Work?

Future Work Compare against I-policy where threshold changes each talkspurt Compare using different metrics, say that combine latency and gaps or looks at distribution –PQ studies to measure tradeoffs Larger networks Combine with repair Other decay strategies for QM