Abstract
New requirements to the overload control of Parlay gateway are analyzed. And the maximum revenue based overload control model of Parlay gateway is proposed. Furthermore, the network-based overload control architecture based on the agent linear programming theory is proposed. And network overload control architecture based on linear programming is given out. Simulation results show that using agent linear method, it is quick to find out maximum revenue based overload control algorithm; also it is suitable for large-scale softswitch network.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hubaux: The Impact of the Internet on telecommunication architecture. Computer Networks 31, 257–273 (1999)
Parlay Group, Parlay 4.1 Specification, (2002), http://www.parlay.org/
Smith, D.E.: Ensuring Robust Call Throughput and Fairness for SCP Overload Controls. IEEE/ACM Transactions on Networking (5), 538–548 (1995)
Kihl, M., Nyberg, C.: Investigation of overload control algorithms for SCPs in the intelligent network. IEE Proc.-Commun. 6, 419–424 (1997)
Karmouch, A.: Special Section on Mobile Agents. IEEE Communications 7, 1–10 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, YY., Zhang, ZJ., Zhang, F., Li, YJ. (2004). A New Overload Control Algorithm of NGN Service Gateway. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004. GCC 2004. Lecture Notes in Computer Science, vol 3251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30208-7_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-30208-7_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23564-4
Online ISBN: 978-3-540-30208-7
eBook Packages: Springer Book Archive