On queuing lengths in on-line switching (Q557908)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On queuing lengths in on-line switching |
scientific article; zbMATH DE number 2184104
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On queuing lengths in on-line switching |
scientific article; zbMATH DE number 2184104 |
Statements
On queuing lengths in on-line switching (English)
0 references
30 June 2005
0 references
The analyzed problem belongs to queueing theory. The analyzed model is concerned with queueing networks, especially with the analysis of switching protocols in fixed length packet networks. In the paper, the Longest-Queue-First protocol is analyzed and its competitive ratio (being the worst-case queue length with respect to the optimal queue length of a clairvoyant adversary) is derived.
0 references
online switching
0 references
queuing
0 references
competitive ratio
0 references
0.8164546489715576
0 references
0.7983206510543823
0 references
0.7811391353607178
0 references
0.7759581804275513
0 references
