摘要
多类顾客多服务台队列网络广泛地应用到计算机网络、通讯网络和交通网络 .由于系统的复杂性 ,其数量指标的精确解很难求出 .为了寻求逼近解 ,本文用概率测度弱收敛理论对进行了研究 ,在高负荷的条件下 ,我们获得了网输入过程、闲时过程和负荷过程的极限定理 .
Queueing network with multiple customer typtes and multiple server stations has been used to computer and Communication and transportation networks widely. accurate solution of quantity index is difficulty to evatuate for complex of systems. in order to seek approximation solution. We used theory of weak convergence of probability measures.under heavy traffic assumptions we obtain limit theorems for the netput process?idle time process and workload process.
出处
《数学的实践与认识》
CSCD
北大核心
2004年第1期108-112,共5页
Mathematics in Practice and Theory
关键词
逼近解
极限定理
网络队列
服务强度
协方差
布朗运动
queueing network
heavy traffic
netput process
idle time process
workload process
