A calculus for network delay, Part I: Network elements in isolation

A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy. The theory developed is different from traditional approaches to analyzing delay because the model used to describe the entry of data into the network is nonprobabilistic. It is supposed that the data stream entered into the network by any given user satisfies burstiness constraints. A data stream is said to satisfy a burstiness constraint if the quantity of data from the stream contained in any interval of time is less than a value that depends on the length of the interval. Several network elements are defined that can be used as building blocks to model a wide variety of communication networks. Each type of network element is analyzed by assuming that the traffic entering it satisfies bursting constraints. Under this assumption, bounds are obtained on delay and buffering requirements for the network element; burstiness constraints satisfied by the traffic that exits the element are derived. >

[1]  P. R. Kumar,et al.  Distributed scheduling based on due dates and buffer prioritization , 1990, 29th IEEE Conference on Decision and Control.

[2]  Debasis Mitra,et al.  Randomized parallel communications on an extension of the omega network , 1987, JACM.

[3]  Rene Leonardo Cruz.  A Calculus for Network Delay and a Note on Topologies of Interconnection Networks , 1987 .

[4]  Israel Cidon,et al.  Real-time packet switching: a performance analysis , 1988, IEEE J. Sel. Areas Commun..

[5]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[6]  G. J. A. Stern,et al.  Queueing Systems, Volume 2: Computer Applications , 1976 .

[7]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[8]  J. R. Perkins,et al.  Stable, distributed, real-time scheduling of flexible manufacturing/assembly/diassembly systems , 1989 .

[9]  S. L. Hakimi,et al.  Analysis and design of communication networks with memory , 1969 .

[10]  A. E. Eckberg,et al.  AN APPROACH TO CONTROLLING CONGESTION IN ATM NETWORKS , 1990 .

[11]  Ward Whitt,et al.  Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue , 1989, Proc. IEEE.

[12]  P. R. Kumar,et al.  Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems , 1990 .

[13]  G. F. Newell,et al.  Applications of Queueing Theory. , 1983 .

[14]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[15]  Shaler Stidham,et al.  Technical Note - A Last Word on L = λW , 1974, Oper. Res..

[16]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[17]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[18]  Edgar Reich,et al.  On the Integrodifferential Equation of Takacs. II , 1958 .

[19]  P. R. Kumar,et al.  Stable distributed real-time scheduling of flexible manufacturing/assembly/disassembly systems , 1988, Proceedings of the 27th IEEE Conference on Decision and Control.

[20]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[21]  E. L. Hahne,et al.  Round robin scheduling for fair flow control in data communication networks , 1986, ICC.

[22]  J. Turner,et al.  New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.