-
1
-
-
84894681700
-
Network innovation using openflow: A survey
-
First
-
A. Lara, A. Kolasani, and B. Ramamurthy, "Network innovation using openflow: A survey," Communications Surveys Tutorials, IEEE, vol. 16, no. 1, pp. 493-512, First 2014.
-
(2014)
Communications Surveys Tutorials, IEEE
, vol.16
, Issue.1
, pp. 493-512
-
-
Lara, A.1
Kolasani, A.2
Ramamurthy, B.3
-
2
-
-
70349653267
-
Minimizing rulesets for tcam implementation
-
R. McGeer and P. Yalagandula, "Minimizing rulesets for tcam implementation," in INFOCOM 2009, IEEE, 2009, pp. 1314-1322.
-
(2009)
INFOCOM 2009, IEEE
, pp. 1314-1322
-
-
McGeer, R.1
Yalagandula, P.2
-
3
-
-
77951131004
-
Tcam razor: A systematic approach towards minimizing packet classifiers in tcams
-
Apr
-
A. X. Liu, C. R. Meiners, and E. Torng, "Tcam razor: A systematic approach towards minimizing packet classifiers in tcams," IEEE/ACM Trans. Netw., vol. 18, no. 2, pp. 490-500, Apr. 2010. [Online] Available: http://dx.doi.org/10.1109/TNET.2009.2030188
-
(2010)
IEEE/ACM Trans. Netw
, vol.18
, Issue.2
, pp. 490-500
-
-
Liu, A.X.1
Meiners, C.R.2
Torng, E.3
-
4
-
-
84859963086
-
Bit weaving: A non-prefix approach to compressing packet classifiers in tcams
-
Apr
-
C. R. Meiners, A. X. Liu, and E. Torng, "Bit weaving: A non-prefix approach to compressing packet classifiers in tcams," IEEE/ACM Trans. Netw., vol. 20, no. 2, pp. 488-500, Apr. 2012. [Online] Available: http://dx.doi.org/10.1109/TNET.2011.2165323
-
(2012)
IEEE/ACM Trans. Netw
, vol.20
, Issue.2
, pp. 488-500
-
-
Meiners, C.R.1
Liu, A.X.2
Torng, E.3
-
5
-
-
84893373329
-
-
Princeton University, Tech. Rep. TR-966-13, Oct
-
N. Katta, J. Rexford, and D. Walker, "Infinite cacheflow in software-defined networks," Princeton University, Tech. Rep. TR-966-13, Oct 2013. [Online] Available: http://www.cs.princeton.edu/research/techreps/TR-966-13
-
(2013)
Infinite Cacheflow in Software-defined Networks
-
-
Katta, N.1
Rexford, J.2
Walker, D.3
-
6
-
-
84883099537
-
Palette: Distributing tables in software-defined networks
-
Y. Kanizo, D. Hay, and I. Keslassy, "Palette: Distributing tables in software-defined networks," in INFOCOM, 2013 Proceedings IEEE, 2013, pp. 545-549.
-
(2013)
INFOCOM, 2013 Proceedings IEEE
, pp. 545-549
-
-
Kanizo, Y.1
Hay, D.2
Keslassy, I.3
-
7
-
-
84893398564
-
Optimizing the "one big switch" abstraction in software-defined networks
-
CoNEXT '13
-
N. Kang, Z. Liu, J. Rexford, and D. Walker, "Optimizing the "one big switch" abstraction in software-defined networks," in Proceedings of the 9th international conference on Emerging networking experiments and technologies, ser. CoNEXT '13, 2013. [Online] Available: http://www.cs.princeton.edu/ jrex/papers/rule-place13.pdf
-
(2013)
Proceedings of the 9th International Conference on Emerging Networking Experiments and Technologies, ser
-
-
Kang, N.1
Liu, Z.2
Rexford, J.3
Walker, D.4
-
8
-
-
0032673941
-
Constructing optimal ip routing tables
-
R. Draves, C. King, S. Venkatachary, and B. Zill, "Constructing optimal ip routing tables," in INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, vol. 1, 1999, pp. 88-97 vol.1.
-
(1999)
INFOCOM '99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
, vol.1
, pp. 88-97
-
-
Draves, R.1
King, C.2
Venkatachary, S.3
Zill, B.4
-
9
-
-
84889760968
-
Smalta: Practical and near-optimal fib aggregation
-
New York, NY, USA: ACM
-
Z. A. Uzmi, M. Nebel, A. Tariq, S. Jawad, R. Chen, A. Shaikh, J. Wang, and P. Francis, "Smalta: practical and near-optimal fib aggregation," in Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies, ser. CoNEXT '11. New York, NY, USA: ACM, 2011, pp. 29:1-29:12. [Online] Available: http://doi.acm.org/10.1145/2079296.2079325
-
(2011)
Proceedings of the Seventh COnference on Emerging Networking EXperiments and Technologies, Ser. CoNEXT '11
, pp. 291-2912
-
-
Uzmi, Z.A.1
Nebel, M.2
Tariq, A.3
Jawad, S.4
Chen, R.5
Shaikh, A.6
Wang, J.7
Francis, P.8
-
10
-
-
84883085700
-
Fifa: Fast incremental fib aggregation
-
Y. Liu, B. Zhang, and L. Wang, "Fifa: Fast incremental fib aggregation," in INFOCOM, 2013 Proceedings IEEE, 2013, pp. 1-9.
-
(2013)
INFOCOM, 2013 Proceedings IEEE
, pp. 1-9
-
-
Liu, Y.1
Zhang, B.2
Wang, L.3
-
11
-
-
84969211536
-
Compressing rectilinear pictures and minimizing access control lists
-
Philadelphia, PA, USA: Society for Industrial and Applied Mathematics
-
D. A. Applegate, G. Calinescu, D. S. Johnson, H. Karloff, K. Ligett, and J. Wang, "Compressing rectilinear pictures and minimizing access control lists," in Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, ser. SODA '07. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2007, pp. 1066-1075. [Online] Available: http://dl.acm.org/citation.cfm?id=1283383.1283498
-
(2007)
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Ser. SODA '07
, pp. 1066-1075
-
-
Applegate, D.A.1
Calinescu, G.2
Johnson, D.S.3
Karloff, H.4
Ligett, K.5
Wang, J.6
-
12
-
-
84866490861
-
Abstractions for network update
-
New York, NY, USA: ACM
-
M. Reitblatt, N. Foster, J. Rexford, C. Schlesinger, and D. Walker, "Abstractions for network update," in Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, ser. SIGCOMM '12. New York, NY, USA: ACM, 2012, pp. 323-334. Available: http://doi.acm.org/10.1145/2342356.2342427
-
(2012)
Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, Ser. SIGCOMM '12
, pp. 323-334
-
-
Reitblatt, M.1
Foster, N.2
Rexford, J.3
Schlesinger, C.4
Walker, D.5
-
13
-
-
68649129121
-
Openflow: Enabling innovation in campus networks
-
Mar
-
N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, "Openflow: enabling innovation in campus networks," SIGCOMM Comput. Commun. Rev., vol. 38, no. 2, pp. 69-74, Mar. 2008. [Online] Available: http://doi.acm.org/10.1145/1355734.1355746
-
(2008)
SIGCOMM Comput. Commun. Rev
, vol.38
, Issue.2
, pp. 69-74
-
-
McKeown, N.1
Anderson, T.2
Balakrishnan, H.3
Parulkar, G.4
Peterson, L.5
Rexford, J.6
Shenker, S.7
Turner, J.8
-
14
-
-
85076709056
-
Real time network policy checking using header space analysis
-
Berkeley, CA, USA: USENIX Association
-
P. Kazemian, M. Chang, H. Zeng, G. Varghese, N. McKeown, and S. Whyte, "Real time network policy checking using header space analysis," in Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation, ser. nsdi'13. Berkeley, CA, USA: USENIX Association, 2013, pp. 99-112. [Online] Available: http://dl.acm.org/citation.cfm?id=2482626.2482638
-
(2013)
Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation, Ser. Nsdi'13
, pp. 99-112
-
-
Kazemian, P.1
Chang, M.2
Zeng, H.3
Varghese, G.4
McKeown, N.5
Whyte, S.6
|