A. Elwalid, et al., A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node, IEEE Journal on Selected Areas in Communications (1995) 1115 -- 1127.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....traffic, Eqn. 48) implies that P and ae are bounded by P = A (1) ae = lim t 1 : 49) The regulated arrival model is a suitable description when the amount of traffic that enters the network is limited at the network edge, e.g. by a leaky bucket, and has been studied extensively [9, 10, 21]. Consider a collection C of flows which are regulated by subadditive functions A , and let P i and ae i be the peak rate and average rate constraints implied by A i . Clearly, the aggregate of the flows A C is bounded i2C A , with peak and longtime average rates bounded by P C = ....

A. Elwalid, D. Mitra, and R. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115--1127, August 1995.

....is an abbreviated version of [1] I. INTRODUCTION Performance guarantees in QoS networks are either deterministic or statistical. A deterministic service guarantees that all packets from a flow satisfy given worst case end to end delay bounds and no packets are dropped in the network [2] 4] [8], 15] A deterministic service provides the highest level of QoS guarantees, however, it leaves a significant portion of network resources on the average unused [22] A statistical service makes probabilistic service guaran This work is supported in part by the National Science Foundation ....

....statistical independence of flows. Since it is often not feasible to obtain a reliable statistical characterization of traffic sources, recent research on statistical QoS has attempted to exploit statistical multiplexing without assuming a specific source model. Starting with the seminal work in [8], researchers have investigated the statistical multiplexing gain by only assuming that flows are statistically independent, and that traffic from each flow is constrained by a deterministic regulator, e.g. by a leaky bucket [5] 8] 7] 9] 10] 12] 16] 17] 19] 20] 21] ....

[Article contains additional citation context not shown here]

A. Elwalid, D. Mitra, and R. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115--1127, August 1995.

....constant off time T 2 . The rationale of considering these sources is that it is generally believed that they generate the worst case traffic that can depart from the policer (a device to enforce a traffic stream to be compliant to a number of traffic parameters) see Elwalid, Mitra, and Wentworth [8]. No exact analysis is available for the loss probability of this model. Scaling and large deviations. Suppose n statistically identical (Markov fluid or periodic) sources. Scale buffer and capacity: B = nb and C = nc: Denote with H n the loss probability in the model with n sources. The ....

A. Elwalid, D. Mitra and R. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous regulated traffic in ATM node. IEEE Journal of Selected Areas in Communications, 15: 1115 -- 1127, 1995.

....been analyzed successfully. However, the model with deterministic on off traffic is known to be notoriously difficult, and no closed form solution is known. Contribution of this work. A significant contribution on the performance of a node with regulated input is by Elwalid, Mitra, and Wentworth [10]. They present an insightful procedure for calculating an upper bound to the loss probability. They translate a technique to estimate loss probabilities into a manageable admission control (for more results on admission control, see also [12] and survey paper [25] However, the construction ....

....To avoid trivialities, i N i r i C i N i p i : B. Literature This subsection reviews and evaluates the existing literature in the field of queues fed by adversarial traffic. We distinguish between three approaches: exact bounds, the virtual buffer trunk construction by Elwalid et al. [10], and large deviations asymptotics. Exact bounds. Kvols and Blaabjerg [16] consider the discrete time version of our model it is assumed that there are N homogeneous sources. Then the model is equivalently given, by on time T , off time T and cell spacing D (i.e. during bursts every D time ....

[Article contains additional citation context not shown here]

A. Elwalid, D. Mitra, and R. H. Wentworth. A New Approach for Allocating Buffers and Bandwidth to Heterogenous, Regulated Traffic in an ATM Node. IEEE Journal on Selected Areas in Communications, 13(6):1115--1127, Aug. 1995.

....Handover entity, located at the MT. 6.1.1.2.5. Wireless Connection Admission Control (WCAC) In general CAC is responsible for deciding whether the network can serve a new connection, while the traffic contracts of the already established connections are preserved [GAPU96] SAIT92] RSKJ91] [EMW95], PEEL96] KEWC96] ELMI93] ABSO94] CCYC97] In Wireless ATM Networks, two Connection Admission Controls exist. The first one is located in the switch that the APs are connected to and it performs the functions that any fixed network CAC would do to check if the new connection could be ....

A. Edwalid, D. Mitra, R. Wentworth, `A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM node', IEEE JSAC, vol. 13, 1995, pp. 1115-1127.

....compared to 23 for peak rate allocation. However, the assumption that the sources can simultaneously produce worst case traffic yields a strict admission control policy. By taking sources to be statistically independent and allowing the possibility of a few losses, Elwalid, Mitra, and Wentworth [50] show that further multiplexing gains can be extracted while retaining the adversarial worst case behavior of individual sources. For independent shaped sources, Mitra and Morrison [61] show that traffic processes which maximize the loss probability estimate (using Chernoff bounds) are periodic, ....

....worst case behavior of individual sources. For independent shaped sources, Mitra and Morrison [61] show that traffic processes which maximize the loss probability estimate (using Chernoff bounds) are periodic, on off processes with random phases. Admission control schemes are proposed in [50] for use in this scenario of worst case source behavior, statistically independent sources, and an allowed small loss in the network. 7 Constrained VBR Only so much can be accomplished by smoothing the output of an unconstrained video encoder with S VBR. In some cases, the output still may not ....

A. Elwalid, D. Mitra, and H. Wentworth, "A New Approach for Allocating Buffers and Band- width to Heterogeneous Regulated Traffic in an ATM Node," IEEE J. Select Areas of Commu- nications: Special Issue on Fundamental Advances in Networking, Vol. 13, No. 6, pp. 1115-1127, August, 1995.

....probability. The queue length tail probabilities for the 2 state markovian model have been studied well in the literature, and large deviations estimates have been developed [5] PfQ qg Le Gammaffiq (7) where L is the loss in bufferless multiplexing as estimated from Chernoff s theorem [6]: log L k j logf1 Gamma w j w j e s h j g Gamma s C (8) wherein w j = j = j j ) and s is the solution of: k j w j h j e 1 Gamma w j w j e = C (9) The queue length decay rate ffi in (7) is computed from: ffi = maxfs : k j ff j (s) Cg (10) where ff j (s) ....

A. Elwalid, D. Mitra, and R. H. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an atm node. IEEE Journal on Selected Areas in Communications, 13(6):1115--1127, August 1995.

....q is a Gaussian random variable, it is easy to show that lnE[e q] qO q crq202. Therefore, the tightest bound is given by ] 22 (11) lnPr[q B] OB qO rrq . Since the right hand side of the inequality has the minimum at 0 = B q we have the following large deviations approximation [12] for overflow probability lnPr[q B] B q)2 (12) 2rrq 2 Solving this for B, we know that the buffer requirement for a target overflow probability is given by B q q rrq (13) where 45 = V 21nPr[q B] A refined large deviations approximation [12] gives lnPr[q B] B q)2 ) 14) 2rr ....

.... the following large deviations approximation [12] for overflow probability lnPr[q B] B q)2 (12) 2rrq 2 Solving this for B, we know that the buffer requirement for a target overflow probability is given by B q q rrq (13) where 45 = V 21nPr[q B] A refined large deviations approximation [12] gives lnPr[q B] B q)2 ) 14) 2rr ln( x q) In this case, 45 can be found by numerically solving 452 2 ln(Pr[q ] x : 0. Another approximation found in the literature [13] is lnPr[q B] B q)2 ln(x ) 2 2 and 45 = V 2 lnPr[q B] ln(x ) 15) 3.3 Departure Process Since ....

[Article contains additional citation context not shown here]

A. Elwalid, D. Mitra and R. H. Wentworth, "A New Approach for Allocating Buffers and Bandwidth to Heterogeneous, Regulated Traffic in an ATM Node", IEEE J. Select. Areas Commun., vol. 13, no. 6, Aug. 1995, pp. 1115-1127.

....traffic contracts. Sources that conform to leaky bucket characterizations are said to be regulated sources. In recent years, several research teams have carefully studied the problem of providing statistical QoS guarantees to regulated sources that are multiplexed in a single shared buffer [15][33] 37] With shared buffer multiplexers, however, it is difficult (if not impossible) to tightly characterize a connection s traffic once the traffic passes through the shared buffer. Therefore, the existing solutions do not extend to the network environment in a satisfactory manner. Although ....

....of the independent random variables. An approxi mate convolution algorithm is described in [28] However, convolution often leads to numerical problems. We there fore apply the Large Deviation (LD) approximation, which is known to be accurate and also computationally very effi cient [43] 13] [15], 40] to the expectation in the numer ator. Towards this end, let . s) denote the logarithm of the moment generating of We define Note that u (s) lnE[eSV ] v : by the independence of the U s. The large deviation (LD) approximation gives the following approximation for 5; ....

[Article contains additional citation context not shown here]

A. Elwalid, D. Mitra, and R. H. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115 1127, August 1995.

....distributions of the independent random variables. An approximate convolution algorithm is described in [7] However, convolution often leads to numerical prob lems. We therefore apply the Large Deviation (LD) approximation, which is known to be accurate and also computationally very efficient [13, 4, 5, 11], to the expectation in the numerator. Towards this end, let u (s) denote the logarithm of the moment generating of us(s) lnE[e US] We define U : U. Note that by the independence of the U s. The large deviation (LD) approximation gives the following approximation for O [13] 1 e ....

....for smoothing bufferless multiplexing and GPS. The GPS performance is independent of the number of traversed hops. and C = 45 Mbit sec. For our smoothing bufferless multiplexing scheme we set the loss bound to e = 10 7. These parameters are also used for some some of the numerical examples in [5]. In Figure 4 we plot the maximum number of connections J that can be supported by the nodes I through N without violating any QoS requirements as a function of the number of hops, N. We do this for two delay bounds, d = 20 msec and d = 0.2 seconds. The maximum number of connec tions that can ....

A. Elwalid, D. Mitra, and R. H. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115 1127, August 1995.

....fairness. This failure will result in spite of fair bandwidth allocation policies applied at each transmission link in the entire network. Some researchers, for example, have already noticed that buffer allocation policies have an effect on the overall end to end fairness in bandwidth allocation [8 10]. Quality of service is often an end to end issue, of which end to end fairness is a critically important piece. Fair bandwidth allocation algorithms such as Weighted Fair Queueing [1, 2] have frequently been used as a component of an overall mechanism that ensures end to end delay guarantees. ....

A. Elwalid, D. Mitra, and R. H. Wentworth, "A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node," IEEE J. Select. Areas Commun., vol. 13, no. 6, pp. 1115--1127, Aug. 1995.

No context found.

A. Elwalid, D. Mitra and R.H. Wentworth, "A New Approach for Allocating Buffers and Bandwidth to Heterogeneous, Regulated Traffic in an ATM Node", IEEE IEEE Journal on Selected Areas in Communications, 13:6, pp. 1115-1127, Aug. 1995.

No context found.

A. Elwalid, et al., A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node, IEEE Journal on Selected Areas in Communications (1995) 1115 -- 1127.

No context found.

A. Elwalid, D. Mitra, and R. Wentworth. A New Approach for Allocating Buffers and Bandwidth to Heterogeneous, Regulated Traffic in an ATM Node. IEEE Journal on Selected Areas in Communications, 13(6):1115--1127, August 1995.

No context found.

A. Elwalid, D. Mitra, and R. H. Wentworth, "A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node," IEEE J. Select. Areas Commun., vol. 13, pp. 1115--1127, Aug. 1995.

No context found.

Anwar I. Elwalid, Debasis Mitra, and Robert H. Wentworth, "A new approach for allocating buffers and bandwidth to heterogeneous regulated traffic in an ATM node," IEEE Journal on Selected Areas in Communications, vol. 13, no. 6, pp. 1115--1127, August 1995.

No context found.

A. Elwalid, D. Mitra, and R.H. Wentworth. A New Approach for Allocating Buffers and Bandwidth to Heterogeneous, Regulated Traffic. IEEE Journal of Selected Areas in Communication, 13(6), August 1995.

No context found.

A. Elwalid, D. Mitra, and R. Wentworth. A new approach for allocating buffer and bandwidth to heterogeneous, regulated traffic in an atm node. IEEE Journal on Selected Area in Communications, 13(6):1115--1127, August 1995.

No context found.

A. Elwalid, Mitra D., and R. Wenworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in ATM node. IEEE Journal of Selected Areas in Communications, 13:1048--1056, August 1995.

No context found.

A. Elwalid, D. Mitra, and R. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115--1127, August 1995.

No context found.

A. Elwalid, Mitra D., and R. Wenworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in ATM node. IEEE Journal of Selected Areas in Communications, 13:1048--1056, August 1995.

No context found.

A. Elwalid, D. Mitra, R.H. Wentworth, "A New Approach for Allocating Buffers and Bandwidth to Heterogeneous, Regulated Traffic in an ATM Node," IEEE J. Select. Areas Commun., Vol. 13 No. 6, pp. 1115-1127, August 1995

No context found.

A. Elwalid, D. Mitra, and R. Wenworth, "A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in ATM node," IEEE J. Select. Areas Commun., vol. 13, pp. 1048--1056, Aug. 1995.

No context found.

A. Elwalid, D. Mitra, and R. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115--1127, August 1995.

No context found.

A. Elwalid, D. Mitra, and R. Wenworth, "A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in ATM node," IEEE Journal of Selected Areas in Communications, vol. 13, pp. 1048--1056, August 1995.

First 50 documents  Next 50

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