Packet Scheduling and Traffic Differentiation in Femtocell Environment

2011 ◽  
Vol E94-B (11) ◽  
pp. 3018-3025
Author(s):  
Volkan SEVINDIK ◽  
Oguz BAYAT
Keyword(s):  
Packet Scheduling ◽  
Traffic Differentiation

Packet Scheduling in Home and Business Femtocell Networks

2011 ◽  
pp. 245-268
Author(s):  
Volkan Sevindik ◽  
Oguz Bayat
Keyword(s):  
Packet Scheduling ◽  
Packet Delay ◽  
Real Data ◽  
Traffic Classification ◽  
Femtocell Networks ◽  
Delay Bound ◽  
Traffic Differentiation ◽  
Grade Of Service ◽  
Femtocell Network ◽  
Key Indicators

This chapter presents the performance of the existing macrocell schedulers in the home femtocell environment and provides a scheduling solution for the traffic differentiation problem in the business femtocell environment. The traffic classification concept is applied to Best Effort (BE) traffic in the femtocell network, and a Grade of Service (GoS) metric is used as a scheduler parameter to classify the traffic in terms of total delivered throughput. CDMA2000 1xEVDO Rev, a femtocell product, is used to conduct two different throughput experiments in order to collect real Data Rate Request (DRC) values. For both existing and proposed scheduling methods, the first experiment consists of 4 BE users, and the second experiment consists of 4 BE and 2 Voice over IP (VoIP) users. Collected DRC values are used in computer simulations to assess the performance of both the existing and the proposed scheduling methods. Average delivered throughput, throughput fairness, BE traffic differentiation error, and VoIP packet delay bound error are used as key indicators to show the performances of both scheduling techniques.

SIGACT News Online Algorithms Column 37

2021 ◽  
Vol 52 (2) ◽  
pp. 71-71
Author(s):  
Rob van Stee
Keyword(s):  
Lower Bound ◽  
Online Algorithms ◽  
Packet Scheduling ◽  
Open Problems ◽  
Competitive Algorithm ◽  
Long Time ◽  
News Online

For this issue, Pavel Vesely has contributed a wonderful overview of the ideas that were used in his SODA paper on packet scheduling with Marek Chrobak, Lukasz Jez and Jiri Sgall. This is a problem for which a 2-competitive algorithm as well as a lower bound of ϕ ≈ 1:618 was known already twenty years ago, but which resisted resolution for a long time. It is great that this problem has nally been resolved and that Pavel was willing to explain more of the ideas behind it for this column. He also provides an overview of open problems in this area.

Sign in / Sign up

Export Citation Format

Share Document