Cheng-Shang Chang
ABSTRACT
In this paper, we consider the performance analysis problem for a work conserving link with a large number of independent regulated inputs. For such a problem, we derive simple stochastic bounds under a general traffic constraint for the inputs. The bound for queue length is shown to be a stochastic extension of the deterministic worst case bound and it is asymptotically tighter than the bound in Kesidis and Konstantopoulos [23]. We also test the bound by considering periodic inputs with independent starting phases. Based on Sanov's theorem and importance sampling, we propose a fast simulation algorithm that achieves significant variance reduction. The simulations results are compared with our stochastic bound and the bound in [23].
- 1.R. Boorstyn, A. Burchard, J. Liebeherr, and C. Oottamakorn, "Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet Networks," Proc. IEEE INFOCOM 2000, Vol. 3, pp. 1223-1232, Tel Aviv, Israel, 2000.Google Scholar
Cross Ref
- 2.D.D. Botvich and N.G. Duffield, "Large deviations, the shape of the loss curve, and economies of scale in large multiplexers," Queueing Systems, Vol. 20, pp. 293-320, 1995.Google ScholarCross Ref
- 3.J. Bucklew. Large Deviation Techniques in Decision, Simulation and Estimation. New York, NY: J. Wiley & Sons, Inc., 1990.Google Scholar
- 4.C.S. Chang, "Stability, queue length and delay of deterministic and stochastic queueing networks," IEEE Trans. Automat. Contr., vol. 39, pp. 913-931, 1994.Google ScholarCross Ref
- 5.C.S. Chang, Performance Guarantees in Communication Networks, Springer-Verlag, 2000. Google ScholarDigital Library
- 6.H. Cramer, "Surun nouveau theoreme-limite de la theorie des probabilites." In Actualites Scientiques et Industrielles, number 736 in Colloque consacreala heorie des probabilites, pp. 5-23. Hermann, Paris, 1938.Google Scholar
- 7.C. Courcoubetis, F. Kelly and R. Weber, "Measurement-based usage charges in communication networks," preprint, 1998. Available from http://www.statslab.cam.ac.uk/~frank.Google Scholar
- 8.R.L. Cruz, "A calculus for network delay, Part I: Network elements in isolation," IEEE Trans. Inform. Theory, vol. 37, pp. 114-131, 1991.Google ScholarDigital Library
- 9.A. Dembo and O. Zeitouni. Large Deviations Techniques and Applications. Boston: Jones and Barlett Publishers, 1992.Google Scholar
- 10.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, Vol. 13, pp. 1115-1127, 1995. Google ScholarDigital Library
- 11.G. Hebuterne and J.Y. Le Boudec, "Comments on "a deterministic approach to the end-to-end analysis of packet ows in connection oriented networks"", IEEE/ACM Transactions on Networking, Vol. 8, No. 1, Feb., 2000. Google ScholarDigital Library
- 12.P. Heidelberger, "Fast simulation of rare events in queueing and reliability models," IBM Research Report RC 19028, Yorktown Heights, New York, 1993. Preliminary version appears in Performance Evaluation of Computer and Communications Systems, Springer Verlag, Lecture Notes in Computer Science, Volume 729, 165-202. Google ScholarDigital Library
- 13.(IETF Internet draft) Y. Bernet, J. Binder, S. Blake, M. Carlson, S. Keshav, B. Ohlman, D. Verma, Z. Wang, and W. Weiss, "A framework for differentied services," http://www.ietf.org/html.charters/diffservcharter.html, 1998.Google Scholar
- 14.(IETF Internet draft) S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang and W. Weiss, "An architecture of differentiated services," http://www.ietf.org/html.charters/diffservcharter.html, 1998.Google Scholar
- 15.(IETF Internet draft) K. Nichols, S. Blake, F. Baker, and D. Black, "Definition of the differentiated services field (DS field) in the IPv4 and IPv6 headers," http://www.ietf.org/html.charters/diffservcharter.html, 1998.Google Scholar
- 16.(IETF Internet draft) V. Jacobson, K. Nichols, and K. Poduri, "An expedited forwarding PHB," http://www.ietf.org/html.charters/diffservcharter.html, 1998.Google Scholar
- 17.(IETF RFC 2205) L. Zhang, S. Berson, S. Herzog, and S. Jamin, "Resource ReSerVation Protocol (RSVP)," ftp://ds.internic.net/rfc/rfc2205.txt, 1997.Google Scholar
- 18.(IETF RFC 2210) J. Wroclawski, "The use of RSVP with IETF integrated service," ftp://ds.internic.net/rfc/rfc2210.txt, 1997.Google Scholar
- 19.(IETF RFC 2211) J. Wroclawski, "Specification of the controlled-load network element service," ftp://ds.internic.net/rfc/rfc2211.txt, 1997.Google Scholar
- 20.(IETF RFC 2212) S. Shenker, C. Patridge and R. Guerin, "Specification of guaranteed quality of service," ftp://ds.internic.net/rfc/rfc2212.txt, 1997.Google Scholar
- 21.(IETF RFC 2215) S. Shenker and J. Wroclawski, "General characterization parameters for integrated service network elements," ftp://ds.internic.net/rfc/rfc2215.txt, 1997.Google Scholar
- 22.(IETF RFC 2216) S. Shenker and J. Wroclawski, "Network element service specification template," ftp://ds.internic.net/rfc/rfc2216.txt, 1997.Google Scholar
- 23.G. Kesidis and T. Konstantopoulos, "Worst-case performance of a buffer with independent shaped arrival processes," to appear in IEEE Communications Letters. Available from http://cheetah.vlsi.uwaterloo.ca.Google Scholar
- 24.G. Kesidis and T. Konstantopoulos, "Extremal traffic and worst-case performance for queues with shaped arrivals," to appear in Fields Institute Communications. Available from http://cheetah.vlsi.uwaterloo.ca.Google Scholar
- 25.E. Knightly, "Enforceable quality of service guarantees for bursty traffic streams," Proc. of IEEE INFOCOM'98, pp. 635-642, San Francisco, March, 1998.Google Scholar
- 26.J.F. Kurose, "On computing per-session performance bounds in high-speed multi-hop computer networks," SIGMETRICS and PERFORMANCE'92. Google ScholarDigital Library
- 27.F. LoPresti, Z. Zhang, J. Kurose and D. Towsley, "Source time scale and optimal buffer/bandwidth tradeoff for regulated traffic in an ATM node," Proc. IEEE INFOCOM'97, pp. 676-683, Kobe, Japan, April, 1997.Google ScholarCross Ref
- 28.M. Mandjes and A. Ridder, "Optimal trajectory to over flow in a queue fed by a large number of sources," Queueing Systems, Vol. 31, pp. 137-170, 1999. Google ScholarDigital Library
- 29.M. Reisslein, K.W. Ross, and S. Rajagopal, "A framework for guaranteeing statistical QoS," Feb., 1999. Available from http://www.eurecom.fr/~ross.Google Scholar
- 30.S.M. Ross, Stochastic Processes. New York: J. Wiley & Sons, 1983.Google Scholar
- 31.I.N. Sanov, "On the probability of large deviations of random variables," in Russian, 1957. (English translation from Mat. Sb. (42)) in Selected Translations in Mathematical Statistics and Probability I (1961), pp. 213-244).Google Scholar
- 32.W. Song and B. Schmeiser, "Reporting the Precision of Simulation Experiments," New Directions in Simulation for Manufacturing and Communications, pp. 402-407, 1994.Google Scholar
- 33.A. Shwartz and A. Weiss. Large Deviations for Performance Analysis: Queues, Communication and Computing. 1994.Google Scholar
- 34.A. Simonian and J. Guibert, "Large deviations approximations for uid queues fed by a large number of on/off sources," IEEE Journal on Selected Areas in Communications, Vol. 13, pp. 1017-1027, 1995. Google ScholarDigital Library
- 35.D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, Berlin: J. Wiley & Sons, 1983.Google Scholar
- On the performance of multiplexing independent regulated inputs
Recommendations
On the performance of multiplexing independent regulated inputs
In this paper, we consider the performance analysis problem for a work conserving link with a large number of independent regulated inputs. For such a problem, we derive simple stochastic bounds under a general traffic constraint for the inputs. The ...
Large deviation analysis for multiplexing independent regulated inputs
In this paper, we consider the performance analysis problem for a work conserving link with a large number of independent regulated inputs. For such a problem, we derive simple stochastic bounds under a general traffic constraint for the inputs. The ...
Performance of Space–Time Codes: Gallager Bounds and Weight Enumeration
Since the standard union bound for space-time codes may diverge in quasi-static fading channels, the limit-before-average (LBA) technique has been exploited to derive tight performance bounds. However, it suffers from the computational burden arising ...
Comments