Detecting heavy flows in the SDN match and action model

作者: Yehuda Afek , Anat Bremler-Barr , Shir Landau Feibish , Liron Schiff

DOI: 10.1016/J.COMNET.2018.02.018

关键词:

摘要: Abstract Efficient algorithms and techniques to detect identify large flows in a high throughput traffic stream the SDN match-and-action model are presented. This is contrast previous work that either deviated from match action by requiring additional switch level capabilities or did not exploit data plane. Our construction has two parts; (a) new methods efficiently sample an model, (b) efficient scalable way, model. flow detection provide accuracy present good practical tradeoff between - controller traffic, number of entries required table. Based on different parameters, we differentiate heavy flows, elephant bulky types. Additionally, as part our scheme, sampling packets with arbitrary probability p per packet byte traverses switch. Finally, show how can be adapted distributed monitoring setting multiple switches, easily scale switches.

参考文章(22)
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi, Efficient Computation of Frequent and Top-k Elements in Data Streams Database Theory - ICDT 2005. pp. 398- 412 ,(2004) , 10.1007/978-3-540-30570-5_27
Ramana Rao Kompella, Walter Willinger, David G. Andersen, Michael K. Reiter, Vyas Sekar, Hui Zhang, CSAMP: a system for network-wide flow monitoring networked systems design and implementation. pp. 233- 246 ,(2008)
Minlan Yu, Rui Miao, Lavanya Jose, Software defined traffic measurement with OpenSketch networked systems design and implementation. pp. 29- 42 ,(2013)
Graham Cormode, S. Muthukrishnan, An improved data stream summary: The count-min sketch and its applications latin american symposium on theoretical informatics. pp. 29- 38 ,(2004) , 10.1007/978-3-540-24698-5_7
Anat Bremler-Barr, Yehuda Afek, Liron Schiff, ORange: Multi Field OpenFlow based Range Classifier architectures for networking and communications systems. pp. 63- 73 ,(2015) , 10.5555/2772722.2772733
J. Misra, David Gries, Finding Repeated Elements Science of Computer Programming. ,vol. 2, pp. 143- 152 ,(1982) , 10.1016/0167-6423(82)90012-0
Cristian Estan, George Varghese, New directions in traffic measurement and accounting ACM Transactions on Computer Systems. ,vol. 21, pp. 270- 313 ,(2003) , 10.1145/859716.859719
Graham Cormode, Marios Hadjieleftheriou, Finding frequent items in data streams very large data bases. ,vol. 1, pp. 1530- 1541 ,(2008) , 10.14778/1454159.1454225
Ye Yu, Chen Qian, Xin Li, Distributed and collaborative traffic monitoring in software defined networks Proceedings of the third workshop on Hot topics in software defined networking. pp. 85- 90 ,(2014) , 10.1145/2620728.2620739
Gurmeet Singh Manku, Rajeev Motwani, Approximate frequency counts over data streams Proceedings of the VLDB Endowment. ,vol. 5, pp. 1699- 1699 ,(2012) , 10.14778/2367502.2367508