Stable Scheduling Policies for Maximizing Throughput in Generalized Constrained Queueing Systems

We consider a class of queueing networks referred to as "generalized constrained queueing networks" which form the basis of several different communication networks and information systems. These networks consist of a collection of queues such that only certain sets of queues can be concur...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 53; číslo 8; s. 1913 - 1931
Hlavní autori:	Chaporkar, P., Sarkar, S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.09.2008 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Applied sciences Buffer overflow Communication networks Communications networks Computer science; control theory; systems Computer systems and distributed systems. User interface Constrained queueing networks Constraints Delay Exact sciences and technology Information systems Measurement multicast Networks Operational research and scientific management Operational research. Management science Operations research Optimal scheduling optimization Policies Processor scheduling Queues Queuing theory Queuing theory. Traffic theory randomized algorithms Scheduling Software Stability Strategy Studies Throughput wireless Wireless networks Overflow(computer arithmetics) Optimal policy Constrained queueing networks Stability region Randomized algorithm Queueing network Delay Optimal design Multicast Queue length optimization Service differentiation throughput Queue stability Probabilistic approach Scheduling Distributed system Buffer system Constrained optimization Randomized design Queueing system randomized algorithms Wireless network Metric wireless Reward
ISSN:	0018-9286, 1558-2523
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!