@inproceedings{10.1145/3185467.3185477,
author = {Chuprikov, Pavel and Kogan, Kirill and Nikolenko, Sergey},
title = {How to Implement Complex Policies on Existing Network Infrastructure},
year = {2018},
isbn = {9781450356640},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3185467.3185477},
doi = {10.1145/3185467.3185477},
abstract = {Transport networks satisfy requests to forward data in a given topology. At the level of a network element, forwarding decisions are defined by flows. To implement desired data properties during forwarding, a network operator imposes economic models by applying policies to flows, ideally without dealing with underlying resource constraints. Policy splitting over multiple network elements under resource constraints is a hard optimization problem [6, 7]. We discuss limitations of the proposed methods and existing Boolean minimization techniques. The major contribution of this work is an optimal solution with linear time complexity at the price of a single bit forwarded in every packet. The results are supported by a comprehensive evaluation study that compares previous and currently proposed methods.},
booktitle = {Proceedings of the Symposium on SDN Research},
articleno = {9},
numpages = {7},
keywords = {software-defined networking, network management},
location = {Los Angeles, CA, USA},
series = {SOSR '18}
}