摘要
在网络通信中,如何合理分配网络资源、减少信元损失和通信阻塞具有重要意义。针对这一问题,提出一种带有共享缓冲的门限网络系统。利用排队理论,建立了服务系统的数学模型。对数学模型进行简化,并根据离散事件动态系统的原理和方法进行了计算机仿真。仿真结果表明:在共享缓冲区为定值的情况下,适当调整其中一类顾客的缓存大小,可使系统总的顾客损失率到达最小;两类顾客缓存均一定的情况下,增加共享缓冲区可减少系统总的顾客损失率。为决策者控制决策提供了重要的参考信息。
In network communication, it is important to allocate reasonably the network resources, to reduce the cell loss ratio and the channel burden. For this problem, a kind of network system with buffer sharing area was proposed. According to the queuing theory, a mathematic model was established for this system. The model was simplified and simulated in computer based on the principle of discrete event dynamic system. The simulation results were as follows : when the buffer of one kind of customer was adjusted properly, the total customer loss ratio could be minimized on condition that the buffer sharing area was set constant; increasing the buffer sharing area could reduce the total customer loss ratio when the buffers of two kinds of customers were set constant respectively. This supplied meaningful reference information for policy maker and controller.
出处
《计算机仿真》
CSCD
北大核心
2009年第9期96-99,119,共5页
Computer Simulation
关键词
通信
有限排队
仿真
共享缓冲
Telecommunication
Finite queue
Simulation
Buffer sharing