An analytical framework for SLA admission control in a DiffServ domain

We define an analytical approach and a methodology to determine the set of service level agreements (SLA) that can be effectively supported by a DiffServ IP network. We consider the assured forwarding (AF) per hop behavior (PHB), and, based on the SLA probabilistic description, we derive a worst-case mathematical formulation for the overbooking probability, i.e., the probability that the traffic crossing any link of a source-destination path exceeds the link capacity. We then compare analytical results with simulation of different traffic models.