The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 24, 2020

Filed:

Dec. 11, 2018
Applicants:

State Grid Henan Information & Telecommunication Company, Zhengzhou, CN;

Beijing University of Posts and Telecommunications, Beijing, CN;

Inventors:

Wencui Li, Zhengzhou, CN;

Shiwen Wang, Zhengzhou, CN;

Siya Xu, Beijing, CN;

Gangsong Dong, Zhengzhou, CN;

Shaoyong Guo, Beijing, CN;

Yi Jin, Zhengzhou, CN;

Xiong Li, Zhengzhou, CN;

Lei Feng, Beijing, CN;

Jing Shen, Zhengzhou, CN;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04L 12/857 (2013.01); H04L 12/803 (2013.01); G06F 9/48 (2006.01); G06F 9/455 (2018.01); H04L 12/715 (2013.01); H04L 12/725 (2013.01); H04L 12/721 (2013.01);
U.S. Cl.
CPC ...
H04L 47/2491 (2013.01); G06F 9/45558 (2013.01); G06F 9/4881 (2013.01); H04L 45/124 (2013.01); H04L 45/306 (2013.01); H04L 45/64 (2013.01); H04L 47/125 (2013.01); G06F 2009/45595 (2013.01); H04L 45/14 (2013.01);
Abstract

The present application provides a method for dynamically allocating resources in an SDN/NFV network based on load balancing. For multimedia services with different demands, a virtual link mapping target, a constraint and a load state of a physical link are associated. A subtask is adaptively mapped to a network node according to the load state of the physical link. The method effectively distinguishes used resources and remaining resources of a physical node and a link to balance the load, and thereby improve the utilization of network resources and avoid occurrence of a local optimum or current optimum. The solution involves performing a subtask mapping to find a server node satisfying constraints for each subtask in a service request. The model for mapping the subtask is A virtual link mapping is then performed to find a physical path for each virtual link in the service request, which satisfies the capability constraint of the virtual link. The dynamic virtual mapping is described as


Find Patent Forward Citations

Loading…