DocumentCode
1673070
Title
Configuring UNIX STREAMS communication buffers based on an Erlang traffic model
Author
Lee, T.P. ; Barkley, R.E.
Author_Institution
AT&T Bell Labs., Holmdel, NJ, USA
fYear
1988
Firstpage
230
Lastpage
234
Abstract
The authors describe a STREAMS communication buffer allocation algorithm based on the blocking probability, given the total amount of communication buffer memory. Memory requests are modeled as Erlang B traffic characterized by the mean interarrival time and mean buffer holding time for each size. The objective function to be minimized is the total number of blocked requests for the given traffic subject to the memory constraint.<>
Keywords
buffer storage; computer networks; data communication systems; network operating systems; probability; protocols; queueing theory; telecommunication traffic; Erlang traffic model; UNIX STREAMS communication buffers; UNIX System V release 3.0; blocked requests; blocking probability; communication buffer allocation algorithm; mean buffer holding time; mean interarrival time; objective function; remote file sharing; Constraint optimization; Exponential distribution; Lagrangian functions; Memory management; Polynomials; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Networking Symposium, 1988., Proceedings of the
Conference_Location
Washington, DC, USA
Print_ISBN
0-8186-0835-8
Type
conf
DOI
10.1109/CNS.1988.5001
Filename
5001
Link To Document