检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]兰州理工大学理学院,甘肃兰州730000 [2]兰州理工大学电信学院,甘肃兰州730000
出 处:《系统工程与电子技术》2014年第10期2076-2081,共6页Systems Engineering and Electronics
基 金:国家自然科学基金(61167005)资助课题
摘 要:讨论了两种入口协议下的离散时间Erlang消失系统Geom/Geom/c/c,通过对系统的重构,建立新模型,分别得到两种入口协议下的稳态分布、PGF、平均队长和损失率的表达式,并进行了新旧模型的数值比较。通过比较得到,新旧模型队长的计算方法,损失率不同,但是状态转移矩阵,PGF的表达式相同。最后,在新模型下对两种不同入口协议进行了对比,得出两种协议下顾客的损失率随到达率增加而增大;随服务台个数和服务率的增加而减小;两种协议下顾客的平均队长随服务率的增加而减小,随到达率和服务台个数的增加而增大;同一参数下,有直接入口的损失率低于有延迟入口的损失率,有直接入口的平均队长低于有延迟入口的平均队长。Discrete-time Erlang lose systems Geom/Geom/c/c in two main entrance protocols are discussed. The system is reconstructed, new models are proposed in different entrance protocols, and the formula of PGF, the loss rate and the mean queue are obtained in the steady state system respectively. With some numerical examples, the differences of the important stationary indices are compared in new models and existing models. The calculation methods of the queue and the loss rate are different, but the state transition matrix and PGF had the same expressions. Finally, the new models are compared in the two different entrance protocols. The loss rate increases with the increasing arrival rate and decreases with the increasing numbers of entrance websites and the service rate. The mean queue decreases with the increasing service rate and increases with the increasing of the arrival rate and the numbers of entrance websites. Under the same parameters, the loss rate in direct en trance protocols is less than the other; the mean queue in delayed entrance protocols is higher than the other.
关 键 词:离散时间排队 Erlang消失系统 马尔可夫链
分 类 号:O236[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.137.142.253