Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Mitra, J. Morrison (1995)
Multiple Time Scale Regulation and Worst Case Processes for ATM Network ControlProceedings of 1995 34th IEEE Conference on Decision and Control, 1
C. Courcoubetis, F. Kelly, R. Weber (2000)
Measurement-Based Usage Charges in Comminucations NetworksOper. Res., 48
R. Boorstyn, A. Burchard, J. Liebeherr, Chaiwat Oottamakorn (2000)
Statistical service assurances for traffic scheduling algorithmsIEEE Journal on Selected Areas in Communications, 18
D. Botvich, N. Duffield (1995)
Large deviations, the shape of the loss curve, and economies of scale in large multiplexersQueueing Systems, 20
M. Denker, C. Grillenberger, K. Sigmund (1976)
Ergodic Theory on Compact Spaces
G. Kesidis, T. Konstantopoulos (2000)
Extremal shape-controlled traffic patterns in high-speed networksIEEE Trans. Commun., 48
B. Doshi (1993)
Deterministic rule based traffic descriptors for broadband ISDN: worst case behavior and connection acceptance controlProceedings of GLOBECOM '93. IEEE Global Telecommunications Conference
F. Presti, Zhi-Li Zhang, J. Kurose, D. Towsley (1997)
Source time scale and optimal buffer/bandwidth trade-off for regulated traffic in an ATM nodeProceedings of INFOCOM '97, 2
C. Courcoubetis, R. Weber (1996)
Buffer overflow asymptotics for a buffer handling many traffic sourcesJournal of Applied Probability, 33
D. Lee (1994)
Effects of leaky bucket parameters on the average queueing delay: worst case analysisProceedings of INFOCOM '94 Conference on Computer Communications
J. Turner (1986)
New directions in communications (or which way to the information age?)IEEE Communications Magazine, 24
S. Shioda (1998)
WORST-CASE PERFORMANCE OF ATM MULTIPLEXER WITH GCRA-CONFORMING ARRIVAL PROCESSESJournal of The Operations Research Society of Japan, 41
G. Kesidis, T. Konstantopoulos (2000)
Worst-case performance of a buffer with independent shaped arrival processesIEEE Communications Letters, 4
C. Walsh (2003)
Maximal Effective Bandwidth of Constrained TrafficQueueing Systems, 44
S. Rajagopal, M. Reisslein, K. Ross (2002)
Packet multiplexers with adversarial regulated trafficProceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98, 1
A. Puhalskii (1996)
Large deviation analysis of the single server queueQueueing Systems, 23
W. Rudin (1968)
Real and complex analysis
R. Cruz (1991)
A calculus for network delay, Part I: Network elements in isolationIEEE Trans. Inf. Theory, 37
D. Varberg (1973)
Convex Functions
F. Kelly (1994)
Notes on effective bandwidths
We address the problem of finding the worst possible traffic a user of a telecommunications network can send. We take “worst” to mean having the highest effective bandwidth, a concept that arises in the Large Deviation theory of queueing networks. The traffic is assumed to be stationary and to satisfy “leaky bucket” constraints, which represent the a priori knowledge the network operator has concerning the traffic. Firstly, we show that this optimization problem may be reduced to an optimization over periodic traffic sources. Then, using convexity methods, we show that the realizations of a worst case source must have the following properties: at each instant the transmission rate must be either zero, the peak rate, or the leaky bucket rate; it may only be the latter when the leaky bucket is empty or full; each burst of activity must either start with the leaky bucket empty or end with it full.
Applied Mathematics and Optimization – Springer Journals
Published: Aug 1, 2003
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.