Dynamic Resource Allocation Algorithm in Parlay Multi-Service Environment-Reference-Cited by-同舟云学术

Dynamic Resource Allocation Algorithm in Parlay Multi-Service Environment

Published:2012-07 Issue: Volume:546-547 Page:1470-1477
ISSN:1662-8985
Container-title:Advanced Materials Research
language:
Short-container-title:AMR

Author:

Wang Qin¹,Wang Jun Ping¹,Zhu Qi Liang¹

Affiliation:

1. Beijing University of Posts and Telecommunications

Abstract

In the next generation network, there are more and more types of service. And the resource allocation control is more and more difficult. So it is very useful to do some research in this field. An algorithm which is flexible and adaptive can make the parlay gateway works better. In this paper a proved adaptive and sensitive resource allocation algorithm has been presented in the environment of Parlay multi-service. The simulation results indicate that this algorithm can satisfy the requirements of different kinds of service. The Parlay gateway can make full use of resource using this algorithm.

Publisher

Trans Tech Publications, Ltd.

Subject

General Engineering

Link

https://www.scientific.net/AMR.546-547.1470.pdf

Reference7 articles.

1. ZHANG Qi-zhi, FAN Bing-bing. Proved resource allocation algorithm in Parlay multi-service environment. Computer Engineering and Application, 2007, 43(25): 153-155.

2. Ma Xutao, Liao Jianxin, Zhu Xiaomin. The Performance Analyse of SSDB Mechanism in Parlay Multi-Service Environment. Journal of Beijing University of Posts and Telecommunications, 2005, 28(6): 34-38.

3. Li Tonghong, LiaoJianxin, Chen Junliang. The study of SCP overload control in intelligent network[J]. Acta Electronica Sinica, 1999, 27(4): 1-5.

4. Li Aolei, Li Zhizhu. Simulation and application of loading balance policy in distributed web server[J]. Journal of Shanghai Jiao Tong University, 2003, 37(6): 982-896.

5. Chaira T, Ray A K. Segmentation using fuzzy divergence[J]. Pattern Recognition Letters, 2003, 12(24): 1837-1844.