Adversarial queueing network
From Infogalactic: the planetary knowledge core
In queueing theory, an adversarial queueing network is a model where the traffic to the network is supplied by an opponent rather than as the result of a stochastic process. The model has seen use in describing the impact of packet injections on the performance of communication networks.[1] The model was first introduced in 1996.[2]
The stability of an adversarial queueing network can be determined by considering a fluid limit.[3]
References
<templatestyles src="Reflist/styles.css" />
Cite error: Invalid <references> tag; parameter "group" is allowed only.
<references />, or <references group="..." />| Single queueing nodes | |
|---|---|
| Arrival processes | |
| Queueing networks | |
| Service policies | |
| Key concepts | |
| Limit theorems | |
| Extensions |
|
| Information systems | |
<templatestyles src="Asbox/styles.css"></templatestyles>
 |
This probability-related article is a stub. You can help Wikipedia by expanding it. |
