1. Quality of Service Requirements
Techniques for Achieving Good Quality of Service
Integrated Services

2. How stringent the quality-of-service requirements are.
5-30
How stringent the quality-of-service requirements are.
A stream of packets from a source to a destination is called a flow
The need of each flow can be characterized by four primary parameters: reliability, delay, jitter, and bandwidth

3. Techniques for Achieving Good QoS
No single technique provides efficient, dependable QoS in an optimum way. Practical solutions often combining multiple techniques.
Overprovisioning: is the solution to provide so much router capacity, buffer space and bandwidth that the packets just fly through easily. Drawback: expensive. Example: telephone system.
Buffering: Flows can be buffered on the receiving side before being delivered.
Traffic Shaping
The leaky Bucket Algorithm
The token Bucket Algorithm
Resource Reservation
Admission Control
Proportional Routing &Packet Scheduling

4. Smoothing the output stream by buffering packets.

5. Traffic Shaping
Not like last technique that the source outputs the packets with an uniform spacing between them, the packets may be emitted irregularly.
Traffic shaping is about regulating the average rate of data transmission. It smoothes out the traffic on the server side, rather than on the client side.
Working principle: When a connection is set up, the user and subnet agree on a certain traffic pattern (shape) for that circuit ( this is called service level agreement). The source packets can therefore be delivered in a timely fashion if the sender send packets according to the agreed-on contract.
Application: Useful for real-time data such as audio and video connection.

6. The Leaky Bucket Algorithm
A leaky bucket with water. (b) a leaky bucket with packets.
Leaky bucket algorithm is nothing other than a single-server queuing system with constant service time. It turns an uneven flow of packets from the user processes inside the host into an even flow of packets onto the network.
For fixed size packets, the algorithm above works well. For variable-sized packets, it is often better to allow a fixed number of bytes per tick.

7. The Leaky Bucket Algorithm
(a) Input to a leaky bucket. (b) Output from a leaky bucket. Output from a token bucket with capacities of (c) 250 KB, (d) 500 KB, (e) 750 KB, (f) Output from a 500KB token bucket feeding a 10-MB/sec leaky bucket.

8. The Token Bucket Algorithm
Differences between Leaky bucket and Token Bucket algorithms:
The leaky does not allow idle hosts to save up permission to send large bursts later. The token does allow saving, up to the maximum size of the bucket, n.
Token throws away tokens when the bucket fills up but never discards packets. Leaky discards packets when the bucket fills up.
5-34
(a) Before (b) After.

9. Token Bucket Algorithm: Calculating the length of the maximum rate burst.
Burst length S second.
Token bucket capacity C bytes
The token arrival rate p bytes/sec
The maximum output rate M bytes/sec
C+pS=MS
S=C/(M-p)
Example: C=250KB, M=25MB/sec, p=2MB/sec. In this case S=11msec.

10. Resource Reservation
Three different kinds of resources can potentially be reserved:
Bandwidth
Buffer Space. For a good quality of service, some buffers can be reserved for a specific flow so that flow does not have to compete for buffers with other flows.
CPU cycles.

11. An example of flow specification (RFCs 2210 &2211).
Admission Control
5-34
An example of flow specification (RFCs 2210 &2211).
Router need to know the flow specification to decide whether or not admit the flow.
Steps to create flow specification:
Sender specify the flow parameters it would like to use
Each router examines it and modifies the parameters as need be.
When it gets to the other end, the parameters can be established

12. RSVP-The ReSerVation Protocol
This protocol is used for making the reservations; other protocols are used for sending the data.
It allows multiple senders to transmit to multiple groups of receivers, permits individual receivers to switch channels freely, and optimizes bandwidth use while at the same time 3liminating congestion.
It uses multicast routing using spanning trees. To send to a group, a sender puts the group’s address in its packets.
The difference from normal multicasting is a little extra information that is multicast to the group periodically to tell the routers along the tree to maintain certain data structures in their memories.

13. RSVP-The ReSerVation Protocol
Any receiver in a group can send a reservation message up the tree to the sender using the reverse path forwarding algorithm
At each hop, the router notes the reservation and reserves the necessary bandwidth. If insufficient bandwidth is available, it reports back failure.
Bandwidth can be reserved all the way form the sender to the receiver making the reservation request along the spanning tree.
A network
The multicast spanning tree for host 1
The multicast spanning tree for host 2.

14. RSVP-The ReSerVation Protocol (2)
(a) Host 3 requests a channel to host 1. (b) Host 3 then requests a second channel, to host 2. (c) Host 5 requests a channel to host 1.