This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Deterministic Model and Transient Analysis of Virtual Circuits
February 1993 (vol. 19 no. 2)
pp. 187-197

A model for a virtual circuit in the form of a tandem of servers that process incoming packets using a FIFO (first-in, first-out) discipline is proposed. The service times are assumed to be known completely. These may differ from packet to packet and from server to server. The model permits a variety of buffer or transit time constraints to be incorporated into the model. Several results that help one to understand the transient behavior of a virtual circuit are presented. On the basis of these results, a number of schemes that may be used to determine the time when the next packet must be sent over the network are presented. Transit delay and throughput are used to evaluate a given schedule. Solutions are given for maximum throughput, minimum transit delay, and maximum throughput under transit delay constraints. It is expected that these results will have a substantial bearing on the study of congestion control policies in computer networks, particularly those based on predicting network behavior.

[1] D. R. Cheriton, "Sirpent: A high performance internetworking approach,"Computer Comm. Rev., vol. 19, no. 4, 1989.
[2] D.E. Comer,Internetworking with TCP/ IP, Vol. 1, Prentice Hall, Englewood Cliffs, N.J., 1991.
[3] B. N. Jain and A. K. Agrawala,Open Systems Interconnection: Its Architecture and Protocols. Amsterdam: Elsevier, 1990.
[4] E. Gelenbe, "Stationary deterministic flows in discrete systems I,"Theoretical Computer Sci., vol. 23, pp. 107-127, 1983.
[5] E. Gelenbe and D. Finkel, "Stationary deterministic flows: II. The single server queue,"Theoretical Computer Sci., vol. 52, pp. 269-280, 1987.
[6] K. G. Shin and C. Hou, "Analytic evaluation of contention protocols used for real-time systems," inProc. IEEE Real-Time Syst. Symp., Dec. 1990, pp. 136-145.
[7] Craigen, D. et al., "m-EVES: A Tool for Verifying Software," inProc. 10th Int'l Conf. Software Eng., Singapore, Apr. 1988, CS Press, Los Alamitos, Calif., Order No. 849, pp. 324-333.
[8] S. Keshav, "A control theoretic approach to flow control,"Computer Commun. Rev., vol. 21, no. 4, pp. 3-15, Sept. 1991.
[9] S. P. Morgan, "Window flow control on a trunked byte stream virtual circuit,"IEEE Trans. Commun., vol. 36, no. 7, July 1988.
[10] G. Pujolle, "Ergodicity conditions and congestion control in computer networks," in E. Gelenbe, Ed.,Modelling and Performance Evaluation of Computer Systems. Amsterdam: North Holland, 1976, pp. 287-317.
[11] K. K. Ramakrishnan and R. Jain, "A binary feedback scheme for congestion avoidance in computer networks,"Assoc. Comput. Mach. Trans. Computer Syst., vol. 8, no. 2, May 1990.
[12] M. S. Shalmon, "Exact delay analysis of packet switched networks,"IEEE Trans. Commun., vol. COM-35, no. 12, Dec. 1987.
[13] S. Singh, A. K. Agrawala, and S. Keshav, "Deterministic analysis of flow control and congestion control policies in virtual circuits," University of Maryland Computer Science Tech. Rep. TR 2490, June 1990.
[14] J. Waclawski, "Window dynamics," Ph.D. dissertation, Dept. of Computer Science, University of Maryland, College Park, MD, May 1990.
[15] P. J. Denning and J. P. Buzen, "The operational analysis of queueing network models,"ACM Comput. Surveys, vol. 10, pp. 225-261, Sept. 1978.
[16] Y. C. Ho,Discrete Event Dynamic Systems: Analyzing Complexity and Performance in the Modern World. New York: IEEE Press, 1992.

Index Terms:
transit delay; deterministic model; transient analysis; virtual circuits; tandem of servers; FIFO; service times; transit time constraints; throughput; maximum throughput; minimum transit delay; congestion control; computer networks; computer networks; delays; opensystems
Citation:
A.K. Agrawala, B.N. Jain, "Deterministic Model and Transient Analysis of Virtual Circuits," IEEE Transactions on Software Engineering, vol. 19, no. 2, pp. 187-197, Feb. 1993, doi:10.1109/32.214835
Usage of this product signifies your acceptance of the Terms of Use.