QoS aware Multi-Path Routing using Link Scheduling Algorithm

2019 ◽  
Vol 09 ◽  
Author(s):  
Satyasrikanth Palle ◽  
Shivashankar
Keyword(s):  
Cellular Networks ◽  
Scheduling Algorithm ◽  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Link Scheduling ◽  
Spatial Reuse ◽  
Mobile Cellular ◽  
Simulation Results ◽  
End To End

Objective: The demand for Cellular based multimedia services is growing day by day, in order to fulfill such demand the present day cellular networks needs to be upgraded to support excessive capacity calls along with high data accessibility. Analysis of traffic and huge network size could become very challenging issue for the network operators for scheduling the available bandwidth between different users. In the proposed work a novel QoS Aware Multi Path scheduling algorithm for smooth CAC in wireless mobile networks. The performance of the proposed algorithm is assessed and compared with existing scheduling algorithms. The simulation results show that the proposed algorithm outperforms existing CAC algorithms in terms of throughput and delay. The CAC algorithm with scheduling increases end-to-end throughput and decreases end-to-end delay. Methods: The key idea to implement the proposed research work is to adopt spatial reuse concept of wireless sensor networks to mobile cellular networks. Spatial reusability enhances channel reuse when the node pairs are far away and distant. When Src and node b are communicating with each other, the other nodes in the discovered path should be idle without utilizing the channel. Instead the other nodes are able to communicate parallelly the end-to-end throughput can be improved with acceptable delay. Incorporating link scheduling algorithms to this key concept further enhances the end-to-end throughput with in the turnaround time. So, in this research work we have applied spatial reuse concept along with link scheduling algorithm to enhance end-to-end throughput with in turnaround time. The proposed algorithm not only ensures that a connection gets the required bandwidth at each mobile node on its way by scheduling required slots to meet the QoS requirements. By considering the bandwidth requirement of the mobile connections, the CAC module at the BS not only considers the bandwidth requirement but also conforming the constrains of system dealy and jitter are met. Result: To verify the feasibility and effectiveness of our proposed work, with respect to scheduling the simulation results clearly shows the throughput improvement with Call Admission Control. The number of dropped calls is significantly less and successful calls are more with CAC. The percentage of dropped calls is reduced by 9 % and successful calls are improved by 91%. The simulation is also conducted on time constraint and ratio of dropped calls are shown. The total time taken to forward the packets and the ration of dropped calls is less when compared to non CAC. On a whole the CAC with scheduling algorithms out performs existing scheduling algorithms. Conclusion: In this research work we have proposed a novel QoS aware scheduling algorithm that provides QoS in Wireless Cellular Networks using Call Admission Control (CAC). The simulation results show that the end-to-end throughput has been increased by 91% when CAC is used. The proposed algorithm is also compared with existing link scheduling algorithms. The results reveal that CAC with scheduling algorithm can be used in Mobile Cellular Networks in order to reduce packet drop ratio. The algorithm is also used to send the packets within acceptable delay.

Link Scheduling Scheme for Multi-Hop Cognitive Radio Ad Hoc Networks

2013 ◽  
Vol 443 ◽  
pp. 430-434
Author(s):  
Chao Li ◽  
Guo Chun Ren ◽  
Cheng Gui Wang ◽  
Yu Bo Wang
Keyword(s):  
Ad Hoc ◽  
Scheduling Algorithm ◽  
Cluster Head ◽  
Link Scheduling ◽  
Destination Node ◽  
Spatial Reuse ◽  
Topology Structure ◽  
Scheduling Scheme ◽  
Simulation Results ◽  
Hoc Networks

In this paper, we propose to apply a centre scheduling algorithm in the CRAHNs with a cluster. In this network, the cluster head assigns time slots to each node so that every node can be fair to transfer data. The scheme schedules the links to the same destination node first, which has the largest topology structure, then another destination node whose topology structure is larger than the rest. The algorithm presented in this paper considers both the fairness and the spatial reuse, and the simulation results show that this algorithm still has a good performance when the topology is so large.

Parallel Scheduling Algorithms Investigation of Support Strict Resource Reservation from Grid

2014 ◽  
Vol 519-520 ◽  
pp. 108-113 ◽  
Author(s):  
Jun Chen ◽  
Bo Li ◽  
Er Fei Wang
Keyword(s):  
Parallel Computing ◽  
Resource Utilization ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Resource Reservation ◽  
Parallel Scheduling ◽  
Scheduling Model ◽  
Computing Grid ◽  
Simulation Results ◽  
Reservation Request

This paper studies resource reservation mechanisms in the strict parallel computing grid,and proposed to support the parallel strict resource reservation request scheduling model and algorithms, FCFS and EASY backfill analysis of two important parallel scheduling algorithm, given four parallel scheduling algorithms supporting resource reservation. Simulation results of four algorithms of resource utilization, job bounded slowdown factor and the success rate of Advanced Reservation (AR) jobs were studied. The results show that the EASY backfill + firstfit algorithm can ensure QoS of AR jobs while taking into account the performance of good non-AR jobs.

scholarly journals Priority based round robin (PBRR) CPU scheduling algorithm

2019 ◽  
Vol 9 (1) ◽  
pp. 190
Author(s):  
Sonia Zouaoui ◽  
Lotfi Boussaid ◽  
Abdellatif Mtibaa
Keyword(s):  
Operating System ◽  
Real Time ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
New Approach ◽  
Real Time Operating System ◽  
Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

A SURVEY OF VARIANTS OF ROUND ROBIN CPU SCHEDULING ALGORITHMS

2021 ◽  
Vol 4 (4) ◽  
pp. 526-546
Author(s):  
Sunday Samuel Olofintuyi ◽  
Temidayo Oluwatosin Omotehinwa ◽  
Joshua Segun Owotogbe
Keyword(s):  
Research Work ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
Reference Source ◽  
The Past ◽  
Research Areas ◽  
Quantum Time ◽  
Cpu Utilization ◽  
Future Work

Quite a number of scheduling algorithms have been implemented in the past, including First Come First Served (FCFS), Shortest Job First (SJF), Priority and Round Robin (RR). However, RR seems better than others because of its impartiality during the usage of its quantum time. Despite this, there is a big challenge with respect to the quantum time to use. This is because when the quantum time is too large, it leads to FCFS, and if the quantum time is too short, it increases the number of switches from the processes. As a result of this, this paper provides a descriptive review of various algorithms that have been implemented in the past 10 years, for various quantum time in order to optimize the performance of CPU utilization. This attempt will open more research areas for researchers, serve as a reference source and articulate various algorithms that have been used in the previous years – and as such, the paper will serve as a guide for future work. This research work further suggests novel hybridization and ensemble of two or more techniques so as to improve CPU performance by decreasing the number of context switch, turnaround time, waiting time and response time and in overall increasing the throughput and CPU utilization.

scholarly journals Link Scheduling Algorithm to Mitigate Worst-Case Interference Problems for LTE-A

2021 ◽  
Vol 10 (3) ◽  
pp. 1832-1836
Keyword(s):  
Scheduling Algorithm ◽  
Link Scheduling ◽  
Transmission Performance ◽  
Multimedia Services ◽  
Worst Case ◽  
Real Time Traffic ◽  
Scheduling Method ◽  
Simulation Results ◽  
Interference Problems

As the number of apps increases, the traffic of multimedia services in wireless networks grows exponentially. Because of the proportional fair algorithm's shortcomings in terms of achieving Quality of Service (QoS) requirements such as delay and packet loss, it is not extensively employed in modern wireless communication. This study provides a scheduling method based on the QoS utility function, with a parameter added to improve the priority mechanism in order to overcome such flaws. Our scheduling algorithm can match the QoS criteria of real-time traffic, according to simulation results, and the overall system transmission performance has increased significantly.

scholarly journals A Novel Amended Dynamic Round Robin Scheduling Algorithm for Timeshared Systems

2019 ◽  
Vol 17 (1) ◽  
pp. 90-98 ◽  
Author(s):  
Uferah Shafi ◽  
Munam Shah ◽  
Abdul Wahid ◽  
Kamran Abbasi ◽  
Qaisar Javaid ◽  
...  
Keyword(s):  
Operating System ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Round Robin ◽  
Processing Unit ◽  
Cpu Scheduling ◽  
Central Processing ◽  
Quantum Time ◽  
Simulation Results ◽  
Burst Time

Central Processing Unit (CPU) is the most significant resource and its scheduling is one of the main functions of an operating system. In timeshared systems, Round Robin (RR) is most widely used scheduling algorithm. The efficiency of RR algorithm is influenced by the quantum time, if quantum is small, there will be overheads of more context switches and if quantum time is large, then given algorithm will perform as First Come First Served (FCFS) in which there is more risk of starvation. In this paper, a new CPU scheduling algorithm is proposed named as Amended Dynamic Round Robin (ADRR) based on CPU burst time. The primary goal of ADRR is to improve the conventional RR scheduling algorithm using the active quantum time notion. Quantum time is cyclically adjusted based on CPU burst time. We evaluate and compare the performance of our proposed ADRR algorithm based on certain parameters such as, waiting time, turnaround time etc. and compare the performance of our proposed algorithm. Our numerical analysis and simulation results in MATLAB reveals that ADRR outperforms other well-known algorithms such as conventional Round Robin, Improved Round Robin (IRR), Optimum Multilevel Dynamic Round Robin (OMDRR) and Priority Based Round Robin (PRR)

scholarly journals TLS-VaD: A New Tool for Developing Centralized Link-Scheduling Algorithms on the IEEE802.15.4e TSCH Network

Electronics ◽  
2019 ◽  
Vol 8 (12) ◽  
pp. 1555
Author(s):  
Iman Hedi Santoso ◽  
Kalamullah Ramli ◽  
Suryadi M.T.
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Link Scheduling ◽  
Test Results ◽  
Research Support ◽  
Support Tools ◽  
Channel Hopping ◽  
Centralized Scheduling ◽  
Validity Tests ◽  
Support Research

A simulator plays an important role in network protocol research, as it enables researchers to develop protocols more flexibly. Many simulators have been developed to support research in this field, including NS-2, NS-3, OPNET, OMNeT, and Cooja. Although, as a research support tools, NS3 and Cooja have already been equipped with an Internet of things (IoT) module, their support for research on IoT centralized scheduling is still limited. Therefore, this study is aimed to develop a tool for IoT centralized scheduling research, where the IoT technology is based on the IEEE802.15.4e time synchronized channel hopping (TSCH) standard. The tool is called the TSCH Link-Scheduling visualization and data processing (TLS-VaD). The results of validity tests show that TLS-VaD works well; therefore, this tool can be used in the performance measurement of centralized scheduling algorithms on TSCH networks. As an example of the application, this research used TLS-VaD to test the performance of three scheduling algorithms: Iman Ramli Bursty Transmission Scheduling Algorithm (IRByTSA), first top scheduling algorithm (FTSA), and first leaf scheduling algorithm (FLSA). The test results using TLS-VaD shows that IRByTSA had better performance compared to FLSA and FTSA, because it saved more power and was able to generate scheduling decisions relatively quickly.

scholarly journals Dynamic Round Robin CPU Scheduling Algorithm Based on K-Means Clustering Technique

2020 ◽  
Vol 10 (15) ◽  
pp. 5134
Author(s):  
Samih M. Mostafa ◽  
Hirofumi Amano
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
Time Cost ◽  
Cpu Scheduling ◽  
Scheduling Policy ◽  
Service Period

Minimizing time cost in time-shared operating system is the main aim of the researchers interested in CPU scheduling. CPU scheduling is the basic job within any operating system. Scheduling criteria (e.g., waiting time, turnaround time and number of context switches (NCS)) are used to compare CPU scheduling algorithms. Round robin (RR) is the most common preemptive scheduling policy used in time-shared operating systems. In this paper, a modified version of the RR algorithm is introduced to combine the advantageous of favor short process and low scheduling overhead of RR for the sake of minimizing average waiting time, turnaround time and NCS. The proposed work starts by clustering the processes into clusters where each cluster contains processes that are similar in attributes (e.g., CPU service period, weights and number of allocations to CPU). Every process in a cluster is assigned the same time slice depending on the weight of its cluster and its CPU service period. The authors performed comparative study of the proposed approach and popular scheduling algorithms on nine groups of processes vary in their attributes. The evaluation was measured in terms of waiting time, turnaround time, and NCS. The experiments showed that the proposed approach gives better results.

Performance Evaluation of Crossbar Switch Fabrics in Core Routers

2003 ◽  
Vol 04 (02) ◽  
pp. 163-177 ◽  
Author(s):  
Wenjie Li ◽  
Yiping Gong ◽  
Bin Liu
Keyword(s):  
Performance Evaluation ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Round Robin ◽  
Bursty Traffic ◽  
Input Output ◽  
Traffic Models ◽  
Switch Fabrics ◽  
Design And Implementation ◽  
Simulation Results

Many researchers have pointed out that using complex scheduling algorithms in input queuing switches with virtual output queuing (VOQ) scheme can achieve 100% throughput. But these algorithms are too complex to be implemented in hardware. In this paper, based on combined input/output queuing (CIOQ) switch fabrics, we propose a simple scheduling algorithm named outlet priority round robin (OPRR). For synthetic workloads we consider, including uniform and bursty traffic models, the performance of OPRR in VOQ mode and single queue mode is evaluated respectively. Through the simulation results we show that 1) OPRR algorithm, coupled with the speedup of 2, can lead to performance very close to output queuing switches, and 2) under the same condition, OPRR algorithm in single queue mode behaves almost identically to VOQ mode. These results are very useful to direct the design and implementation of switch fabrics in core routers.

Sign in / Sign up

Export Citation Format

Share Document