Comparative study of two CPU router time management algorithms in cellular IP networks

2010 ◽  
Vol 21 (2) ◽  
pp. 120-129
Author(s):  
Deo Prakash Vidyarthi ◽  
Mohammad Anbar
Keyword(s):  
Comparative Study ◽  
Time Management ◽  
Ip Networks ◽  
Cellular Ip ◽  
Management Algorithms

scholarly journals Router CPU Time Management in Cellular IP Networks using GA

2010 ◽  
Vol 1 (3) ◽  
pp. 130-136 ◽  
Author(s):  
Mohammad Anbar ◽  
Deo Prakash Vidyarthi
Keyword(s):  
Time Management ◽  
Ip Networks ◽  
Cpu Time ◽  
Cellular Ip

scholarly journals Adaptive semi-soft handoff for Cellular IP networks

2007 ◽  
Vol 2 (2/3) ◽  
pp. 109 ◽  
Author(s):  
Eriko Nurvitadhi ◽  
Ben Lee ◽  
Chansu Yu ◽  
Myungchul Kim
Keyword(s):  
Ip Networks ◽  
Soft Handoff ◽  
Cellular Ip

Buffer Management in Cellular IP Network using PSO

2011 ◽  
pp. 80-92
Author(s):  
Mohammad Anbar ◽  
Deo Prakash Vidyarthi
Keyword(s):  
Buffer Management ◽  
Window Size ◽  
Threshold Value ◽  
Pso Algorithm ◽  
Ip Networks ◽  
Base Station ◽  
Computational Method ◽  
Ip Network ◽  
Cellular Ip ◽  
Second Tier

Cellular IP networks deal with the concepts of micro-mobility. Buffer management in Cellular IP networks is very crucial as its proper usage not only increases the throughput of the network but also results in the reduction of the call drops. This article proposes a model for buffer management in Cellular IP network using Particle Swarm Optimization (PSO), an evolutionary computational method often used to solve hard problems. The model considers two kinds of buffers; Gateway buffer and Base Station buffer. In the proposed two-tier model, the first tier applies a prioritization algorithm for prioritizing real-time packets in the buffer. In the second tier PSO algorithm is used on a swarm of cells in the network. PSO is applied for a given time slot, called window. In each window period the swarm can store number of packets depending on the window size and the total number of packets. The effect of various parameters e.g. number of packets, size of packets, window size, and a threshold value on buffer utilization has been studied by conducting the simulation experiments.

A Comparative Study of Evolutionary Algorithms for Maximizing Reliability of a Flow in Cellular IP Network

2012 ◽  
pp. 247-257
Author(s):  
Mohammad Anbar ◽  
Deo P. Vidyarthi
Keyword(s):  
Evolutionary Algorithms ◽  
Comparative Study ◽  
Rapid Development ◽  
Experimental Studies ◽  
Access Network ◽  
Search Space ◽  
Ip Network ◽  
Cellular Ip ◽  
Reliability Issue ◽  
Characteristic Measure

The rapid development in technology, witnessed in daily communication, especially in wireless communication, is a good motivation for performance improvement in this field. Cellular IP access network is a suitable environment where a micro mobility of mobile users is implemented and managed. The reliability of Cellular IP network during the communication is an important characteristic measure and must be considered while designing a new model. Evolutionary Algorithms are powerful tools for optimization and problem solving, which require extracting the best solution from a big search space. This chapter explores the reliability issue in Cellular IP of a flow of packets passing through the route from a source to a destination. The main aim of the chapter is to maximize the reliability of the flow passing through a route having number of routers. Two Evolutionary Algorithms (EAs), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), have been used for this purpose, and a comparative study between the two is performed. Experimental studies of the proposed work have also been performed.

Sign in / Sign up

Export Citation Format

Share Document