QoS-Oriented Packet Scheduling Schemes for Multimedia Traffics in OFDMA Systems

Shin, Seokjoo; Bahng, Seungjae; Koo, Insoo; Kim, Kiseon

doi:10.1007/978-3-540-31956-6_19

Cited by 3 publications

(6 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For comparison purpose, we are interested in the PLFS proposed in [8]. The priority metric used to schedule RT traffic differs from that used for NRT traffic.…”

Section: Packet Loss Fair Scheduling (Plfs)mentioning

confidence: 99%

“…Section III presents the OWFS packet scheduler. In section IV, OWFS performance is compared with the PLFS ( [8]). Global throughput, average delay for both traffic classes and RT packet drop rate are considered.…”

Section: Introductionmentioning

confidence: 99%

“…The goal of the paper is to compare this opportunist "GPS based" algorithm with a "PF based" algorithm. In the last mentioned class of algorithms, we choose the Packet Loss Fair Scheduling (PLFS) scheduler proposed in [8]. As [4]- [6], a "PF based" metric is used to prioritize flows and it considers both RT and NRT traffic classes.…”

Section: Introductionmentioning

confidence: 99%

“…Authors of [3] consider proportional rate constraints during cell capacity optimization. Scheduling algorithms ([4]- [8]) deal with multiplexing at a packet level. Unlike assumptions in [1]- [3], buffers have a finite length and may be empty from time to time; QoS of multimedia traffic is more evolved than a user rate requirement.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An Opportunist Extension of Wireless Fair Service for Packet Scheduling in OFDMA

Lengoumbi

Martins

Godlewski

2007

2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring

View full text Add to dashboard Cite

In this paper, we investigate packet scheduling and radio resource allocation in Orthogonal Frequency Division Multiple Access (OFDMA) wireless networks. Each subchannel is a Rayleigh fading channel modeled by a Finite State Markov Channel (FSMC). The Wireless Fair Service (WFS) packet Scheduler is modified for a multi carrier and multi rate context. The proposed algorithm, named Opportunist Wireless Fair Service (OWFS), copes with both real time (RT) and non real time (NRT) traffic constraints. For both traffic classes, specific criteria of performance are compared with PLFS, a scheduler recently proposed for OFDMA.

show abstract

“…For comparison purpose, we are interested in the PLFS proposed in [8]. The priority metric used to schedule RT traffic differs from that used for NRT traffic.…”

Section: Packet Loss Fair Scheduling (Plfs)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Opportunist Extension of Wireless Fair Service for Packet Scheduling in OFDMA

Lengoumbi

Martins

Godlewski

2007

2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring

View full text Add to dashboard Cite

show abstract

“…Several research contributions on meeting user QoS and bandwidth requirements are present in the literature e.g., [4][5][6][7][8]. These contributions fall under the category of user level of wireless communication hierarchical figure (Fig.…”

Section: Related Workmentioning

confidence: 99%

User QoE Influenced Spectrum Trade, Resource Allocation, and Network Selection

Khan

Tembiné

Sivrikaya

et al. 2011

Int J Wireless Inf Networks

View full text Add to dashboard Cite

In future wireless networks, we envision more dynamic telecommunication paradigm, where the dynamics may be translated into dynamic service offerings and user profiles etc. We further expect that the wireless communication market will be influenced when the usercentric network selection vision is realized. By the usercentric network selection vision, we mean that users will be free to select any available network operator or service provider on short term contractual basis. This dictates that operators will compete for their share of a common user pool on much smaller time quanta when compared with the current long term user contacts with the operators. One intuitive strategy of operators will be to incentivize users by offering different QoS and service price offers. As the operators' offers are influenced by their incurring costs. This necessitates to study the market behavior at different levels and investigate the operator and user behavior at these level. In this paper, we categorize and position the communication players and model the interaction between players at different levels. We introduce the learning aspects in the interaction and investigate the equilibrium strategies of involved stake-holders i.e., users and operators. We also model the utility functions of all the involved stake-holders. We also examine the risk-sensitive utility functions in order to cover both risk-seeking and riskaverse in the user QoEs. We implement the user-centric approach and compare it against our proposed networkcentric resource utilization and call blocking.

show abstract

Game Dynamics and Cost of Learning in Heterogeneous 4G Networks

Khan

Tembiné

Vasilakos

2012

IEEE J. Select. Areas Commun.

134

View full text Add to dashboard Cite

International audienceIn this paper, we study game dynamics and learning schemes for heterogeneous 4G networks. We introduce a novel learning scheme called cost-to-learn that incorporates the cost to switch, the switching delay, and the cost of changing to a new action and, captures the realistic behavior of the users that we have experimented on OPNET simulations. Considering a dynamic and uncertain environment where the users and operators have only a numerical value of their own payoffs as information, we construct various heterogeneous combined fully distributed payoff and strategy reinforcement learning (CODIPAS-RL): the users try to learn their own optimal payoff and their optimal strategy simultaneously. We establish the asymptotic pseudo-trajectories as solution of differential equations. Using evolutionary game dynamics, we prove the convergence and stability properties in specific classes of dynamic robust games. We provide various numerical examples and OPNET simulations in the context network selection in wireless local area networks (WLAN) and Long Term Evolution (LTE)

show abstract

QoS-Oriented Packet Scheduling Schemes for Multimedia Traffics in OFDMA Systems

Cited by 3 publications

References 2 publications

An Opportunist Extension of Wireless Fair Service for Packet Scheduling in OFDMA

An Opportunist Extension of Wireless Fair Service for Packet Scheduling in OFDMA

User QoE Influenced Spectrum Trade, Resource Allocation, and Network Selection

Game Dynamics and Cost of Learning in Heterogeneous 4G Networks

Contact Info

Product

Resources

About