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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In this paper we address the challenge of multiuser scheduling in the downlink of 3GPP UMTS/LTE. Long Term Evolution (LTE… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Recently, it has been shown that carrier-sense multiple access (CSMA)-type random access algorithms can achieve the maximum… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2007
2007
We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul… (More)
  • figure 1
  • table I
  • figure 2
  • table II
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The goal of this paper is to present exact formulae for the throughput of IEEE 802.11 networks in the absence of transmission… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper studies input-queued packet switches loaded with both unicast and multicast traffic. The packet switch architecture is… (More)
  • figure 1
  • table I
  • table II
  • table III
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Abstruct-The stability of a queueing network with interdependent servers is considered. The dependency of servers is described by… (More)
  • figure 1
  • figure 2
Is this relevant?