An admission control model through outband signalling management

A dynamic window model is developed which provides admission control for circuit switched networks through the signaling network. This model incorporates distributed processing while achieving desired global congestion control effects. It reflects the interaction between the circuit switched path in the telephone network and the packet switched path in the signaling network. The model is solved by applying the concept of parametric analysis to study the whole circuit switching subnetwork as a composite server. The variant service rate is derived for the composite server of the circuit switch trunk in the context of a closed chain where the arrival of call services is finite. To avoid overflow and combinatorial complex problems, the computation is reduced to the Erlang recursive form. Mean value analysis formulas are derived for the model. Examples are given to demonstrate the validation of the analysis.<<ETX>>

[1]  R. H. Cardwell,et al.  Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.

[2]  Samuel P. Morgan.  Window flow control on a trunked byte-stream virtual circuit , 1988, IEEE Trans. Commun..

[3]  Debasis Mitra,et al.  Optimal design of windows for high speed data networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[4]  Frank Kelly.  Blocking and routing in circuit-switched networks , 1986 .

[5]  M. Schwartz,et al.  Telecommunication networks present and future , 1990, Proceedings of the 1990 IEEE Colloquium in South America.

[6]  Ian F. Akyildiz,et al.  Performance optimization of distributed-system models with unreliable servers , 1990 .

[7]  David Tipper,et al.  The performance of adaptive window flow controls in a dynamic load environment , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[8]  D. Haenschke,et al.  Network Management and Congestion in the U.S. Telecommunications Network , 1981, IEEE Trans. Commun..

[9]  Debasis Mitra,et al.  Dynamic adaptive windows for high speed data networks: theory and simulations , 1990, SIGCOMM '90.

[10]  Martin Reiser,et al.  Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks , 1981, Perform. Evaluation.

[11]  G. Willmann,et al.  Performance modeling of Signaling System No.7 , 1990, IEEE Communications Magazine.

[12]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[13]  H. T. Mouftah,et al.  Performance evaluation of congestion avoidance in broadband ISDNs , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[14]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[15]  D. Mitra,et al.  Dynamic adaptive windows for high speed data networks: theory and simulations , 1990, SIGCOMM 1990.

[16]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.