A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, Mathematical Programming, vol.92, issue.1, pp.1-36, 2002. ,
DOI : 10.1007/s101070100271
Space Decomposition Techniques for Fast Layer-4 Switching, 2000. ,
DOI : 10.1007/978-0-387-35580-1_4
URL : http://marcel.wanda.ch/Publications/buddhikot99space.pdf
On the effect of forwarding table size on SDN network utilization, IEEE INFOCOM 2014, IEEE Conference on Computer Communications, pp.1734-1742, 2014. ,
DOI : 10.1109/INFOCOM.2014.6848111
Internet packet filter management and rectangle geometry, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp.827-835, 2001. ,
Maximum-Minimum S??tze ??ber Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.4, issue.3-4, pp.395-434, 1958. ,
DOI : 10.2140/pjm.1957.7.1073
Compressing Two-dimensional Routing Tables with Order, 2014. ,
DOI : 10.1016/j.endm.2016.03.046
URL : https://hal.archives-ouvertes.fr/hal-01162724
Compressing Two-dimensional Routing Tables with Order, Electronic Notes in Discrete Mathematics, vol.52, 2015. ,
DOI : 10.1016/j.endm.2016.03.046
URL : https://hal.archives-ouvertes.fr/hal-01162724
Optimizing rule placement in software-defined networks for energy-aware routing, 2014 IEEE Global Communications Conference, 2014. ,
DOI : 10.1109/GLOCOM.2014.7037187
URL : https://hal.archives-ouvertes.fr/hal-00996780
Feedback arc set in bipartite tournaments is NP-complete, Information Processing Letters, vol.102, issue.2-3, pp.62-65, 2007. ,
DOI : 10.1016/j.ipl.2006.11.016
URL : http://www-fs.informatik.uni-tuebingen.de/~hueffner/feedback-set-tournaments-ipl06.pdf
Detecting and resolving packet filter conflicts, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), pp.1203-1212, 2000. ,
DOI : 10.1109/INFCOM.2000.832496
Integral boundary points of convex polyhedra In: 50 Years of Integer Programming, pp.49-76, 1958. ,
Optimizing the "one big switch" abstraction in software-defined networks, Proceedings of the ninth ACM conference on Emerging networking experiments and technologies, CoNEXT '13, pp.13-24, 2013. ,
DOI : 10.1145/2535372.2535373
Palette: Distributing tables in software-defined networks, 2013 Proceedings IEEE INFOCOM, pp.545-549, 2013. ,
DOI : 10.1109/INFCOM.2013.6566832
On the approximability of np-complete optimization problems, Royal Institute of Technology Stockholm, 1992. ,
Reducibility among combinatorial problems, 1972. ,
DOI : 10.1007/978-3-540-68279-0_8
Exploiting Order Independence for Scalable and Expressive Packet Classification, IEEE/ACM Transactions on Networking, vol.24, issue.2, pp.1251-1264, 2016. ,
DOI : 10.1109/TNET.2015.2407831
URL : http://webee.technion.ac.il/people/or/publications/ton_order_independence.pdf
High-speed policy-based packet forwarding using efficient multi-dimensional range matching, ACM SIGCOMM Computer Communication Review, vol.28, issue.4, pp.203-214, 1998. ,
DOI : 10.1145/285243.285283
URL : http://www.dmi.ens.fr/~mistral/paperlak6.ps
OpenFlow, ACM SIGCOMM Computer Communication Review, vol.38, issue.2, pp.69-74, 2008. ,
DOI : 10.1145/1355734.1355746
Macroflows and Microflows: Enabling Rapid Network Innovation through a Split SDN Data Plane, 2012 European Workshop on Software Defined Networking, pp.79-84, 2012. ,
DOI : 10.1109/EWSDN.2012.16
Too many sdn rules? compress them with minnie, IEEE Global Communications Conference (GLOBECOM), pp.2015-2016, 2015. ,
DOI : 10.1109/glocom.2015.7417661
URL : https://hal.archives-ouvertes.fr/hal-01203020
Optimal In/Out TCAM Encodings of Ranges, IEEE/ACM Transactions on Networking, vol.24, issue.1, pp.555-568, 2016. ,
DOI : 10.1109/TNET.2014.2382031
Lossy compression of packet classifiers, 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), pp.39-50, 2015. ,
DOI : 10.1109/ANCS.2015.7110119
PAST, Proceedings of the 8th international conference on Emerging networking experiments and technologies, CoNEXT '12, pp.49-60, 2012. ,
DOI : 10.1145/2413176.2413183
Compressing Two-Dimensional Routing Tables, Algorithmica, vol.35, issue.4, pp.287-300, 2003. ,
DOI : 10.1007/s00453-002-1000-7
URL : http://www-2.cs.cmu.edu/~sandholm/compressing.algorithmica.pdf
Survey and taxonomy of packet classification techniques, ACM Computing Surveys, vol.37, issue.3, pp.238-275, 2005. ,
DOI : 10.1145/1108956.1108958
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments, Theory and Applications of Models of Computation, pp.370-379, 2009. ,