Abstract

In order to explore the optimal allocation method of computer network communication, a linear programming model is proposed. Based on the overall structure of service chain deployment, the integer linear programming model is introduced to make mathematical modeling, so that network resources and load balancing can be effectively utilized under resource and delay constraints. Simulation results showed that in the experiment, 10 to 100 SFC request intensities were generated, respectively, calculating the request acceptance rates of the three deployment algorithms. Under the same conditions, the average request acceptance rate based on the G-kSP algorithm is about 95.4% and about 92.3%, and the greedy deployment algorithm is about 81.7%. We show that the optimized distribution method of computer sensor network communication based on a linear programming model reduces the load balance and time complexity while reducing the request acceptance rate.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.