H. Adiseshu, S. Suri, and G. M. Parulkar, Detecting and resolving packet filter conflicts, Proceedings IEEE INFOCOM 2000, The Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp.1203-1212, 2000.

O. Mark-de-berg, M. Cheong, M. Van-kreveld, and . Overmars, Computational Geometry: Algorithms and Applications, 2008.

A. Borodin, R. Ostrovsky, and Y. Rabani, Lower bounds for high dimensional nearest neighbor search and related problems, Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp.312-321, 1999.

P. Bosshart, G. Gibb, H. Kim, G. Varghese, N. Mckeown et al., Forwarding metamorphosis: Fast programmable match-action processing in hardware for SDN, Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, SIGCOMM '13, pp.99-110, 2013.

M. Boutier and J. Chroboczek, Source-specific routing, IFIP Networking, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00947234

T. M. Chan, Klee's measure problem made easy, 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp.410-419, 2013.

M. Charikar, P. Indyk, and R. Panigrahy, New algorithms for subset query, partial match, orthogonal range searching, and related problems, Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, vol.2380, pp.451-462, 2002.

H. Edelsbrunner and H. A. Maurer, On the intersection of orthogonal objects, Information Processing Letters, vol.13, issue.4, pp.177-181, 1981.

D. Eppstein and S. Muthukrishnan, Internet packet filter management and rectangle geometry, Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, pp.827-835, 2001.

A. Feldmann and S. Muthukrishnan, Reaching the Promised Land of Communications, Proceedings IEEE INFOCOM 2000, The Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp.1193-1202, 2000.

P. Gupta and N. Mckeown, Algorithms for packet classification. IEEE Network: The Magazine of Global Internetworking, vol.15, pp.24-32, 2001.

J. Naga-praveen-katta, D. Rexford, and . Walker, Incremental consistent updates, Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN '13, pp.49-54, 2013.

P. Kazemian, M. Chang, H. Zeng, G. Varghese, N. Mckeown et al., Real Time Network Policy Checking using Header Space Analysis, NSDI, 2013.

P. Kazemian, G. Varghese, and N. Mckeown, Header space analysis: Static checking for networks, 2011.

P. Kazemian, G. Varghese, and N. Mckeown, Header space analysis: Static checking for networks, Presented as part of the 9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12), pp.113-126, 2012.

K. Peyman, HSA/NetPlumber source code repository

A. Khurshid, X. Zou, W. Zhou, M. Caesar, and P. Godfrey, VeriFlow : Verifying Network-Wide Invariants in Real Time, NSDI, 2013.

V. Kotronis, X. Dimitropoulos, and B. Ager, Outsourcing the routing control logic: Better internet routing based on SDN principles, Proceedings of the 11th ACM Workshop on Hot Topics in Networks, HotNets-XI, pp.55-60, 2012.

H. Mai, A. Khurshid, . P-brighten, S. Godfrey, and . King, Debugging the Data Plane with Anteater, SIGCOMM, 2011.

A. Mary and Y. Strozecki, Efficient enumeration of solutions produced by closure operations, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, vol.47, pp.1-52, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01388505

C. Monsanto, J. Reich, N. Foster, J. Rexford, and D. Walker, Composing software-defined networks, Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation, nsdi'13, pp.1-14, 2013.

M. Patrascu, Unifying the landscape of cell-probe lower bounds, SIAM J. Comput, vol.40, issue.3, pp.827-847, 2011.

P. Pere?íni, M. Kuzniar, N. Vasi´cvasi´c, M. Canini, D. Kostic et al., CPP: Consistent Packet Processing for Openflow, Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN '13, pp.97-102, 2013.

R. L. Rivest, Partial-match retrieval algorithms, SIAM J. Comput, vol.5, issue.1, pp.19-50, 1976.

, Route Views Project. BGP traces

M. Varvello, R. Laufer, F. Zhang, and T. V. Lakshman, Multi-layer packet classification with graphics processing units, CoNEXT, 2014.

H. Zeng, S. Zhang, F. Ye, V. Jeyakumar, M. Ju et al., USENIX Association. the smallest collection of combinations of R that contains R ? {H} and that is weakly complete, Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation, NSDI'14, pp.87-99, 2014.