D. Mitra, M. I. Reiman, J. Wang, "Robust Dynamic Admission Control for Unified Cell and Call QoS in Statistical Multiplexers", IEEE Journal on Selected Areas in Communications, Vol. 16, No. 5, pp. 692-707, June, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... [13] 24] and [26] Application examples of this modeling paradigm include those concentrating on routing and call admission algorithms for QoS assured traffic classes in [9] and [29] and also those that are concerned with the optimal sharing of link bandwidth resources as in [8] and in [7] [18], 19] However, none of these models addresses the issue of applying this model to cases where elastic traffic is also present in the network, as detailed by the three bullet items in the Introduction. The notion of call admission control for elastic traffic and fairness issues are discussed by ....

D. Mitra, M. I. Reiman, J. Wang, "Robust Dynamic Admission Control for Unified Cell and Call QoS in Statistical Multiplexers", IEEE Journal on Selected Areas in Communications, Vol. 16, No. 5, pp. 692-707, June, 1998.

....The approach here could also make use of 17 equivalent abstractions of other resources (e.g. buffers, round robin slots, etc. It is assumed that these equivalent resources are kept for the duration of the connection. Other work that dynamically adjusts resource usage during a connection [39] [40] is not considered here. Arbitrary numbers of traffic classes Any number of traffic classes can be defined with every connection within the class being treated identically. Classes are differentiated by importance level and the amount of resources used by each connection. Multimedia ....

D. Mitra, M. I. Reiman, and J. Wang, "Robust Dynamic Admission Control for Unified Cell and Call QoS in Statistical Multiplexers," IEEE Journal on Selected Areas in Communications, Vol. 16, No. 5, June 1998, pp. 692-707.

.... call classes have a constraint on their maximum call blocking probability has been considered in [31] The problem of ensuring fairness across call classes has been tackled in a game theoretic setting in [32] Mitra and others seek to unify fairness across call classes with packet level QoS in [33]. The class level QoS in a network depends on how the entire bandwidth of the link is shared by the various classes. Two common ways of sharing the bandwidth of the link are the complete sharing and the complete partitioning policies [34] In the complete sharing policy, the entire bandwidth ....

....utility as a key measure of the network revenue. Therefore, call admission schemes have to consider the dual objectives of maximizing throughput and guaranteeing class level QoS. While admission control schemes have been developed by other researchers to maximize the network throughput (see [31] [33], 36] the objectives of guaranteeing class level QoS and maximizing throughput have not been considered together. In Chapter 5, we develop a call admission scheme that considers these two objectives together. In our discussion in Chapter 5, we assume that the bandwidth requirements of users ....

[Article contains additional citation context not shown here]

D. Mitra, M. I. Rieman, and J. Wang. Robust dynamic admission control for unified cell and call QoS in statistical multiplexers. IEEE Journal on Selected Areas in Communications, 16(5):692--707, June 1998. Also available from http://cm.bell-labs.com/cm/ms/who/mitra/pub.html.

....connection access control this is known as conservative control. An aggressive type controller might momentarily allow combinations that violate QoS if averaged over time the system meets QoS. This depends on the dynamics of the problem which we will not consider here, but is considered elsewhere [Mit98, Ton99]. For a given distribution of source combinations, f(S) and representation, F, each feature vector, f, has an associated QoS vector, q(f) q 1 (f) q l (f) that is the average 1 over the source combinations having feature f, e.g. 3.1) We formulate the QoS requirements in terms of the ....

Mitra, D., Reiman, M.I., Wang, J., "Robust dynamic admission control for unified cell and call QoS in statistical multiplexers," IEEE JSAC, v. 16, n. 5, pp. 692--707, 1998.

....that some basic properties of the network traffic are known from historic measurements: reliable values of the mean burst, silence and call duration are available. We try to exploit the dynamics of the system by measuring the current load, cf. the procedures proposed in Mitra, Reiman, and Wang [24]. This focus is fundamentally different from recent work on MBAC algorithms by Duffield [10] and Grossglauser and Tse [16] They concentrate on the estimation of traffic characteristics out of measurements; the intrinsic unreliability of the resulting estimates is taken into account in their ....

D. Mitra, M. Reiman, and J. Wang. Robust dynamic admission control for unified cell and call QoS in statistical multiplexers. IEEE Journal on Selected Areas in Communications, 16: 692 -- 707, 1998.

....10 3.2 Connection admission control (CAC) Connection admission control was one of the main items motivating us in this study. Although we do not derive results on CAC in this paper, we feel that our approach may be fruitful. Our approach is similar in spirit to that of Mitra, Reiman, and Wang [MRW], where fast times scales were assumed to mix quickly for the purpose of CAC. We now outline our approach and comment on implementation. A good admission control should not admit a customer if that admission would cause too high a probability of error in the foreseeable future. A Markovian control ....

Debasis Mitra, Martin I. Reiman, and Jie Wang, "Robust Dynamic Admission Control for Unified Cell and Call QoS in Statistical Multiplexers " IEEE J. Sel. Areas Commun. June, 1998.

....between nearby samples. Second, the underlying loss rate as a function of load for this is a standard result ( 9] that can be used for comparison, and it possesses the property that the loss rate is exponentially large with large load as is shown to be the case for more realistic situations ([10]) Thus, the M M 1 will give a clear insights into the implementation issues. The values of sample size T in the data set range from 5 Theta 10 5 to 10 6 , so if the underlying loss rate p(x) 10 Gamma6 , s=T will be a very unreliable estimate of p. In the following experiments we ....

Mitra, D., Reiman, M.I., Wang, J., "Robust dynamic admission control for unified cell and call QoS in statistical multiplexers", IEEE JSAC, Vol. 16, No. 5 pp. 692--707, June, 1998. 0.5 0.55 0.6 0.65 0.7 0.75 0.8 0.85 0.9 0.95

....into the network. CAC is a policy for accepting or rejecting call requests. The network wants to find a CAC policy that maximizes the long term revenue utility and meets QoS constraints. Maximizing revenue while meeting QoS constraints suggests a constrained semi Markov decision process (SMDP) [17]. The rapid growth in the number of states with problem complexity has led to RL approaches to the problem [15, 16] However, these RL applications have ignored QoS criteria. This work draws on a closely related and more fundamental problem of constrained optimization of (semi )Markov decision ....

....met. This will be described more precisely in the following sections. Unlike prior works, this paper simultaneously considers both problems, and provides methods that scale to larger problems, such as combined CAC and routing in networks. Unlike model based algorithms (e.g. linear programming in [17]) the RL algorithm used in this paper is a stochastic iterative algorithm, it does not require a priori knowledge of the state transition probabilities associated with the underlying Markov chain, and thus can be used to solve real network problems with large state spaces that cannot be handled ....

[Article contains additional citation context not shown here]

Mitra, D., Reiman, M. I., Wang, J., "Robust dynamic admission control for unified cell and call QoS in statistical multiplexers", IEEE J.S.A.C., vol. 16, no. 5, pp. 692--707, 1998.

....from customers for calls that it accepts into the network. The network wants to find a CAC and routing policy that maximizes the long term revenue utility and meets QoS constraints. Maximizing revenue while meeting QoS constraints suggests a constrained semiMarkov decision process (SMDP) as in Mitra, et al. (1998). The rapid growth in the number of states with problem complexity has led to RL approaches to the problem, as in Marbach and Tsitsiklis (1997) Marbach, et al. (1998) However, these RL applications have ignored QoS criteria. This work draws on a closely related and more fundamental problem of ....

....decision processes, which has been studied by researchers from control theory, operation re 2 H. TONG AND T. X BROWN search and artificial intelligence communities, see e.g. Altman and Shwartz (1991) Feinberg (1994) Gabor, et al. (1998) Unlike model based algorithms (e.g. linear programming in Mitra, et al., 1998), the RL algorithm used in this paper is a stochastic iterative algorithm, it does not require a priori knowledge of the state transition probabilities associated with the underlying Markov chain, and thus can be used to solve real network problems with large state spaces that cannot be handled by ....

[Article contains additional citation context not shown here]

Mitra, D., Reiman, M. I., & Wang, J. (1998). Robust dynamic admission control for unified cell and call QoS in statistical multiplexers. IEEE J.S.A.C., 16(5), 692--707.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC