中国邮电高校学报(英文) ›› 2008, Vol. 15 ›› Issue (1): 43-47.doi: 1005-8885 (2008) 01-0043-05

• Network • 上一篇    下一篇

On overload control of parlay application server in next generation network

张奇之   

  1. School of Computer, South China Normal University, Guangzhou 510631, China
  • 收稿日期:2007-02-04 修回日期:1900-01-01 出版日期:2008-03-31
  • 通讯作者: 张奇之

On overload control of parlay application server in next generation network

  1. School of Computer, South China Normal University, Guangzhou 510631, China
  • Received:2007-02-04 Revised:1900-01-01 Online:2008-03-31
  • Contact: Zhang Qizhi

摘要:

After analyzing the features of the Parlay application server (AS), which provides many services with different time constraints in the next generation network (NGN), a self- adapted overload control algorithm implemented in Parlay AS is proposed. In this algorithm, the service process module in parlay AS uses the earliest deadline first (EDF) serving rule to serve messages, and the overload control mechanism, using the Leaky Bucket algorithm to control message flows, is triggered by estimating the queue waiting time of a newly arriving message. By simulation it shows that this algorithm is a simple, easy-to-use, and available algorithm.

关键词:

parlay;application;server,;overload;control,;NGN,;EDF

Abstract:

After analyzing the features of the Parlay application server (AS), which provides many services with different time constraints in the next generation network (NGN), a self- adapted overload control algorithm implemented in Parlay AS is proposed. In this algorithm, the service process module in parlay AS uses the earliest deadline first (EDF) serving rule to serve messages, and the overload control mechanism, using the Leaky Bucket algorithm to control message flows, is triggered by estimating the queue waiting time of a newly arriving message. By simulation it shows that this algorithm is a simple, easy-to-use, and available algorithm.

Key words:

parlay application server;overload control;NGN;EDF

中图分类号: