The enhanced exponentially weighted moving average method: a modified flow enforcement technique for ATM networks

Ibrahim, Tarek F.; Chakravarthy, C.V.

doi:10.1109/icc.1994.368880

Cited by 5 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have found the upper bound on average queue length in Equation (6) and the louse lower bound in Equation (7). The numerical results point out the overestimation in Lee's work which would result in a waste in allocating network resources.…”

Section: Numerical Results and Discussionmentioning

confidence: 75%

Bounds for Multiplexing Leaky‐bucket Enforced Sources in Atm Networks

Wu¹,

Kuo²

1996

Int J Communication

View full text Add to dashboard Cite

Leaky-bucket (LB) based traffic parameters are widely used for traffic declaration and monitoring (enforcing) in asynchronous transfer mode ( A m ) networks. For such a system, every traffic source is policed by an LB enforcer before entering the access node at the edge of the network. In this article, we investigate the characteristics of the model that such traffic sources are multiplexed together by a multiplexer in the edge node. Based on the worst case performance, we derive the upper bound and the lower bound of queue length at the multiplexer as functions of the LB parameters and number of connections. In particular, we also take the peak cell rate, which is an important parameter, into consideration. We also modify the well-known Little's formula which is derived based on long-term average, to be suitable for a complete busy period. It helps us to derive bounds on average waiting time by way of average queue length. . His research interests include high-speed networks, broadband ISDN, mobile communications and queueing theory.

show abstract

Section: Numerical Results and Discussionmentioning

confidence: 75%