计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (25): 153-155.

• 网络、通信与安全 • 上一篇    下一篇

一种改进的Parlay多业务环境资源分配算法

张奇支,范冰冰   

  1. 华南师范大学 计算机学院,广州 510631
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-09-01 发布日期:2007-09-01
  • 通讯作者: 张奇支

Proved resource allocation algorithm in Parlay multi-service environment

ZHANG Qi-zhi,FAN Bing-bing   

  1. Computer School,South China Normal University,Guangzhou 510631,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-01 Published:2007-09-01
  • Contact: ZHANG Qi-zhi

摘要: 针对Parlay多业务环境下由软交换业务发起的业务请求和由Web服务器发起的业务请求,提出了一种改进的自适应资源分配算法。该算法通过识别不同业务负荷的轻重程度,自动调整为其分配的资源数目,在保证一定的公平性和系统稳定的前提下,使资源得到充分的利用。仿真结果表明,这种自适应的资源分配算法能有效地满足下一代网络多业务环境中各业务的需要。

关键词: Parlay, 下一代网络, 应用服务器, 资源分配算法

Abstract: A proved adaptive resource allocation algorithm has been presented to the service request launched by softswitch service and Web server in Parlay multi-service environment.The algorithm can adjust the allocated number of resources automatically by identifying the loads of each service.Taking the fairness and the stability of system as the prerequisite,it can use the resources fully.The simulation results indicate that this adaptive resource allocation algorithm can satisfy the requirement of each service in the multi-service environment of next generation network.

Key words: Parlay, next generation network, application service, resource allocation algorithm