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

Abstract
Figure/Table
References
Related Citation (15)

Download: PDF (560 KB)
Export: BibTeX | EndNote (RIS)

Abstract 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.

Key words： Connection admission control Cooperative game model Genetic algorithm Dynamic bandwidth allocation ATM network

Received: 24 February 1997

PACS:

TN913.24

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors



	Chen Huimin
	Wang Pu
	Li Yanda

Cite this article:

Chen Huimin,Wang Pu,Li Yanda. A CONNECTION ADMISSION CONTROL SCHEME BASED ON THEORETIC GAME MODEL IN ATM NETWORKS[J]. , 1998, 20(5): 648-654 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y1998/V20/I5/648