The existing methods are mostly concentrated on single flow network selection. In this paper, a multi-flow network selection model scheme based on bigraph is proposed. By calculating the satisfactions between flows and networks this scheme can distribute the flows with the most satisfaction on the condition of being fair. Analysis of the performance of the algorithm proves the correctness of Algorithm. Numerical results show that the proposed schemes achieve significant satisfaction and Fair coefficient.
|Number of pages||13|
|Journal||Ruan Jian Xue Bao/Journal of Software|
|Publication status||Published - Jun 2010|
- Network selection