A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game

Algorithm 1

CDSBG.

	Input: abstract network ;
	;
	Resource capacity of SDN domain ;
	Maximum number of iterations ;
	ICA population ;
	Number of empires .
	Output: node mapping matrix
(1)	Initialize the number of empires, maximum number of iterations, and related parameters and .
(2)	Initial feasible policies are randomly generated in all policy sets. Initialize country location and country cost .
(3)	Initialize BATNA and.
(4)	Initial empire building. Calculate the country's normalized costs and power, and generate ASD empires.
(5)	Carry out assimilation and revolutionary operations on each imperial colony, and judge whether the empire will split according to equation (22). If so, split operations will be carried out; otherwise, the next step will be taken.
(6)	Imperial competition stage. Transfer the worst colony of the worst empire to the best empire.
(7)	The empire dies. Check if an empire has no colonies. If so, delete the empire.
(8)	Determine if there is only one empire; if so, update BATNA according to formulas (17) and (18); otherwise, loop through steps 5–7.
(9)	Determine whether the number of iterations has reached . If conditions are met, then the loop is closed, and the optimal imperial position is output. Otherwise, proceed to step 5.