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

Uloženo v:
Podrobná bibliografie
Vydáno 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í příspěvek
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.07.1989
Institute of Electrical and Electronics Engineers
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 spaces among the nodes of the network is considered. The goal is to optimize some performance criterion associated with the time to buffer overflow, such as its mean or the probability that it exceeds some value. It is argued that for any such performance criterion the assignment should be done roughly in inverse proportion to the logarithms of the effective service rates at the nodes. Effective service means the ratio of the service rate to the stationary arrival rate at the node in the network with inifinite buffers.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
DOI:10.1109/18.32150