|
|||||
|
|
| 基于运营收入最大化的Parlay网关过载控制 | |
| 引用本文： | 张云勇,张智江,刘韵洁,李忠诚,李国杰. 基于运营收入最大化的Parlay网关过载控制[J]. 通信学报, 2005, 26(3): 95-103 |
| 作者姓名： | 张云勇 张智江 刘韵洁 李忠诚 李国杰 |
| 作者单位： | 1. 中国科学院计算所,北京,100080;中国联合通信有限公司,技术部博士后科研工作站,北京,100032 2. 中国联合通信有限公司,技术部博士后科研工作站,北京,100032 3. 中国科学院计算所,北京,100080 |
| 摘 要： | 针对目前基于节点过载算法不灵活、响应时间长的问题,结合下一代网络中 Parlay 网关过载控制的新的需求,设计了基于网络的、运营收入最大化的 Parlay 网关过载控制的模型。并将基于 agent 的线性规划理论引入到过载控制算法中,提出了基于 agent 线性规划理论的过载控制系统结构。实验表明,采用此方法,可以很快找出满足运营收入最大化的过载控制算法,且在大型软交换网络中具有良好的可伸缩性,可缩短过载控制的响应时间,提高控制灵敏度,且可灵活地按照地域等因素划分子网。 |
| 关 键 词： | 下一代网络 软交换 Parlay 过载控制 移动agent 线性规划 运营收入最大化 |
| 文章编号： | 1000-436X(2005)03-0092-07 |
| 修稿时间： | 2004-05-09 |
Maximum running revenue based parlay gateway overload control |
|
| ZHANG Yun-yong,ZHANG Zhi-jiang,LI Guo-jie,LIU Yun-jie,LI Zhong-cheng. Maximum running revenue based parlay gateway overload control[J]. Journal on Communications, 2005, 26(3): 95-103 | |
| Authors: | ZHANG Yun-yong ZHANG Zhi-jiang LI Guo-jie LIU Yun-jie LI Zhong-cheng |
| Affiliation: | ZHANG Yun-yong1,2,ZHANG Zhi-jiang2,LI Guo-jie1,LIU Yun-jie2,LI Zhong-cheng1 |
| Abstract: | Node based overload control algorithm is not flexible and has long responding time. And some new requirements of Parlay gateway overload control are needed in next generation network(NGN). Maximum revenue based network-based overload control model of Parlay gateway is proposed. Furthermore, agent linear programming theory is imported into network-based overload control algorithm. And overload control architecture based on agent linear programming is given out. Simulation results show that it is quick to find out maximum revenue based overload control algorithm and is scalable in large softswitch network. Also, it can reduce the responding time, improve control sensitivity and divide subnets flexibly according to the different areas. |
| Keywords: | next generation network softswitch overload control mobile agent linear programming maximum revues |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
| 点击此处可从《通信学报》浏览原始摘要信息 | |
| 点击此处可从《通信学报》下载全文 | |