OpenCounter: Counting unknown flows in Software Defined Networks
暂无分享,去创建一个
Christian Callegari | Stefano Giordano | Michele Pagano | Gregorio Procissi | S. Giordano | G. Procissi | M. Pagano | C. Callegari
[1] Mikkel Thorup,et al. Tabulation based 4-universal hashing with applications to second moment estimation , 2004, SODA '04.
[2] Balachander Krishnamurthy,et al. Sketch-based change detection: methods, evaluation, and applications , 2003, IMC '03.
[3] Qiang Fu,et al. Cardigan: deploying a distributed routing fabric , 2013, HotSDN '13.
[4] Graham Cormode,et al. An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.
[5] Russell J. Clark,et al. SDX , 2014 .
[6] Yan Chen,et al. Reversible sketches for efficient and accurate change detection over network data streams , 2004, IMC '04.
[7] Gunjan Tank,et al. Software-Defined Networking-The New Norm for Networks , 2012 .
[8] Christian Callegari,et al. The LogLog counting reversible sketch: A distributed architecture for detecting anomalies in backbone networks , 2012, 2012 IEEE International Conference on Communications (ICC).
[9] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..
[10] Nick McKeown,et al. OpenFlow: enabling innovation in campus networks , 2008, CCRV.
[11] P. Flajolet,et al. Loglog counting of large cardinalities , 2003 .
[12] Divesh Srivastava,et al. Holistic UDAFs at streaming speeds , 2004, SIGMOD '04.