User satisfaction based scheduling algorithm for high-speed wireless networks

2007 ◽  
Author(s):  
Nidal Nasser ◽  
Tarek Bejaoui
Keyword(s):  
Wireless Networks ◽  
User Satisfaction ◽  
High Speed ◽  
Scheduling Algorithm

scholarly journals A Prioritized Load Aware Weighted Round Robin (PLAWRR) algorithm in Broadband Wireless Networks

2019 ◽  
Vol 3 (4) ◽  
Author(s):  
Ibrahim Saidu ◽  
Nasir Aliyu Shinkafi ◽  
Abubakar Roko ◽  
A. U. Moyi
Keyword(s):  
Wireless Networks ◽  
Packet Loss ◽  
High Speed ◽  
Scheduling Algorithm ◽  
Round Robin ◽  
Traffic Load ◽  
Superior Performance ◽  
Network Resources ◽  
Broadband Wireless ◽  
Heterogeneous Service

Broadband Wireless networks (BWNs) provide a reliable internet access for the delivery of high-speed multimedia applications. The BWNs such as WiMAX provides quality of service (QoS) support for heterogeneous service classes with diverse QoS requirements. Scheduling algorithm is one of the mechanisms used to assure QoS. The existing scheduling algorithm uses a priority value to prioritize traffics according to varying traffic conditions. However, it wastes network resources due to failure to consider channel conditions; thus, lead to increase in delay and packet loss as well as decrease in throughput. In this paper, a prioritized load aware weighted round robin (PLAWRR) algorithm is proposed to improve resource utilization. The PLAWRR algorithm employs a modified value priority according to not only traffic load but also channel condition and throughput history for traffics prioritization. It also introduces a new dynamic weight according to the prioritization value. The performance of the proposed algorithm is evaluated using simulations. The results show that the proposed PLAWRR achieves superior performance compared to the existing algorithm in terms of delay and packet loss as well as increase in throughput.

Effect of Slice Priority for admission control in 5G Wireless Networks: A comparison study for two Fuzzy-based systems considering Software-Defined-Networks

2020 ◽  
Vol 26 (3) ◽  
pp. 169-183
Author(s):  
Phudit Ampririt ◽  
Yi Liu ◽  
Makoto Ikeda ◽  
Keita Matsuo ◽  
Leonard Barolli ◽  
...  
Keyword(s):  
Wireless Networks ◽  
Admission Control ◽  
High Speed ◽  
Additional Parameter ◽  
Fifth Generation ◽  
Efficient Management ◽  
Grade Of Service ◽  
User Request ◽  
Control Decision ◽  
And Control

The Fifth Generation (5G) networks are expected to be flexible to satisfy demands of high-quality services such as high speed, low latencies and enhanced reliability from customers. Also, the rapidly increasing amount of user devices and high user’s requests becomes a problem. Thus, the Software-Defined Network (SDN) will be the key function for efficient management and control. To deal with these problems, we propose a Fuzzy-based SDN approach. This paper presents and compares two Fuzzy-based Systems for Admission Control (FBSAC) in 5G wireless networks: FBSAC1 and FBSAC2. The FBSAC1 considers for admission control decision three parameters: Grade of Service (GS), User Request Delay Time (URDT) and Network Slice Size (NSS). In FBSAC2, we consider as an additional parameter the Slice Priority (SP). So, FBSAC2 has four input parameters. The simulation results show that the FBSAC2 is more complex than FBSAC1, but it has a better performance for admission control.

scholarly journals Randomized scheduling algorithm for virtual output queuing switch at the presence of non-uniform traffic

2019 ◽  
Vol 8 (1) ◽  
pp. 50
Author(s):  
Ali Ghiasian ◽  
Majid Jamali
Keyword(s):  
Randomized Algorithms ◽  
High Speed ◽  
Time Slot ◽  
Scheduling Algorithm ◽  
Superior Performance ◽  
High Complexity ◽  
Maximum Weight ◽  
Switch Architecture ◽  
Simulation Results ◽  
Maximum Weight Matching

<span>Virtual Output Queuing (VOQ) is a well-known queuing discipline in data switch architecture that eliminates Head Of Line (HOL) blocking issue. In VOQ scheme, for each output port, a separate FIFO is maintained by each input port. Consequently, a scheduling algorithm is required to determine the order of service to virtual queues at each time slot. Maximum Weight Matching (MWM) is a well-known scheduling algorithm that achieves the entire throughput region. Despite of outstanding attainable throughput, high complexity of MWM makes it an impractical algorithm for implementation in high-speed switches. To overcome this challenge, a number of randomized algorithms have been proposed in the literature. But they commonly perform poorly when input traffic does not uniformly select output ports. In this paper, we propose two randomized algorithms that outperform the well-known formerly proposed solutions. We exploit a method to keep a parametric number of heavy edges from the last time matching and mix it by randomly generated matching to produce a new schedule. Simulation results confirm the superior performance of the proposed algorithms.</span>

scholarly journals Shortest Link Scheduling in Wireless Networks Under The Rayleigh Fading Model

2021 ◽  
Author(s):  
Baogui Huang ◽  
Jiguo Yu ◽  
Chunmei Ma ◽  
Fengyin Li ◽  
Guangshun Li
Keyword(s):  
Wireless Networks ◽  
Rayleigh Fading ◽  
Scheduling Algorithm ◽  
Random Variable ◽  
Rayleigh Distribution ◽  
Interference Model ◽  
Link Scheduling ◽  
Signal Power ◽  
Schedule Delay ◽  
Radio Signals

Abstract Many shortest link scheduling algorithms adopt non-fading SINR interference model, which assumes that the received signal power will always remain determinate as long as the transmission power of the corresponding sender is fixed. In fact, because environment always influences the propagation of radio signals, the received signal power is by no means a certain value. Rayleigh fading is a statistical model for radio signals propagation. It assumes that the strength of a signal on a receiver is a random variable, varying with the Rayleigh distribution. This paper proposes a shortest link scheduling algorithm under the Rayleigh fading model (SLSRF). The SLSRF partitions the wireless network area into hexagons and colors the hexagons with 3 different colors such that two neighboring hexagons have different colors. The senders of the links scheduled simultaneously are arranged in hexagons with the same color. The correctness of the SLSRF is proved through theoretical analysis, and the efficiency is illustrated by elaborate simulations. Our simulation results demonstrate that the schedule delay of SLSRF is less than that of some results under the non-fading SINR interference model. Furthermore, we extend the SLSRF to a distributed version, which is suitable for large wireless networks.

Sign in / Sign up

Export Citation Format

Share Document