S. Arora, A. Frieze, and H. Kaplan, 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

M. Milind, S. Buddhikot, M. Suri, and . Waldvogel, Space decomposition techniques for fast layer-4 switching, 2000.

R. Cohen, L. Lewin-eytan, J. Naor, and D. Raz, 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

D. Eppstein and S. Muthukrishnan, Internet packet filter management and rectangle geometry, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp.827-835, 2001.

T. Gallai, Maximum-Minimum S??tze ??ber Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.4, issue.3-4, pp.395-434, 1958.
DOI : 10.1007/BF02020271

F. Giroire, D. Mazauric, J. Moulierac, and B. Onfroy, Minimizing Routing Energy Consumption: From Theoretical to Practical Results, 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing, pp.252-259, 2010.
DOI : 10.1109/GreenCom-CPSCom.2010.147
URL : https://hal.archives-ouvertes.fr/hal-00531468

F. Giroire, J. Moulierac, and T. Phan, 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-01070576

F. Giroire, J. Moulierac, F. Truong-khoa-phan, and . Roudaut, Minimization of network power consumption with redundancy elimination, NETWORKING 2012, pp.247-258, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00721855

A. Hari, S. Suri, and G. Parulkar, 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

J. Alan, . Hoffman, B. Joseph, and . Kruskal, Integral boundary points of convex polyhedra, 50 Years of Integer Programming, pp.49-76, 1958.

N. Kang, Z. Liu, J. Rexford, and D. Walker, 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

Y. Kanizo, D. Hay, and I. Keslassy, Palette: Distributing tables in software-defined networks, 2013 Proceedings IEEE INFOCOM, pp.545-549, 2013.
DOI : 10.1109/INFCOM.2013.6566832

T. Lakshman and D. Stiliadis, 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

N. Mckeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson et al., OpenFlow, ACM SIGCOMM Computer Communication Review, vol.38, issue.2, pp.69-74, 2008.
DOI : 10.1145/1355734.1355746

R. Narayanan, S. Kotha, G. Lin, A. Khan, S. Rizvi et al., 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

B. Stephens, A. Cox, W. Felter, C. Dixon, and J. Carter, PAST, Proceedings of the 8th international conference on Emerging networking experiments and technologies, CoNEXT '12, pp.49-60
DOI : 10.1145/2413176.2413183

S. Suri, T. Sandholm, and P. Warkhede, Compressing Two-Dimensional Routing Tables, Algorithmica, vol.35, issue.4, pp.287-300, 2003.
DOI : 10.1007/s00453-002-1000-7
URL : http://cial.csie.ncku.edu.tw/st2008/pdf/Compressing Two-Dimensional Routing Tables.pdf