\r\ndifferent types of middlebox. The improper placement of network

\r\nmiddlebox and path assignment for flows could greatly increase

\r\nthe network latency and also decrease the performance of network.

\r\nMinimizing the total end to end latency of all the ows requires to

\r\nassign path for the incoming flows. In this paper, the flow path

\r\nassignment problem in regard to the placement of various kinds

\r\nof middlebox is studied. The flow path assignment problem is

\r\nformulated to a linear programming problem, which is very time

\r\nconsuming. On the other hand, a naive greedy algorithm is studied.

\r\nWhich is very fast but causes much more latency than the linear

\r\nprogramming algorithm. At last, the paper presents a heuristic

\r\nalgorithm named FPA, which takes bottleneck link information and

\r\nestimated bandwidth occupancy into consideration, and achieves

\r\nnear optimal latency in much less time. Evaluation results validate

\r\nthe effectiveness of the proposed algorithm.","references":"[1] O. N. Fundation, \u201cSoftware-defined networking: The new norm for\r\nnetworks,\u201d ONF White Paper, vol. 2, pp. 2\u20136, 2012.\r\n[2] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson,\r\nJ. Rexford, S. Shenker, and J. Turner, \u201cOpenflow: enabling innovation in\r\ncampus networks,\u201d ACM SIGCOMM Computer Communication Review,\r\nvol. 38, no. 2, pp. 69\u201374, 2008.\r\n[3] B. Han, V. Gopalakrishnan, L. Ji, and S. Lee, \u201cNetwork function\r\nvirtualization: Challenges and opportunities for innovations,\u201d IEEE\r\nCommunications Magazine, vol. 53, no. 2, pp. 90\u201397, 2015.\r\n[4] Y. Zhang, N. Beheshti, L. Beliveau, G. Lefebvre, R. Manghirmalani,\r\nR. Mishra, R. Patneyt, M. Shirazipour, R. Subrahmaniam, C. Truchan,\r\net al., \u201cSteering: A software-defined networking for inline service\r\nchaining,\u201d in Network Protocols (ICNP), 2013 21st IEEE International\r\nConference on, pp. 1\u201310, IEEE, 2013.\r\n[5] A. Gushchin, A. Walid, and A. Tang, \u201cScalable routing in sdn-enabled\r\nnetworks with consolidated middleboxes,\u201d in Proceedings of the 2015\r\nACM SIGCOMM Workshop on Hot Topics in Middleboxes and Network\r\nFunction Virtualization, pp. 55\u201360, ACM, 2015.\r\n[6] A. Hari, T. Lakshman, and G. Wilfong, \u201cPath switching: reduced-state\r\nflow handling in sdn using path information,\u201d in Proceedings of\r\nthe 11th ACM Conference on Emerging Networking Experiments and\r\nTechnologies, p. 36, ACM, 2015.\r\n[7] A. Gember, P. Prabhu, Z. Ghadiyali, and A. Akella, \u201cToward\r\nsoftware-defined middlebox networking,\u201d in Proceedings of the 11th\r\nACM Workshop on Hot Topics in Networks, pp. 7\u201312, ACM, 2012.\r\n[8] A. Abujoda and P. Papadimitriou, \u201cMidas: Middlebox discovery and\r\nselection for on-path flow processing,\u201d in Communication Systems and\r\nNetworks (COMSNETS), 2015 7th International Conference on, pp. 1\u20138,\r\nIEEE, 2015.\r\n[9] Z. Liu, X. Wang, W. Pan, B. Yang, X. Hu, and J. Li, \u201cTowards\r\nefficient load distribution in big data cloud,\u201d in Computing, Networking\r\nand Communications (ICNC), 2015 International Conference on,\r\npp. 117\u2013122, IEEE, 2015.\r\n[10] Z. A. Qazi, C.-C. Tu, L. Chiang, R. Miao, V. Sekar, and M. Yu,\r\n\u201cSimple-fying middlebox policy enforcement using sdn,\u201d in ACM\r\nSIGCOMM computer communication review, vol. 43, pp. 27\u201338, ACM,\r\n2013.\r\n[11] W. Ma, J. Beltran, Z. Pan, D. Pan, and N. Pissinou, \u201cSdn-based traffic\r\naware placement of nfv middleboxes,\u201d IEEE Transactions on Network\r\nand Service Management, vol. 14, no. 3, pp. 528\u2013542, 2017.\r\n[12] J. Liu, Y. Li, Y. Zhang, L. Su, and D. Jin, \u201cImprove service chaining\r\nperformance with optimized middlebox placement,\u201d IEEE Transactions\r\non Services Computing, vol. 10, no. 4, pp. 560\u2013573, 2017.\r\n[13] Y. Kanizo, D. Hay, and I. Keslassy, \u201cPalette: Distributing tables in\r\nsoftware-defined networks,\u201d in INFOCOM, 2013 Proceedings IEEE,\r\npp. 545\u2013549, IEEE, 2013.\r\n[14] N. Kang, Z. Liu, J. Rexford, and D. Walker, \u201cOptimizing the one\r\nbig switch abstraction in software-defined networks,\u201d in Proceedings\r\nof the ninth ACM conference on Emerging networking experiments and\r\ntechnologies, pp. 13\u201324, ACM, 2013.\r\n[15] X. Wang, W. Shi, Y. Xiang, and J. Li, \u201cEfficient network security policy\r\nenforcement with policy space analysis,\u201d IEEE\/ACM Transactions on\r\nNetworking, vol. 24, no. 5, pp. 2926\u20132938, 2016.\r\n[16] S. K. Fayazbakhsh, L. Chiang, V. Sekar, M. Yu, and J. C. Mogul,\r\n\u201cEnforcing network-wide policies in the presence of dynamic middlebox\r\nactions using flowtags.,\u201d in NSDI, vol. 14, pp. 543\u2013546, 2014.\r\n[17] J. Liu, Y. Li, H. Wang, D. Jin, L. Su, L. Zeng, and T. Vasilakos,\r\n\u201cLeveraging software-defined networking for security policy\r\nenforcement,\u201d Information Sciences, vol. 327, pp. 288\u2013299, 2016.\r\n[18] Z. Qazi, C.-C. Tu, R. Miao, L. Chiang, V. Sekar, and M. Yu, \u201cPractical\r\nand incremental convergence between sdn and middleboxes,\u201d Open\r\nNetwork Summit, Santa Clara, CA, 2013.\r\n[19] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction\r\nto algorithms. MIT press, 2009.\r\n[20] J. McCauley, Z. Liu, A. Panda, T. Koponen, B. Raghavan, J. Rexford,\r\nand S. Shenker, \u201cRecursive sdn for carrier networks,\u201d ACM SIGCOMM\r\nComputer Communication Review, vol. 46, no. 4, pp. 1\u20137, 2016.\r\n[21] S. Mitchell, M. OSullivan, and I. Dunning, \u201cPulp: a linear programming\r\ntoolkit for python,\u201d The University of Auckland, Auckland, New Zealand,\r\nhttp:\/\/www. optimization-online. org\/DB FILE\/2011\/09\/3178. pdf, 2011.\r\n[22] A. J. Mason, \u201cOpensolver-an open source add-in to solve linear and\r\ninteger progammes in excel,\u201d in Operations research proceedings 2011,\r\npp. 401\u2013406, Springer, 2012.\r\n[23] A. Makhorin, \u201cGlpk (gnu linear programming kit),\u201d http:\/\/www. gnu.\r\norg\/s\/glpk\/glpk. html, 2008.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 153, 2019"}