- Packet Processing: The idea was to compressing the routing tables without sacrificing the look up and update performance. We have measured the entropy of the IP routing tables as well. The topic covers some combinatorial and stochastic techniques.
ACM Sigcomm [1], IEEE ICNP [2], IEEE/ACM ToN [3], ACM HotNets [4, 5].
- Survivable Optical Network Design: The problem is related to ultra fast failure localization in optical networks based on a compressed sensing idea. Our theoretical findings are on combinatorial group testing in graphs. Besides, deal with network coding in backbone networks.
IEEE/ACM ToN [6, 7, 8, 9], IEEE/OSA Journal of Lightwave Technology [10], IEEE Infocom [11, 12, 13, 14], IEEE ISIT [15]
- Internet Routing, Reliability and Scalability: Our focus is on network design for IP Fast Reroute. The topic is on graph theory and trees. Besides, we deal with future internet architectures designed for multicast addressing, and with the compressibility of routing policies other than the traditional shortest paths.
IEEE/ACM ToN [16, 17], IEEE Infocom [18, 19]
- Data Centers and Prototyping with OpenFlow: We also have competence in data centers, software defined networking (SDN) and network function virtualization (NFV). We presented a Mininet based SDN testbed which can accommodate Click VNFs and combine them into service chains, an SDN testbed for large-scale MPTCP mesurements in PlanetLab, and an implementation of greedy routing, bloom filter forwarding and network coding in OpenFlow 1.0.
IEEE Infocom [20], ACM SIGCOMM Demo [21, 22, 23]
References
[1] ![[pdf]](http://lendulet.tmit.bme.hu/lendulet_website/wp-content/plugins/papercite/img/pdf.png)
G. Rétvári, J. Tapolcai, A. Kőrösi, A. Majdán, and Z. Heszberger, “Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond,” in ACM SIGCOMM, 2013.
[Bibtex]
G. Rétvári, J. Tapolcai, A. Kőrösi, A. Majdán, and Z. Heszberger, “Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond,” in ACM SIGCOMM, 2013. [Bibtex]
@INPROCEEDINGS{retvari2013sigcomm,
author = {G. R\'etv\'ari and J. Tapolcai and A. K\H{o}r\"osi and A. Majd\'an and Z. Heszberger},
title = {Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond},
booktitle = {ACM SIGCOMM},
year = {2013},
keywords = {IP Fib Compression and top},
url = {http://arxiv.org/abs/1402.1194}
}[2] A. Kőrösi, J. Tapolcai, B. Mihálka, G. Mészáros, and G. Rétvári, “Compressing IP Forwarding Tables: Realizing Information-theoretical Space Bounds and Fast Lookups Simultaneously,” in Proc. IEEE ICNP, 2014.
[Bibtex]
A. Kőrösi, J. Tapolcai, B. Mihálka, G. Mészáros, and G. Rétvári, “Compressing IP Forwarding Tables: Realizing Information-theoretical Space Bounds and Fast Lookups Simultaneously,” in Proc. IEEE ICNP, 2014. [Bibtex]
@INPROCEEDINGS{korosi2014icnp,
author = {A. K\H{o}r\"osi and J. Tapolcai and Bence Mih\'alka and G\'abor M\'esz\'aros and G. R\'etv\'ari},
title = {Compressing IP Forwarding Tables: Realizing Information-theoretical
Space Bounds and Fast Lookups Simultaneously},
booktitle = {Proc. IEEE ICNP},
year = {2014},
keywords = {IP Fib Compression and top}
}[3] G. Rétvári, J. Tapolcai, A. Kőrösi, A. Majdán, and Z. Heszberger, “Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond,” IEEE/ACM Transactions on Networking, vol. 24, iss. 1, pp. 149-162, 2016. impact factor 2.284
[Bibtex]
[Bibtex]
@ARTICLE{retvari2014sigcomm,
author = {G. R\'etv\'ari and J. Tapolcai and A. K\H{o}r\"osi and A. Majd\'an and Z. Heszberger},
title = {Compressing IP Forwarding Tables: Towards Entropy Bounds and Beyond},
journal = {IEEE/ACM Transactions on Networking},
volume={24},
number={1},
pages={149--162},
year={2016},
comment = {impact factor 2.284},
keywords = {IP Fib Compression and top},
url = {http://arxiv.org/abs/1402.1194}
}[4] ![[doi]](http://lendulet.tmit.bme.hu/lendulet_website/wp-content/plugins/papercite/img/external.png)
G. Rétvári, D. Szabó, A. Gulyás, A. Kőrösi, and J. Tapolcai, “An Information-Theoretic Approach to Routing Scalability,” in ACM HotNets, 2014, p. 2:1–2:7.
[Bibtex]
G. Rétvári, D. Szabó, A. Gulyás, A. Kőrösi, and J. Tapolcai, “An Information-Theoretic Approach to Routing Scalability,” in ACM HotNets, 2014, p. 2:1–2:7. [Bibtex]
@inproceedings{retvari2014information,
author = {R{\'e}tv\'{a}ri, G\'{a}bor and Szab\'{o}, D\'{a}vid and Guly\'{a}s, Andr\'{a}s and K\H{o}r\"{o}si, Attila and Tapolcai, J\'{a}nos},
title = {An Information-Theoretic Approach to Routing Scalability},
booktitle = {ACM HotNets},
year = {2014},
location = {Los Angeles, CA, USA},
pages = {2:1--2:7},
articleno = {2},
numpages = {7},
url = {http://doi.acm.org/10.1145/2670518.2673863},
doi = {10.1145/2670518.2673863},
acmid = {2673863},
keywords = {IP FIB Compression and top and Internet scalability and entropy and forwarding table and hop-by-hop routing}
}[5] G. Rétvári, Z. Csernátony, A. Kőrösi, J. Tapolcai, A. Császár, G. Enyedi, and G. Pongrácz, “Compressing IP Forwarding Tables for Fun and Profit,” in ACM HotNets, 2012.
[Bibtex]
[Bibtex]
@INPROCEEDINGS{retvari2012hotnets,
author = {G. R\'etv\'ari and Z. Csern\'atony and A. K\H{o}r\"osi and J. Tapolcai and A. Cs\'asz\'ar and G. Enyedi and G. Pongr\'acz},
title = {Compressing {IP} Forwarding Tables for Fun and Profit},
booktitle = {ACM HotNets},
year = {2012},
keywords = {IP Fib Compression and top}
}[6] J. Tapolcai, P. Ho, P. Babarczi, and L. Rónyai, “Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails,” IEEE/ACM Transactions on Networking, vol. 23, iss. 6, pp. 1719-1728, 2015. impact factor 1.986
[Bibtex]
J. Tapolcai, P. Ho, P. Babarczi, and L. Rónyai, “Neighborhood Failure Localization in All-Optical Networks via Monitoring Trails,” IEEE/ACM Transactions on Networking, vol. 23, iss. 6, pp. 1719-1728, 2015. impact factor 1.986 [Bibtex]
@ARTICLE{tapolcai2014gnfl_ton,
author = {J. Tapolcai and Pin-Han Ho and P. Babarczi and L. R\'onyai},
title = {Neighborhood Failure Localization in All-Optical Networks via Monitoring
Trails},
journal = {IEEE/ACM Transactions on Networking},
volume={23},
number={6},
pages={1719--1728},
year={2015},
comment = {impact factor 1.986},
doi = {10.1109/TNET.2014.2342222},
issn = {1063-6692},
keywords = {monitoring-trail and Network-Wide Local Unambiguous Failure Localization and top}
}[7] J. Tapolcai, P. Ho, L. Rónyai, and B. Wu, “Network-Wide Local Unambiguous Failure Localization (NWL-UFL) via Monitoring Trails,” IEEE/ACM Transactions on Networking, vol. 20, iss. 6, pp. 1762-1773, 2012. impact factor 2.284
[Bibtex]
J. Tapolcai, P. Ho, L. Rónyai, and B. Wu, “Network-Wide Local Unambiguous Failure Localization (NWL-UFL) via Monitoring Trails,” IEEE/ACM Transactions on Networking, vol. 20, iss. 6, pp. 1762-1773, 2012. impact factor 2.284 [Bibtex]
@ARTICLE{tapolcai2012nwufl,
author = {J. Tapolcai and Pin-Han Ho and L. R\'onyai and Bin Wu},
title = {Network-Wide Local Unambiguous Failure Localization ({NWL-UFL}) via
Monitoring Trails},
journal = {IEEE/ACM Transactions on Networking},
year = {2012},
volume = {20},
pages = {1762 -- 1773},
number = {6},
comment = {impact factor 2.284},
demo = {demo/?demo_nl-ufl},
keywords = {monitoring-trail and Network-Wide Local Unambiguous Failure Localization and top}
}[8] P. Babarczi, J. Tapolcai, and P. Ho, “Adjacent Link Failure Localization with Monitoring Trails in All-Optical Mesh Networks,” IEEE/ACM Transactions on Networking, vol. 19, iss. 3, pp. 907-920, 2011. impact factor 2.284
[Bibtex]
P. Babarczi, J. Tapolcai, and P. Ho, “Adjacent Link Failure Localization with Monitoring Trails in All-Optical Mesh Networks,” IEEE/ACM Transactions on Networking, vol. 19, iss. 3, pp. 907-920, 2011. impact factor 2.284 [Bibtex]
@ARTICLE{babarczi2010ton,
author = {P. Babarczi and J. Tapolcai and Pin-Han Ho},
title = {Adjacent Link Failure Localization with Monitoring Trails in All-Optical
Mesh Networks},
journal = {IEEE/ACM Transactions on Networking},
year = {2011},
volume = {19},
pages = {907 - 920},
number = {3},
month = {June},
comment = {impact factor 2.284},
demo = {demo/?demo_afl},
doi = {10.1109/TNET.2010.2096429},
issn = {1063-6692},
keywords = {monitoring-trail and top}
}[9] J. Tapolcai, P. Ho, B. Wu, and L. Rónyai, “A Novel Approach for Failure Localization in All-Optical Mesh Networks,” IEEE/ACM Transactions on Networking, vol. 19, pp. 275-285, 2011. impact factor 2.284
[Bibtex]
J. Tapolcai, P. Ho, B. Wu, and L. Rónyai, “A Novel Approach for Failure Localization in All-Optical Mesh Networks,” IEEE/ACM Transactions on Networking, vol. 19, pp. 275-285, 2011. impact factor 2.284 [Bibtex]
@ARTICLE{tapolcai2010m-trail_ton,
author = {J. Tapolcai and Pin-Han Ho and Bin Wu and L. R\'onyai},
title = {A Novel Approach for Failure Localization in All-Optical Mesh Networks},
journal = {IEEE/ACM Transactions on Networking},
year = {2011},
volume = {19},
pages = {275--285},
comment = {impact factor 2.284},
demo = {demo/?demo_rca_rcs},
doi = {10.1109/TNET.2010.2068057},
issn = {1063-6692},
keywords = {monitoring-trail and top}
}[10] J. Tapolcai, P. Ho, L. Rónyai, P. Babarczi, and B. Wu, “Failure Localization for Shared Risk Link Groups in All-Optical Mesh Networks using Monitoring Trails,” IEEE/OSA Journal of Lightwave Technology, vol. 29, iss. 10, pp. 1597-1606, 2011. impact factor 2.784
[Bibtex]
[Bibtex]
@ARTICLE{tapolcai2010jlt,
author = {J. Tapolcai and Pin-Han Ho and L. R\'onyai and P. Babarczi and Bin Wu},
title = {Failure Localization for Shared Risk Link Groups in All-Optical Mesh
Networks using Monitoring Trails},
journal = {IEEE/OSA Journal of Lightwave Technology},
year = {2011},
volume = {29},
pages = {1597--1606},
number = {10},
month = {May},
comment = {impact factor 2.784},
demo = {demo/?demo_dense-srlg},
issn = {0733-8724},
keywords = {monitoring-trail and bidirectional m-trail and top}
}[11] J. Tapolcai, L. Rónyai, É. Hosszu, P. Ho, and S. Subramaniam, “Signaling Free Localization of Node Failures in All-Optical Networks,” in Proc. IEEE INFOCOM, Toronto, Canada, 2014, pp. 1860-1868.
[Bibtex]
J. Tapolcai, L. Rónyai, É. Hosszu, P. Ho, and S. Subramaniam, “Signaling Free Localization of Node Failures in All-Optical Networks,” in Proc. IEEE INFOCOM, Toronto, Canada, 2014, pp. 1860-1868. [Bibtex]
@INPROCEEDINGS{tapolcai2014nl-ufl-node,
author = {J. Tapolcai and L. R\'onyai and \'E. Hosszu and Pin-Han Ho and S. Subramaniam},
title = {Signaling Free Localization of Node Failures in All-Optical Networks},
booktitle = {Proc. IEEE INFOCOM},
year = {2014},
pages = {1860--1868},
address = {Toronto, Canada},
month = may,
keywords = {monitoring-trail and Network-Wide Local Unambiguous Failure Localization and top}
}[12] J. Tapolcai, B. Wu, and P. Ho, “On Monitoring and Failure Localization in Mesh All-Optical Networks,” in Proc. IEEE INFOCOM, Rio de Janero, Brasil, 2009, pp. 1008-1016. acceptance rate 19.7%
[Bibtex]
J. Tapolcai, B. Wu, and P. Ho, “On Monitoring and Failure Localization in Mesh All-Optical Networks,” in Proc. IEEE INFOCOM, Rio de Janero, Brasil, 2009, pp. 1008-1016. acceptance rate 19.7% [Bibtex]
@INPROCEEDINGS{tapolcai09mtrail,
author = {J. Tapolcai and Bin Wu and Pin-Han Ho},
title = {On Monitoring and Failure Localization in Mesh All-Optical Networks},
booktitle = {Proc. IEEE INFOCOM},
year = {2009},
pages = {1008--1016},
address = {Rio de Janero, Brasil},
comment = {acceptance rate 19.7%},
keywords = {monitoring-trail and bidirectional m-trail}
}[13] J. Tapolcai, L. Rónyai, and P. Ho, “Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks,” in Proc. IEEE INFOCOM Mini-Symposium, San Diego, CA, USA, 2010. acceptance rate 24.2%
[Bibtex]
J. Tapolcai, L. Rónyai, and P. Ho, “Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks,” in Proc. IEEE INFOCOM Mini-Symposium, San Diego, CA, USA, 2010. acceptance rate 24.2% [Bibtex]
@INPROCEEDINGS{tapolcai2010infocommini,
author = {J. Tapolcai and L. R\'onyai and Pin-Han Ho},
title = {Optimal Solutions for Single Fault Localization in Two Dimensional
Lattice Networks},
booktitle = {Proc. IEEE INFOCOM Mini-Symposium},
year = {2010},
address = {San Diego, CA, USA},
comment = {acceptance rate 24.2%},
demo = {demo/?demo_2d_grid},
keywords = {monitoring-trail and bidirectional m-trail and top}
}[14] J. Tapolcai, P. Ho, P. Babarczi, and L. Rónyai, “On Achieving All-Optical Failure Restoration via Monitoring Trails,” in Proc. IEEE INFOCOM Mini-Symposium, Turin, Italy, 2013, pp. 380-384.
[Bibtex]
J. Tapolcai, P. Ho, P. Babarczi, and L. Rónyai, “On Achieving All-Optical Failure Restoration via Monitoring Trails,” in Proc. IEEE INFOCOM Mini-Symposium, Turin, Italy, 2013, pp. 380-384. [Bibtex]
@INPROCEEDINGS{tapolcai2013nfl_mtrail_infocom,
author = {J. Tapolcai and Pin-Han Ho and P. Babarczi and L. R\'onyai},
title = {On Achieving {All-Optical} Failure Restoration via Monitoring Trails},
booktitle = {Proc. IEEE INFOCOM Mini-Symposium},
year = {2013},
pages = {380-384},
address = {Turin, Italy},
month = {April},
issn = {0743-166X},
keywords = {monitoring-trail and Network-Wide Local Unambiguous Failure Localization and top}
}[15] P. Babarczi, J. Tapolcai, L. Rónyai, and M. Médard, “Resilient Flow Decomposition of Unicast Connections with Network Coding,” in Proc. IEEE International Symposium on Information Theory (ISIT), 2014, pp. 116-120.
[Bibtex]
P. Babarczi, J. Tapolcai, L. Rónyai, and M. Médard, “Resilient Flow Decomposition of Unicast Connections with Network Coding,” in Proc. IEEE International Symposium on Information Theory (ISIT), 2014, pp. 116-120. [Bibtex]
@INPROCEEDINGS{babarczi2014resilient,
author = {P. Babarczi and J. Tapolcai and L. R\'onyai and M. M\'edard},
title = {Resilient Flow Decomposition of Unicast Connections with Network
Coding},
booktitle = {Proc. IEEE International Symposium on Information Theory (ISIT)},
year = {2014},
pages = {116-120},
month = {June},
doi = {10.1109/ISIT.2014.6874806},
keywords = {network coding and dedicated protection},
url = {http://arxiv.org/abs/1401.6670}
}[16] A. Gulyás, G. Rétvári, Z. Heszberger, and R. Agarwal, “On the scalability of routing with policies,” IEEE/ACM Transactions on Networking, vol. 23, iss. 5, pp. 1610-1618, 2015.
[Bibtex]
A. Gulyás, G. Rétvári, Z. Heszberger, and R. Agarwal, “On the scalability of routing with policies,” IEEE/ACM Transactions on Networking, vol. 23, iss. 5, pp. 1610-1618, 2015. [Bibtex]
@ARTICLE{gulyas2014scalability,
author = {Guly{\'a}s, Andr{\'a}s and R{\'e}tv{\'a}ri, G{\'a}bor and Heszberger, Zal{\'a}n and Agarwal, Rachit},
title = {On the scalability of routing with policies},
journal = {IEEE/ACM Transactions on Networking},
year = {2015},
volume = {23},
pages = {1610--1618},
number = {5},
doi = {10.1109/TNET.2014.2345839},
issn = {1063-6692},
keywords = {compact routing and top},
publisher = {IEEE}
}[17] J. Tapolcai, J. Bíró, P. Babarczi, A. Gulyás, Z. Heszberger, and D. Trossen, “Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding,” IEEE/ACM Transactions on Networking, vol. 23, iss. 6, pp. 1832-1845, 2015. impact factor 1.986
[Bibtex]
J. Tapolcai, J. Bíró, P. Babarczi, A. Gulyás, Z. Heszberger, and D. Trossen, “Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast Forwarding,” IEEE/ACM Transactions on Networking, vol. 23, iss. 6, pp. 1832-1845, 2015. impact factor 1.986 [Bibtex]
@ARTICLE{tapolcai2014bloom_ton,
author = {J. Tapolcai and J. B\'ir\'o and P. Babarczi and A. Guly\'as and Z. Heszberger and D. Trossen},
title = {Optimal False-Positive-Free Bloom Filter Design for Scalable Multicast
Forwarding},
journal = {IEEE/ACM Transactions on Networking},
volume={23},
number={6},
pages={1832--1845},
year={2015},
comment = {impact factor 1.986},
doi = {10.1109/TNET.2014.2342155},
issn = {1063-6692},
keywords = {multicast addressing and future internet architectures and top}
}[18] J. Tapolcai and G. Rétvári, “Router Virtualization for Improving IP-level Resilience,” in Proc. IEEE INFOCOM, Turin, Italy, 2013.
[Bibtex]
J. Tapolcai and G. Rétvári, “Router Virtualization for Improving IP-level Resilience,” in Proc. IEEE INFOCOM, Turin, Italy, 2013. [Bibtex]
@INPROCEEDINGS{tapolcai2013router_virt_lfa,
author = {J. Tapolcai and G. R\'etv\'ari},
title = {Router Virtualization for Improving {IP-level} Resilience},
booktitle = {Proc. IEEE INFOCOM},
year = {2013},
address = {Turin, Italy},
month = apr,
days = {14},
demo = {demo/?lfa-vn},
keywords = {IP Fast ReRoute and top}
}[19] G. Rétvári, J. Tapolcai, G. Enyedi, and A. Császár, “IP Fast ReRoute: Loop Free Alternates Revisited,” in Proc. IEEE INFOCOM, Shanghai, P.R. China, 2011.
[Bibtex]
G. Rétvári, J. Tapolcai, G. Enyedi, and A. Császár, “IP Fast ReRoute: Loop Free Alternates Revisited,” in Proc. IEEE INFOCOM, Shanghai, P.R. China, 2011. [Bibtex]
@INPROCEEDINGS{retvari2011lfa_infocom,
author = {G. R\'etv\'ari and J. Tapolcai and G. Enyedi and A. Cs\'asz\'ar},
title = {{IP} Fast {ReRoute:} Loop Free Alternates Revisited},
booktitle = {Proc. IEEE INFOCOM},
year = {2011},
address = {Shanghai, P.R. China},
month = {4},
days = {10},
keywords = {IP Fast ReRoute and top}
}[20] M. Csernai, F. Ciucu, R. Braun, and A. Gulyás, “Reducing Cabling Complexity in Large Flattened Butterfly Networks by an Order of Magnitude,” in Optical Fiber Communication Conference, 2014, p. Th2A–56.
[Bibtex]
[Bibtex]
@INPROCEEDINGS{csernai2014reducing,
author = {Csernai, M\'arton and Ciucu, Florin and Braun, Ralf-Peter and Guly\'as, Andr\'as},
title = {Reducing Cabling Complexity in Large Flattened Butterfly Networks
by an Order of Magnitude},
booktitle = {Optical Fiber Communication Conference},
year = {2014},
pages = {Th2A--56},
organization = {Optical Society of America},
keywords = {data center and top}
}[21] A. Csoma, B. Sonkoly, L. Csikor, F. Németh, A. Gulyás, W. Tavernier, and S. Sahhaf, “ESCAPE: Extensible Service Chain Prototyping Environment Using Mininet, Click, NETCONF and POX,” in ACM SIGCOMM (DEMO), Chicago, Illinois, USA, 2014, pp. 125-126.
[Bibtex]
A. Csoma, B. Sonkoly, L. Csikor, F. Németh, A. Gulyás, W. Tavernier, and S. Sahhaf, “ESCAPE: Extensible Service Chain Prototyping Environment Using Mininet, Click, NETCONF and POX,” in ACM SIGCOMM (DEMO), Chicago, Illinois, USA, 2014, pp. 125-126. [Bibtex]
@INPROCEEDINGS{csoma2014escape,
author = {Csoma, Attila and Sonkoly, Bal\'azs and Csikor, Levente and N\'emeth, Felici\'an and Guly\'as, Andr\'as and Tavernier, Wouter and Sahhaf, Sahel},
title = {ESCAPE: Extensible Service Chain Prototyping Environment Using Mininet,
Click, NETCONF and POX},
booktitle = {ACM SIGCOMM (DEMO)},
year = {2014},
pages = {125--126},
address = {Chicago, Illinois, USA},
publisher = {ACM},
acmid = {2631448},
doi = {10.1145/2619239.2631448},
isbn = {978-1-4503-2836-4},
keywords = {Software Defined Networking and NETCONF and click and mininet and prototyping and service chain and demo},
numpages = {2},
url = {http://doi.acm.org/10.1145/2619239.2631448}
}[22] F. Németh, B. Sonkoly, L. Csikor, and A. Gulyás, “A Large-Scale Multipath Playground for Experimenters and Early Adopters,” in ACM SIGCOMM (DEMO), Hong Kong, China, 2013, pp. 482-483.
[Bibtex]
F. Németh, B. Sonkoly, L. Csikor, and A. Gulyás, “A Large-Scale Multipath Playground for Experimenters and Early Adopters,” in ACM SIGCOMM (DEMO), Hong Kong, China, 2013, pp. 482-483. [Bibtex]
@INPROCEEDINGS{nemethf_multipath_playground2013,
author = {Felici\'an N\'emeth and Bal\'azs Sonkoly and Levente Csikor and Andr\'as Guly\'as},
title = {A Large-Scale Multipath Playground for Experimenters and Early Adopters},
booktitle = {ACM SIGCOMM (DEMO)},
year = {2013},
pages = {482-483},
address = {Hong Kong, China},
month = aug,
keywords = {Software Defined Networking and demo}
}[23] F. Németh, Ádám. Stipkovits, B. Sonkoly, and A. Gulyás, “Towards smartflow: case studies on enhanced programmable forwarding in openflow switches,” in ACM SIGCOMM (DEMO), 2012, pp. 85-86.
[Bibtex]
[Bibtex]
@INPROCEEDINGS{nemeth2012towards,
author = {N\'emeth, Felici\'an and Stipkovits, \'Ad\'am and Sonkoly, Bal\'azs and Guly\'as, Andr\'as},
title = {Towards smartflow: case studies on enhanced programmable forwarding
in openflow switches},
booktitle = {ACM SIGCOMM (DEMO)},
year = {2012},
volume = {42},
pages = {85--86},
keywords = {Software Defined Networking and demo}
}