Browse > Article

Worst Closed-Loop Controlled Bulk Distributions of Stochastic Arrival Processes for Queue Performance  

Lee Daniel C. (Department of Computer Science and Engineering at Wright State University)
Publication Information
Journal of Communications and Networks / v.7, no.1, 2005 , pp. 87-92 More about this Journal
Abstract
This paper presents basic queueing analysis contributing to teletraffc theory, with commonly accessible mathematical tools. This paper studies queueing systems with bulk arrivals. It is assumed that the number of arrivals and the expected number of arrivals in each bulk are bounded by some constraints B and (equation omitted), respectively. Subject to these constraints, convexity argument is used to show that the bulk-size probability distribution that results in the worst mean queue performance is an extremal distribution with support {1, B} and mean equal to A. Furthermore, from the viewpoint of security against denial-of-service attacks, this distribution remains the worst even if an adversary were allowed to choose the bulk-size distribution at each arrival instant as a function of past queue lengths; that is, the adversary can produce as bad queueing performance with an open-loop strategy as with any closed-loop strategy. These results are proven for an arbitrary arrival process with bulk arrivals and a general service model.
Keywords
Performance tools and methodology; queueing analysis; teletraffic;
Citations & Related Records

Times Cited By Web Of Science : 1  (Related Records In Web of Science)
Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 W. Whitt, 'Minimizing delays in the GI/G/1 queue,' Operations Research, vol. 32, no. 1, pp. 41-51, 1984   DOI   ScienceOn
2 B. Hajek, 'The proof of a folk theorem on queueing delay with applications to routing in networks,' J. Assoc. Comput. Mach., vol. 30, pp. 834-851, 1983   DOI   ScienceOn
3 F. BacceIIi and P. Bremaud, Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences, Berlin: Springer-Verlag, 1994
4 G. de Veciana, 'Leaky buckets and optimal self-tuning rate control,' in Proc. IEEE GLOBECOM'94, 1994, pp. 1207-1211   DOI
5 F. Lo Presti et aI., 'Source time scale and optimal bufferlbandwidth tradeoff for heterogeneous regulated traffic in a network node,' IEEE/ACM Trans. Networking, vol. 7, pp. 490-501, Aug. 1999   DOI   ScienceOn
6 D. C. Lee, 'Effects of leaky bucket parameters on the average queueing delay: Worst case analysis,' in Proc. IEEE INFOCOM'94, 1994, pp. 482-489   DOI
7 J. A. S. Monteiro, M. Gerla, and L. Fratta, 'Leaky bucket analysis for ATM networks,' in Proc. SBT/IEEE Int. Telecommun. Symp., 1990, pp. 498-502   DOI
8 B. Erimli and J. Murphy, 'On worst case traffic in ATM networks,' in 12-th UK lEE Teletraffic Symp., (Windsor, United Kingdom), Mar. 1995
9 M. Reisslein, K. Ross, and S. Rajagopal, 'Guaranteeing statistical QoS to regulated traffic: The single node case,' in Proc. IEEE INFOCOM'99, (New York), Mar. 1999, pp. 1061-1072   DOI
10 S.-K. Kweon and K. G. Shin, 'Traffic-controlled rate monotonic priority scheduling of ATM cells,' in Proc. IEEE INFOCOM'96, (San Francisco, CA), Mar. 1996, pp. 655-662   DOI
11 T. Worster, 'Modelling deterministic queues: The leaky bucket as an arrival process,' in The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks, J. Labetoulle and J. W. Roberts, Eds., Amsterdam: Elsevier Science, 1994, pp. 581-590
12 D. C. Lee, 'Worst-case fraction of CBR teletraffic unpunctual due to statistical multiplexing,' IEEE/ACM Trans. Networking, vol. 4, pp. 98-105, Feb. 1996   DOI   ScienceOn
13 M. G. Hluchyj and N. Yin, 'A second-order leaky bucket algorithm to guarantee QoS in ATM networks,' in Proc. IEEE GLOBECOM'96, 1996, pp. 1090-1096   DOI
14 J. M. Barcelo, J. Garcia-Vidal, and O. Casals, 'Worst-case traffic in a tree network of ATM multiplexers,' IEEE/ACM Trans. Networking, vol. 8, pp. 507-516, Aug. 2000   DOI   ScienceOn
15 D. E. Comer, lnternetworking with TCP/IP, 3rd ed., Upper Saddle River, NJ: Prentice Hall, 1995
16 S. Low and P. P. Varaiya, 'Burst reducing servers in ATM networks,' Queueing Systems, vol. 20, pp. 61-84, Sept. 1995   DOI   ScienceOn
17 J. S. Turner, 'New directions in communications (or which way to the information age?),' IEEE Commun. Mag., Oct. 1986
18 I. Khan and V. O. K. Li, 'A traffic control mechanism for ATM networks,' in Proc. IEEE GLOBECOM'93, (Houston, TX), 1993, pp. 1122-1126   DOI
19 B. T. Doshi, 'Deterministic rule based traffic descriptors for broadband ISDN: Worst case behavior and connection acceptance control,' in The Fundamental Role of Teletraffic in the Evolution of Telecommunication Networks, J. Labetoulle and J. W. Roberts, Eds., Amsterdam: Elsevier Science, 1994, pp. 591-600
20 A. Parekh and R. Gallager, 'A generalized processor sharing approach to flow control in integrated service networks: The multiple node case,' IEEE/ACM Trans. Networking, vol. 2, pp. 137-150, Apr. 1994   DOI   ScienceOn
21 T. Tsuchya and H. Saito, 'The worst case cell arrival patterns in ATM networks,' IEICE Trans. Commun., vol. 81-B, pp. 996-1003, May 1998
22 H. Ahmadi, R. Guerin, and K. Sohraby, 'Analysis of leaky bucket access control mechanism with batch arrival process,' in Proc. IEEE GLOBECOM'90, Dec. 1990, pp. 344-349   DOI
23 A. Skliros, 'Characterizing the worst traffic profile passing through an ATM-UNI,' in Proc. First UK Workshop on Performance Modeling and Evaluation of ATM Networks, 1993, pp. 74-84
24 M. Shaked and J. G. Shanthikumar, Stochastic Orders and Their Applications, Boston: Academic Press, 1994
25 N. Yamanaka, Y. Sato, and K. Sato, 'Performance limitation of leaky bucket algorithm for usage parameter control and bandwidth allocation methods,' IEICE Trans. Commun., vol. E75-B, pp. 82-86, Feb. 1992
26 A. Parekh and R. Gallager, 'A generalized processor sharing approach to flow control in integrated service networks: The single-node case,' IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, June 1993   DOI   ScienceOn
27 R. L. Cruz, 'Calculus for network delay-part I: Network elements in isolation,' IEEE Trans. Inform. Theory, vol. 37, pp. 114-131, Jan. 1991   DOI   ScienceOn
28 R. Krishnan and J. A. Silvester, 'The effect of variance reduction on the performance of the leaky bucket,' in Proc. ICC'95, (Seattle), 1995, pp. 1974-1980   DOI
29 J. F. Kurose, 'On computing per-session performance bounds in highspeed multi-hop computer networks,' in Proc. ACM SIGMETRICS/IFIP Performance'92 Conf, (Newport, RI), June 1992, pp. 128-139
30 D. Stoyan, Comparison Methods for Queues and Other Stochastic Models, New York: Wiley, 1983
31 P. A. Humblet, 'Determinism minimizes waiting time in queues,' MIT Laboratory for Information and Decision Systems Report, LIDS-P-1207, 1982
32 J. S. M. Ho, H. Uzunalioglu, and I. Akyildiz, 'Cooperating leaky bucket for average rate enforcement of VBR video traffic in ATM networks,' in Proc.IEEE INFOCOM'95, 1995, pp. 1248-1255   DOI
33 R. L. Cruz, 'Calculus for network delay-part II: Network analysis,' IEEE Trans. Inform. Theory, vol. 37, pp. 132-141, Jan. 1991   DOI   ScienceOn