Title :
Efficiency of first-come first-served algorithms
Author_Institution :
Corp. Technol., Swisscom AG, Berne, Switzerland
Abstract :
We derive a new upper bound on the efficiency of first-come first-served algorithms (FCFSA) based on a genie argument. This upper bound of 0.4906 is only slightly higher than today´s best known algorithm which achieves a maximum stable throughput of 0.4878
Keywords :
access protocols; multi-access systems; FCFSA; efficiency; first-come first-served algorithms; genie argument; maximum stable throughput; upper bound; Algorithm design and analysis; Capacity planning; Filtering theory; Protocols; Throughput; Upper bound;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708696
