| http://dbpedia.org/ontology/abstract
|
Maximum throughput scheduling is a procedu … 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.d be used with care, as we will see below.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.tlc-networks.polito.it/~giaccone/papers/ton-multicast03.pdf +
, http://www.tlc-networks.polito.it/mellia/papers/info05.pdf +
, http://citeseerx.ist.psu.edu/viewdoc/download%3Fdoi=10.1.1.16.8494&rep=rep1&type=pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
4451219
|
| http://dbpedia.org/ontology/wikiPageLength
|
5116
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1102888405
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Fair_queuing +
, http://dbpedia.org/resource/Carrier-to-interference_ratio +
, http://dbpedia.org/resource/System_spectral_efficiency +
, http://dbpedia.org/resource/Power_control +
, http://dbpedia.org/resource/High-Speed_Downlink_Packet_Access +
, http://dbpedia.org/resource/Link_adaptation +
, http://dbpedia.org/resource/Max-min_fair +
, http://dbpedia.org/resource/Spread_spectrum +
, http://dbpedia.org/resource/Bit_rate +
, http://dbpedia.org/resource/Category:Network_scheduling_algorithms +
, http://dbpedia.org/resource/Profit_%28economics%29 +
, http://dbpedia.org/resource/FIFO_%28computing_and_electronics%29 +
, http://dbpedia.org/resource/Customer +
, http://dbpedia.org/resource/Wireless_network +
, http://dbpedia.org/resource/Radio_resource_management +
, http://dbpedia.org/resource/Packet-switched +
, http://dbpedia.org/resource/Customer_satisfaction +
, http://dbpedia.org/resource/Category:Radio_resource_management +
, http://dbpedia.org/resource/Proportionally_fair +
, http://dbpedia.org/resource/Fairness_measure +
, http://dbpedia.org/resource/Round-robin_scheduling +
, http://dbpedia.org/resource/Carrier_to_noise_ratio +
, http://dbpedia.org/resource/Throughput +
, http://dbpedia.org/resource/Data_packet +
, http://dbpedia.org/resource/Weighted_fair_queuing +
, http://dbpedia.org/resource/Best-effort_network +
, http://dbpedia.org/resource/Path_loss +
, http://dbpedia.org/resource/Dynamic_channel_allocation +
, http://dbpedia.org/resource/Max-min_fairness +
, http://dbpedia.org/resource/Cellular_communication_networks +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Network_scheduling_algorithms +
, http://dbpedia.org/resource/Category:Radio_resource_management +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Procedure +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Maximum_throughput_scheduling?oldid=1102888405&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Maximum_throughput_scheduling +
|
| owl:sameAs |
https://global.dbpedia.org/id/f8vU +
, http://www.wikidata.org/entity/Q17097321 +
, http://rdf.freebase.com/ns/m.0c34b1 +
, http://dbpedia.org/resource/Maximum_throughput_scheduling +
|
| rdf:type |
http://dbpedia.org/class/yago/WikicatSchedulingAlgorithms +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/Act100030358 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/ontology/AnatomicalStructure +
, http://dbpedia.org/class/yago/Event100029378 +
|
| rdfs:comment |
Maximum throughput scheduling is a procedu … 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.ces per transferred amount of information.
|
| rdfs:label |
Maximum throughput scheduling
|
