scholarly journals An Enhanced Bandwidth Optimization in Un-reliable Network using Efficient Bandwidth Utilization based Scheduling Algorithm

2018 ◽  
Vol 10 (2) ◽  
pp. 596
Author(s):  
Sivashanmugam N ◽  
Jyoti Venkateshwaran
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Network Services ◽  
Quality Of Services ◽  
Traffic Data ◽  
Bandwidth Utilization ◽  
Average Delay ◽  
Data Interchange ◽  
Real Time Application

<span lang="EN-US">Nowadays, bandwidth utilization is a very challenging task for Subscriber Stations (SS) to predict a large amount of data. The existing techniques allow the SS to maintain the occupied bandwidth via risk of failure which does not satisfy the quality of services (QoS) needs.  Another challenge is the resource handling with QoS. In Web technology life, there is only few research focused on tackling the resource handling issues with different techniques. Current methods do not consider the data interchange during route switching.  To offer the best solution of above problems, An Efficient Bandwidth Utilization based Scheduling (EBS) Algorithm is designed to maintain proper bandwidth utilization in a real-time application. The EBS algorithm predicts the amount of bandwidth which should be requested according to backlogged traffic data. It’s also considering the data rate divergence between a packet received and transmissions in a queue to improve the bandwidth. The main objective of proposed design is to permits other complementary station (CS) and SSs to bring out the unutilized bandwidth by the availability of SS transmission. The unutilized bandwidth is not possible to get regularly. The proposed method is more flexible to apply in real time and research-oriented applications. The methods enhance the bandwidth utilization during maintenance of the same QoS guaranteed network services. A proposed method avoids the current bandwidth reservation collapse at the time of the same QoS guaranteed services.  The techniques permit SSs to find out the portion of un-utilized bandwidth accurately. Based on Experimental evaluations, proposed algorithm reduces 21.26 PLR (Packet Loses Ratio), 3.25 AD (Average Delay), and improves 8.65 BU (Bandwidth Utilization) and 51.2% (Throughput) compared than existing methods.</span>

scholarly journals A RED modified weighted moving average for soft real-time application

2014 ◽  
Vol 24 (3) ◽  
pp. 697-707 ◽  
Author(s):  
Joanna Domanśka ◽  
Adam Domański ◽  
Dariusz R. Augustyn ◽  
Jerzy Klamka
Keyword(s):  
Real Time ◽  
Optimization Problem ◽  
Optimality Criterion ◽  
Task Force ◽  
Moving Average ◽  
Timing Constraints ◽  
Real Time Traffic ◽  
Real Time Application ◽  
Weighted Moving Average

Abstract The popularity of TCP/IP has resulted in an increase in usage of best-effort networks for real-time communication. Much effort has been spent to ensure quality of service for soft real-time traffic over IP networks. The Internet Engineering Task Force has proposed some architecture components, such as Active Queue Management (AQM). The paper investigates the influence of the weighted moving average on packet waiting time reduction for an AQM mechanism: the RED algorithm. The proposed method for computing the average queue length is based on a difference equation (a recursive equation). Depending on a particular optimality criterion, proper parameters of the modified weighted moving average function can be chosen. This change will allow reducing the number of violations of timing constraints and better use of this mechanism for soft real-time transmissions. The optimization problem is solved through simulations performed in OMNeT++ and later verified experimentally on a Linux implementation

Simulation Research on EDF Scheduling Algorithm of CAN Network Based on OPNET

2012 ◽  
Vol 433-440 ◽  
pp. 5102-5106
Author(s):  
Jie Chang Wu ◽  
Jia Hao ◽  
Chao You Guo
Keyword(s):  
Real Time ◽  
Normal Load ◽  
Scheduling Algorithm ◽  
Load Condition ◽  
Transmission Delay ◽  
Data Frame ◽  
Average Delay ◽  
Real Time System ◽  
Simulation Research ◽  
Set Up

In order to analyze and evaluate real-time performance of CAN network, the OPNET models of CAN network with Fixed Priority Scheduling (FPS) and Earliest Deadline First (EDF) have been set up in this paper. Based on simulation experiments, the performances of average delay and transmission success ratio in the two models are analyzed and the experiments also indicate that under normal load condition the two scheduling algorithm both can send data frame successfully before the deadline. In a slight overload condition FPS algorithm makes the transmission delay of low priority data frame significantly increased, and even occurs the phenomenon that low priority data frame can not be sent at all times; while the EDF algorithm can make all the nodes to complete the data frames in less than 3ms transmission delay, it meets the delay requirements that are delay should less than 10ms in most control systems, it indicates that EDF algorithm has the better scheduling and availability in soft real-time system.

scholarly journals Load Balancing Technique with an Efficient Method

2019 ◽  
Vol 8 (6) ◽  
pp. 1257-1262
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Efficient Method ◽  
Load Balance ◽  
Completion Time ◽  
Scheduling Algorithm ◽  
Quality Of Services ◽  
Huge Number ◽  
Task Scheduling Algorithm

There are a huge number of nodes connected to web computing to offer various types of web services to provide cloud clients. Limited numbers of nodes connected to cloud computing have to execute more than a thousand or a million tasks at the same time. So it is not so simple to execute all tasks at the same particular time. Some nodes execute all tasks, so there is a need to balance all the tasks or loads at a time. Load balance minimizes the completion time and executes all the tasks in a particular way.There is no possibility to keep an equal number of servers in cloud computing to execute an equal number of tasks. Tasks that are to be performed in cloud computing would be more than the connected servers. Limited servers have to perform a great number of tasks.We propose a task scheduling algorithm where few nodes perform the jobs, where jobs are more than the nodes and balance all loads to the available nodes to make the best use of the quality of services with load balancing.

scholarly journals Performance Analysis on Multiple Device Connections of Small Office Home Office Network

2021 ◽  
Vol 18 (4(Suppl.)) ◽  
pp. 1457
Author(s):  
Muhamad Nur Ashaari ◽  
Murizah Kassim ◽  
Ruhani Ab. Rahman ◽  
Abd Razak Mahmud
Keyword(s):  
Performance Analysis ◽  
Packet Loss ◽  
High Speed ◽  
Network Performance ◽  
Network Services ◽  
Quality Of Services ◽  
Home Office ◽  
Internet Connections ◽  
The Impact

Malaysia has been supported by one of the high-speed fiber internet connections called TM UniFi. TM UniFi is very familiar to be used as a medium to apply Small Office Home Office (SOHO) concept due to the COVID-19 pandemic. Most of the communication vendors offer varieties of network services to fulfill customers' needs and satisfaction during the pandemic. Quality of Services is queried by most users by the fact of increased on users from time to time. Therefore, it is crucial to know the network performance contrary to the number of devices connected to the TM UniFi network. The main objective of this research is to analyze TM UniFi performance with the impact of multiple device connections or users' services. The study was conducted to analyze the QoS on its traffic, packets transfer, RTT, latency, and throughput. Wireshark simulation program has been used as a network traffic capture where PCAP files have been analyzed by using PCAP Analyzer for Splunk. Traffic filtering has been enabled to capture selected traffic to measure network performance. The result shows that better network performance can be achieved if a smaller number of devices are connected at the same time.  The percentage of packet loss, RTT, latency is increased when more users connected at the same time. The throughput also shows a decrease for multi-device connections. Based on the analysis it can be concluded that TM UniFi still can provide good network services for the SOHO network environment and sufficient bandwidth despite the rapid user growth in Malaysia.

Programming Interfaces for Realtime and Cloud-Based Computing

2012 ◽  
pp. 959-975
Author(s):  
Gregory Katsaros ◽  
Tommaso Cucinotta
Keyword(s):  
Quality Of Service ◽  
Real Time ◽  
State Of The Art ◽  
New Products ◽  
The State ◽  
New Challenges ◽  
Real Time Computing ◽  
Programming Interfaces ◽  
Real Time Application

The appearance of different business roles according to this classification, potentially with differing interests, introduces new challenges with regard to the tools and mechanisms put in place in order to enable the efficient provisioning of services. Security, Quality of Service (QoS) assurance, and real-time capabilities are just a few issues that the providers are trying to tackle and integrate within the new products and services that they offer. In this chapter, we make an overview of the approaches that aim to APIs for real-time computing. In the first part of this chapter, several Real-Time Application Interfaces will be presented and compared. After that, we will document the state-of-the-art regarding the Cloud APIs available and analyze the architecture and the technologies that they support.

Hierarchical QoS Admission Control Mechanism for IEEE 802.16j Mobile Multi-Hop Relay WiMAX Network

2014 ◽  
pp. 205-218
Author(s):  
Rohaiza Yusoff ◽  
Mohd Dani Baba ◽  
Muhammad Ibrahim
Keyword(s):  
Real Time ◽  
Admission Control ◽  
Performance Metrics ◽  
Control Mechanism ◽  
Bandwidth Utilization ◽  
Control Approach ◽  
Ieee 802.16J ◽  
Set Up ◽  
Wimax Network

This chapter presents some performance issues in Worldwide Interoperability for Microwave Access (WiMAX) network and focus on the capability of non-transparent relay in Mobile Multi-Hop Relay (MMR) WiMAX Network. In this work, an admission control mechanism with hierarchy Quality of Service (QoS) is developed for the relay architecture. An open source-based simulator is used to evaluate the three types of QoS classes, which are Unsolicited Grant Access (UGS), Real Time Polling Service (rtPS), and Non-Real Time Polling Service (nrtPS). Two scenarios of non-transparent relay topologies are set up for different numbers of subscribers with different types of QoS application classes. Three performance metrics, which are bandwidth utilization, number of slots used, and number of admitted service flow, are observed and plotted in graph. The results show the hierarchy-based QoS admission control mechanism can enhance the throughput of provided services by 35% compared to the conventional method without the admission control approach.

Sign in / Sign up

Export Citation Format

Share Document