QoS Mechanisms Research Articles

Analyzing Node Density Impact on End-to-End Delay and Throughput in Mobile Ad hoc Network Video Conferencing Services

Video conferencing services have gained significant popularity in recent years, enabling real-time communication and collaboration among individuals and groups. However, the performance of video conferencing systems over MANETs poses challenges of topology fluctuations and node density. This research paper aims to present an analysis of end-to-end delay and throughput in video conferencing over MANETs. The main objective is to identify the impact of node density in MANETs on video conferencing user experience. To conduct the study, an experimental setup of Zoom cloud meeting service was designed, consisting of a simulated MANET environment and a video conferencing application. End-to-end delay and throughput were measured via Wireshark software based on interconnected node scenarios and different configurations at densities of 2 and 4 nodes. The collected data was analyzed using appropriate statistical techniques to identify trends, patterns. The end-to-end delay analysis results revealed the impact of fluctuating network density conditions, on the overall delay experienced during the video conferencing session increased by 27%. While throughput analysis revealed a 65% decrease in data transfer capacity caused by higher packet loss factor in MANET. The integrated analysis explores the relationship between end-to-end delay and throughput, providing insight into optimization strategies. These findings can guide the design and implementation of more efficient and reliable video conferencing systems in mobile ad-hoc environments, In the face of fluctuations in node density, these findings can encourage the development of QoS mechanisms specifically designed for MANETs. These mechanisms can prioritize video packets and allocate network resources effectively, ensuring better user experience and overcoming resource constraints

QoS-pro: A QoS-enhanced Transaction Processing Framework for Shared SSDs

Solid State Drives (SSDs) are widely used in data-intensive scenarios due to their high performance and decreasing cost. However, in shared environments, concurrent workloads can interfere with each other, leading to a violation of Quality of Service (QoS). While QoS mechanisms like fairness guarantees and latency constraints have been integrated into SSDs, existing transaction processing frameworks offer limited QoS guarantees and can significantly degrade overall performance in a shared environment. The reason is that the internal components of an SSD, originally designed to exploit parallelism, struggle to coordinate effectively when QoS mechanisms are applied to them. This article proposes a novel QoS -enhanced transaction pro cessing framework, called QoS-pro, which enhances QoS guarantees for concurrent workloads while maintaining high parallelism for SSDs. QoS-pro achieves this by redesigning transaction processing procedures to fully exploit the parallelism of shared SSDs and enhancing QoS-oriented transaction translation and scheduling with parallelism features in mind. In terms of fairness guarantees, QoS-pro outperforms state-of-the-art methods by achieving 96% fairness improvement and 64% maximum latency reduction. QoS-pro also shows almost no loss in throughput when compared with parallelism-oriented methods. Additionally, QoS-pro triggers the fewest Garbage Collection (GC) operations and minimally affects concurrently running workloads during GC operations.

Composable distributed real-time systems with deterministic network channels

A system that needs to interact with the physical world in a timely manner is called a real-time system. When such a system is composed of multiple subsystems, or nodes, each of which is a geographically separate system, such a system of systems is called a distributed real-time system. The computation at each node must adhere to the timing requirements, and the connecting communication channels must never cause delays that trigger further timing violations. In this paper, we introduce Deterministic Network Channels, a network construct using Time Sensitive Networking QoS mechanisms that add reliable and deterministic communication for distributed tasks. Introducing such network channels as a construct allows designers to focus on higher-level primitives when building distributed systems. We describe our reference implementation and evaluate it by extending Timed C with network channels. Building on this, we also perform a thorough performance evaluation to determine practical bounds for both Linux and TSN under heavy workloads and adverse network conditions to show how the proposed reference implementation performs in real-world scenarios. In our tests, we can synchronize two separate machines running commercial off-the-shelf hardware to within 15μs of each other under severe internal and external interference.

High-Precision Networking Services: Problems, Approaches, and Opportunities

One of the next waves of networking innovation is expected to be driven by the needs of applications that require communication services with stringent service level guarantees, for example near-deterministic and ultra-low end-to-end latency. Providing such services is riddled with challenges due to limitations with existing QoS mechanisms and application characteristics that are not tolerant of even slight degradation. In addition, to be deployable in practice, advances in accounting technology to be able to verify compliance of services with their guarantees will also be sorely needed, resulting in a separate set of challenges. This industry vision paper provides an overview of the problems, highlights some solution approaches, and articulates a set of very practical research challenges that, when successfully addressed, will have significant practical impact.

Improving QoS mechanisms for IEEE 802.11ax with overlapping basic service sets

Improving QoS mechanisms for IEEE 802.11ax with overlapping basic service sets

VoIP Performance Evaluation and Capacity Estimation Using different QoS Mechanisms

Data networks and new mobile networks (4G and 5G) deploy packet switching in their core networks. Due to this architecture VoIP protocols has a wide deployment in these environments. VoIP capacity and quality must be considered during VoIP protocols implementations. The aim of QoS mechanisms is to satisfy voice traffic requirements; this is deployed by using many tools like congestion management utilities, congestion avoidance utilities, and link fragmentation tools. Each tool has an impact on voice performance. Queuing is very important mechanisms in the traffic management system. Certain routers in data networks must deploy some QoS tools that control how different packets are temporally buffered until transmission on the interface. This paper studies the effect of different QoS tools on VoIP application performance and capacity via OPNET simulation. Also, the maximum VoIP capacity which gives accepted quality will be investigated.

A smart network and compute-aware Orchestrator to enhance QoS on cloud-based multimedia services

Rich-media applications deployed on cloud lead the use of the internet by people and organisations around the world. The advent of Software-Defined Networking (SDN), Networking Function Virtualisation (NFV), and Machine Learning (ML) techniques brings new possibilities to address carrier environment challenges, especially QoS. The literature does not show a smart and flexible solution that brings scalability with holistic management of network, compute, and application resources taking into account different approaches to enhance QoS. This paper presents the Orchestrator that manages agnostic network, compute, and applications resources hosted in the cloud. Through ML algorithms, our solution enhances QoS towards network resilience, bandwidth allocation based on real-time traffic, and end-to-end QoS mechanism to the event-driven scenario. The Orchestrator operation spans across different domains providing applications, virtual functions, and cloud resources management elastically. Our experimental evaluation in a large-scale testbed shows Orchestrator's capability to provide a smart jitter decrease using AI techniques.

A smart network and compute-aware Orchestrator to enhance QoS on cloud-based multimedia services

Rich-media applications deployed on cloud lead the use of the internet by people and organisations around the world. The advent of Software-Defined Networking (SDN), Networking Function Virtualisation (NFV), and Machine Learning (ML) techniques brings new possibilities to address carrier environment challenges, especially QoS. The literature does not show a smart and flexible solution that brings scalability with holistic management of network, compute, and application resources taking into account different approaches to enhance QoS. This paper presents the Orchestrator that manages agnostic network, compute, and applications resources hosted in the cloud. Through ML algorithms, our solution enhances QoS towards network resilience, bandwidth allocation based on real-time traffic, and end-to-end QoS mechanism to the event-driven scenario. The Orchestrator operation spans across different domains providing applications, virtual functions, and cloud resources management elastically. Our experimental evaluation in a large-scale testbed shows Orchestrator's capability to provide a smart jitter decrease using AI techniques.

Implementation and Evaluation of Activity-Based Congestion Management Using P4 (P4-ABC)

Activity-Based Congestion management (ABC) is a novel domain-based QoS mechanism providing more fairness among customers on bottleneck links. It avoids per-flow or per-customer states in the core network and is suitable for application in future 5G networks. However, ABC cannot be configured on standard devices. P4 is a novel programmable data plane specification which allows defining new headers and forwarding behavior. In this work, we implement an ABC prototype using P4 and point out challenges experienced during implementation. Experimental validation of ABC using the P4-based prototype reveals the desired fairness results.

A Study of the Effects on QoS in WiFi-Cellular Offloading Scenarios

Nowadays the mobile data usage has been significantly increased by an unprecedented amount with the wide spread of smart devices, which is known as the explosion of data traffic. The rapid growth in mobile data traffic leads to a deficiency of cellular network capacity. To solve this problem, readily available Wi-Fi networks are used to offload the data traffic from cellular networks. The Wi-Fi offloading must ensure guaranteed throughput and delay performance for the users. However, if the user doesn’t meet any Wi-Fi network during the download period, the quality of experience gets degraded. Quality of experience can be improved with the help of various techniques such as resource allocation, scheduling, and handoff schemes. To know the effect of the offloading process, some key parameters are identified in this paper and the effect of offloading on these parameters is studied. Here, in this paper a study of various parameters like download time, number of users, data size on the throughput, delay and packet loss is done in the cellular network -WiFi offloading scenarios. This study highlights the need for an efficient QoS mechanism in future heterogeneous networks. It can be considered as a research aspect in upcoming integrated networks.

QoS-enabled TCP for software-defined networks: a combined scheduler-per-node approach

Software-defined network (SDN) can ease the implementation of QoS concept by introducing a flexible and manageable mechanism to overcome the TCP pacing in the network and data centers which have burst traffics. SDN’s flexible structure lets the network manager control the resources while the traffic condition is changed. Therefore, it is possible to adopt an application flow rate based on its dynamic parameters such as delay and throughput. This paper studies a new dynamic QoS mechanism for SDNs. This mechanism improves the performance of TCP-based network traffic in the per-node model, compared with the classical end-to-end approach. In overall, we focused on two ideas: First, we alter the end-to-end holistic view of the TCP on per-node behavior. Second, we take advantage of a two-segment scheduler model. As a result, we are aware of congestion in the entire network nodes and are able to make a reaction to obtain the requested QoS. Simulation results show the effectiveness of the developed model.

Pre-Shaping Bursty Transmissions under IEEE802.1Q as a Simple and Efficient QoS Mechanism

Pre-Shaping Bursty Transmissions under IEEE802.1Q as a Simple and Efficient QoS Mechanism

Exploring a New Framework to Build Mobile QoS-Aware Applications and Services for Future Internet

Mobile users are making more demands of common networks by running applications such as network streaming of audio, video as well as immersive gaming that demand a high Quality of Service. One way to address this problem is by making services mobile, such that the services will move closer to the users as they move around. This ensures that low latencies are maintained between the client and server resulting in a better Quality of Service. At present, new architectures such as the Y-Comm framework, attempt to provide a platform to support intelligent service migration mechanisms. However, what is also needed is to provide QoS mechanisms in order to facilitate efficient service migration. This requires techniques to measure the QoS in terms of bandwidth, latency and burst characteristics at various locations to which the server could be migrated. In addition, the emergence of Software Defined Networking as well as new end to end control mechanisms such as the Network Management Control Protocol and the development of new transport protocols will allow a new framework to support mobile QoS-Aware applications and services that will be a key part of the Future Internet. This paper explores the development of a new applications and services framework for Future Internet that replaces the traditional IP framework. New mechanisms are developed to decide when and where to move services and a video on demand scenario is analysed. An analytical model is investigated to provide results based on bandwidth and latency. The results show that this approach is valid and should lead to better QoS and better Quality of Experience for mobile users.

QoS Mechanisms in NGN

QoS Mechanisms in NGN

Design and Implementation of SDN-based 6LBR with QoS Mechanism over Heterogeneous WSN and Internet

Design and Implementation of SDN-based 6LBR with QoS Mechanism over Heterogeneous WSN and Internet

Impact of Qos Mechanisms on the Performance of Dynamic Web Services in Heterogeneous Wireless Networks (802.11e and 802.16e)

The quality of service in heterogeneous wireless networks is increasingly demanded by customers and by Internet access providers. This paper studies and evaluates the impact of quality of service and the improvements induced on web-oriented services. The heterogeneous wireless networks studied in this paper are: 802.11e and 802.16e. Several scientific research work has been conducted evaluating the performance of heterogeneous wireless networks taking into account the quality of service. According to our research, no work has been done taking into account the convergence of two networks with mobility constraints. This study carried out under OPNET Modeler 14.5, varying the 802.11e QoS mechanisms (DCF, PCF, HCCA, EDCA) and 802.16e (Best Effort, nRTPS). The criteria of evaluation are: TCP delay, TCP retransmission count, HTTP Response and Database Page Response Time.

Optimized Routing Information Exchange in Hybrid IPv4-IPv6 Network using OSPFV3 & EIGRPv6

IPv6 is the next generation internet protocol which is gradually replacing the IPv4. IPv6 offers larger address space, simpler header format, efficient routing, better QoS and built-in security mechanisms. The migration from IPv4 to IPv6 cannot be attained in a short span of time. The main issue is compatibility and interoperability between the two protocols. Therefore, both the protocols are likely to coexist for a long time. Usually, tunneling protocols are deployed over hybrid IPv4-IPv6 networks to offer end-to-end IPv6 connectivity. Many routing protocols are used for IPv4 and IPv6. In this paper, researchers analyzed the optimized routing information exchange of two routing protocols (OSPFv3 & EIGRPv6) in hybrid IPv4-IPv6 network. Experimental results show that OSPFv3 performs better than EIGRPv6 in terms of most of the parameters i.e. convergence time, RTT, response time, tunnel overhead, protocol traffic statistics, CPU and memory utilization.

Performance Evaluation of Scalable Video Streaming in Mobile Ad hoc Networks

The development of video streaming services on wireless ad hoc networks is a challenge task as a consequence of different limitations such as bandwidth-constrained, variable capacity links and energy-constrained operation. Moreover, the dynamic topology of nodes causes frequent link failures and high error rates. We propose in this paper a performance evaluation of the scalable video streaming over mobile ad hoc networks. In particular, we focus on the rate-adaptive strategy for streaming scalable video (H.264/SVC). In order to provide QoS mechanisms in the routing process, a new routing protocol is introduced. This protocol estimates the available bandwidth value, which is sent to video source in order to adapt the bit rate during the video transmission. We also propose a simulation framework that supports evaluation studies for scalable video streaming. In the simulation experiments, SVC streams with combined scalability (quality and temporal scalability) were used. As quality scalability method, we used Medium Grain Scalability (MGS). The results reveal that the rate-adaptive method helps avoid or reduce the congestion in MANETs obtaining a better quality in the received videos.

Network delay guarantee for differentiated services in content-centric networking

The newly adopted built-in caching mechanism guarantees efficient content delivery for content-centric networking (CCN) as compared to the existing IP-based networks such as the Internet. However, it is a challenge at the same time for CCN to meet QoS requirements due to content caching. In this paper, we investigate the problem of providing network delay guaranteed services in CCN. More specifically, we study the problem of meeting network delay requirements for differentiated services (content providers) in CCN while at the same time optimizing the overall content delivery performance.To support delay guarantee, we first present a simple and holistic network model which characterizes network delays of routing content to clients at different locations. By aligning network locations with content popularity, we ensure that each content provider has an optimized network delay of routing content to clients. We then derive analytical network delays for content providers by incorporating their content distribution models into the proposed holistic network model, and further formulate the delay guarantee task as a nonlinear integer programming (NIP) problem under the given network resources and traffic access patterns. We evaluate our mechanism and investigate the optimized network performance using different real/synthetic network topologies. With numerical studies, we analyze the process of competing for the network resources by different content providers, and investigate how various factors (e.g., content popularity, traffic volume, router storage capacity) affect this competition process. Our models and results presented in this paper provide guidance in designing resource provisioning and QoS mechanisms for CCN.

Software defined autonomic QoS model for future Internet

Software defined technology has gained enormous momentum in both industry and academia. It may change the existing information flow architecture, which centered at hardware, by granting more privileges to deploy third-party software with more flexible network control and management capabilities. However, how to provide intelligent QoS guarantee in future network is still a hot research issue. Based on top-down design strategy, in this paper, we propose a hierarchical autonomic QoS model by adopting software-defined technologies. In this model, the network is divided into: data-plane, control-plane and management-plane. Then the data-plane is sliced as multiple virtual networks with the dynamic resource allocation capabilities, in order to carry different services or applications. The control-plane is abstracted as resource control layer and service control layer for each virtual network respectively. The management-plane then constructs hierarchical autonomic control loops in terms of different services’ bearing virtual networks and the corresponding hierarchical control logic. With the hierarchical autonomic control loop and layered service management functions, this model can provide dynamic QoS guarantee to the underlying data networks. We further proposed a context-aware Collaborative Borrowing Based Packet-Marking (CBBPM) algorithm. As an important underlying QoS component in data-plane, CBBPM can be combined with other QoS components to provide some new QoS functions. Experiment comparisons between different QoS mechanisms demonstrate the effectiveness of our proposed hierarchical autonomic QoS model and the packet marking mechanism.