Patent ID: 11936758
Assignee: NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS
Field: Digital communication (Electrical engineering)
Classification: CPC H  G  Y | IPC G  H

Claim 3:
4. The efficient parallelization and deployment method of a multi-objective service function chain based on a CPU+DPU platform according to claim 2, wherein the multi-objective deployment problem in step (1) is specifically described as follows:
an objective function of the SFC deployment problem is as follows:, min
   ⁡
   (
   
    
     f
     1
    
    +
    
     f
     2
    
    +
    
     f
     3
    
   
   )
  
  ⁢
  

  
   
    s
    .
    t
    .
       
    
     C
     1
    
   
   ,
   
    C
    2
   
   ,
   
    C
    3
   
  
  ⁢
  

  
   {
   
    
     
      
       
        f
        1
       
       =
       
        
         ∑
         
            
          
           
            r
            μ
           
           ∈
           R
          
         
        
        
         D
         μ
        
       
      
     
    
    
     
      
       
        f
        2
       
       =
       
        
         ∑
         
            
          
           
            r
            μ
           
           ∈
           R
          
         
        
        
         
          y
          
           r
           μ
          
         
         ⁢
         
          B
          
           
            μ
            τ
           
           ⁢
           r
          
         
        
       
      
     
    
    
     
      
       
        f
        3
       
       =
       
        C
        ⁡
        (
        τ
        ), for f1, Dμ is a total response delay, that is,

Dμ=Lμ+Pμ+Tμ+Wq, wherein Lμ is a communication delay, Pμ is a processing delay, Tμ is a transmission delay, and Wq is an average queuing delay;
for f2, Σrμ∈RyrμBμτr is a total throughput, wherein the binary variable yrμ represents whether rμ is accepted, Bμ is a minimum bandwidth of the SFC, and τr=l*Δ represents a survival time of the SFC;
for f3, C(τ) represents a total deployment cost, with the following expression:

C(τ)=SC(τ)+Cscale(τ)+CDPU(τ)

SC(τ) represents a total operation cost, i.e., a sum of a cost of turning on the server and a cost of successfully placing the VNF:

SC(τ)=Σni∈NΣfvμ∈FμxfvμniζcCfvμ+Σej∈EΣehμ∈EμxehμejζBBμ+Σni∈NζO, xfvμni represents whether VNF fvμ∈Fμ is deployed on a server node ni∈N in the request rμ∈R, xehμej represents whether a virtual link ehμ∈Eμ is mapped to a physical link ej∈E in the request rμ∈R, ζc and ζB respectively represent the unit costs of the resource and the bandwidth, Cfvμ represents the resource requirement of VNF c and represents the cost of turning on the server;
Cscale(τ)=Σni∈NΣfvμ∈FμCh·xni,hfvμ represents a total scaling cost, wherein Ch represents a horizontal scaling cost, and xni,hfvμ represents whether VNF fvμ∈Fμ is horizontally scaled;
CDPU(τ) represents a total use cost of the DPU and is defined as follows:

CDPU(τ)=Σni∈NΣfvμ∈FμζcDxni,DfμCfvμ+ζBDxni,DfvμBμ, wherein ζcD and ζBD represent the unit costs of the resource and bandwidth during use of the DPU, and xni,Dfμ represents whether VNF fvμ∈Fμ is processed with the DPU; and
C1 represents a resource constraint, C2 represents a bandwidth constraint, and C3 represents a delay constraint.