Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,273,814 papers from all fields of science
Search
Sign In
Create Free Account
Maximum throughput scheduling
Known as:
Maximum throughput resource management
Maximum throughput scheduling is a procedure for scheduling data packets in a packet-switched best-effort communications network, typically a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
FIFO (computing and electronics)
Fair queuing
Fairness measure
Max-min fairness
Expand
Broader (1)
Radio resource management
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Update or wait: How to keep your data fresh
Yin Sun
,
E. Uysal-Biyikoglu
,
R. Yates
,
C. E. Koksal
,
N. Shroff
IEEE INFOCOM - The 35th Annual IEEE…
2016
Corpus ID: 990701
In this work we study how to manage the freshness of status updates sent from a source to a remote monitor via a network server…
Expand
Review
2011
Review
2011
Vehicular Networking: A Survey and Tutorial on Requirements, Architectures, Challenges, Standards and Solutions
G. Karagiannis
,
O. Altintas
,
+4 authors
Timothy R. Weil
IEEE Communications Surveys and Tutorials
2011
Corpus ID: 15343373
Vehicular networking has significant potential to enable diverse applications associated with traffic safety, traffic efficiency…
Expand
Highly Cited
2011
Highly Cited
2011
Minimizing age of information in vehicular networks
S. Kaul
,
M. Gruteser
,
V. Rai
,
J. Kenney
Annual IEEE Communications Society Conference on…
2011
Corpus ID: 8015851
Emerging applications rely on wireless broadcast to disseminate time-critical information. For example, vehicular networks may…
Expand
Highly Cited
2011
Highly Cited
2011
Throughput Maximization for the Gaussian Relay Channel with Energy Harvesting Constraints
Chuan Huang
,
Rui Zhang
,
Shuguang Cui
IEEE Journal on Selected Areas in Communications
2011
Corpus ID: 9393090
This paper considers the use of energy harvesters, instead of conventional time-invariant energy sources, in wireless cooperative…
Expand
Highly Cited
2010
Highly Cited
2010
513 Mbit/s Visible Light Communications Link Based on DMT-Modulation of a White LED
J. Vucic
,
C. Kottke
,
S. Nerreter
,
K. Langer
,
J. Walewski
Journal of Lightwave Technology
2010
Corpus ID: 35629285
We report a visible-light wireless point-to-point communication link operating at 513 Mbit/s gross transmission rate (net Mbit/s…
Expand
Highly Cited
2009
Highly Cited
2009
Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks
J. Ni
,
Bo Tan
,
R. Srikant
IEEE/ACM Transactions on Networking
2009
Corpus ID: 3169168
Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access algorithms can achieve the maximum…
Expand
Highly Cited
2002
Highly Cited
2002
Pathload: A Measurement Tool for End-to-End Available Bandwidth
Manish Jain
,
C. Dovrolis
2002
Corpus ID: 9533577
The available bandwidth of a network path P is the maximum throughput that P can provide t o a a o w, without reducing the…
Expand
Highly Cited
2002
Highly Cited
2002
QoS Issues in Web Services
D. Menascé
IEEE Internet Computing
2002
Corpus ID: 42937779
Quality of service (QoS) is a combination of several qualities or properties of a service, such as: availability is the…
Expand
Highly Cited
1990
Highly Cited
1990
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
L. Tassiulas
,
A. Ephremides
IEEE Conference on Decision and Control
1990
Corpus ID: 14964341
The stability of a queuing network with interdependent servers is considered. The dependency among the servers is described by…
Expand
Highly Cited
1979
Highly Cited
1979
Tree algorithms for packet broadcast channels
J. Capetanakis
IEEE Transactions on Information Theory
1979
Corpus ID: 32628457
The multiaccessing of a broadcast communication channel by independent sources is considered. Previous accessing techniques…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE