Optimal Buffer Sharing

IEEE Journal on Selected Areas in Communications

Volumn 13, Issue 7, 1995, Pages 1229-1240

  Cidon, Israel ^a,b   Guérin, Roch ^c   Georgiadis, Leonidas ^c   Khamisy, Asad ^a  

^a SUN MICROSYSTEMS   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BUFFER STORAGE; COMPUTATIONAL METHODS; OPTIMAL SYSTEMS; PACKET NETWORKS; PROBABILITY;

BUFFER SHARING; LOSS PROBABILITY; OPTIMAL THRESHOLD CALCULATION; PUSH OUT WITH THRESHOLD TYPE (POT);

PACKET SWITCHING;

EID: 0029376180     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/49.414642     Document Type: Article

References (8)

1. D. M. Bertsekas, Dynamic Programming, Deterministic and Stochastic Models. Englewood Cliffs, NJ: Prentice-Hall, 1987.
2. G. J. Foschini and B. Gopinath, “Sharing memory optimally,” IEEE Trans. Commun., vol. COM-31, no. 3, Mar. 1983.
3. F. Kamoun and L. Kleinrock, “Analysis of shared finite storage in a computer network node environment under general traffic conditions,” IEEE Trans. Commun., vol. COM-28, no. 7, July 1980.
4. H. Kroner, G. Hebuterne, P. Boyer, and A. Gravey, “Priority management in ATM switching nodes,” IEEE Trans. Commun., vol. 9, no. 3, pp. 418–427, Apr. 1991.
5. S. Lippman, “Applying a new device in the optimization of exponential queueing systems,” Op. Res., vol. 23, pp. 687–710, 1975.
6. S. Ross, Introduction to Stochastic Dynamic Programming. New York: Academic.
7. R. F. Serfozo, “An equivalence between continous and discrete time Markov decision processes,” Op. Res., vol. 27, pp. 616–620, 1979.
8. S. X. Wei, E. J. Coyle, and M. T. Hsiao, “An optimal buffer management policy for high-performance packet switching,” in Proc. IEEE GLOBECOM'91, vol. 2, Dec. 1991, pp. 924–928.