期刊文献+

A CONNECTION ADMISSION CONTROL SCHEME BASED ON GAME THEORETICAL MODEL IN ATM NETWORKS

A CONNECTION ADMISSION CONTROL SCHEME BASED ON GAME THEORETICAL MODEL IN ATM NETWORKS
下载PDF
导出
摘要 In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among different traffic sources is analyzed based on cooperative game model. A CAC scheme is proposed using the genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share and accuracy of accepting/rejecting the incoming calls. Simulation results show that the proposed scheme ensures fairness of the shared bandwidth to different traffic sources. In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among different traffic sources is analyzed based on cooperative game model. A CAC scheme is proposed using the genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share and accuracy of accepting/rejecting the incoming calls. Simulation results show that the proposed scheme ensures fairness of the shared bandwidth to different traffic sources.
出处 《Journal of Electronics(China)》 1999年第1期7-15,共9页 电子科学学刊(英文版)
基金 National Science Foundation of China,Grant No.69682010
关键词 CONNECTION ADMISSION control Cooperative GAME model GENETIC algorithm Dynamic BANDWIDTH ALLOCATION ATM network Connection admission control Cooperative game model Genetic algorithm Dynamic bandwidth allocation ATM network
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部