Abstract
Our novel Call Admission Control (CAC) scheme [1], [2] determines the number of Expedited Forwarding (EF) (Premium) flows accepted, based on e2e available bandwidth measurement. However, it does not control the number of flows that could be accepted at a node or over a link along a selected routing path for an EF flow. Hence we complemented the functionality of CAC withoriginal traffic management algorithms [2], [3] to balance EF traffic along the selected routing path for new EF flows and consequently across Differentiated Services (DiffServ) network. The novelty of these algorithms emerges from the fact that they employ an optimization dimension of EF traffic, namely the partitioning of End-to-End (e2e) delay required for a new flow into per-link or per-DiffServ node along the selected routing path. Furthermore, some network resource policies are incorporated with these algorithms to apportion the e2e resource required for EF traffic flows intoper-DiffServ node requirement along the selected routing path. We demonstrate through analysis and simulation that our proposed optimal e2e delay budget management algorithms are superior to Equi-Partitioning (EP) algorithm for DiffServ in guaranteeing e2e delay bounds required forEF flows. Furthermore, highly loaded DiffServ nodes are assigned low delay budget and the opposite for low loaded DiffServ nodes, which result in increasing DiffServ network resource utilization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have