• DocumentCode
    2262802
  • Title

    End-to-end verification of QoS policies

  • Author

    El-Atawy, Adel ; Samak, Taghrid

  • Author_Institution
    Google Inc., Mountain View, CA, USA
  • fYear
    2012
  • fDate
    16-20 April 2012
  • Firstpage
    426
  • Lastpage
    434
  • Abstract
    Configuring a large number of routers and network devices to achieve quality of service (QoS) goals is a challenging task. In a differentiated services (DiffServ) environment, traffic flows are assigned specific classes of service, and service level agreements (SLA) are enforced at routers within each domain. We present a model for QoS configurations that facilitates efficient property-based verification. Network configuration is given as a set of policies governing each device. The model efficiently checks the required properties against the current configuration using computation tree logic (CTL) model checking. By symbolically modeling possible decision paths for different flows from source to destination, properties can be checked at each hop, and assessments can be made on how closely configurations adhere to the specified agreement. The model also covers configuration debugging given a specific QoS violation. Efficiency and scalability of the model are analyzed for policy per-hop behavior (PHB) parameters over large network configurations.
  • Keywords
    DiffServ networks; formal verification; quality of service; trees (mathematics); CTL; Network configuration; QoS policies; SLA; computation tree logic model checking; differentiated services environment; end-to-end verification; policy per-hop behavior parameters; possible decision paths; property-based verification; service level agreements; traffic flows; Analytical models; Bandwidth; Computational modeling; Diffserv networks; Quality of service; Routing; Security;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Operations and Management Symposium (NOMS), 2012 IEEE
  • Conference_Location
    Maui, HI
  • ISSN
    1542-1201
  • Print_ISBN
    978-1-4673-0267-8
  • Electronic_ISBN
    1542-1201
  • Type

    conf

  • DOI
    10.1109/NOMS.2012.6211927
  • Filename
    6211927