Abstract
In this paper, we investigate the admission-control problem for voice traffic in fixed-route circuit-switched wireless networks. We consider coordinate-convex admission-control policies and a “blocked-calls-cleared” mode of operation, in conjunction with the usual assumptions on the voice process statistics. These conditions result in a product-form stationary distribution for the voice state of the system, which facilitates the evaluation of network performance. However, to determine the optimal policy a large state space must be searched. We develop a recursive procedure to accelerate the evaluation of a large number of different admission-control policies, and a descent-search method to reduce significantly the number of policies that must be evaluated in searching for the optimal one. The numerical examples we present indicate that reduced blocking probability (or increased throughput) can be obtained by administering active admission control. The degree of improvement is highest in moderately overloaded traffic conditions, but it is typically small in low-capacity networks (at all loads). However, in applications where the performance measure associates different revenues or costs with the various call types, considerable improvement can be obtained when admission control is used.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.M. Aein, A multi-user-class, blocked-calls-cleared, demand access model, IEEE Trans. Commun. COM-26(3) (1978) 378–385.
J.M. Akinpelu, The overload performance of engineered networks with nonhierarchical and hierarchical routing, AT&T Bell Labs. Tech. J. 63(7) (1984) 1261–1281.
D.J. Baker, A. Ephremides and J.A. Flynn, The design and simulation of a mobile radio network with distributed control, IEEE J. SAC SAC-2(1) (1984) 226–237.
C.M. Barnhart, J.E. Wieselthier and A. Ephremides, Admission control in integrated voice/data multihop radio networks, NRL/MR/5521-93-7196, Naval Research Laboratory (1993).
D. Bertsekas and R. Gallager,Data Networks (Prentice Hall, Englewood Cliffs, 1987).
D.Y. Burman, J.P. Lehoczky and Y. Lim, Insensitivity of blocking probabilities in a circuit-switching network, J. Appl. Prob. 21 (1984) 850–859.
A.E. Conway and N.D. Georganas,Queueing Networks - Exact Computational Algorithms: A Unified Theory Based on Decomposition and Aggregation (The MIT Press, Cambridge, MA, 1989).
G.J. Coviello and P.A. Vena, Integration of circuit/packet switching by a SENET (slotted envelope network) concept, in:Record National Telecommunications Conf. (1975) 42.12-42.17.
A. Ephremides, J.E. Wieselthier and D.J. Baker, A design concept for reliable mobile radio networks with frequency hopping signaling, Proc. IEEE 75(1) (1987) 56–73.
G.J. Foschini and B. Gopinath, Sharing memory optimally, IEEE Trans. Commun. COM-31(3) (1983) 352–360.
Y.-C. Ho, R.S. Sreenivas and P. Vakili, Ordinal optimization of DEDS, J. Disc. Event Dyn. Syst. 2(1992) 61–88.
S. Jordan, A continuous state space model of multiple service, multiple resource communication networks, IEEE Trans. Commun. 43(2/3/4) (1995) 477–484.
S. Jordan and P. Varaiya, Throughput in multiple service, multiple resource communication networks, IEEE Trans. Commun. 39(8) (1991) 1216–1222.
S. Jordan and P. Varaiya, Control of multiple service, multiple resource communication networks, IEEE Trans. Commun. 42(11) (1994) 2979–2988.
F.P. Kelly, Blocking probabilities in large circuit-switched networks, Adv. Appl. Prob. 18 (1986) 473–505.
G. Louth, M. Mitzenmacher and F. Kelly, Computational complexity of loss networks, Theor. Comp. Sci. 125 (1994) 45–59.
K.W. Ross and D. Tsang, Teletraffic engineering for product-form circuit-switched networks, Adv. Appl. Prob. 22 (1990) 657–675.
J.H. Weber, A simulation study of routing and control in communications networks, Bell Syst. Tech. J. 43 (1964) 2639–2676.
J.E. Wieselthier, C.M. Barnhart and A. Ephremides, A neural network approach to routing without interference in multihop radio networks, IEEE Trans. Commun. 42(1) (1994) 166–177.
J.E. Wieselthier, C.M. Barnhart and A. Ephremides, On the problems of data-delay evaluation and minimization in wireless integrated voice/data networks,Proc. 1994 IEEE Int. Symp. on Information Theory, Trondheim, Norway (1994) p. 407.
J.E. Wieselthier, C.M. Barnhart and A. Ephremides, Data-delay evaluation in integrated wireless networks based on local product-form solutions for voice occupancy, submitted to Wireless Networks (1995).
J.E. Wieselthier, C.M. Barnhart and A. Ephremides, A mini-product-form-based solution to data-delay evaluation in wireless integrated voice/data networks,Proc. IEEE INFOCOM'95, Boston, MA (1995) pp. 1044–1052.
J.E. Wieselthier, C.M. Barnhart and A. Ephremides, Standard clock simulation and ordinal optimization applied to admission control in integrated communication networks, J. Disc. Event Dyn. Syst. 5 (1995) 243–280.
J.E. Wieselthier and A. Ephremides, Fixed- and movable-boundary channel-access schemes for integrated voice/data networks, IEEE Trans. Commun. 43 (1995) 64–74.
Wolfram Research, Inc.,Mathematica (Wolfram Research, Inc., Champaign, Illinois, 1991).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Barnhart, C.M., Wieselthier, J.E. & Ephremides, A. Admission-control policies for multihop wireless networks. Wireless Netw 1, 373–387 (1995). https://doi.org/10.1007/BF01985751
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01985751