Building a Controlled Delay Assured Forwarding Class in DiffServ Networks Parag Kulkarni Nazeeruddin Mohammad Sally McClean Gerard Parr Michaela Black Bryan Scotney School of Computing and Information Engineering Faculty of Engineering University of Ulster Coleraine, Northern Ireland [email protected]
15
Embed
Building a Controlled Delay Assured Forwarding Class in DiffServ Networks Parag Kulkarni Nazeeruddin Mohammad Sally McClean Gerard Parr Michaela Black.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Building a Controlled Delay Assured Forwarding Class in
DiffServ Networks
Parag KulkarniNazeeruddin Mohammad
Sally McCleanGerard Parr
Michaela BlackBryan Scotney
School of Computing and Information EngineeringFaculty of Engineering
• Quality of Service (QoS) within a typical router in the internet is quantified through several parameters– e.g. Delay, Delay Variation, Packet Loss
• Effective Queue Management helps to improve QoS
• Objective of this research – To design a “ProActive Queue Management”
strategy that provides quantitative controlled delay guarantees on a per hop basis across an end-to-end (e2e) path by regulating queue size around an operating point q0 (thereby regulating delay below the control target and minimizing delay variation).
Background
• Service differentiation essential to support SLAs– DiffServ is the way forward due to its simplicity and
scalability
• IETF has standardised PHBs but has not mandated particular mechanisms to realise them
• Focus of this work -> AF PHB– AF PHB has outlined 4 classes and 3 drop precedence levels
within each class– RFC 2957 has recommended AQM to realise the drop
precedence levels (to achieve differentiated dropping)– Transactional data applications (interactive) are an important
class of apps requiring low delay– Currently available solutions provide only throughput
guarantees– Support available only for qualitative differentiation of delay
and no quantitative guarantees are offered
Design Objectives
• The challenge is to build an AQM scheme that can – Prevent Global Synchronisation– Capture the dynamics of the underlying
system accurately in real time thereby bypassing the parameter tuning problem
– Avoid the conservative approach of mathematical modelling
– Achieve the performance objective (regulate the delay below the control target)
Extensions to the PAQMAN Algorithm
• Extended algorithm called PAQMAN-DS• Supports 3 drop precedences per
queue• Uses same queue threshold for all 3
precedences• Uses different packet drop probability
computation function for each precedence
• Employs coupled queue lengths
PAQMAN-DS Algorithm
• Input - average queue size observations for all three precedences over the past interval
• for every PI seconds {– Compute average queue size for each
precedence over the past interval– Predict average queue size for each precedence
over the next interval – Compute packet drop probability (PDP) for each