Multi-Flow Network Fairness Selection Scheme Based on Weighted Bigraph Model
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    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.

    Reference
    Related
    Cited by
Get Citation

袁 尧,张玉成,董雯霞,郑如松,杨育波,石晶林.基于二分图匹配的多业务流网络选择机制.软件学报,2010,21(6):1378-1390

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:October 28,2008
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063