Metraipolis › archive › dc_0d4ff84fea02
Maximum throughput scheduling — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Maximum_throughput_scheduling
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-11-07T17:15:33.739Z
- SHA-256 of the archived text
051c54d7424d4b8770ede18affb4390868e839ae418331ef41793205e183ba46- Stable URL of this page
https://metraipolis.com/documento/dc_0d4ff84fea02
How to cite
Maximum throughput scheduling — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Maximum_throughput_scheduling (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0d4ff84fea02 (Metraipolis archive dc_0d4ff84fea02, sha256 051c54d7424d4b8770ede18affb4390868e839ae418331ef41793205e183ba46)
BibTeX
@misc{dc0d4ff84fea02,
title = {Maximum throughput scheduling — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Maximum_throughput_scheduling},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0d4ff84fea02; sha256 051c54d7424d4b8770ede18affb4390868e839ae418331ef41793205e183ba46},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Maximum_throughput_scheduling. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Maximum throughput scheduling is a procedure for scheduling data packets in a packet-switched best-effort network, typically a wireless network, in view to maximize the total throughput of the network, or the system spectral efficiency in a wireless network. This is achieved by giving scheduling priority to the least "expensive" data flows in terms of consumed network resources per transferred amount of information. In advanced packet radio systems, for example the HSDPA 3.5G cellular system, channel-dependent scheduling is used instead of FIFO queuing to take advantage of favourable channel conditions to make best use of available radio conditions. Maximum throughput scheduling may be tempting in this context, especially in simulations where throughput of various schemes are compared. However, maximum throughput scheduling is normally not desirable, and channel-dependent scheduling should be used with care, as we will see below. Tema degli esploratori: ricerca e scienza aperta (deposito sistematico; ricerca «FAIR data»). Fonte: Wikipedia in inglese, voce «Maximum throughput scheduling» — https://en.wikipedia.org/wiki/Maximum_throughput_scheduling Wikidata Q17097321: «Procedure for scheduling data packets in a packet switched best-effort network» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q17097321 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Maximum_throughput_scheduling?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1102888405, consultata il 2026-11-07T17:11:32.574Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 7e2ec5a82344525e30192dff1c7951db3cb8573b11d82f995de2022e411707c8