Performance Metrics for SIP-Based VoIP Applications Over DMO

2017 ◽  
pp. 50-79 ◽  
Author(s):  
Mazin I. Alshamrani ◽  
Ashraf A. Ali
Keyword(s):  
Communication Systems ◽  
Performance Metrics ◽  
Evaluation Studies ◽  
Objective Method ◽  
Subjective Method ◽  
Opinion Score ◽  
End To End ◽  
Sip Proxy ◽  
Voice Data ◽  
Voice Calls

The evaluation studies need to investigate a determined performance metrics to understand and evaluate the examined scenarios. SIP-based Voice over IP (VoIP) applications over MANET, which behaves in a way similar to Direct Mode of Operation (DMO) in mission Critical Communication Systems, have two main performance categories related to the Quality of Service (QoS). The main performance metrics that are considered for the evaluation processes in this research are the SIP end-to-end Performance metrics as defined by the RFC 6076. The main performance metrics are related to the registration, the call setup, and the call termination processes. In this research study, the SIP performance metrics are based on a single SIP proxy server. For voice data, the QoS evaluation is based on two methods: The Objective method and the Subjective method. The Objective method considers the traffic throughput, end-to-end delays, packet loss, and jitter, while the subjective method considers the Mean Opinion Score (MOS), which is mostly related to the end users' experiences during voice calls.

scholarly journals Improved Buffer-Aided Multi-Hop Relaying with Reduced Outage and Packet Delay in Cognitive Radio Networks

Electronics ◽  
2019 ◽  
Vol 8 (8) ◽  
pp. 895
Author(s):  
Shakeel Alvi ◽  
Riaz Hussain ◽  
Qadeer Hasan ◽  
Shahzad Malik
Keyword(s):  
Cognitive Radio ◽  
Outage Probability ◽  
Cognitive Radio Networks ◽  
Communication Systems ◽  
Performance Metrics ◽  
Packet Delay ◽  
Radio Spectrum ◽  
Radio Networks ◽  
Cooperative Relaying ◽  
End To End

Cognitive radio networks have emerged to exploit optimally the scarcely-available radio spectrum resources to enable evolving 5G wireless communication systems. These networks tend to cater to the ever-increasing demands of higher data rates, lower latencies and ubiquitous coverage. By using the buffer-aided cooperative relaying, a cognitive radio network can enhance both the spectral efficiency and the range of the network; although, this could incur additional end-to-end delays. To mitigate this possible limitation of the buffer-aided relaying in the underlay cognitive network, a virtual duplex multi-hop scheme, referred as buffer-aided multi-hop relaying, is proposed, which improves throughput and reduces end-to-end delays while keeping the outage probability to a minimum as well. This scheme simultaneously takes into account the inter-relay interference and the interference to the primary network. The proposed scheme is modeled as a Markov chain, and Monte Carlo simulations under various scenarios are conducted to evaluate several key performance metrics such as throughput, outage probability, and average packet delay. The results show that the proposed scheme outperforms many non-buffer-aided relaying schemes in terms of outage performance. When compared with other buffer-aided relaying schemes such as max-max, max-link, and buffer-aided relay selection with reduced packet delay, the proposed scheme demonstrated better interference mitigation without compromising the delay performance as well.

scholarly journals Distributed Channel Ranking Scheduling Function for Dense Industrial 6TiSCH Networks

Sensors ◽  
2021 ◽  
Vol 21 (5) ◽  
pp. 1593
Author(s):  
Ismael Amezcua Valdovinos ◽  
Patricia Elizabeth Figueroa Millán ◽  
Jesús Arturo Pérez-Díaz ◽  
Cesar Vargas-Rosales
Keyword(s):  
Kalman Filtering ◽  
Bandwidth Allocation ◽  
Communication Systems ◽  
High Reliability ◽  
Allocation Mechanism ◽  
Elapsed Time ◽  
Packet Arrival ◽  
End To End ◽  
Ieee 802.15.4E ◽  
Number Of Cells

The Industrial Internet of Things (IIoT) is considered a key enabler for Industry 4.0. Modern wireless industrial protocols such as the IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) deliver high reliability to fulfill the requirements in IIoT by following strict schedules computed in a Scheduling Function (SF) to avoid collisions and to provide determinism. The standard does not define how such schedules are built. The SF plays an essential role in 6TiSCH networks since it dictates when and where the nodes are communicating according to the application requirements, thus directly influencing the reliability of the network. Moreover, typical industrial environments consist of heavy machinery and complementary wireless communication systems that can create interference. Hence, we propose a distributed SF, namely the Channel Ranking Scheduling Function (CRSF), for IIoT networks supporting IPv6 over the IEEE 802.15.4e TSCH mode. CRSF computes the number of cells required for each node using a buffer-based bandwidth allocation mechanism with a Kalman filtering technique to avoid sudden allocation/deallocation of cells. CRSF also ranks channel quality using Exponential Weighted Moving Averages (EWMAs) based on the Received Signal Strength Indicator (RSSI), Background Noise (BN) level measurements, and the Packet Delivery Rate (PDR) metrics to select the best available channel to communicate. We compare the performance of CRSF with Orchestra and the Minimal Scheduling Function (MSF), in scenarios resembling industrial environmental characteristics. Performance is evaluated in terms of PDR, end-to-end latency, Radio Duty Cycle (RDC), and the elapsed time of first packet arrival. Results show that CRSF achieves high PDR and low RDC across all scenarios with periodic and burst traffic patterns at the cost of increased end-to-end latency. Moreover, CRSF delivers the first packet earlier than Orchestra and MSF in all scenarios. We conclude that CRSF is a viable option for IIoT networks with a large number of nodes and interference. The main contributions of our paper are threefold: (i) a bandwidth allocation mechanism that uses Kalman filtering techniques to effectively calculate the number of cells required for a given time, (ii) a channel ranking mechanism that combines metrics such as the PDR, RSSI, and BN to select channels with the best performance, and (iii) a new Key Performance Indicator (KPI) that measures the elapsed time from network formation until the first packet reception at the root.

scholarly journals Homogeneous row-continuous bivariate markov chains with boundaries

1988 ◽  
Vol 25 (A) ◽  
pp. 237-256
Author(s):  
J. Keilson ◽  
M. Zachmann
Keyword(s):  
Data Transmission ◽  
Communication Systems ◽  
Buffer Capacity ◽  
Passage Time ◽  
Finite Buffer ◽  
Transition Rates ◽  
Boundary Problems ◽  
Ergodic Distribution ◽  
The Matrix ◽  
Voice Data

The matrix-geometric results of M. Neuts are extended to ergodic row-continuous bivariate Markov processes [J(t), N(t)] on state space B = {(j, n)} for which: (a) there is a boundary level N for N(t) associated with finite buffer capacity; (b) transition rates to adjacent rows and columns are independent of row level n in the interior of B. Such processes are of interest in the modelling of queue-length for voice-data transmission in communication systems. One finds that the ergodic distribution consists of two decaying components of matrix-geometric form, the second induced by the finite buffer capacity. The results are obtained via Green's function methods and compensation. Passage-time distributions for the two boundary problems are also made available algorithmically.

scholarly journals A Nonlinear Model For The Optimal Capacity Placement In Self-Healing ATM Networks Based On Link Restoration Strategy

2021 ◽  
Author(s):  
ABM B. Alam
Keyword(s):  
Communication Systems ◽  
Large Scale ◽  
Performance Metrics ◽  
Asynchronous Transfer Mode ◽  
Critical Issue ◽  
Self Healing ◽  
Network Failure ◽  
Optimal Capacity ◽  
Telecommunications Network ◽  
Important Challenge

Network Survivability is a critical issue in telecommunications network due to increasing dependence of the society on communication systems. Fast restoration from a network failure is an important challenge that deserves attention. This thesis addresses an optimal link capacity design problem for survivable asynchronous transfer mode (ATM) network based on the link restoration strategy. Given a projected traffic demands and the network topology, capacity and flow assignment are jointly optimized to yield the optimal capacity placement. The problem is formulated as large-scale nonlinear programming and is solved using a specific type of Lagrange method (so called Separable Augmented Lagrangian Algorithm or SALA for short). Several networks with diverse topological characteristics are used in the experiments to validate our proposed novel model, using capacity installation cost, routing cost, total network cost, used capacity and required CPU time, as performance metrics. Link restoration strategy is compared against global reconfiguration strategy using these performance metrics.

Lending a Hand

2013 ◽  
pp. 1-29
Author(s):  
George T. Karetsos
Keyword(s):  
Communication Systems ◽  
Performance Metrics ◽  
Control Design ◽  
Medium Access ◽  
Design And Implementation ◽  
Data Rates ◽  
Capacity Bounds ◽  
Cooperative Networking ◽  
Outage Probabilities ◽  
And Performance

Cooperative networking is considered one of the main enablers for achieving enhanced data rates in wireless communications. This is due to the fact that through cooperation the adverse effects of fading can be alleviated significantly. Thus, more reliable communication systems deployments can be devised, and performance enhancements can be achieved. In this chapter, the authors discuss the main aspects of cooperative networking starting from the main historical milestones that shaped the idea. Then they focus on the main mechanisms and techniques that foster cooperation and continue by studying performance metrics for various possible deployments, such as capacity bounds and outage probabilities. Finally, the authors take a more practical viewpoint and discuss aspects related to medium access control design and implementation that can serve as a stepping stone for the widespread deployment of cooperative networking.

Secure Buffer-Based Routing Protocol for WMN

2017 ◽  
Vol 13 (1) ◽  
pp. 28-44
Author(s):  
Geetanjali Rathee ◽  
Hemraj Saini
Keyword(s):  
Routing Protocol ◽  
Performance Metrics ◽  
Packet Delivery Ratio ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Link Failure ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End ◽  
Network Metrics

Secure routing is considered as one of a key challenge in mesh networks because of its dynamic and broadcasting nature. The broadcasting nature of mesh environment invites number of security vulnerabilities to come and affect the network metrics drastically. Further, any node/link failure of a routed path may reduce the performance of the entire network. A number of secure routing protocols have been proposed by different researchers but enhancement of a single network parameter (i.e. security) may affect another performance metrics significantly i.e. throughput, end to end delay, packet delivery ratio etc. In order to ensure secure routing with improved network metrics, a Secure Buffer based Routing Protocol i.e. SBRP is proposed which ensures better network performance with increased level of security. SBRP protocol uses buffers at alternate positions to fasten re-routing mechanism during node/link failure and ensures the security using AES encryption. Further the protocol is analyzed against mAODV protocol in both static and dynamic environment in terms of security, packet delivery ratio, end to end delay and network throughput.

Geometric sequence based multipath routing protocol for multi-hop ad hoc networks

2016 ◽  
Vol 12 (4) ◽  
pp. 394-407 ◽  
Author(s):  
Yahya M. Tashtoush ◽  
Mohammad A. Alsmirat ◽  
Tasneem Alghadi
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Transmission Rate ◽  
Multipath Routing ◽  
Delivery Ratio ◽  
Content Type ◽  
End To End Delay ◽  
Geometric Sequence ◽  
End To End

Purpose The purpose of this paper is to propose, a new multi-path routing protocol that distributes packets over the available paths between a sender and a receiver in a multi-hop ad hoc network. We call this protocol Geometric Sequence Based Multipath Routing Protocol (GMRP). Design/methodology/approach GMRP distributes packets according to the geometric sequence. GMRP is evaluated using GloMoSim simulator. The authors use packet delivery ratio and end-to-end delay as the comparison performance metrics. They also vary many network configuration parameters such as number of nodes, transmission rate, mobility speed and network area. Findings The simulation results show that GMRP reduces the average end-to-end delay by up to 49 per cent and increases the delivery ratio by up to 8 per cent. Originality/value This study is the first to propose to use of geometric sequence in the multipath routing approach.

Sign in / Sign up

Export Citation Format

Share Document