一种基于对策模型的ATM网络连接接纳控制策略  

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

作　　者：陈惠民[1] 王普[1] 李衍达[1] 

机构地区：[1]清华大学自动化系,北京100084

出　　处：《电子科学学刊》1998年第5期648-654,共7页

基　　金：国家自然科学基金

摘　　要：本文先简述了ATM网络进行连接接纳控制(Connection Admission Control:CAC)的主要方法,其中主要综述了基于动态带宽分配的CAC策略,而后从合作对策模型的角度讨论业务间共享链路资源的公平性问题,提出一种基于时延带宽积的业务收益函数形式,并通过遗传算法求解待优化的对策函数,以决定对呼叫请求的接入或拒绝。仿真结果表明此方法能够更好地保证不同带宽和服务质量要求的业务共享网络资源的公平性。In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly overviewed 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 combining genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share of accepting/rejecting the incoming calls is proposed. Simulation results show that our scheme ensures fairness of the shared bandwidth to different traffic sources.

关 键 词：连接接纳控制 合作对策模型 ATM网络 

分 类 号：TN913.24[电子电信—通信与信息系统]