@inproceedings{aab7f62a87504ae48b16e223e0666d03,
title = "Efficient Service Chain Verification Using Sketches and Small Samples",
abstract = "A service function chain defines an ordered or partially ordered set of abstract service functions and ordering constraints that must be applied to packet flows as a result of classification. Service chain verification is an important logic, which should verify that each flow indeed traverses the intended set of services, and in the desired order. In this paper we address this service chain verification problem in a new way. The main idea is to convert each service chain verification instance to its 'equivalent set-expression cardinality equation,' and to use statistical algorithms to verify that each equation is satisfied.",
author = "Reuven Cohen and Liran Katzir and Aviv Yehezkel",
note = "Publisher Copyright: {\textcopyright} 2021 IEEE.; 2021 IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2021 ; Conference date: 09-11-2021 Through 11-11-2021",
year = "2021",
doi = "10.1109/NFV-SDN53031.2021.9665020",
language = "الإنجليزيّة",
series = "2021 IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2021 - Proceedings",
pages = "1--7",
editor = "Larry Horner and Kurt Tutschku and Molka Gharbaoui and {de la Oliva}, Antonio and Chiara Contoli and Helge Parzyjegla",
booktitle = "2021 IEEE Conference on Network Function Virtualization and Software Defined Networks, NFV-SDN 2021 - Proceedings",
}