Multi-Flow Network Fairness Selection Scheme Based on Weighted Bigraph Model

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.

[1]  Anders Eriksson,et al.  Providing quality of service in always best connected networks , 2003, IEEE Commun. Mag..

[2]  E. Gustafsson,et al.  Always best connected , 2003, IEEE Wirel. Commun..