Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions

IEEE Transactions on Communications

Volumn 28, Issue 7, 1980, Pages 992-1003

  Kamoun, Farouk ^a   Kleinrock, Leonard ^b  

^a FACULTÉ DES SCIENCES DE TUNIS   (Tunisia)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS - DATA COMMUNICATION SYSTEMS;

COMPUTER NETWORKS;

EID: 0019032785     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1980.1094756     Document Type: Article

References (17)

1. F. Kamoun, “Design considerations for large computer communication networks,” Dep. Comput. Sci., School Eng. and Appl. Sci., Univ. California, Los Angeles, UCLA-ENG-7642. Apr. 1976.
2. L. Kleinrock and F. Kamoun. “Hierarchical routing for large networks, performance evaluation and optimization,” Comput. Networks, vol. 1, pp. 155–174, Jan. 1977.
3. “Stochastic performance evaluation of hierarchical routing for large networks.” Comput. Networks, vol. 3. pp. 337–353. Nov. 1979.
4. M.A. Rich and M. Schwartz, “Buffer sharing in computer-communication network nodes,” in Proc. ICC. San Francisco, CA, June 1957. pp. 33-17-33-20.
5. D.L. Drukey. “Finite buffers for purists.” TRW Inc., Redondo Beach, CA, TRW Syst. Group Rep. 75.6400-10-97, 1975.
6. M. Irland, “Queueing analysis for a buffer allocation scheme for a packet switch.” in Proc. NTC. vol. 1. Nov. 1975. pp. 24-8-24-13.
7. S. Lam. “Store-and-forward buffer requirements in a packet switching network.” IEEE Trans. Commun., vol. COM-24, pp. 394–403, Apr. 1976.
8. R. Syski, Introduction to Congestion in Telephone Systems. Edinburgh and London: Oliver and Boyd, 1960.
9. J.R. Jackson, ” Networks of waiting lines,” Oper. Res., vol, 5, pp. 518–521. 1957.
10. W. J. Gordon and G.F. Newell, “Closed queueing systems with exponential servers,” Oper. Res., vol. 15, pp. 254–265, 1957.
11. F. Baskett, K. Chandy, R. Muntz, and F. Palacios, “Open, closed, and mixed networks of queues with different classes of customers,” J. Ass. Comput. Mach., vol. 22, pp. 248–260, Apr. 1975.
12. L. Kleinrock, Queueing Systems, Vol. I : Theory. New York: Wiley-Interscience, 1975.
13. J. W.N. Wong, “Queueing network models for computer systems, to School Eng. Appl, Sci., Univ. California, Los Angeles, UCLA- ENG-7579, Oct. 1975.
14. F. Kamoun, and L. Kleinrock, “Analysis of shared storage in a computer network environment,” in Proc. 9th HICSS Honolulu, HI, Jan. 1976, pp. 80-92.
15. J. Buzen. “Queueing network models of multiprogramming,” Ph.D. dissertation. Div. Eng. Appl. Sci. Harvard Univ., Cambridge. MA. 1971.
16. A. C. Williams and R. A. Bhandiwad, “A generating function approach to queueing network analysis of multiprogrammed computers,” Networks, vol. 6. pp. 1–22. Jan. 1976.
17. F. R. Moore. “Computational model of a close queueing network with exponential servers.” IBM J. Res. Develop., vol. 16. pp. 567–572. Nov. 1972.