The optimal buffer allocation problem

Pathwise probabilistic arguments are used to justify a simple rule of thumb by which buffer allocation can be carried out. The model for the underlying network is the skeleton of an open Jackson network. The problem of how to distribute in the best possible way a fixed number N of available buffer s...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on information theory Ročník 35; číslo 4; s. 721 - 725
Hlavný autor:	Anantharam, V.
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.07.1989 Institute of Electrical and Electronics Engineers
Predmet:	Analytical models Application software Applied sciences Buffer overflow Computer networks Context modeling Exact sciences and technology Joining processes Manufacturing systems Network servers Operational research and scientific management Operational research. Management science Queuing theory. Traffic theory Routing Space stations
ISSN:	0018-9448
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!