备注
| 报告简介：This talk starts with a brief survey of various NFV middlebox placement problems in SDN networks. We then narrow down to a placement problem with a given set of flows in a tree topology. We assume that each flow needs to go through a given set of middleboxes, with or without a particular order. In addition, when a flow passes through a middlebox, its traffic may expand or diminish depending on the type of middlebox (this phenomenon is called traffic-changing effect). Multiple flows can share the same middlebox to save middlebox setup costs. The overall objective is to minimize the cost of setting up middleboxes and the cost of total bandwidth consumption by these flows. More specifically, we study a middlebox placement optimization problem for multiple flows with constraints of middlebox traffic-changing ratios and their dependency relations. We prove the NP-hardness of optimally placing even a single type of middlebox in a general network topology. We then focus on tree-structured networks. For homogeneous flows with the same bandwidth, we propose three optimal algorithms for three different cases, including placing a single middlebox (as a basic solution), a non-ordered middlebox set, and a totally-ordered middlebox set. The talk ends with some discussions on several on-going projects on middlebox placement problems.。
|
