位置:成果数据库 > 期刊 > 期刊详情页
一种可容错的覆盖网节点合作激励策略
  • ISSN号:0732-2112
  • 期刊名称:电子学报
  • 时间:0
  • 页码:145-148
  • 语言:中文
  • 分类:TP393[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]西安交通大学电子与信息工程学院,西安710049, [2]北京航空航天大学中德联合软件研究所,北京100191, [3]清华大学计算机科学与技术系,北京100084
  • 相关基金:Supported by the National Natural Science Foundation of China under Grant No.60673180 (国家自然科学基金); the International Science and Technology Cooperative Program of China under Grant No.S2010GR0607 (国际科技合作计划项目 )
  • 相关项目:异质环境中拓扑自组织的overlay网络研究
中文摘要:

提出了一种能够实现多业务之间呼损率比例公平的准入控制算法CDPF(call dropping proportional fairness).CDPF根据各类呼叫的平均到达率、平均持续时间、小区驻留时间等参数,动态地计算各类呼叫的准入阈值,从而控制各类呼叫的准入数量,使得各类呼叫的呼损率符合给定的比例.当网络负载发生变化时,各类呼叫的呼损率也随之变化,但各类呼叫呼损率之间的比值始终保持不变.仿真结果表明,随着网络负载的变化,CDPF能够很好地保证呼损率的比例公平.此外,CDPF算法比已有算法具有更低的时间复杂度.

英文摘要:

In this paper, an admission control algorithm called CDPF (call dropping proportional fairness) is proposed to realize the proportional fairness of call loss probability. It dynamically computes the admission threshold for each class call to control the accepted call number according to the average call arrival rate, the average call duration time and the average cell dwell duration time of each class, and thus guarantees the call loss probability proportion of each class. In CDPF, the call loss probability of each class changes with the network load, while their proportion keeps unchanged. Simulation results show that with the change of network load, CDPF guarantees the proportional fairness of call loss probability. Compared with the existing algorithms, CDPF has lower time complexity.

同期刊论文项目
期刊论文 31 会议论文 29 专利 3
同项目期刊论文