Compressed Video Streams: Network Constrained Smoothing
|
|
- Alban Harper
- 6 years ago
- Views:
Transcription
1 Compressed Video Streams: Network Constrained Smoothing Chris Bewick Rubem Pereira Madjid Merabti. June 1999 Distributed Multimedia Systems Group Liverpool John Moores University Byrom St, Liverpool, England. L3 3AF Abstract In this paper we introduce a new approach for dealing with variable bit rate (VBR) compressed video streams, such as the ones transmitted by Video-On- Demand servers. Bit rate bursts are exhibited along multiple time scales during transmission, and are not fully captured in the VBR flow specifications for current QoS networks such as the Tenet Real Time Protocol Suite [1] and ATM policing components [2]. These flow specifications are essential to simultaneously maximise network utilisation and minimise the probability of cell or packet loss that ends in QoS degradation. By balancing the early transmission of frames, via work-ahead smoothing, against the necessary buffer requirements and delay bounds, the optimal smoothing algorithm [3] stand as a theoretical technique for reducing bit rate variability. The scheme presented in this paper extends existing results in the area of smoothing and buffering techniques to incorporate network constraints. We consider how a network profile may be generated for a connection path, and how efficiently a smoothed video stream may be scheduled for reservation given this information. Our results will show how the network as a whole is able to support more connections at any one time, and strongly hint at the further reaching implications of the flow specification mapping techniques. 1. Introduction Distributed multimedia applications are going to play an important role in shaping the type of service provided by future networks. Commercial potential is enormous and already the race has begun, with cable and telecommunication companies in the lineup. One of the most challenging of these multimedia applications is VOD (Video-on- Demand). Customers are able to choose a video and receive it at the point of request with very delay. The client makes the request for a video to a video-server across an
2 intermediate distribution network. The video-server can then assess whether the system has sufficient resources to service the request for the duration of the connection. The assessment involves the video-server interacting with the distribution network for the determination of the best connection route from source to sink, as well as one that can be reliably reserved. During reservation, the key issue is the support for QoS by the underlying network sub-systems, allocating the least amount of resources as possible per connection without compromising connection QoS requirements. This is not a trivial problem: due to the high bandwidth associated with raw digitised videos, compressed techniques are used that introduce variability to the bit rate. The bandwidth is greatly reduced after compression, by a order of magnitude of 50 or more for sustainable high-quality PAL video. The bit rate variance (burstiness) is born out of the compression technique needed to produce a constant perceivable level of quality in the video. Here the compression algorithm produces variability on multiple time-scales, from the individual frame sizes varying both periodically and in response to image content, to a larger time-scale where scene changes take place. During a scene changes less compression is possible, since there is less correspondence between a frame and the ones before it. Scene changes may occur infrequently and then later in the video, a group clustered together, attributing to another layer in the multiple time-scale model. These are all important issues when considering how QoS is to be efficiently and effectively provided for VBR, and in particular the idea of multiple time-scale layering of multimedia streams. 2. QoS issues arising from VBR For provisions of QoS guarantees the networks needs to know the characteristics of the traffic for new connections. This information typically comes in a number of parameters, such as peak and average cell rate amongst others. Traffic shaping mechanisms such as the leaky bucket, which is used in ATM networks, endeavour to force network users to comply with the traffic parameters agreed upon during connection establishment. The sender is responsible for describing the characteristics accurately, and the network agrees to provide QoS as long as the traffic follows the specification. In cases where the live connection breaks the agreement, the leaky bucket mechanism discards cells on a per-stream basis, degrading the QoS until the stream becomes compliant again. This scheme is biased toward the network provider, in that it is the misbehaving connection that is penalised in order to prevent other
3 streams from losing their QoS guarantees as a result of cell loss or delay. The problem lies in the fact that, with compressed video, the network users are not fully aware of the best way to describe the traffic characteristics to the network. A result of this is that either the network is under-utilised, with eventual higher costs per connection, or packets are dropped, with degradation of QoS. We tackle this problem by developing a mapping scheme that allows new connections traffic characteristics to be specified on a per interval basis, such that in each interval the stream bit-rate is constant. 3. Related work VOD architecture can be divided into the following subsystems: The Video Server The Distribution Network The User Equipment The strict QoS and high throughput required by real time multimedia connections impact heavily on the design complexity of VOD systems. One relevant issue is the effect that the design of each subsystem has on others. One example is how the video server method of per-stream buffer usage influences the bit-rate at a given time, and so affects the optimal bandwidth reservation scheme for the network. This is intended to allow client and server to better cope with data transfer variability and to remove delay jitter [4]. The buffer is put to use by applying smoothing algorithms to the untouched bit-rate trace of a compressed video stream. The simplest smoothing technique is temporal buffering where the result is the peaks and troughs are flattened but a delay is introduced to the connection. The delay is because of the way that the buffer operates, always making sure that it is displaying video frames slightly behind when they are actually received. There are two more basic smoothing techniques, and another of them is smoothing by aggregation (or statistical multiplexing). This is achieved when a large number of independent streams share a given network bandwidth, and as the number of streams becomes large, the aggregate bandwidth requirement tends to a Normal distribution. This does not introduce any kind of delay, but alone can only provide statistical QoS guarantees to each connection. The number of simultaneous streams would need to be extremely large (i.e. tending to infinity) before the aggregate bandwidth becomes predictable, as it complies with the Normal Distribution. This paper deals with the final basic smoothing technique, smoothing by workahead. The method is the most active from the point of view of the processing
4 needed for calculation and the effect on traffic shape. It works by transmitting traffic peaks in advance of when the video information is due to be displayed, constrained by the size of the buffer and whether the data is available to be sent [5]. The networking benefits come from the bandwidth reserved may be relieved during certain periods of the connection duration and exploit the low load level of other periods [6]. An optimal smoothing algorithm, from the point of view of a single stream, has been reported in [3]. Smoothing of this type, without considering the loading on the distribution network is unlikely to optimise the network and, as a result, the whole system. Our method extends the optimal smoothing groundwork to take into account the network loading and consequently other streams multiplexed across the network. 4. Network Constrained Smoothing scheme In the scheme we present here, compressed video streams are smoothed in order to present per interval CBR characteristics. Without any workahead smoothing, CBR segments would mean that the perceivable end quality of the video would fluctuate with the complexity and movement of the video content [7]. In this case, workahead smoothing is applied to calculate CBR segments for transmission of VBR encoded video. The end result being a list of CBR segments, each with its own bandwidth requirement, and is called the transmission schedule. Although the variable nature of the stream has not been eradicated, the segmentation has accurately dissected the traffic shape into a set of parameters. The original unsmoothed trace is far too complex to be described by its shape, and typically is simply parameterised into overall average and peak bit-rates. The workahead smoothing generates a set of easily manageable measurement units about the video stream, and in particular they can be policed with ease under QoS such as ATM that provide support for leaky bucket constraints. The number of segments generated is minimised to akin the original VBR traffic to CBR as much as possible, reaping the inherent benefits of CBR from a QoS point of view. It is relatively simple to accurately and efficiently reserve network resources for CBR, an aspect so strong that there are even papers arguing the need for VBR and investigating video quality parameters for encoding. [8]. Here we consider how the segments are actually selected and under what criteria. The choice of CBR segment length and bit-rate are constrained by a number of factors: the content of the video stream, the available buffer space, the network
5 loading and consequently the network path. This paper focuses on using information about network loading to improve overall network efficiency, and points the way to incorporating routing algorithms. Routing would be performed by choosing the best route that can support the transmission schedule made up of the CBR intervals. Each router, therefore, will have a complete bit-rate reservation map of all the connections it is supporting [9]. The information is fed back to servers attempting new connections so that they can adapt to network loading by smoothing video streams in order to relieve the bit-rate in intervals of high network loading. In this paper, a two level smoothing is proposed: Firstly to find the best route capable of supporting an optimally smoothed traffic map. Secondly, the information about loading along the route is used to exploit less loaded intervals and reduce the loading at higher loaded times. The techniques used to determine the less loaded time intervals are modular and plug-in by nature to our overall scheme. The degree of freedom for changing the transmission schedule is determined by the size of the buffer and the time when video data is available for transmission (e.g. availability assumed to be immediate for pre-compressed video). Maximum cumulative data receivable without buffer overflow Cumulative data consumed by client time 5. Network resource allocation In this section we consider a suitable QoS model for making use of the video transmission schedules. The model is based on the Renegotiated CBR (RCBR) service [10], where the only performance gains are achieved strictly through statistical multiplexing. This is not the ideal situation for clients and VOD operators alike since the streams may often suffer frame loss and degraded QoS at periods of peak loading.
6 Since the smoothing of each stream under the scheme herein improves the balance of workload between network nodes, it follows that a higher level of multiplexing can be attained before any renegotiations are needed. This is by the fact that the overall network traffic is more evenly spread, the bursts of one stream more likely to coincide with the troughs of another stream. During periods when many connections are being reserved or have been reserved, the connection admission control permits a greater number of deterministic connections to be served simultaneously, and consequently an improved level of multiplexing. Network performance benefits are reaped from the fact that network bandwidth is intelligently allocated, and so the maximum possible number of connections across the network as a whole is increased. 6. Theoretical case study This section compares the optimal smoothing to a network constrained smoothing for a traffic level that is close to saturating a switch along the connection path. This case study shows a case where the new scheme has an immediate effect on the network performance. Video Server ATM switch Client Client The dotted line in the diagram represents a connection path that the video server is seeking to reserve. The switch in the centre is in a highly loaded state, and is supporting a number of connections. The following graph shows the aggregate of all the connections being supported at the switch, and a map of the new optimally
7 smoothed connection is overlaid on top. The straight dotted line represents the maximum throughput that the switch can cope with. Aggregate after new connection Aggregate before new connection New connection time Note that the y-axis represents the bit-rate and does not start from zero for the two aggregates, illustrating fluctuation of throughput at the switch. The new connection is drawn at the same unit scale, but starts from zero on the y-axis. In this first graph the new connection was smoothed using optimal smoothing, and it breaks the limit of the switch by its shape. The following graph shows how the network constrained smoothing of the new connection can better fit the aggregate traffic in such a way that it does not break the throughput limit. The total video data to be transmitted is exactly the same in both smoothed connections (i.e. the area under the graph), the only difference is the smoothing technique. Aggregate after new connection Aggregate before new connection New connection time
8 The constraint for how much we are allowed to re-smooth is the buffer size, and in this case it allows the new smoothing to avoid breaking the switch limit on throughput. Note that in this example, the switch that was under considereation had the highest loading for the entire connection duration compared to the other switches in the connection route. The method of measuring the network profile along the route is important to how the connection is re-smoothed, and smoothing for the highest loaded switch is likely not an optimal solution. 7. Evaluation The case study examines how network constrained smoothing can be employed to avoid congestion at the most highly loaded switch along a connection path. The optimal smoothing produces smoothed streams with minimised rate variability, but this still generates congestion when a number of streams are multiplexed through a network switch. A connection s QoS guarantees may be under threat when too many high rate segments from one stream to the next coincide. The case involves precisely this, and then goes on to show how by, taking advantage of buffer freedoms, the congestion may be avoided. Our step-by-step algorithm for numerically calculating the network constrained smoothing is currently in the stages of development, but the results back up the formulation. Indeed there is more than one way to perform the smoothing, balancing priorities such as minimising the number of CBR segments and incorporating network link speed limitations. Further experimentation is needed to explore the effects of network constrained smoothing on a larger scale. The results highlight how the scheme smoothes the video streams as well as the network profile. The effect is to smooth overall network loading as connections are added, each new stream smoothed accordingly. 8. Conclusion In this paper we have demonstrated a new scheme for transmitting pre-compressed VBR video streams under network constrained smoothing. The ideas embodied draw from QoS flow specification, smoothing and network profiling. Within a framework of support for VOD, the new smoothing technique enables the network operator to provide a bigger and more reliable service through increased multiplexing and better
9 distribution of network loading. The resource savings can be passed on the video server operator by way of cheaper charges and better service at peak times. The results presented in this paper show how, by taking advantage of the workahead smoothing and the buffering allowances, the shape of the traffic may be manipulated to better suit the expected network loading. This is important in terms of the forthcoming QoS networks that are able to cope with a more complex flow specification other than simply peak and average rates. The relatively poor performance of other optimal smoothing techniques show how the smoothing technique and network load profile can not be considered mutually exclusive. Our evaluation explains this, and goes further to suggest directions for further work investigating the relationship between the network profile and flow specification. We have shown that our scheme allows routers to support more connections than was possible with previous smoothing schemes. This leads to more efficient use of QoS networks, thus promoting the development of distributed multimedia services. References [1] Ferrari, D. (1998). The Tenet experience and the design of protocols for integrated-services internetworks. Multimedia systems 6(3): [2] Campbell, A., G. Coulson, et al. (1994 April). A Quality of Service Architecture. ACM SIGCOMM Computer Communication Review 24(2): [3] Salehi, J., Z.-L. Zhang, et al. (1998). Supporting Stored Video: Reducing Rate Variability and End-to-End Resource Requirements Through Optimal Smoothing. IEEE/ACM Trans. Networking 6(4). [4] Wrege, D. E., E. Knightly, et al. (1996). Deterministic Delay Bounds for VBR Video in Packet-Switching Networks: Fundamental Limits and Practical Tradeoffs. EEE/ACM Transactions on Networking 4(3): [5] Wu, T. and E. Knightly (1999). Buffering vs. Smoothing for End-to-End QoS: Fundamental Issues and Comparison. Proceedings of Performance '99, Istanbul, Turkey.
10 [6] Knightly, E. and P. Rossaro (1997). On the Effects of Smoothing for Deterministic QoS. Distributed Systems Engineering Journal: Special Issue on Quality of Service 4(1): [7] Krunz, M. and S. K. Tripathi (1997). Exploiting the Temporal Structure of MPEG Video for the Reduction of Bandwidth Requirements. IEEE INFOCOM'97, Japan. [8] Grossglauser, M., S. Keshav, et al. (1995). The Case Against VBR. Proc. 5th Intl. Workshop on Network and Operating System Support (NOSSDAV '95), Durham, New Hampshire. [9] Knightly, E. and J. Qiu (1998). Measurement-Based Admission Control with Aggregate Traffic Envelopes. IEEE ITWDC '98, Ischia, Italy. [10] Grossglauser, M., S. Keshav and D. N. C. Tse (1997). RCBR: A simple and efficient service for multiple time-scale traffic. IEEE/ACM Trans.Networkings, 5(6):
Comparison of Shaping and Buffering for Video Transmission
Comparison of Shaping and Buffering for Video Transmission György Dán and Viktória Fodor Royal Institute of Technology, Department of Microelectronics and Information Technology P.O.Box Electrum 229, SE-16440
More informationNetwork Model for Delay-Sensitive Traffic
Traffic Scheduling Network Model for Delay-Sensitive Traffic Source Switch Switch Destination Flow Shaper Policer (optional) Scheduler + optional shaper Policer (optional) Scheduler + optional shaper cfla.
More informationdifferent problems from other networks ITU-T specified restricted initial set Limited number of overhead bits ATM forum Traffic Management
Traffic and Congestion Management in ATM 3BA33 David Lewis 3BA33 D.Lewis 2007 1 Traffic Control Objectives Optimise usage of network resources Network is a shared resource Over-utilisation -> congestion
More informationLecture 17 Multimedia Transport Subsystem (Part 3)
CS 414 Multimedia Systems Design Lecture 17 Multimedia Transport Subsystem (Part 3) Klara Nahrstedt Spring 2010 Administrative MP2: deadline Monday, March 1, demos 5-7pm (sign up in class on Monday) HW1:
More informationRate Control of Real-time MPEG-2 over ATM DBR Service with Bandwidth Re-negotiation
Rate Control of Real-time MPEG- over ATM DBR Service with Bandwidth Re-negotiation Kentarou Fukuda Naoki Wakamiya Masayuki Murata Hideo Miyahara Department of Informatics and Mathematical Science Graduate
More informationQuality Differentiation with Source Shaping and Forward Error Correction
Quality Differentiation with Source Shaping and Forward Error Correction György Dán and Viktória Fodor KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology, {gyuri,viktoria}@imit.kth.se
More information9. D. Tse, R. Gallager, and J. Tsitsiklis. Statistical multiplexing of multiple timescale
9. D. Tse, R. Gallager, and J. Tsitsiklis. Statistical multiplexing of multiple timescale markov streams. Preprint. 10. J.S. Turner. Managing Bandwidth in ATM Networks with Bursty Trac. IEEE Network Magazine,
More informationLecture 17: Distributed Multimedia
06-06798 Distributed Systems Lecture 17: Distributed Multimedia Distributed Systems 1 Overview Characteristics of multimedia systems audio, video, etc delivery in real time, on time Quality of service
More informationLecture Outline. Bag of Tricks
Lecture Outline TELE302 Network Design Lecture 3 - Quality of Service Design 1 Jeremiah Deng Information Science / Telecommunications Programme University of Otago July 15, 2013 2 Jeremiah Deng (Information
More informationAdvanced Computer Networks
Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr
More informationQUALITY of SERVICE. Introduction
QUALITY of SERVICE Introduction There are applications (and customers) that demand stronger performance guarantees from the network than the best that could be done under the circumstances. Multimedia
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationWhat Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control
Chapter 12 Congestion in Data Networks Effect of Congestion Control Ideal Performance Practical Performance Congestion Control Mechanisms Backpressure Choke Packet Implicit Congestion Signaling Explicit
More informationPriority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies
CSCD 433/533 Priority Traffic Advanced Networks Spring 2016 Lecture 21 Congestion Control and Queuing Strategies 1 Topics Congestion Control and Resource Allocation Flows Types of Mechanisms Evaluation
More informationRECOMMENDATION ITU-R BT.1720 *
Rec. ITU-R BT.1720 1 RECOMMENDATION ITU-R BT.1720 * Quality of service ranking and measurement methods for digital video broadcasting services delivered over broadband Internet protocol networks (Question
More informationV 1. volume. time. t 1
On-line Trac Contract Renegotiation for Aggregated Trac R. Andreassen and M. Stoer a a Telenor AS, P.O.Box 83, 2007 Kjeller, Norway. Email: fragnar.andreassen, mechthild.stoerg@fou.telenor.no Consider
More informationReal-Time Protocol (RTP)
Real-Time Protocol (RTP) Provides standard packet format for real-time application Typically runs over UDP Specifies header fields below Payload Type: 7 bits, providing 128 possible different types of
More informationLecture 4 Wide Area Networks - Congestion in Data Networks
DATA AND COMPUTER COMMUNICATIONS Lecture 4 Wide Area Networks - Congestion in Data Networks Mei Yang Based on Lecture slides by William Stallings 1 WHAT IS CONGESTION? congestion occurs when the number
More information5. Conclusion. 6. References
Delivery Techniques Developing hybrid bandwidth smoothing techniques that are aimed for both VCR interactivity as well as high-utilization of networ channels are required. This involves both the interaction
More informationQuality of Service (QoS)
Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive
More informationResource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
More informationBandwidth Estimation in Prerecorded VBR-Video Distribution Systems Exploiting Stream Correlation
Bandwidth Estimation in Prerecorded VBR-Video Distribution Systems Exploiting Stream Correlation G. Boggia, P. Camarda, and D. Striccoli Dipartimento di Elettrotecnica ed Elettronica Politecnico di Bari
More informationAn Effective and Efficient Traffic Smoothing Scheme for Delivery of Online VBR Media Streams
An Effective and Efficient Traffic Smoothing Scheme for Delivery of Online VBR Media Streams Ray-I Chang, Meng-Chang Chen, Jan-Ming Ho and Ming-Tat Ko Institute of Information Science Academia Sinica,
More informationQoS-Aware IPTV Routing Algorithms
QoS-Aware IPTV Routing Algorithms Patrick McDonagh, Philip Perry, Liam Murphy. School of Computer Science and Informatics, University College Dublin, Belfield, Dublin 4. {patrick.mcdonagh, philip.perry,
More informationQoS Guarantees. Motivation. . link-level level scheduling. Certain applications require minimum level of network performance: Ch 6 in Ross/Kurose
QoS Guarantees. introduction. call admission. traffic specification. link-level level scheduling. call setup protocol. reading: Tannenbaum,, 393-395, 395, 458-471 471 Ch 6 in Ross/Kurose Motivation Certain
More informationCongestion Control Open Loop
Congestion Control Open Loop Muhammad Jaseemuddin Dept. of Electrical & Computer Engineering Ryerson University Toronto, Canada References 1. A. Leon-Garcia and I. Widjaja, Communication Networks: Fundamental
More informationCHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS
28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the
More informationBROADBAND AND HIGH SPEED NETWORKS
BROADBAND AND HIGH SPEED NETWORKS ATM SERVICE CATEGORIES Service Categories : represent particular combinations of traffic parameters and QoS parameters. These parameters are determined by users for a
More informationNetwork Support for Multimedia
Network Support for Multimedia Daniel Zappala CS 460 Computer Networking Brigham Young University Network Support for Multimedia 2/33 make the best of best effort use application-level techniques use CDNs
More informationCongestion in Data Networks. Congestion in Data Networks
Congestion in Data Networks CS420/520 Axel Krings 1 Congestion in Data Networks What is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet
More informationScheduling. Scheduling algorithms. Scheduling. Output buffered architecture. QoS scheduling algorithms. QoS-capable router
Scheduling algorithms Scheduling Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Scheduling: choose a packet to transmit over a link among all
More informationWhat Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues
168 430 Computer Networks Chapter 13 Congestion in Data Networks What Is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet handling capacity
More informationTo address these challenges, extensive research has been conducted and have introduced six key areas of streaming video, namely: video compression,
Design of an Application Layer Congestion Control for Reducing network load and Receiver based Buffering Technique for packet synchronization in Video Streaming over the Internet Protocol Mushfeq-Us-Saleheen
More informationTraffic Access Control. Hamid R. Rabiee Mostafa Salehi, Fatemeh Dabiran, Hoda Ayatollahi Spring 2011
Traffic Access Control Hamid R. Rabiee Mostafa Salehi, Fatemeh Dabiran, Hoda Ayatollahi Spring 2011 Outlines Traffic Access Control Definition Traffic Shaping Traffic Policing The Leaky Bucket The Token
More informationActive Adaptation in QoS Architecture Model
Active Adaptation in QoS Architecture Model Drago agar and Snjeana Rimac -Drlje Faculty of Electrical Engineering University of Osijek Kneza Trpimira 2b, HR-31000 Osijek, CROATIA Abstract - A new complex
More informationFrom ATM to IP and back again: the label switched path to the converged Internet, or another blind alley?
Networking 2004 Athens 11 May 2004 From ATM to IP and back again: the label switched path to the converged Internet, or another blind alley? Jim Roberts France Telecom R&D The story of QoS: how to get
More informationPerformance Analysis of Cell Switching Management Scheme in Wireless Packet Communications
Performance Analysis of Cell Switching Management Scheme in Wireless Packet Communications Jongho Bang Sirin Tekinay Nirwan Ansari New Jersey Center for Wireless Telecommunications Department of Electrical
More informationChapter 24 Congestion Control and Quality of Service 24.1
Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control
More informationTraffic Management Tools for ATM Networks With Real-Time and Non-Real-Time Services
Traffic Management Tools for ATM Networks With Real-Time and Non-Real-Time Services Kalevi Kilkki Helsinki University of Technology e-mail: kalevi.kilkki@hut.fi Abstract This presentation considers some
More informationFrame Relay. Frame Relay: characteristics
Frame Relay Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Network management and QoS provisioning - 1 Frame Relay: characteristics Packet switching
More informationIMPLEMENTATION OF CONGESTION CONTROL MECHANISMS USING OPNET
Nazy Alborz IMPLEMENTATION OF CONGESTION CONTROL MECHANISMS USING OPNET TM Communication Networks Laboratory School of Engineering Science Simon Fraser University Road map Introduction to congestion control
More informationPerformance Consequences of Partial RED Deployment
Performance Consequences of Partial RED Deployment Brian Bowers and Nathan C. Burnett CS740 - Advanced Networks University of Wisconsin - Madison ABSTRACT The Internet is slowly adopting routers utilizing
More informationIEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 5, NO. 6, DECEMBER RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 5, NO. 6, DECEMBER 1997 741 RCBR: A Simple and Efficient Service for Multiple Time-Scale Traffic Matthias Grossglauser, Student Member, IEEE, Srinivasan Keshav,
More informationUBR Congestion controlled Video Transmission over ATM Eltayeb Omer Eltayeb, Saudi Telecom Company
UBR Congestion controlled Video Transmission over ATM Eltayeb Omer Eltayeb, Saudi Telecom Company ABSTRACT The ATM unspecified bit rate (UBR) class of service some times referred to as best effort service-
More informationA DiffServ IntServ Integrated QoS Provision Approach in BRAHMS Satellite System
A DiffServ IntServ Integrated QoS Provision Approach in BRAHMS Satellite System Guido Fraietta 1, Tiziano Inzerilli 2, Valerio Morsella 3, Dario Pompili 4 University of Rome La Sapienza, Dipartimento di
More information3. Quality of Service
3. Quality of Service Usage Applications Learning & Teaching Design User Interfaces Services Content Process ing Security... Documents Synchronization Group Communi cations Systems Databases Programming
More informationDesign of a Weighted Fair Queueing Cell Scheduler for ATM Networks
Design of a Weighted Fair Queueing Cell Scheduler for ATM Networks Yuhua Chen Jonathan S. Turner Department of Electrical Engineering Department of Computer Science Washington University Washington University
More informationCongestion Control in Communication Networks
Congestion Control in Communication Networks Introduction Congestion occurs when number of packets transmitted approaches network capacity Objective of congestion control: keep number of packets below
More informationPCRTT Enhancement for Off-Line Video Smoothing
Real-Time Imaging 7, 000 000 (2001) doi:10.1006/rtim.2001.0229, available online at http://www.idealibrary.com on PCRTT Enhancement for Off-Line Video Smoothing A n enhancement of the Piecewise Constant
More informationEpisode 5. Scheduling and Traffic Management
Episode 5. Scheduling and Traffic Management Part 3 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling
More informationDiffServ Architecture: Impact of scheduling on QoS
DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics
More informationDelivering ATM-based Video-on-Demand across Asymmetrical Digital Subscriber Lines
Delivering ATM-based Video-on-Demand across Asymmetrical Digital Subscriber Lines Emile Swanson Technology Integration, Telkom SA Ltd Private Bag X74, Pretoria, 0001 South Africa SwansEW1@telkom.co.za
More informationATM Quality of Service (QoS)
ATM Quality of Service (QoS) Traffic/Service Classes, Call Admission Control Usage Parameter Control, ABR Agenda Introduction Service Classes and Traffic Attributes Traffic Control Flow Control Special
More informationIntroduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15
Introduction to Real-Time Communications Real-Time and Embedded Systems (M) Lecture 15 Lecture Outline Modelling real-time communications Traffic and network models Properties of networks Throughput, delay
More informationThe Network Layer. Network Layer Design Objectives
1 next CITS3002 help3002 CITS3002 schedule The Network Layer The Data Link Layer had the responsibility of reliably transmitting frames across along a single wire (or wireless,...) link. The Network Layer's
More informationComputer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ
Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ 1 Lecture 5: Network Layer (cont ) Reference: Chapter 5 - Computer Networks, Andrew S. Tanenbaum, 4th Edition, Prentice Hall, 2003. 2
More informationA Measurement-Based CAC Strategy for ATM Networks
A Measurement-Based CAC Strategy for ATM Networks Kunyan Liu, David W. Petr, Cameron Braun*, Telecommunications & Information Sciences Laboratory Department of Electrical Engineering and Computer Science
More informationPERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK
I.J.E.M.S., VOL.2 (3) 211: 163-171 ISSN 2229-6X PERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION Jai Kumar and U.C. Jaiswal Department of Computer Science and Engineering, Madan
More informationFlow Control. Flow control problem. Other considerations. Where?
Flow control problem Flow Control An Engineering Approach to Computer Networking Consider file transfer Sender sends a stream of packets representing fragments of a file Sender should try to match rate
More informationTDDD82 Secure Mobile Systems Lecture 6: Quality of Service
TDDD82 Secure Mobile Systems Lecture 6: Quality of Service Mikael Asplund Real-time Systems Laboratory Department of Computer and Information Science Linköping University Based on slides by Simin Nadjm-Tehrani
More informationEffect of TCP and UDP Parameters on the quality of Video streaming delivery over The Internet
Effect of TCP and UDP Parameters on the quality of Video streaming delivery over The Internet MAZHAR B. TAYEL 1, ASHRAF A. TAHA 2 1 Electrical Engineering Department, Faculty of Engineering 1 Alexandria
More informationEnd-to-End Delay Analysis of Videoconferencing over Packet-Switched Networks
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 4, AUGUST 2000 479 End-to-End Delay Analysis of Videoconferencing over Packet-Switched Networks Mario Baldi, Member, IEEE, and Yoram Ofek, Member, IEEE
More informationScienceDirect. Configuration of Quality of Service Parameters in Communication Networks
Available online at www.sciencedirect.com ScienceDirect Procedia Engineering 69 ( 2014 ) 655 664 24th DAAAM International Symposium on Intelligent Manufacturing and Automation, 2013 Configuration of Quality
More informationATM Hierarchical Shaping ATM VC into VP Shaping, page 1
ATM Hierarchical Shaping ATM VC into VP Shaping, page 1 Traffic shaping is a quality of service (QoS) mechanism that is used to manage the network traffic by shaping the traffic to a specified rate. Traffic
More informationWeek 7: Traffic Models and QoS
Week 7: Traffic Models and QoS Acknowledgement: Some slides are adapted from Computer Networking: A Top Down Approach Featuring the Internet, 2 nd edition, J.F Kurose and K.W. Ross All Rights Reserved,
More informationQuality of Service (QoS)
Quality of Service (QoS) A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint form so you can add, modify, and delete
More informationQuality of Service II
Quality of Service II Patrick J. Stockreisser p.j.stockreisser@cs.cardiff.ac.uk Lecture Outline Common QoS Approaches Best Effort Integrated Services Differentiated Services Integrated Services Integrated
More informationA Two-Tiered On-Line Server-Side Bandwidth Reservation Framework for the Real-Time Delivery of Multiple Video Streams
A Two-Tiered On-Line Server-Side Bandwidth Reservation Framework for the Real-Time Delivery of Multiple Video Streams Jorge M. Londoño and Azer Bestavros Computer Science Department, Boston University,
More informationOverview. Lecture 22 Queue Management and Quality of Service (QoS) Queuing Disciplines. Typical Internet Queuing. FIFO + Drop tail Problems
Lecture 22 Queue Management and Quality of Service (QoS) Overview Queue management & RED Fair queuing Khaled Harras School of Computer Science niversity 15 441 Computer Networks Based on slides from previous
More informationPERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION WITH DROP-TAIL
I.J.E.M.S., VOL.2 (4) 2011: 221-228 ISSN 2229-600X PERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION WITH DROP-TAIL Jai Kumar, Jaiswal Umesh Chandra Department of Computer Science
More informationMaximizing the Number of Users in an Interactive Video-on-Demand System
IEEE TRANSACTIONS ON BROADCASTING, VOL. 48, NO. 4, DECEMBER 2002 281 Maximizing the Number of Users in an Interactive Video-on-Demand System Spiridon Bakiras, Member, IEEE and Victor O. K. Li, Fellow,
More informationProf. Dr. Abdulmotaleb El Saddik. site.uottawa.ca mcrlab.uottawa.ca. Quality of Media vs. Quality of Service
Multimedia Communications Multimedia Technologies & Applications Prof. Dr. Abdulmotaleb El Saddik Multimedia Communications Research Laboratory School of Information Technology and Engineering University
More informationQuality of Service (QoS) Computer network and QoS ATM. QoS parameters. QoS ATM QoS implementations Integrated Services Differentiated Services
1 Computer network and QoS QoS ATM QoS implementations Integrated Services Differentiated Services Quality of Service (QoS) The data transfer requirements are defined with different QoS parameters + e.g.,
More informationWorst-case Ethernet Network Latency for Shaped Sources
Worst-case Ethernet Network Latency for Shaped Sources Max Azarov, SMSC 7th October 2005 Contents For 802.3 ResE study group 1 Worst-case latency theorem 1 1.1 Assumptions.............................
More informationModelling a Video-on-Demand Service over an Interconnected LAN and ATM Networks
Modelling a Video-on-Demand Service over an Interconnected LAN and ATM Networks Kok Soon Thia and Chen Khong Tham Dept of Electrical Engineering National University of Singapore Tel: (65) 874-5095 Fax:
More informationInternet Services & Protocols. Quality of Service Architecture
Department of Computer Science Institute for System Architecture, Chair for Computer Networks Internet Services & Protocols Quality of Service Architecture Dr.-Ing. Stephan Groß Room: INF 3099 E-Mail:
More informationTrace Traffic Integration into Model-Driven Simulations
Trace Traffic Integration into Model-Driven Simulations Sponsor: Sprint Kert Mezger David W. Petr Technical Report TISL-10230-10 Telecommunications and Information Sciences Laboratory Department of Electrical
More informationof-service Support on the Internet
Quality-of of-service Support on the Internet Dept. of Computer Science, University of Rochester 2008-11-24 CSC 257/457 - Fall 2008 1 Quality of Service Support Some Internet applications (i.e. multimedia)
More informationQuality of Service in the Internet
Quality of Service in the Internet Problem today: IP is packet switched, therefore no guarantees on a transmission is given (throughput, transmission delay, ): the Internet transmits data Best Effort But:
More informationComparing the bandwidth and priority Commands of a QoS Service Policy
Comparing the and priority s of a QoS Service Policy Contents Introduction Prerequisites Requirements Components Used Conventions Summary of Differences Configuring the Configuring the priority Which Traffic
More informationChapter 6: Congestion Control and Resource Allocation
Chapter 6: Congestion Control and Resource Allocation CS/ECPE 5516: Comm. Network Prof. Abrams Spring 2000 1 Section 6.1: Resource Allocation Issues 2 How to prevent traffic jams Traffic lights on freeway
More informationCSCD 433/533 Advanced Networks Spring Lecture 22 Quality of Service
CSCD 433/533 Advanced Networks Spring 2016 Lecture 22 Quality of Service 1 Topics Quality of Service (QOS) Defined Properties Integrated Service Differentiated Service 2 Introduction Problem Overview Have
More informationFairness in bandwidth allocation for ABR congestion avoidance algorithms
Fairness in bandwidth allocation for ABR congestion avoidance algorithms Bradley Williams, Neco Ventura Dept of Electrical Engineering, University of Cape Town, Private Bag, Rondebosch, South Africa {bwillia,
More informationAdvanced Lab in Computer Communications Meeting 6 QoS. Instructor: Tom Mahler
Advanced Lab in Computer Communications Meeting 6 QoS Instructor: Tom Mahler Motivation Internet provides only single class of best-effort service. Some applications can be elastic. Tolerate delays and
More informationCSE398: Network Systems Design
CSE398: Network Systems Design Instructor: Dr. Liang Cheng Department of Computer Science and Engineering P.C. Rossin College of Engineering & Applied Science Lehigh University February 21, 2005 Outline
More informationSIMULATION OF PACKET DATA NETWORKS USING OPNET
SIMULATION OF PACKET DATA NETWORKS USING OPNET Nazy Alborz, Maryam Keyvani, Milan Nikolic, and Ljiljana Trajkovic * School of Engineering Science Simon Fraser University Vancouver, British Columbia, Canada
More informationQuality of Service Monitoring and Delivery Part 01. ICT Technical Update Module
Quality of Service Monitoring and Delivery Part 01 ICT Technical Update Module Presentation Outline Introduction to IP-QoS IntServ Architecture DiffServ Architecture Post Graduate Certificate in Professional
More informationSTATISTICAL PROPERTIES OF MPEG STREAMS AND ISSUES FOR TRAMSMISSION OF VIDEO INFORMATION IN HIGH SPEED NETWORKS
STATISTICAL PROPERTIES OF MPEG STREAMS AND ISSUES FOR TRAMSMISSION OF VIDEO INFORMATION IN HIGH SPEED NETWORKS Marek Natkaniec, Krzysztof Wajda {wajda,natkanie}@kt.agh.edu.pl. Telecommunications Department,
More informationEVALUATION OF THREE CAC METHODS: GAUSSIAN APPROXIMATION METHOD, METHOD OF EFFECTIVE BANDWIDTH AND DIFFUSION APPROXIMATION METHOD
Journal of ELECTRICAL ENGINEERING, VOL. 57, NO. 6, 2006, 360 364 EVALUATION OF THREE CAC METHODS: GAUSSIAN APPROXIMATION METHOD, METHOD OF EFFECTIVE BANDWIDTH AND DIFFUSION APPROXIMATION METHOD Peter Kvačkaj
More informationTELE Switching Systems and Architecture. Assignment Week 10 Lecture Summary - Traffic Management (including scheduling)
TELE9751 - Switching Systems and Architecture Assignment Week 10 Lecture Summary - Traffic Management (including scheduling) Student Name and zid: Akshada Umesh Lalaye - z5140576 Lecturer: Dr. Tim Moors
More informationVideo Streaming Over Multi-hop Wireless Networks
Video Streaming Over Multi-hop Wireless Networks Hao Wang Dept. of Computer Information System, Cameron University hwang@cameron.edu Andras Farago, Subbarayan Venkatesan Dept. of Computer Science, The
More informationPresentation Outline. Evolution of QoS Architectures. Quality of Service Monitoring and Delivery Part 01. ICT Technical Update Module
Quality of Service Monitoring and Delivery Part 01 ICT Technical Update Module Presentation Outline Introduction to IP-QoS IntServ Architecture DiffServ Architecture Post Graduate Certificate in Professional
More informationQoS for Real Time Applications over Next Generation Data Networks
QoS for Real Time Applications over Next Generation Data Networks Final Project Presentation December 8, 2000 http://www.engr.udayton.edu/faculty/matiquzz/pres/qos-final.pdf University of Dayton Mohammed
More informationA model of Fuzzy Control Backoff Schemes in Telecommunication Networks
A model of Fuzzy Control Backoff Schemes in Telecommunication Networks SOMCHAI LEKCHAROEN 1 AND CHANINTORN JITTAWIRIYANUKOON 2 1 Faculty of Information Technology, Rangsit University THAILAND 2 Faculty
More informationAsynchronous Transfer Mode (ATM) ATM concepts
Asynchronous Transfer Mode (ATM) Asynchronous Transfer Mode (ATM) is a switching technique for telecommunication networks. It uses asynchronous time-division multiplexing,[1][2] and it encodes data into
More informationAdmission Control Policies in Integrated Services Networks
Admission Control Policies in Integrated Services Networks Roberto Canonico, Simon Pietro Romano and Giorgio Ventre Dipartimento di Informatica e Sistemistica, Università di Napoli Federico II, Napoli,
More informationNetwork Control and Signalling
Network Control and Signalling 1. Introduction 2. Fundamentals and design principles 3. Network architecture and topology 4. Network control and signalling 5. Network components 5.1 links 5.2 switches
More informationADVANCED COMPUTER NETWORKS
ADVANCED COMPUTER NETWORKS Congestion Control and Avoidance 1 Lecture-6 Instructor : Mazhar Hussain CONGESTION CONTROL When one part of the subnet (e.g. one or more routers in an area) becomes overloaded,
More informationMultimedia Networking. Network Support for Multimedia Applications
Multimedia Networking Network Support for Multimedia Applications Protocols for Real Time Interactive Applications Differentiated Services (DiffServ) Per Connection Quality of Services Guarantees (IntServ)
More informationPrinciples. IP QoS DiffServ. Agenda. Principles. L74 - IP QoS Differentiated Services Model. L74 - IP QoS Differentiated Services Model
Principles IP QoS DiffServ Differentiated Services Architecture DSCP, CAR Integrated Services Model does not scale well flow based traffic overhead (RSVP messages) routers must maintain state information
More information