Qing Lyu and Hang Zhu
Optimizing Network Latency with Fast Path Assignment for Incoming Flows
461 - 467
2019
13
9
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/10010718
https://publications.waset.org/vol/153
World Academy of Science, Engineering and Technology
Various flows in the network require to go through
different types of middlebox. The improper placement of network
middlebox and path assignment for flows could greatly increase
the network latency and also decrease the performance of network.
Minimizing the total end to end latency of all the ows requires to
assign path for the incoming flows. In this paper, the flow path
assignment problem in regard to the placement of various kinds
of middlebox is studied. The flow path assignment problem is
formulated to a linear programming problem, which is very time
consuming. On the other hand, a naive greedy algorithm is studied.
Which is very fast but causes much more latency than the linear
programming algorithm. At last, the paper presents a heuristic
algorithm named FPA, which takes bottleneck link information and
estimated bandwidth occupancy into consideration, and achieves
near optimal latency in much less time. Evaluation results validate
the effectiveness of the proposed algorithm.
Open Science Index 153, 2019