Based on the network management cost control and the virtual network reconfiguration algorithm, we designed the network overhead crowd optimization space and the management vector. The overhead structure will convert the mobile virtualization Internet topology to the point-to-point architecture. Here, the network overhead of each protocol layer is defined as a crowd node. Internet access service is defined as a crowd resource request node. Each virtual module of the Internet virtualization platform is defined as a crowd management node. The management node is the center of the network overhead management mechanism. The crowd resource request node is connected to the node.

In order to further reduce the complexity of network overhead and management, every virtual crowd management node of the Internet virtualization platform must maintain a bidirectional connection with the crowd node. The connection must satisfy the mobility management of the randomness and the full connectivity of the Internet. Virtual mobile Internet virtual topology is the network overhead crowd management of the fully connected graph. The network overhead management driven by this kind of crowd is in exchange for the minimum interconnection cost with the virtual Internet mapping. This crowd management mechanism is based on the optimization of network cost as the goal, in order to solve the network overhead request of network overhead crowd optimization space, improve the speed of the virtual Internet restructuring, and reduce the complexity of network overhead management.

*N*
_{CP} represents a crowd node. *N*
_{RCQ} represents a resource request node. *N*
_{CM} is a crowd management node. The value of *N*
_{CP} is determined by the cross layer system of the virtualization platform. The value of *N*
_{RCQ} is determined by the operator and the mobile user. The value of *N*
_{CM} is determined by the virtual process of mobile Internet. NO (a, b) represents the network overhead between a and b nodes. NO (a, b) _{UP} represents the overhead network overhead between a and b nodes. NO (a, b) _{DW} represents the network overhead between a and b nodes.

$$ \left\{\begin{array}{l} NO{\left(a,b\right)}_{UP}=\frac{{\displaystyle \sum_{i=1}^x NO(i)}}{{\displaystyle \sum_{j=1}^{N_{CP}} NO(j)}}\left(\omega \left({N}_{RCQ}\right)\right)\\ {} NO{\left(a,b\right)}_{DW}=\frac{{\displaystyle \sum_{i=1}^y NO(i)}}{{\displaystyle \sum_{j=1}^{N_{CP}} NO(j)}}\left({\omega}_F\left({N}_{RCQ}\right)\right)\end{array}\right. $$

(2)

Here, *x* represents the uplink scale. *y* indicates the size of the downlink. *ω*(*N*
_{RCQ}) denotes the average network overhead in the uplink virtualization network. *ω*
_{
F
}(*N*
_{RCQ}) denotes the average network overhead in the downlink virtualization network.

The additional network overhead of crowd management node can be obtained by the formula (3). The added value of *V*
_{ad} can accurately reflect the fusion degree of crowd and network overhead management *F*
_{d}. The smaller the added value, the higher the degree of fusion.

$$ \left\{\begin{array}{l}{V}_{ad}= \max \left\{{\displaystyle \sum_{i\to x,j\to y}\omega \left( NO(i)\cdot {N}_{CM}(j)\right)}\right\}\\ {}{F}_d= \ln \left(\frac{\omega \left( \min \left\{x,y\right\}\right)}{{\displaystyle \sum_{k\to {N}_{CP}}{\omega}_F(k)}}\right)\end{array}\right. $$

(3)

According to the formulas (2) and (3), the implementation of network overhead crowd management process is shown in Fig. 2. The crowd mechanism must satisfy the conditions shown in the formula (4).

$$ \left\{\begin{array}{l}{\displaystyle \sum_{i=1}^x NO(i)\le \sqrt{\omega (x)}}\\ {}{\displaystyle \sum_{i\to x,j\to y}\omega \left(i\cdot {N}_{CM}(j)\right)}\ge {\displaystyle \sum_{k\to {N}_{CP}}{\omega}_F(k)}\end{array}\right. $$

(4)