2016
DOI: 10.1109/tvt.2015.2425883
|View full text |Cite
|
Sign up to set email alerts
|

Joint Realtime and Nonrealtime Flows Packet Scheduling and Resource Block Allocation in Wireless OFDMA Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 63 publications
0
9
0
Order By: Relevance
“…Those techniques can provide guidelines for network design, simplify parametrization, and assess compounded optimization criteria for heterogeneous networks. The network designer must establish resource allocation strategies to conciliate conflicted objectives, keeping in mind that the ultimate goals are user experience, satisfaction, and operators' interest [301].…”
Section: Discussion and Future Directionsmentioning
confidence: 99%
“…Those techniques can provide guidelines for network design, simplify parametrization, and assess compounded optimization criteria for heterogeneous networks. The network designer must establish resource allocation strategies to conciliate conflicted objectives, keeping in mind that the ultimate goals are user experience, satisfaction, and operators' interest [301].…”
Section: Discussion and Future Directionsmentioning
confidence: 99%
“…1 -QoS without interference awareness: This set of works studies the sub-problem of queue scheduling and resource allocation addressing only QoS and fairness without adequate attention to interference. Examples include maximizing average utilities balancing efficiency and fairness [6], analysis of generalized proportional fairness [7], scheduling for elastic traffic using convex optimization [8], single cell throughput maximization with rate guarantees [2], utility maximization with rate constraints through a token counter [9], minimum rate guarantees using a Lagrangian approach [10], joint channel-and queue-aware scheduling for mean-delay utility maximization [11], mean-delay fairness via gradient method [12], joint real-time and non-real-time packet scheduling and resource allocation [13], mean-delay guarantees through time-coupling constraints and Lagrange dual-based solutions [14], maximizing goodput for multihop networks through dual solutions [15], utility maximization and routing with probabilistic delay requirements [16], adapting rates with delay constraints to increase network video capacity [17], QoS-aware routing and subchannel allocation in time-slotted realy networks, without interference coordination, and dynamic user association [18], and, in single AP, single frequency networks, optimizing secondary users' delay based on interference [19].…”
Section: A Related Work and Identifying The Research Gapmentioning
confidence: 99%
“…However, applying such strict admission control in a public WMN is undesirable due to network resources underutilization. Because the QoS requirement of an application usually can be specified based on its peak usage, guaranteeing QoS for the application can be overprovisioning QoS, which leads to inefficient network resource utilization [5][6][7]. Moreover, due to the mobility of mesh clients transiting multiple mesh routers, the amount of traffic to be guaranteed with a specific QoS requirement will vary over time.…”
Section: Introductionmentioning
confidence: 99%