scholarly journals Performance comparison between virtual MPLS IP network and real IP network without MPLS

2021 ◽  
Vol 12 (2) ◽  
pp. 83-90
Author(s):  
Ivan Nedyalkov
Keyword(s):  
Real Time ◽  
Ip Networks ◽  
Performance Comparison ◽  
Virtual Network ◽  
The Internet ◽  
Real Time Traffic ◽  
Ip Network ◽  
Different Types

In this paper an IP based network consisting of two separate IP networks - a virtual one, running MPLS and an experimental IP network, connected to the virtual one, have been studied. VoIP traffic is exchanged between the two networks. Both networks are connected to the Internet and exchange traffic with it. The virtual network is created by using GNS3. The purpose of this paper is to show a comparison in the performance between the two IP networks. In addition, mathematical distributions and approximations have been made to be used to further evaluate the performance of the two networks. The used methodology in the present work can be applied in the study of different IP networks through which different types of real-time traffic passes.

Buffer Management in Cellular IP Networks using Evolutionary Algorithms

2010 ◽  
Vol 1 (4) ◽  
pp. 1-22 ◽  
Author(s):  
Mohammad Anbar ◽  
Deo P. Vidyarthi
Keyword(s):  
Evolutionary Algorithms ◽  
Real Time ◽  
Optimization Problems ◽  
Buffer Management ◽  
Complex Problem ◽  
Base Station ◽  
Base Stations ◽  
Real Time Traffic ◽  
Ip Network ◽  
Cellular Ip

Real-time traffic in Cellular IP network is considered to be important and therefore given priority over non-real-time. Buffer is an important but scarce resource and to optimize Quality of Service by managing buffers of the network is an important and complex problem. Evolutionary Algorithms are quite useful in solving such complex optimization problems, and in this regard, a two-tier model for buffer, Gateway and Base Station, management in Cellular IP network has been propsed. The first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer of the gateway with a specified threshold. Packets which couldn’t be served, after the threshold, is given to the nearest cells of the network to be dealt with in the second tier, while Evolutionary Algorithm (EA) based procedures are applied in order to optimally store these packets in the buffer of the base stations. Experiments have been conducted to observe the performance of the proposed models and a comparative study of the models, GA based and PSO based, has been carried out to depict the advantage and disadvantage of the proposed models.

Hybrid Energy Efficient Protocol with Service Differentiation for QoS Provisions in Multi-Hop WSNs

2015 ◽  
Vol 6 (2) ◽  
pp. 27-47
Author(s):  
Amal Bourmada ◽  
Azeddine Bilami
Keyword(s):  
Quality Of Service ◽  
Real Time ◽  
Wireless Sensors ◽  
Service Differentiation ◽  
Hybrid Energy ◽  
Real Time Traffic ◽  
Asset Tracking ◽  
Different Types ◽  
Different Levels

The growing demand of usage of wireless sensors networks (WSNs) in multiple types of applications such as environment monitoring or asset tracking makes the quality-of-service (QoS) a paramount topic in wireless sensors applications. In these applications, each sensor node may collect different types of data with different levels of importance involving a different treatment to meet QoS purpose. Consequently, a sensor network should be ready to spend more resources in transmitting packets that hold more important information. In this paper, the authors propose an enhanced protocol with differentiated services for WSNs called QoS-HEEP. The proposed protocol is an improvement of HEEP protocol while providing requested quality of service for high priority real time traffic, which is distinguished from the low priority and non-real time traffic. Thus, input traffic streams are served based on their priorities. Through simulations using NS Simulator; it is observed that the authors' proposal outperforms more than other protocols developed in the literature for QoS provisions in WSNs.

On Demand Bandwidth Reservation for Real-Time Traffic in Cellular IP Network using Particle Swarm Optimization

2011 ◽  
pp. 215-228 ◽  
Author(s):  
Mohammad Anbar ◽  
D.P. Vidyarthi
Keyword(s):  
Particle Swarm Optimization ◽  
Real Time ◽  
Particle Swarm ◽  
Bandwidth Reservation ◽  
Swarm Optimization ◽  
Available Bandwidth ◽  
On Demand ◽  
Real Time Traffic ◽  
Ip Network ◽  
Cellular Ip

Cellular IP network deals with micro mobility of the mobile devices. An important challenge in wireless communication, especially in cellular IP based network, is to provide good Quality of Service (QoS) to the users in general and to the real-time users (users involved in the exchange of real-time packets) in particular. Reserving bandwidth for real time traffic to minimize the connection drop (an important parameter) is an activity often used in Cellular IP network. Particle Swarm Optimization (PSO) algorithm simulates the social behavior of a swarm or flock to optimize some characteristic parameter. PSO is effectively used to solve many hard optimization problems. The work, in this paper, proposes an on demand bandwidth reservation scheme to improve Connection Dropping Probability (CDP) in cellular IP network by employing PSO. The swarm, in the model, consists of the available bandwidth in the seven cells of the cellular IP network. The anytime bandwidth demand for real-time users is satisfied by the available bandwidth of the swarm. The algorithm, used in the model, searches for the availability of the bandwidth and reserves it in the central cell of the swarm. Eventually, it will allocate it on demand to the cell that requires it. Simulation experiments reveal the efficacy of the model.

ANALYTICAL PERFORMANCE EVALUATION OF LOW-BITRATE REAL-TIME TRAFFIC MULTIPLEXING IN UMTS OVER IP NETWORKS

2001 ◽  
Vol 02 (01) ◽  
pp. 147-174
Author(s):  
MICHAEL MENTH
Keyword(s):  
Real Time ◽  
Substantial Effect ◽  
Ip Networks ◽  
Time Analysis ◽  
Network Resources ◽  
Real Time Traffic ◽  
User Data ◽  
Ip Packet ◽  
Traffic Multiplexing ◽  
Data Multiplexing

Voice and circuit switched data will be carried over IP networks in the wireline part of the future UMTS. The commonly used protocol suite for low-bitrate real-time traffic transmission in the Internet leads to large header overhead, i.e., to low utilization of the network resources by user data. Multiplexing packets of different flows into a single IP packet reduces this effect. We model packet tunneling and multiplexing with subsequent spacing in IP networks. We derive a discrete-time analysis based on a framework for solving Markov chains. The numerical results show the superiority of multiplexing schemes provided that parameters are set in an appropriate way since there are many performance tradeoffs that have substantial effect on the efficiency of the system.

Sign in / Sign up

Export Citation Format

Share Document