Checkpoint and recovery protocols are commonly used in distributed applications for providing fault
tolerance. A distributed system may require taking checkpoints from time to time to keep it free of arbitrary
failures. In case of failure, the system will rollback to checkpoints where global consistency is preserved.
Checkpointing is one of the fault-tolerant techniques to restore faults and to restart job fast. The algorithms
for checkpointing on distributed systems have been under study for years.
It is known that checkpointing and rollback recovery are widely used techniques that allow a distributed
computing to progress inspite of a failure.There are two fundamental approaches for checkpointing and
recovery.One is asynchronus approach, process take their checkpoints independenty.So,taking checkpoints
is very simple but due to absence of a recent consistent global checkpoint which may cause a rollback of
computation.Synchronus checkpointing approach assumes that a single process other than the application
process invokes the checkpointing algorithm periodically to determine a consistent global checkpoint.
Novel cell selection proceduref lte hetnets based on mathematical modelling o...ijwmn
Femtocells have been considered one of the most important technologies in LTE networks to solve indoor
coverage problem, however the randomness deployment of femtocells, leads to great challenge for selecting
optimum serving cell. In this work, a new cell selection algorithm is proposed that enables new user to
select best serving cell whereas several factors are put into consideration other than highest instantaneous
SNR or maximum RSRP such as cell load .A new prediction algorithm is designed to predict the
performance of (PF) scheduling algorithm to calculate expected number of RBs to be scheduled to new
user, then reduction in achievable data rate due to both received SNR and instant cell load is estimated.
The numerical results show that the new proposed cell selection algorithm achieves higher average cell
throughput than conventional cell selection methods and achieves less cell load variance between different
adjacent cells.
Priority based bandwidth allocation in wireless sensor networksIJCNCJournal
Most of the sensor network applications need real time communication and the need for deadline aware real time communication is becoming eminent in these applications. These applications have different dead line requirements also. The real time applications of wireless sensor networks are bandwidth sensitive and need higher share of bandwidth for higher priority data to meet the dead line requirements. In this paper we focus on the MAC layer modifications to meet the real time requirements of different priority data.Bandwidth partitioning among different priority transmissions is implemented through MAC layer modifications. The MAC layer implements a queuing model that supports lower transfer rate for lower
priority packets and higher transfer rate for real
time packets with higher priority, minimizing the end to
end delay. The performance of the algorithm is evaluated with varying node distribution
.
CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMRijujournal
This paper describes two-fold approach towards utilizing Triple Modular Redundancy (TMR) in Wireless
Adhoc Network (AdocNet). A distributed checkpointing and recovery protocol is proposed. The protocol
eliminates useless checkpoints and helps in selecting only dependent processes in the concerned
checkpointing interval, to recover. A process starts recovery from its last checkpoint only if it finds that it is
dependent (directly or indirectly) on the faulty process. The recovery protocol also prevents the occurrence
of missing or orphan messages. In AdocNet, a set of three nodes (connected to each other) is considered to
form a TMR set, being designated as main, primary and secondary. A main node in one set may serve as
primary or secondary in another. Computation is not triplicated, but checkpoint by main is duplicated in its
primary so that primary can continue if main fails. Checkpoint by primary is then duplicated in secondary
if primary fails too.
Soft Real-Time Guarantee for Control Applications Using Both Measurement and ...CSCJournals
In this paper, we present a probabilistic admission control algorithm over switched Ethernet to support soft real-time control applications with heterogeneous periodic flows. Our approach is purely end host based, and it enables real-time application-to-application QoS management over switched Ethernet without sophisticated packet scheduling or resource reservation mechanisms in Ethernet switches or middleware on end hosts. In designing the probabilistic admission control algorithm, we employ both measurement and analytical techniques. In particular, we provide a new and efficient method to identify and estimate the queueing delay probability inside Ethernet switches for heterogeneous periodic flows with variable message size and period. We implement the probabilistic admission control algorithm on the Windows operating system, and validated its efficacy through extensive experiments.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
Novel cell selection proceduref lte hetnets based on mathematical modelling o...ijwmn
Femtocells have been considered one of the most important technologies in LTE networks to solve indoor
coverage problem, however the randomness deployment of femtocells, leads to great challenge for selecting
optimum serving cell. In this work, a new cell selection algorithm is proposed that enables new user to
select best serving cell whereas several factors are put into consideration other than highest instantaneous
SNR or maximum RSRP such as cell load .A new prediction algorithm is designed to predict the
performance of (PF) scheduling algorithm to calculate expected number of RBs to be scheduled to new
user, then reduction in achievable data rate due to both received SNR and instant cell load is estimated.
The numerical results show that the new proposed cell selection algorithm achieves higher average cell
throughput than conventional cell selection methods and achieves less cell load variance between different
adjacent cells.
Priority based bandwidth allocation in wireless sensor networksIJCNCJournal
Most of the sensor network applications need real time communication and the need for deadline aware real time communication is becoming eminent in these applications. These applications have different dead line requirements also. The real time applications of wireless sensor networks are bandwidth sensitive and need higher share of bandwidth for higher priority data to meet the dead line requirements. In this paper we focus on the MAC layer modifications to meet the real time requirements of different priority data.Bandwidth partitioning among different priority transmissions is implemented through MAC layer modifications. The MAC layer implements a queuing model that supports lower transfer rate for lower
priority packets and higher transfer rate for real
time packets with higher priority, minimizing the end to
end delay. The performance of the algorithm is evaluated with varying node distribution
.
CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMRijujournal
This paper describes two-fold approach towards utilizing Triple Modular Redundancy (TMR) in Wireless
Adhoc Network (AdocNet). A distributed checkpointing and recovery protocol is proposed. The protocol
eliminates useless checkpoints and helps in selecting only dependent processes in the concerned
checkpointing interval, to recover. A process starts recovery from its last checkpoint only if it finds that it is
dependent (directly or indirectly) on the faulty process. The recovery protocol also prevents the occurrence
of missing or orphan messages. In AdocNet, a set of three nodes (connected to each other) is considered to
form a TMR set, being designated as main, primary and secondary. A main node in one set may serve as
primary or secondary in another. Computation is not triplicated, but checkpoint by main is duplicated in its
primary so that primary can continue if main fails. Checkpoint by primary is then duplicated in secondary
if primary fails too.
Soft Real-Time Guarantee for Control Applications Using Both Measurement and ...CSCJournals
In this paper, we present a probabilistic admission control algorithm over switched Ethernet to support soft real-time control applications with heterogeneous periodic flows. Our approach is purely end host based, and it enables real-time application-to-application QoS management over switched Ethernet without sophisticated packet scheduling or resource reservation mechanisms in Ethernet switches or middleware on end hosts. In designing the probabilistic admission control algorithm, we employ both measurement and analytical techniques. In particular, we provide a new and efficient method to identify and estimate the queueing delay probability inside Ethernet switches for heterogeneous periodic flows with variable message size and period. We implement the probabilistic admission control algorithm on the Windows operating system, and validated its efficacy through extensive experiments.
DYNAMIC TASK SCHEDULING BASED ON BURST TIME REQUIREMENT FOR CLOUD ENVIRONMENTIJCNCJournal
Cloud computing has an indispensable role in the modern digital scenario. The fundamental challenge of cloud systems is to accommodate user requirements which keep on varying. This dynamic cloud environment demands the necessity of complex algorithms to resolve the trouble of task allotment. The overall performance of cloud systems is rooted in the efficiency of task scheduling algorithms. The dynamic property of cloud systems makes it challenging to find an optimal solution satisfying all the evaluation metrics. The new approach is formulated on the Round Robin and the Shortest Job First algorithms. The Round Robin method reduces starvation, and the Shortest Job First decreases the average waiting time. In this work, the advantages of both algorithms are incorporated to improve the makespan of user tasks.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
Online opportunistic routing using Reinforcement learningHarshal Solao
Cognitive radio network hold the key to achieve better radio bandwidth utilization and improve the quality of wireless application. The topology of Cognitive radio ad-hoc network can change dynamically through frequently changing nodes.
This project work propose a scheme that uses a reinforcement learning method to route the packet from source to destination in which nodes share channel information to each other to select best relay node among them.The main goal of this work
is to compute prior time channel availability using of Hidden Markov Model. This
scheme model strategic interaction among multiple cognitive nodes for selecting best
candidate forwarder and maximize average per packet reward between source and
destination. That collectively addresses the issue of learning and routing in an opportunistic manner even in the absence of reliable knowledge about channel statistics and network model.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
An Efficient Parallel Algorithm for Secured Data Communication Using RSA Publ...Harshal Solao
Public key infrastructure based cryptographic algorithms are usually considered as
slower than their corresponding symmetric key based algorithms due to their root in modular
arithmetic. In the RSA public-key security algorithm, the encryption and decryption
is entirely based on modular exponentiation and modular reduction which are performed on
very large integers, typically 1024 bits. Due to this reason the sequential implementation of
RSA becomes compute-intensive and takes lot of time and energy to execute. Moreover, it
is very difficult to perform intense modular computations on very large integers because of
the limitation in size of basic data types available with GCC infrastructure. In this topic,
we are looking into the possibility of improving the performance of proposed parallel RSA
algorithm by using two different techniques simultaneously, first implementing modular calculation
on larger integers using OpenMP on the GCC infrastructure. I have also analyzed
the performance gained by computing the sequential version with the parallel version of RSA running on the GCC infrastructure.
Cellular wireless systems like GSM suffer from congestion resulting in overall system degradation and poor service delivery. When the traffic demand in a geographical area is high, the input traffic rate will exceed thecapacity of the output lines. This work focused on homogenous wireless network (the network traffic and resource dimensioning that are statistically identical) such that the network performance
evaluation can be reduced to a system with single cell and a single traffic type. Such system can employa queuing model to evaluate the performance metric of a cell in terms of blocking probability.
Five congestion control models were compared in the work to ascertain their peculiarities, they are Erlang B, Erlang C, Engset (cleared), Engset (buffered), and Bernoulli. To analyze the system, an aggregate onedimensional Markov chain wasderived, such that it describes a call arrival process under the assumption
that it is Poisson distributed. The models were simulated and their results show varying performances, however the Bernoulli model (Pb5) tends to show a situation that allows more users access to the system and the congestion level remain unaffected despite increase in the number of users and the offered traffic into the system.
Exploiting Wireless Networks, through creation of Opportunity Network – Wirel...ijasuc
Spotting Opportunity today and recognizing the same is the vision of the expert. The wireless
communication network regime is one such environment that offers such a platform for many working
scientific, academic and engineering experts. Henceforth, “Opportunistic-network” is a recent evolution
of the above said phenomena in the wireless community. They function by spontaneous cooperation &
coordination giving birth to a special type network called wireless-mobile-adhoc-network (W-MAN). As
said, these networks are formed instantaneously in a random manner – breaking the conventional
mathematically evolved algorithms’, and provided the quintessential of a network(s) that exist in
neighbourhood(s) or approachable limits. Is more of situational based, exploited for specialized purpose
or advantage, which mimics all the characteristic of a well evolved network. Such networks, lack an endto-end path, contact, cooperation and coordination; which is mainly opportunity based, and break or
even disintegrate soon after discovery, thus the challenge lay in integration, construction and probable
sustenance or even mid-way reconstruction till purpose. One can cite many realistic scenarios fitting to
this situation. For example, wildlife tracking sensor networks, military networks, vehicular ad hoc
networks to mention a few. To transmit information under such circumstances/scenarios researchers have
proposed various efficient forwarding (single copy), replication routing and controlled based schemes. In
this paper, we propose to explore, investigate and analyze most of the schemes [1] [2] [3] [4] [5] [6] and
present the findings of the said scheme by consolidating critical parameters and issues and towards the
end of this paper, algorithms, possible solutions to deal with such complex and dynamic situations
through W-MAN scheme suggested by us.
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Scheduling is one of the most important fundamental concepts in operating systems. Round
Robin (RR) scheduling is one of the most widely used algorithms in multitasking and real time
environments [1]. In multitasks environments, it is necessary to select the process among a set of
processes. The CPU is allocated to the selected process and controlled by the scheduling algorithm. Each
scheduling algorithm has its own needs, advantages and disadvantages. In this paper we have studied RR
and focused on Dynamic Round Robin algorithm (DRR) and its impact on the processes, which grow in
its burst time in a non-deterministic way with different sets of phenomenon and compared the results.
DEADLOCK RECOVERY TECHNIQUE IN BUS ENHANCED NOC ARCHITECTUREVLSICS Design
Increase in the speed of processors has led to crucial role of communication in the performance of systems. As a result, routing is taken into consideration as one of the most important subjects of the Network on Chip architecture. Routing algorithms to deadlock avoidance prevent packets route completely based on network traffic condition by means of restricting the route of packets. This action leads to less performance especially in non-uniform traffic patterns. On the other hand True Fully Adoptive Routing algorithm provides routing of packets completely based on traffic condition. However, deadlock detection and recovery mechanisms are needed to handle deadlocks. Use of global bus beside NoC as a parallel supportive environment, provide platform to offer advantages of both features of bus and NoC. This bus is useful for broadcast and multicast operations, sending delay sensitive signals, system management and other services. In this research, we use this bus as an escaping path for deadlock recovery technique. According to simulation results, this bus is suitable platform for deadlock recovery technique.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
Multilevel priority packet scheduling scheme for wireless networksijdpsjournal
Scheduling different types of packets such as real
-
time and non
-
real time data packets in wireless links is
necessary to reduce energy consumption of the wireless device. Most of the existing packet schedulin
g
mechanism uses opportunistic transmission sche
duling, in which communication is postponed upto an
acceptable time deadline until the best expected channel conditions to transmit are found. This algo
rithm
incurs a large processing overhead and more energy consumption. In this paper we propose a Dynamic
Multilevel Queue Scheduling algorithm. In the proposed scheme, the ready queue is partitioned into t
hree
levels of priority queues. Real
-
time packets are placed into the highest priority queue and non
-
real time
data packets are placed into two other queue
s. We evaluate the performance of the proposed Dynamic
Multilevel Queue Scheduling scheme through simulations for real
-
time and non
-
real time data. Simulation
results illustrate that the Multilevel Priority packet scheduling scheme overcomes the convention
al methods
interms of average data waiting time and end
-
to
-
end delay
Analysing Mobile Random Early Detection for Congestion Control in Mobile Ad-h...IJECEIAES
This research paper suggests and analyse a technique for congestion control in mobile ad hoc networks. The technique is based on a new hybrid approach that uses clustering and queuing techniques. In clustering, in general cluster head transfers the data, following a queuing method based on a RED (Random Early Detection), the mobile environment makes it Mobile RED (or MRED), It majorly depends upon mobility of nodes and mobile environments leads to unpredictable queue size. To simulate this technique, the Network Simulator 2 (or NS2) is used for various scenarios. The simulated results are compared with NRED (Neighbourhood Random Early Detection) queuing technique of congestion control. It has been observed that the results are improved using MRED comparatively.
Enchancing the Data Collection in Tree based Wireless Sensor Networksijsrd.com
Number of techniques used in Wireless Sensor Network to improve data collection from sensor nodes. It achieve by minimize the schedule length and dynamic channel assignment. Schedule length minimized by BFS algorithm without interfering links. Interfering links can be eliminated by transmission power control and multi frequency. The power can be save by using beacon signal. Collection of data can also be limited by topology of network. So the nodes are arranged in form. The capacitated minimal spanning trees and degree- constrained spanning trees give significant improvement in scheduling. Finally the data collection is enhancing in terms of security by using T-Hash Chain algorithm.
Automatic analysis of smoothing techniques by simulation model based real tim...ijesajournal
The pivotal research work that has been carried out and described in this literature acknowledges the
importance of various smoothing techniques for processing 3D human faces from 2.5D range face images.
The smoothing techniques have been developed and implemented using MATLAB-Simulink for real time
processing in embedded system. In addition, the significance of smoothed 2.5D range image over original
face range image has been discovered as well as its time complexity has also been reported with array of
experiments. The variations in time complexities are also accomplished using different optimization levels
and execution modes. A set of filtering techniques such as, Max filter, Min filter, Median filter, Mean filter,
Mid-point filter and Gaussian filter, have been designed and illustrated using Simulink model. The model
takes depth face image (i.e. the range face image) as input in real time and presents the improvement over
original face images. In the design flow, the performance of every block has also been characterized by
range face images from Frav3D, GavabDB, and Bosphorus databases. In the experimental section of this
research article, an array of performance analysis for these smoothing techniques with variation of
frameworks is explained.
MULTI-CLUSTER MULTI-CHANNEL SCHEDULING (MMS) ALGORITHM FOR MAXIMUM DATA COLLE...IJCNCJournal
Interference during data transmission can cause performance degradation like packet collisions in Wireless Sensor Networks (WSNs). While multi-channels available in IEEE 802.15.4 protocol standard WSN technology can be exploited to reduce interference, allocating channel and channel switching
algorithms can have a major impact on the performance of multi-channel communication. This paper presents an improved Fuzzy Logic based Cluster Formation and Cluster Head (CH) Selection algorithm with enhanced network lifetime for multi-cluster topology. The Multi-Cluster Multi-Channel Scheduling
(MMS) algorithm proposed in this paper improves the data collection by minimizing the maximum interference and collision. The presented work has developed Cluster formation and cluster head (CH) selection algorithm and Interference-free data communication by proper channel scheduled. The extensive
simulation and experimental outcomes prove that the proposed algorithm not only provides an interference-free transmission but also provides delay minimization and longevity of the network lifetime, which makes the presented algorithm suitable for energy-constrained wireless sensor networks.
Online opportunistic routing using Reinforcement learningHarshal Solao
Cognitive radio network hold the key to achieve better radio bandwidth utilization and improve the quality of wireless application. The topology of Cognitive radio ad-hoc network can change dynamically through frequently changing nodes.
This project work propose a scheme that uses a reinforcement learning method to route the packet from source to destination in which nodes share channel information to each other to select best relay node among them.The main goal of this work
is to compute prior time channel availability using of Hidden Markov Model. This
scheme model strategic interaction among multiple cognitive nodes for selecting best
candidate forwarder and maximize average per packet reward between source and
destination. That collectively addresses the issue of learning and routing in an opportunistic manner even in the absence of reliable knowledge about channel statistics and network model.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Analysis of Latency and Throughput of 2D Torus Topology using Modified XY Rou...IDES Editor
Network-on-Chip (NoC) is a packet switched onchip
communication network designed using a layered
methodology i.e. “routes packets, not wires”. It is an efficient
on chip communication architecture for System on Chip (SoC)
architectures. NoCs solved the disadvantages of SoCs and are
scalable. Each route in NoC includes some routers and it takes
a few clock periods by passing a router.
When the network is in congestion, the package transmission
will produce much more time delay. So adopting an appropriate
routing algorithm to get the balance between the time delay
and throughput rate becomes the key problem. In this paper
we tried to solve that problem using torus topology with our
modified XY routing algorithm.
We used NIRGAM simulator for analysis of latency and
throughput of modified XY routing algorithm for 2D torus
topology. 3x3 network size used for analyze the performance.
We consider all tiles as source, all tiles as destination and
vary the packet size & traffic used is Constant Bit Rate (CBR)
random traffic. It is found that packet size increases then
latency/packet increases and throughput (in Gbps) also
increases but latency/flit decreases.
An Efficient Parallel Algorithm for Secured Data Communication Using RSA Publ...Harshal Solao
Public key infrastructure based cryptographic algorithms are usually considered as
slower than their corresponding symmetric key based algorithms due to their root in modular
arithmetic. In the RSA public-key security algorithm, the encryption and decryption
is entirely based on modular exponentiation and modular reduction which are performed on
very large integers, typically 1024 bits. Due to this reason the sequential implementation of
RSA becomes compute-intensive and takes lot of time and energy to execute. Moreover, it
is very difficult to perform intense modular computations on very large integers because of
the limitation in size of basic data types available with GCC infrastructure. In this topic,
we are looking into the possibility of improving the performance of proposed parallel RSA
algorithm by using two different techniques simultaneously, first implementing modular calculation
on larger integers using OpenMP on the GCC infrastructure. I have also analyzed
the performance gained by computing the sequential version with the parallel version of RSA running on the GCC infrastructure.
Cellular wireless systems like GSM suffer from congestion resulting in overall system degradation and poor service delivery. When the traffic demand in a geographical area is high, the input traffic rate will exceed thecapacity of the output lines. This work focused on homogenous wireless network (the network traffic and resource dimensioning that are statistically identical) such that the network performance
evaluation can be reduced to a system with single cell and a single traffic type. Such system can employa queuing model to evaluate the performance metric of a cell in terms of blocking probability.
Five congestion control models were compared in the work to ascertain their peculiarities, they are Erlang B, Erlang C, Engset (cleared), Engset (buffered), and Bernoulli. To analyze the system, an aggregate onedimensional Markov chain wasderived, such that it describes a call arrival process under the assumption
that it is Poisson distributed. The models were simulated and their results show varying performances, however the Bernoulli model (Pb5) tends to show a situation that allows more users access to the system and the congestion level remain unaffected despite increase in the number of users and the offered traffic into the system.
Exploiting Wireless Networks, through creation of Opportunity Network – Wirel...ijasuc
Spotting Opportunity today and recognizing the same is the vision of the expert. The wireless
communication network regime is one such environment that offers such a platform for many working
scientific, academic and engineering experts. Henceforth, “Opportunistic-network” is a recent evolution
of the above said phenomena in the wireless community. They function by spontaneous cooperation &
coordination giving birth to a special type network called wireless-mobile-adhoc-network (W-MAN). As
said, these networks are formed instantaneously in a random manner – breaking the conventional
mathematically evolved algorithms’, and provided the quintessential of a network(s) that exist in
neighbourhood(s) or approachable limits. Is more of situational based, exploited for specialized purpose
or advantage, which mimics all the characteristic of a well evolved network. Such networks, lack an endto-end path, contact, cooperation and coordination; which is mainly opportunity based, and break or
even disintegrate soon after discovery, thus the challenge lay in integration, construction and probable
sustenance or even mid-way reconstruction till purpose. One can cite many realistic scenarios fitting to
this situation. For example, wildlife tracking sensor networks, military networks, vehicular ad hoc
networks to mention a few. To transmit information under such circumstances/scenarios researchers have
proposed various efficient forwarding (single copy), replication routing and controlled based schemes. In
this paper, we propose to explore, investigate and analyze most of the schemes [1] [2] [3] [4] [5] [6] and
present the findings of the said scheme by consolidating critical parameters and issues and towards the
end of this paper, algorithms, possible solutions to deal with such complex and dynamic situations
through W-MAN scheme suggested by us.
EFFECTS OF MAC PARAMETERS ON THE PERFORMANCE OF IEEE 802.11 DCF IN NS-3ijwmn
This paper presents the design procedure of the NS-3 script for WLAN that is organized according to the hierarchical manner of TCP/IP model. We configure all layers by using NS-3 model objects and set and modify the values used by objects to investigate the effects of MAC parameters (access mechanism, CWmin, CWmax and retry limit) on the performance metrics viz. packet delivery ratio, packet lost ratio, aggregated throughput, and average delay. The simulation results show that RTS/CTS access mechanism outperforms basic access mechanism in saturated state, whereas the MAC parameters have no significant impact on network performance in non-saturated state. A higher value of CWmin improves the aggregated throughput in expense of average delay. The tradeoff relationships among the performance metrics are also observed in results for the optimal values of MAC parameters. Our design procedure represents a good guideline for new NS-3 users to design and modify script and results greatly benefit the network design and management.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
Scheduling is one of the most important fundamental concepts in operating systems. Round
Robin (RR) scheduling is one of the most widely used algorithms in multitasking and real time
environments [1]. In multitasks environments, it is necessary to select the process among a set of
processes. The CPU is allocated to the selected process and controlled by the scheduling algorithm. Each
scheduling algorithm has its own needs, advantages and disadvantages. In this paper we have studied RR
and focused on Dynamic Round Robin algorithm (DRR) and its impact on the processes, which grow in
its burst time in a non-deterministic way with different sets of phenomenon and compared the results.
DEADLOCK RECOVERY TECHNIQUE IN BUS ENHANCED NOC ARCHITECTUREVLSICS Design
Increase in the speed of processors has led to crucial role of communication in the performance of systems. As a result, routing is taken into consideration as one of the most important subjects of the Network on Chip architecture. Routing algorithms to deadlock avoidance prevent packets route completely based on network traffic condition by means of restricting the route of packets. This action leads to less performance especially in non-uniform traffic patterns. On the other hand True Fully Adoptive Routing algorithm provides routing of packets completely based on traffic condition. However, deadlock detection and recovery mechanisms are needed to handle deadlocks. Use of global bus beside NoC as a parallel supportive environment, provide platform to offer advantages of both features of bus and NoC. This bus is useful for broadcast and multicast operations, sending delay sensitive signals, system management and other services. In this research, we use this bus as an escaping path for deadlock recovery technique. According to simulation results, this bus is suitable platform for deadlock recovery technique.
PERFORMANCE ANALYSIS OF OLSR PROTOCOL IN MANET CONSIDERING DIFFERENT MOBILITY...ijwmn
A Mobile Ad Hoc Network (MANET) is created when an independent mobile node network is connected
dynamically via wireless links. MANET is a self-organizing network that does not rely on pre-existing
infrastructure such as wired or wireless network routers. Mobile nodes in this network move randomly,
thus, the topology is always changing. Routing protocols in MANET are critical in ensuring dependable
and consistent connectivity between the mobile nodes. They conclude logically based on the interaction
between mobile nodes in MANET routing and encourage them to choose the optimum path between source
and destination. Routing protocols are classified as proactive, reactive, or hybrid. The focus of this project
will be on Optimized Link State Routing (OLSR) protocol, a proactive routing technique. OLSR is known as
the optimized variant of link state routing in which packets are sent throughout the network using the
multipoint relay (MPR) mechanism. This article evaluates the performance of the OLSR routing protocol
under condition of changing mobility speed and network density. The study's performance indicators are
average packet throughput, packet delivery ratio (PDR), and average packet latency. Network Simulator 2
(NS-2) and an external patch UM-OLSR are used to simulate and evaluate the performance of such
protocol. As a result of research, the approach of implementing the MPR mechanism are able to minimise
redundant data transmission during the normal message broadcast. The MPRs enhance the link state
protocols’ traditional diffusion mechanism by selecting the right MPRs. Hence, the number of undesired
broadcasts can be reduced and limited. Further research will focus on different scenario and environment
using different mobility model
Multilevel priority packet scheduling scheme for wireless networksijdpsjournal
Scheduling different types of packets such as real
-
time and non
-
real time data packets in wireless links is
necessary to reduce energy consumption of the wireless device. Most of the existing packet schedulin
g
mechanism uses opportunistic transmission sche
duling, in which communication is postponed upto an
acceptable time deadline until the best expected channel conditions to transmit are found. This algo
rithm
incurs a large processing overhead and more energy consumption. In this paper we propose a Dynamic
Multilevel Queue Scheduling algorithm. In the proposed scheme, the ready queue is partitioned into t
hree
levels of priority queues. Real
-
time packets are placed into the highest priority queue and non
-
real time
data packets are placed into two other queue
s. We evaluate the performance of the proposed Dynamic
Multilevel Queue Scheduling scheme through simulations for real
-
time and non
-
real time data. Simulation
results illustrate that the Multilevel Priority packet scheduling scheme overcomes the convention
al methods
interms of average data waiting time and end
-
to
-
end delay
Analysing Mobile Random Early Detection for Congestion Control in Mobile Ad-h...IJECEIAES
This research paper suggests and analyse a technique for congestion control in mobile ad hoc networks. The technique is based on a new hybrid approach that uses clustering and queuing techniques. In clustering, in general cluster head transfers the data, following a queuing method based on a RED (Random Early Detection), the mobile environment makes it Mobile RED (or MRED), It majorly depends upon mobility of nodes and mobile environments leads to unpredictable queue size. To simulate this technique, the Network Simulator 2 (or NS2) is used for various scenarios. The simulated results are compared with NRED (Neighbourhood Random Early Detection) queuing technique of congestion control. It has been observed that the results are improved using MRED comparatively.
Enchancing the Data Collection in Tree based Wireless Sensor Networksijsrd.com
Number of techniques used in Wireless Sensor Network to improve data collection from sensor nodes. It achieve by minimize the schedule length and dynamic channel assignment. Schedule length minimized by BFS algorithm without interfering links. Interfering links can be eliminated by transmission power control and multi frequency. The power can be save by using beacon signal. Collection of data can also be limited by topology of network. So the nodes are arranged in form. The capacitated minimal spanning trees and degree- constrained spanning trees give significant improvement in scheduling. Finally the data collection is enhancing in terms of security by using T-Hash Chain algorithm.
Automatic analysis of smoothing techniques by simulation model based real tim...ijesajournal
The pivotal research work that has been carried out and described in this literature acknowledges the
importance of various smoothing techniques for processing 3D human faces from 2.5D range face images.
The smoothing techniques have been developed and implemented using MATLAB-Simulink for real time
processing in embedded system. In addition, the significance of smoothed 2.5D range image over original
face range image has been discovered as well as its time complexity has also been reported with array of
experiments. The variations in time complexities are also accomplished using different optimization levels
and execution modes. A set of filtering techniques such as, Max filter, Min filter, Median filter, Mean filter,
Mid-point filter and Gaussian filter, have been designed and illustrated using Simulink model. The model
takes depth face image (i.e. the range face image) as input in real time and presents the improvement over
original face images. In the design flow, the performance of every block has also been characterized by
range face images from Frav3D, GavabDB, and Bosphorus databases. In the experimental section of this
research article, an array of performance analysis for these smoothing techniques with variation of
frameworks is explained.
Adoption of internal web technologies by oecd turkish government officialsijmpict
Use of communication and information channels for the OECD have been increasingly encouraged by
new channels such as the OECD’s Committee Information Service (OLIS) and Clearspace (CS) web
portals. A logit regression model was used to estimate the influence of the government’s supply side policy
tools and organisational factors on the decision to open OLIS and Clearspace accounts. Additionally,
probability analysis conducted to give insights on the usage frequency of information channels. Study used
a dataset that includes 126 Turkish top-level country and municipal government officials working on
different OECD study topics in 2010. Findings imply that the influence of the explanatory variables tested
differ between the two web-portal models. Satisfaction with the timing of information provided by the
OECD Permenant Delegation (timing issues in reaching reports) among officials is the only variable that
consistently has a positive influence on the adoption of both web-portal applications. The probability
analysis show that while duration of employment and degree of expertise increase the probability of use of
online information channels, work duration on OECD topics and meeting participation are the variables
that decrease the probability of use of face to face communication channels.
Clinical Diagnosis of Parkinson’s disease [PD] leads to errors, excessive medical costs, and provide
insufficient services to the patients. There is no particular method or a test to detect the PD. The diagnosis
of the Parkinson’s disease needs an accurate detection. Computer Aided Diagnosis (CAD) gives accurate
results to detect the PD. These CAD can be embedded into a real time application for the early diagnosis of
PD. Dopamine nerve terminals can be reduced in the brain parts such as Substantia nigra, Striatum, and
other brain structures. This reduction which will lead to Parkinson’s disease. Dopamine Reduction gets
automatically diagnosed by CAD and PD/normal patients can be found. For this, machine learning system
(MLS)/CAD can be trained with the help of Artificial Neural Networks (ANN). Image processing techniques
that are available to detect PD using MLS/CAD gets discussed in this paper.
Crime and violence are inherent in our political and social system. With the moving pace of technology, the
popularity of internet grows continuously, with not only changing our views of life, but also changing the
way crime takes place all over the world. We need a technology that can be used to bring justice to those
who are responsible for conducting attacks on computer systems across the globe. In this paper, we present
various measures being taken in order to control and deal with the crime related to digital devices. This
paper gives an insight of Digital Forensics and current situation of India in handling such type of crimes.
Watch step by Step Info, How you make system for Autopilot business. You also buy this system (if you can't afford or make step by step business formula),No problem!!
We do it for you. Check for more info: http://goo.gl/cnL8Up
The foremost by-product of this paper is the automation of geological undertakings, for instance, dealing
with exceptionally thin sections of rocks that were subjected to deformation alongside finite steps of time
which can be recorded in video for later analysis using image processing and numerical analysis
procedures. Markers are used in order to trace gradients of deformation over a sample and study other
mechanical properties. Image processing and video sequence analysis can be a very powerful investigation
tool and this paper shows preliminary results from its use on microtectonics. The proposed algorithm is a
combination of two well-known approaches: feature extraction and block matching.
Quite often in experimental work, many situations arise where some observations are lost or become
unavailable due to some accidents or cost constraints. When there are missing observations, some
desirable design properties like orthogonality,rotatability and optimality can be adversely affected. Some
attention has been given, in literature, to investigating the prediction capability of response surface
designs; however, little or no effort has been devoted to investigating same for such designs when some
observations are missing. This work therefore investigates the impact of a single missing observation of the
various design points: factorial, axial and center points, on the estimation and predictive capability of
Central Composite Designs (CCDs). It was observed that for each of the designs considered, precision of
model parameter estimates and the design prediction properties were adversely affected by the missing
observations and that the largest loss in precision of parameters corresponds to a missing factorial point.
Cryptography technology is a security technique used to change plain text to another shape of data or to
symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey
through public networks. Currently, there are many proposed algorithms that provide this service
especially for sensitive data or very important conversations either through mobile or video conferences. In
this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is
compared to the AES. The algorithm has four different rounds for each quarter of the key container table,
and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight
and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested
algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table
are big.
Emotions are an unstoppable and uncontrollable aspect of mental state of human. Some bad situations give
stress and leads to different sufferings. One can’t avoid situation but can have awareness when body feel
stress or any other emotion. It becomes easy for doctors whose patient is not in condition to speak. In that
case person’s physiological parameters are measured to decide emotional status. While experiencing
different emotion, there are also physiological changes taking place in the human body, like variations in
the heart rate (ECG/HRV), skin conductance (GSR), breathing rate(BR), blood volume pulse(BVP),brain
waves (EEG), temperature and muscle tension. These were some of the metrics to sense emotive coefficient.
This research paper objective is to design and develop a portable, cost effective and low power
embedded system that can predict different emotions by using Naïve Bayes classifiers which are based on
probability models that incorporate class conditional independence assumptions. Inputs to this system are
various physiological signals and are extracted by using different sensors. Portable microcontroller used
in this embedded system is MSP430F2013 to automatically monitor the level of stress in computer. This
paper reports on the hardware and software instrumentation development and signal processing approach
used to detect the stress level of a subject.To check the device's performance, few experiments were done in
which 20 adults (ten women and ten men) who completed different tests requiring a certain degree of effort,
such as showing facing intense interviews in office.
Retina is a layer which is found at the back side of the eye ball which plays main role for visualization. Any
disease in the retina leads to severe problems. Blood vessels segmentation and classification of retinal
vessels into arteries and veins is an essential thing for detection of various diseases like Diabetic
Retinography etc. This paper discusses about various existing methodologies for classification of retinal
image into artery and vein which are helpful for the detection of various diseases in retinal fundus image.
This process is basis for the AVR calculation i.e. for the calculation of average diameter of arteries to
veins. One of the symptoms of Diabetic Retinography causes abnormally wide veins and this leads to low
ratio of AVR. Diseases like high blood pressure and pancreas also have abnormal AVR. Thus classification
of blood vessels into arteries and veins is more important. Retinal fundus images are available on the
publically available Database like DRIVE [5], INSPIREAVR [6], VICAVR [7].
The main objective of this paper is to design and develop an automatic vehicle, fully controlled by a
computer system. The vehicle designed in the present work can move in a pre-determined path and work
automatically without the need of any human operator and it also controlled by human operator. Such a
vehicle is capable of performing wide variety of difficult tasks in space research, domestic, scientific and
industrial fields. For this purpose, an IBM compatible PC with Pentium microprocessor has been used
which performed the function of the system controller. Its parallel printer port has been used as data
communication port to interface the vehicle. A suitable software program has been developed for the
system controller to send commands to the vehicle.
The influence of individual factors on the entrepreneurial intentionijmvsc
Today, no one is safe from forces and pressures, which are exerted on it, because of a significant number
of the requirements in particular as regards competitiveness, the need for change, or the crises and the
deregulations. In front of the economic and social turbulences which we know, the creation of new
company appears as a cause of general interest. This research papers focuses on the problematic of the
entrepreneurship, and more particularly on the stake which this domain represents in our society, by
treating the determinants of the entrepreneurial intention. To face this news gives, students must
reconsider their behaviors and their practices to renew themselves, to open out and reinforce their
position in the market. Some of these practices form what one calls the entrepreneurial orientation. For
this reason, we will devote this paper for better encircling and apprehending the concept of individual
factors, and we tried to know how the individual factors (motivations, need for accomplishment, need for
autonomy, passion to develop its own idea, individual characteristics, work experience, teaching) can
influence the intention of the entrepreneur to create his own project. We focused on review literature
through a survey of a sample of students from the Higher Institute of Business Administration of Sfax
(Tunisia).
Minimum Process Coordinated Checkpointing Scheme For Ad Hoc Networks pijans
The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile hosts
capable of communicating with each other without the assistance of base stations. This has made possible
creating a mobile distributed computing environment and has also brought several new challenges in
distributed protocol design. In this paper, we study a very fundamental problem, the fault tolerance
problem, in a MANET environment and propose a minimum process coordinated checkpointing scheme.
Since potential problems of this new environment are insufficient power and limited storage capacity, the
proposed scheme tries to reduce the amount of information saved for recovery. The MANET structure used
in our algorithm is hierarchical based. The scheme is based for Cluster Based Routing Protocol (CBRP)
which belongs to a class of Hierarchical Reactive routing protocols. The protocol proposed by us is nonblocking coordinated checkpointing algorithm suitable for ad hoc environments. It produces a consistent
set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster are
required to take checkpoints; it uses very few control messages. Performance analysis shows that our
algorithm outperforms the existing related works and is a novel idea in the field. Firstly, we describe an
organization of the cluster. Then we propose a minimum process coordinated checkpointing scheme for
cluster based ad hoc routing protocols.
Lately, the Wireless Sensors Networks (WSN) have moved to the concept of the hybrids networks in order to get universal platforms in various types of monitoring and information collecting applications. The work presented in this paper aims in designing a hybrid remote monitoring architecture, largely secured by a high availability and resilience WSN. The modeling approach intends to describe the main operation of polling and dispatching between the communications channels with the purpose of ensuring the information availability and reducing the resilience time. To achieve our goal, we have realized an experimental platform of measuring, processing and routing data through hybrid communications technologies. We have illustrated, via curves, the routing of the data measured by a WSN (ZigBee Technology) to a final user through several communication technologies (HTTPS, SMS, ...).
Enhancement of energy efficiency and throughput using csmaca dcf operation fo...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Efficient failure detection and consensus at extreme-scale systemsIJECEIAES
Distributed systems and extreme-scale systems are ubiquitous in recent years and have seen throughout academia organizations, business, home, and government sectors. Peer-to-peer (P2P) technology is a typical distributed system model that is gaining popularity for delivering computing resources and services. Distributed systems try to increase its availability in the event of frequent component failures and functioning the system in such scenario is notoriously difficult. In order to identify component failures in the system and achieve global agreement (consensus) among failed components, this paper implemented an efficient failure detection and consensus algorithm based on fail-stop type process failures. The proposed algorithm is fault-tolerant to process failures occurring before and during the execution of the algorithm. The proposed algorithm works with the epidemic gossip protocol, which is a randomly generated paradigm of computation and communication that is both fault-tolerant and scalable. A simulation of an extreme-scale information dissemination process shows that global agreement can be achieved. A P2P simulator, PeerSim, is used in the paper to implement and test the proposed algorithm. The proposed algorithm results exhibited high scalability and at the same time detected all the process failures. The status of all the processes is maintained in a Boolean matrix.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
Checkpointing and Rollback Recovery Algorithms for Fault Tolerance in MANETs:...Eswar Publications
Mobile Ad Hoc Networks (MANETs) are emerging as a major technology in mobile computing. A MANET is a collection of mobile devices or nodes that communicate with each other using wireless links without availability of any static infrastructure or centralized control. A node in such a network should be fault tolerable and failure free execution of processes on the network nodes is vital. In order to make devices fault tolerant checkpoint based recovery technique can be used. Checkpointing is a technique that can be used to make device or node fault tolerant and reduce the recovery time in case of failure. It takes the snapshot of current application state of process and stores it in some memory area and then using it to resume the computation from current checkpoint instead of resuming it from the beginning. Some limitations of MANETs such as mobility, dynamic topology,
limited bandwidth of channel, limited storage space and power restrictions makes checkpointing as a major challenge in mobile ad hoc networks. This paper presents the survey of some existing algorithms, which have been proposed for making MANETs fault tolerant and implementing or deploying checkpointing in mobile ad hoc network.
Machine learning in Dynamic Adaptive Streaming over HTTP (DASH)Eswar Publications
Recently machine learning has been introduced into the area of adaptive video streaming. This paper explores a novel taxonomy that includes six state of the art techniques of machine learning that have been applied to Dynamic Adaptive Streaming over HTTP (DASH): (1) Q-learning, (2) Reinforcement learning, (3) Regression, (4) Classification, (5) Decision Tree learning, and (6) Neural networks.
Collision Avoidance Protocol for Inter Vehicular Communication Editor IJCATR
Vehicle to vehicle communication can give us better results by avoiding the major problems in road like collision of vehicles, better route selection in case of traffic congestion, fuel consumption, suitable selection of parking place etc. This paper presents a protocol to avoid the collision of vehicles. High mobility and fast topology changes are the characteristics of Vehicular Ad-hoc Networks (VANETs). To establish the real world environment for VANETs, network simulator NS2 is used. Medium Access Control (MAC) Protocol is used to avoid the collision of transmitted data. The Simulation is done using the proposed Vehicular Ad-hoc On-demand Distance Vector (VAODV) routing protocol, which is a modification of Ad-hoc On-demand Distance Vector (AODV) routing protocol. The proposed VAODV protocol is continuously checks the distance, speed of each vehicle and if it finds that the distance between vehicles is continuously decreasing then in this case it will send a warning textual message to those vehicles that are in accidental situation. Based on this textual information these vehicles will take particular action like vehicle may choose new route if it exists or it may slow down its own speed or it may stop moving by pressing brake. The experimental results are used to find out the performance of VAODV protocol. The performance of VAODV protocol is analyzed with different parameters like end to end delay, throughput, packet delivery ratio, normalized routing load etc.
Collision Avoidance Protocol for Inter Vehicular CommunicationEditor IJCATR
Vehicle to vehicle communication can give us better results by avoiding the major problems in road like collision of
vehicles, better route selection in case of traffic congestion, fuel consumption, suitable selection of parking place etc. This paper
presents a protocol to avoid the collision of vehicles. High mobility and fast topology changes are the characteristics of Vehicular Adhoc
Networks (VANETs). To establish the real world environment for VANETs, network simulator NS2 is used. Medium Access
Control (MAC) Protocol is used to avoid the collision of transmitted data. The Simulation is done using the proposed Vehicular Adhoc
On-demand Distance Vector (VAODV) routing protocol, which is a modification of Ad-hoc On-demand Distance Vector (AODV)
routing protocol. The proposed VAODV protocol is continuously checks the distance, speed of each vehicle and if it finds that the
distance between vehicles is continuously decreasing then in this case it will send a warning textual message to those vehicles that are
in accidental situation. Based on this textual information these vehicles will take particular action like vehicle may choose new route if
it exists or it may slow down its own speed or it may stop moving by pressing brake. The experimental results are used to find out the
performance of VAODV protocol. The performance of VAODV protocol is analyzed with different parameters like end to end delay,
throughput, packet delivery ratio, normalized routing load etc.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
HEAP SORT ILLUSTRATED WITH HEAPIFY, BUILD HEAP FOR DYNAMIC ARRAYS.
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and place the minimum element at the beginning. Repeat the same process for the remaining elements.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
1. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
DOI:10.5121/ijcsa.2014.4603 33
AN EFFICIENT RECOVERY MECHANISM
WITH CHECKPOINTING APPROACH FOR
CLUSTER FEDERATION
Manoj Kumar
Department of Computer Science Engineering, Bhagwant University, Ajmer, Rajasthan
ABSTRACT
Checkpoint and recovery protocols are commonly used in distributed applications for providing fault
tolerance. A distributed system may require taking checkpoints from time to time to keep it free of arbitrary
failures. In case of failure, the system will rollback to checkpoints where global consistency is preserved.
Checkpointing is one of the fault-tolerant techniques to restore faults and to restart job fast. The algorithms
for checkpointing on distributed systems have been under study for years.
It is known that checkpointing and rollback recovery are widely used techniques that allow a distributed
computing to progress inspite of a failure.There are two fundamental approaches for checkpointing and
recovery.One is asynchronus approach, process take their checkpoints independenty.So,taking checkpoints
is very simple but due to absence of a recent consistent global checkpoint which may cause a rollback of
computation.Synchronus checkpointing approach assumes that a single process other than the application
process invokes the checkpointing algorithm periodically to determine a consistent global checkpoint.
KEYWORDS
WAN, LAN, Checkpointing, Recovery, SAN’s, Distributesd System, Cluster, VANET’s.
1.INTRODUCTION
Mobility management is one of the major functions of a GSM or a UMTS network that allows
mobile phones to work. The aim of mobility management is to track where the subscribers are,
allowing calls, SMS and other mobile phone services to be delivered to them. In a cellular
telephone network, handoff is the transition for any given user of signal transmission from one
base station to a geographically adjacent base station as the user moves around. In an
ideal cellular telephone network, each end user's telephone set or modem (the subscriber's
hardware) is always within range of a base station. The region covered by each base station is
known as its cell. The size and shape of each cell in a network depends on the nature of the
terrain in the region, the number of base stations, and the transmit/receive range of each base
station. In theory, the cells in a network overlap; for much of the time, a subscriber's hardware is
within range of more than one base station. The network must decide, from moment to moment,
which base station will handle the signals to and from each and every subscriber's hardware.
Vehicular ad hoc networks are gaining importance for inter-vehicle communication, because they
allow for the local communication between vehicles without any infrastructure, configuration
effort, and without the high costs of cellular networks. Besides local data exchange, vehicular
applications may be extended by accessing Internet services. The access is provided by Internet
gateways installed along the roadside. However, the Internet integration requires a respective
2. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
34
mobility support of the vehicular ad hoc network. In this paper we propose MMIP6, a
communication protocol that integrates multihop IPv6-based vehicular ad hoc networks into the
Internet. Whereas existing approaches are focused on small-scale ad hoc networking scenarios,
MMIP6 is highly optimized for scalability and efficiency. The evaluation showed that MMIP6 is
a suitable solution providing a scalable mobility support with an acceptable performance
characteristic. Typical ITS applications can be categorized into safety, transport efficiency, and
information/entertainment applications (i.e., infotainment) [1]. Vehicular ad hoc networks
(VANETs) are emerging ITS technologies integrating wireless communications to vehicles.
Different Consortia (e.g., Car-to-Car Communications Consortium (C2C-CC) [2]) and
standardization organization (e.g., IETF) have been working on various issues in VANETs. C2C-
CC aims to develop an open industrial standard for inter-vehicle communication using wireless
LAN (WLAN) technology. For example, IEEE 802.11p or dedicated short range communications
(DSRC) is an extension of 802.11 standards for inter-vehicle communication by IEEE working
group. IETF has standardized Network Mobility Basic Support (NEMO BS) [3] for network
mobility in VANETs. Originating from cellular networks, mobility management has been an
important and challenging issue to support seamless communication. Mobility management
includes location management and handoff management [4]. Location management has the
functions of tracking and updating current location of mobile node (MN). Handoff management
aims to maintain the active connections when MN changes its point of attachment. VANET is a
special type of mobile ad hoc networks (MANETs) [5] with unique characteristics. Due to the
high mobility of vehicles, topologies of VANETs are highly dynamic.
2. PHASES OF CHECKPOINTING
Checkpointing has two phases:
• Saving a checkpoint
• Checkpoint recovery following the failure.
To save a checkpoint, the memory and system, necessary to recover from a failure is sent to
storage. Checkpoint recovery involves restoring the system state and memory from the
checkpoint and restarting the computation from the checkpoint stored [6].
3. DATA STRUCTURE
Notations used:
SN - Sequence number of a process
a
SN - Sequence number of cluster a
PN - Total number of processes
cN - Total number of clusters
CH - Cluster Head
[ ]ii YP i, - Process identity number of ith
process, flag Y for ith
process
j
iv - keeps a record of SN for each process Pi in cluster j
( )j
i xC - Xth
checkpoint of process i in cluster j
[ ][ ]jiY - is the flag used to identify active processes at th
x checkpoint
t - Time taken for a control or application message to reach from one CH to another CH
( )CHpa
1 - The checkpoint initiating cluster head process cluster
3. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
35
c
m - control message
a
m - Application message
The aim of this thesis is to present an efficient, better bandwidth utilization, maximum response
time, decentralized and cost effective checkpointing algorithm suitable for cluster federation.
Throughout this survey, we use Np to denote the total number of processes and Nc is the clusters
in the system where Np is much larger than Nc. Each process is assigned a unique id-number I
(1<=i<=Np).
In our check pointing scheme, for each process in the cluster, the checkpointing dependency
information is maintained by its cluster head process. Each Cluster Head sends the control
messages to the cluster head of other clusters which further multicasts the message to all currently
active processes in the cluster.
This scheme reduces the message passing and number of lost messages is also reduced
drastically, thus making system more available, reliable and faster. When a checkpointing
procedure begins, the sending and the receiving of control messages are mainly accomplished
amongst cluster head processes.
To maintain such additional information for processes, each CH maintains a 2-tuple table
[ ]ii YP i, where ( )PNi ≤≤1 , A vector j
iv for keeping a record of SN (Sequence Number) for
each process ip in cluster j where flag [ ][ ] 0=jiY in case, process ip neither receives or sends
any message during current global interval ( ) ( )( )jj
i xCxC 1
_
− at th
X check point. After the
global check point is taken, both the fields in the table are set as empty and j
SN are incremented.
4. RELATED WORK
S Kalaiselvi et.al [8] studied the algorithms for checkpointing parallel/distributed systems. It has
been observed that most of the algorithms published for checkpointing in message passing
systems are based on the seminal article by Chandy and Lamport. Number of reports have been
published in this area by relaxing the assumptions made in this paper and by extending it to
minimize the overheads of coordination and context saving.
Jiannong Cao et.al [9] proposed to address the need of applying different checkpointing schemes
to different subsystems inside a single target system. The proposed algorithm has several
advantages.
Ch. D. V. Subba Rao et.al [10] had proposed a new checkpointing protocol combined with
selective sender based message logging .The protocol is free from the problem of lost messages
Partha Sarathi et.al [11] several schemes for checkpointing and rollback recovery have been
reported in the literature. We analyze some of these schemes under a stochastic model. We have
derived expressions for average cost of checkpointing, rollback recovery, message logging and
piggybacking with application messages in synchronous as well as asynchronous checkpointing.
For quasi-synchronous checkpointing we show that in a system with n processes, the upper bound
and lower bound of selective message logging are O(n2
) and O(n), respectively.
Y. Manable et.al [12] proposed a distributed coordinated checkpointing algorithm .A consistent
global checkpoint is a set of states in which no message is recorded as received in one process
4. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
36
and as not yet sent in another process. This algorithm obtains a consistent global checkpoint for
any checkpoint initiation by any process.
S. Monnet et.al [13] suggested that a cluster takes two types of checkpoints, processes inside a
cluster take checkpoint synchronously and a cluster takes a communication induced checkpoint
whenever it receives an inter cluster application message.
J. Cao et.al [14] analyzed the need of integrating independent and coordinated checkpointing
schemes for applications running in a hybrid distributed environment containing multiple
heterogenous subsystems.
B. Gupta et.al [15] presented a simple non-blocking roll forward checkpointing/recovery
mechanism for cluster federation. The effect of domino phenomenon is limited by the time
interval between successive invocations of the algorithm and recovery is as simple as that in the
synchronous approach.
Suriender Kumar et.al [16] focused on the hierarchical non blocking coordinated checkpointing
algorithms suitable for distributed computing and eliminating the overhead of taking temporary
checkpoints.
Guo hui et.al [17] in distributed computing systems, processes in different hosts take checkpoints
to survive failures. For mobile computing systems, due to certain new characteristics such as
mobility, low bandwidth, disconnection, low power consumption and limited memory,
conventional distributed checkpointing schemes need to be reconsidered. In this paper, a novel
min-process coordinated checkpointing algorithm that
Qiangfeng Yiang et.al [18] checkpointing and rollback recovery are widely used techniques for
achieving fault-tolerance in distributed systems. In this paper, we present a novel checkpointing
algorithm which has the following desirable features: A process can independently initiate
consistent global checkpointing by saving its current state, called a tentative checkpoint. Other
processes come to know about a consistent global checkpoint initiation through information
piggy-backed with the application messages or limited control messages if necessary.
Bidyut Gupta et.al [19] had presented a non-blocking coordinated checkpointing algorithm
suitable for mobile environments. The advantages make the proposed algorithm suitable for
mobile distributed computing systems are following advantages: (a) the proposed algorithm does
not take any temporary checkpoint and hence the overhead of converting temporary checkpoint to
permanent checkpoint is eliminated. (b) the proposed algorithm does not use mutable
checkpoints. Hence the overhead of converting them to permanent ones is eliminated. (c) their
algorithm does not allow any process to take useless checkpoints. It uses very few control
messages and participating processes are interrupted less number of times.
Lalit Kumar et.al [20][7] presented a non-blocking minimum process coordinated checkpointing
protocol that not only minimizes useless checkpoints but also minimizes overall bandwidth
required over wireless channels. In their proposed protocol the height of checkpointing tree
proposed to reduce. This will reduce the uncertainty period and number of induced checkpoint.
J. L. Kim et.al [21] had presented a new efficient synchronized checkpointing protocol which
exploits the dependency relation between processes in distributed systems. In their protocol, a
process takes a checkpoint when it knows that all processes on which it computationally depends
took their checkpoints, and hence the process need not always wait for the decision made by the
checkpointing coordinator as in the conventional synchronized protocols.
5. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
37
5.WORKING MODEL
In proposed algorithm, when communication occurs between two processes in different clusters,
then dependencies are generated between checkpoints taken in different clusters. Dependencies
must be tracked in order to allow the application to be restarted from a consistent state. In our
work based on idea adopted from, it is the sending process that ensures that none of its sent
messages can remain an orphan (received-not-sent).
When the CH of any cluster initiates the checkpointing procedure by sending the control
message to other clusters, then the current cluster’s sequence number SN is piggybacked on each
intercluster control message along with the first application message sent to any process in any
cluster during th
X global checkpoint interval. CH of each other cluster is responsible for storing
these SN values for synchronization among clusters.
The communication scheme based on message passing from one CH to other is beneficial only if
(i) there are very few chances of message loss due to network failure. So the proposed algorithm
works best for the applications which are prone to less network failure and for applications which
use secure network media for message communication. (ii) CH communicates the intercluster
received messages to all the active processes in the cluster within finite period of time so that
there is no synchronization delay. To deal with synchronization delay, the algorithm assumes a
threshold value of time interval within which CH must multicast the received messages to all
processes in the cluster, participating during current global checkpoint interval ( )xx cc −−1 .
Let us assume that the time taken on an average by a cluster head to send a control message to
other cluster head is a constant t with the assumption that the bandwidth available during message
passing remains constant. As seen in most of the previous works [35], If a control message is to
be sent to processes in a cluster, time taken by a sending process a
ip in cluster for any
processes )1( np j ≤≤ in cluster b is t . If the process ip is supposed to send the control
message to all the processes in cluster b directly, it will take tn* . In the proposed algorithm, the
CH of cluster b checks for the value of iY where ni ≤≤1 and multicasts control messages to
all the processes with value of 1=iY . Suppose time taken by CH to multicast the control
message c
m among active processes is τ which is a small fraction of time t as cluster b uses
SAN, a very fast and reliable media in comparison to LAN or WAN used for communication
amongst clusters. So total time taken by CH to inform all the active processes for the next
checkpoint is )( τ+t . This value )( τ+t is considered as a threshold value to keep a check on
transmission delay caused by CH . Although this threshold value varies during each global check
point interval depending upon number of active processes in current global checkpoint interval
but this variation is very small, since number of participating processes during each checkpoint
interval remain almost constant. Now this threshold value will be a common constant for all the
clusters in cluster federation. Hence, each sending and receiving cluster will know a priori about
message transmission delay caused by any other CH . So no acknowledgement is required to
ensure that cluster head has sent the message to all other processes or not, which belong to
same cluster.
Suppose there are two clusters a and b with 4 processes each uniquely identified as
432,1 ,, pppp and 87,65 ,, pppp respectively as shown in figure 1.
6. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
38
Figure 1: Cluster Communication Through Message Passing
Now process 1p of cluster ‘ a ’, which is initiating cluster head process ( )CHpa
1 sends a control
message c
m to CH of cluster ‘b ’ in time interval t say 2 ms (micro seconds). CH of cluster
b on receiving this control message c
m further multicasts it to all the processes of cluster b
who are active in current global checkpoint interval ’ I ’ say within τ ms( say 2ms).
So total time taken for control message c
m sent by cluster a to reach all the active processes in
cluster ( )τ+= tb = 4ms. Now say after 2ms of sending the control message by ( )CHpa
1 of
cluster ‘ a ’, a process a
p4 belonging to same cluster sends an application message
6,, pSNm aa
piggybacked with a
SN along with process identity number of receiving process
to cluster b through ( )CHpa
1 . CH of cluster b after extracting the information from the
received message , sends the message to 6p for processing taking total time of 4ms(2+2) i.e.
)( τ+t . Total time taken for processing first application message a
m = (2+2+2) i.e. ( )τ2+t =
6 ms where first 2 ms taken are considered on the basis that this message is sent after 2ms of
recent global checkpoint interval starts which is ≅ τ . Accordingly within 6 ms, all the processes
in the cluster come to know about the next global checkpoint to be taken even if they haven’t
received the control message yet.
On basis of above observations, maximum global checkpoint interval ( )xx CCI −= −1 is such
that ( )2222 +++=T i.e. ( )τ3+t = 8 ms and 2 sec. is for time taken to composite message.
The proposed algorithm makes system resilient against any message delay or message loss. Since
this threshold value considered is a constant and already known to each cluster, so if any process
( )CHpa
1 of cluster ‘ a ’ sends a piggybacked computation message to cluster ‘b ’, it takes again
time to reach the cluster head CH of cluster b and now the cluster extracts the a
SN
piggybacked with application message . If ab
SNSN < , then CH of cluster b informs all the
active processes in cluster ‘b ’ about the next checkpoint to be taken and sends the received
application message for processing to the concerned process. Therefore instead of waiting for the
control message c
m to arrive, the process 6p of cluster ‘b’ takes a forced checkpoint and updates
its SN value with piggybacked a
SN value, if [ ][ ] 16 =bY . The first application message sent by
a CH to any other cluster only contains piggybacked information. However, any other process in
source cluster doesn’t need to piggyback SN value if it sends any other message to the same
cluster before the next invocation of the proposed algorithm.
7. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
39
6. CHECKPOINTING ALGORITHM
*p[j][i] is the ith
process in jth
cluster & we assume p[j][1] as cluster head of eack cluster j,
cNj ≤≤1 *
Step 1: cp NN ≥ & cp NN ∈
where Np - Number of processes
Nc - Number of clusters
Step 2: *Assigning process id*
k=1 ;
For j=1 to cN
{
For j=1 to pN
{p[j][i]=K;
k=k+1;
i=i+1;
}
j=j+1;
}
Step 3: *Identifying and Assigning cluster head-id*
For j=1 to Nc
{CH[j]=p[J][1] ; * for jth
cluster*
j++ ;
}
Step 4: Y[i][j]=0 ; ∀ cNj ≤≤1
pNi ≤≤1
At Sender:
* Assume inip is the initiator in cluster c*
If inip ==CH[c]
Step 1: takes a checkpoint
Step 2: checks Y[k][c]==1 for each process k Cluster c
Step3: sends inic
SNm , to processes with Y[k][c]==1 and to each element of
cNjjCH ≤≤∀1],[ .
Step 4: 1+= cc
SNSN ;
Step 5: Set Y[k][c]=0 for each process k in each cluster c .
Else
Step 6: takes a checkpoint & informs CH[c].
Step 7: CH[c] repeats the Step 2 to Step 5.
At Receiver:
On receiving cc
SNm , from cluster c , each cNjjCH ≤≤∀1],[ checks for process ip
satisfying condition pNijiY ≤≤∀== 1,1]][[
Step 1: ][ jCH sends cc
SNm , to processes with Y[i][j]==1.
Step 2: 1+= jj
SNSN ;
c
c
NcCH
Nj
∉
≤≤
][
&1
8. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
40
Step 3: Set Y[i][j]==0 for CNj ≤≤1 , pNi ≤≤1
End of algorithm.
RECOVERY ALGORITHM
For each Process Pk and 1<i<n, i!=k
if Sx
ik
> Rx
ki
P*
records these sequence numbers (Rx
ki
+ 1) to Sx
ik
in lost-form-Pi
k
;
//message with sequence numbers (Rx
ki
+ 1) to Sx
ik
are the lost messages from
Pi to Pk
P* forms the total order of all lost messages sent by every Pi, i!=k to Pk using
lost-form-Pi
k
and the message log MESGk for Pk
7. SYSTEM MODEL
In the existing scheme, when a sender sends a message it is received by all the processes whether
they are participating in current checkpoint interval or not, resulting in bandwidth wastage,
increased communication cost and traffic congestion. In proposed checkpointing algorithm,
message moves in composite form and it’s the cluster head who is responsible for sending
message to other cluster heads and further each cluster head multicasts the message to all active
processes. It results in efficient bandwidth utilization and making the system more cost effective
and less traffic congestion prone.
Figure 5: Without Clustering System Model
Figure 2: With Clustering System Model
9. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
41
8. IMPLEMENTATION OF SYSTEM MODEL
This experiment uses sets of PC memory distributed databases with java platform. To evaluate the
implementation of algorithm, following parameters have been taken into consideration:
Bandwidth utilization, Number of clusters, Number of messages to be sent individually, Number
of messages sent as a composite message, number of checkpoints taken, number of messages to
be recovered since this thesis is an attempt to develop a recovery system which may succeed in
reducing the number of messages required to be recovered.
• Bandwidth Utilization Versus Number of clusters
In the proposed algorithm, effort has been focused to find the fact that whether the number of
composite messages depend on the number of clusters? Now consider the given Figure 6.1:
From Figure 6.1, it is obvious that with increase in number of clusters there is increase in number
of composite messages but in a graceful way. Now let us see the advantage of this fact:
Less Number of Clusters: If there are less number of clusters, than number of messages to be
sent are almost equal to number of clusters. In case, the number of clusters sending the messages
is less, the number of composite messages sent is also low and hence the bandwidth is used
efficiently.
Average Number of clusters: If there are average number of clusters, than number of messages
sent are almost two third of the number of clusters. So, with increase in number of clusters, there
is a little increase in number of composite messages and hence usage of bandwidth is still
efficient.
Increased Number of Clusters: If there is large number of sending clusters, the number of
messages sent is almost half of the number of sending clusters. Hence usage of bandwidth is still
efficient.
• Bandwidth Usage: As shown in the Figure 6.2, the bandwidth usage by the proposed
technique is the least as compared to other techniques.
10. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
42
Figure 6.2 Comparison of bandwidth usage
Initially, proposed technique has higher bandwidth usage, this is due to the overheads incurred in
the sending of composite message. But this overhead is neutralized as soon as the number of
clusters increases. Further, increase in number of clusters exponentially increases the bandwidth
usage in traditional method. But in proposed technique, there is only linear increase in the
bandwidth usage. So, proposed technique proves to be of great usage in the scenarios where large
number of processes interacts with each other which is not so rare in real life systems.
• Number of individual messages to be sent versus number of composite messages sent
In the proposed algorithm, if one or more processes in the sending cluster have to send messages
to one or more processes at the receiving end, may be a cluster or a site, then the sending cluster
first makes a composite message comprising of all the individual messages received from
processes under it. This composite message is then sent by the sending cluster to the receiving
cluster and after receiving this message, the receiving cluster multicasts the appropriate extracted
messages to the receiving active processes.
Figure 6.3 shows the comparison between numbers of actual messages to be sent versus number
of composite messages sent. From the above figure, it is clear that during various checkpoints, the
number of composite messages sent remain almost constant. And also, the number of composite
messages sent are largely less than the actual individual messages to be sent, thus saving the
actual bandwidth. Hence this graph clearly shows that the proposed algorithm has a caliber of
improving the bandwidth usage.
11. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
43
• Number of messages to be recovered with increased number of clusters
As shown in the figure 6.4, it is clear that in the proposed technique, less number of
messages need to be recovered than in the B. Gupta et.al method.
Figure 6.4 Messages recovered versus number of clusters
This is due to the fact that in proposed technique, initially a control message is sent to the
receiving clusters from the sending cluster. In case, if the receiving cluster does not receive the
control message in time, still it comes to know about the latest checkpoint taken when it receives
the first application message embedded with latest SN sent to it by sending clusters, thus
minimizing the chances of lost or orphan messages and hence, resulting in minimized recovery of
messages. Moreover , no acknowledgement is sent back by the receiving cluster since even if it
does not receive the control message, first application message sent to any one of its node,
informs about the latest checkpoint taken and hence all the active processes in the cluster updates
its synchronization number with the latest received SN.
3.CONCLUSIONS
Checkpointing protocols require the processes to take periodic checkpoints with varying degrees
of coordination. At one end of the spectrum, coordinated checkpointing requires the processes to
coordinate their checkpoints to form global consistent system states. Coordinated checkpointing
generally simplifies recovery and garbage collection, and yields good performance in practice. At
the other end of the spectrum, uncoordinated checkpointing does not require the processes to
coordinate their checkpoints, but it suffers from potential domino effect, complicates recovery,
and still requires coordination to perform output commit or garbage collection. Between these
two ends are communication-induced checkpointing schemes that depend on the communication
patterns of the applications to trigger checkpoints. These schemes do not suffer from the domino
effect and do not require coordination. Recent studies, however, have shown that the
nondeterministic nature of these protocols complicates garbage collection and degrades
performance.
In this thesis, we have presented a simple non-blocking efficient and low cost check pointing
algorithm for cluster federation. The time interval considered between successive invocations of
algorithm ensures minimum number of lost or delayed messages. The main features of the
algorithm are: 1) Minimum number of processes takes check points in this approach. 2) Cluster to
12. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
44
cluster communication is minimum.3) Each cluster maintains its own data structures for keeping
the check pointing dependency information resulting in decentralized approach and faster speed
of execution. 4) Wastage of bandwidth is minimum
Future Scope
Message is not secure. Here message is travel in plain text form so work on security.
On peer to peer model it is implemented.
It is used in share data base.
REFERENCES
[1] Jalote P. “Fault Tolerance in Distributed Systems”. 1st. edition of Englewood Cliffs, USA: Prentice
Hall,1994
[2] Randell, B, “Fault tolerance in decentralized systems”, In proceedings of the 14th international
symposium on Autonomous Decentralized systems (ISA DS’99), pp. 174-179, March 1999
[3] Russell, D.L. “State Restoration in systems of communicating processes”. IEEE transactions on
software Engineering, 6(2), pp. 183-194, March 1980
[4] Strom, R. and Yemini, S.,”Optimistic recovery in distributed systems”, ACM transactions on
Computer Systems, 3(3), pp. 204-226, August 1985
[5] Elnozahy, E.N., Alvisi, L., Wang, Y.-M. and Johnson, D.B. “A Survey of Rollback-recovery protocols
in message passing systems”, ACM computing surveys ,34(3),pp. 375-408,September 2002
[6] Bhargava, B. and Shu-Renn, L. ,”Independent Checkpointing and Concurrent rollback for recovery in
distributed Systems-an optimistic approach”,n proceedings of The 17th Symposium on Reliable
Distributed Systems, pp. 3-12. Columbus, USA, October 1988.
[7] Wang, Y.-M. “Consistent global checkpoints that contain a given set of local checkpoints”, IEEE
transactions on Computers, 46(4), pp. 456-468, April 1997
[8] S Kalaiselvi and V Rajaraman “A survey of checkpointing algorithms for parallel and distributed
computers”, 25(5), pp. 489-510, October 2000
[9] Jiannong Cao, Yifeng Chen, Kang Zhang, Yanxiang He, “Checkpointing in Hybrid Distributed
Systems”, In proceedings of the 7th international Symposium on Parallel Architectures, Algorithms
and Networks (ISPAN’04) ,2004
[10] Ch. D.V. Subba Rao and M.M. Naidu. “A New, Efficient Coordinated Checkpointing Protocol
Combined with Selective Sender-Based Message Logging”, AICCSA, IEEE/ACS International
Conference on Computer Systems and Applications, pp. 444-447, 2008
[11]Partha Sarathi Mandel, Krishnendu Mukhopadhaya, “ Performance analysis of different checkpointing
and recovery schemes using stochastic model” Journal of Parallel and Distributed Computing , 66(1),
pp. 99-107, January 2006
[12] Y.Manable. “A Distributed Consistent Global Checkpoint Algorithm with minimum number of
Checkpoints”, Technical Report of IEICE, COMP97-6 April, 1997
[13]S.Monnet, C.Morin, R.Badrinath, “Hybrid checkpointing for Parllel Applications in Cluster
Federations”, In 4th IEEE/ ACM International Symposium on Cluster Computing and the Grid,
Chicago, IL, USA, pp. 773-782, April 2004
[14]J. Cao, Y. Chen, K. Zhang and Y. He, “Checkpointing in Hybrid Distributed Systems”, In Proceedings
of the 7th International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN’04),
pp. 136-141, Hong Kong, China, May 2004
[15] B.Gupta and S. Rahimi, and R. Ahmad “A new Roll-Forward checkpointing/Recovery Mechanism for
Cluster Federation” , International journal of computer science and Network security, 6(11), pp. 292-
297, November 2006
[16] Surender Kumar , Parveen Kumar, R.K. Chauhan “Design and performance analysis of coordinated
checkpointing algorithms for distributed mobile systems”, In the proceedings of International Journal
of Distributed and Parallel systems (IJDPS), 1(1), September 2010.
[17] Guo-Hui Li, Hong-Ya Wang, “A Novel min-process checkpointing scheme for mobile computing
systems” Journal of system Architecture,51(1), January 2005
13. International Journal on Computational Sciences & Applications (IJCSA) Vol.4, No.6,December 2014
45
[18] Qiangfeng Jiang, Yi Luo, D. Manivannan, “ An Optimistic Checkpointing and message Logging
approach for consistent global checkpoint Collection in distributed Systems” Journal of Parallel and
Distributed Computing ,68(12) ,pp. 1575-1589, December 2008
[19] Bidyut Gupta, S.Rahimi and Z.Lui. “A New High Performance Checkpointing Approach for Mobile
Computing Systems”. IJCSNS International Journal of Computer Science and Network Security,6(5B),
May 2006
[20] Lalit Kumar Awasthi, Kumar “A Synchoronous Checkpointing Protocol For Mobile Distributed
Systems.” Probabilistic Approach. Int J. Information and Computer Security, 1(3) , pp. 298-314, 2007
[21] J. L. Kim and T. Park. “An efficient protocol for checkpointing recovery in Distributed Systems” IEEE
Transaction On Parallel and Distributed Systems,4(8),pp.955-960, August 1993