This paper presents a new function-based framework for mutual exclusion algorithms in distributed systems. In the traditional classification mutual exclusion algorithms were divided in to two groups: Token-based and Permission-based. Recently, some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. Although the studies in this field up to now can compare and evaluate the algorithms, this paper takes a step further and proposes a new function-based framework as a brief introduction to the algorithms in the four groups as follows: Token-based, Permission-based, Hybrid and K-mutual exclusion. In addition, because of being dispersal and obscure performance criteria, introduces four parameters which can be used to compare various distributed mutual exclusion algorithms such as message complexity, synchronization delay, decision theory and nodes configuration. Hope the proposed framework provides a suitable context for technical and clear evaluation of existing and future methods.
This document summarizes a research paper that proposes a new permission-based clustering mutual exclusion algorithm for mobile ad-hoc networks. The algorithm uses a cluster-based hierarchical approach where only cluster leaders are responsible for granting or denying permission to enter the critical section, thereby reducing message complexity. Nodes are partitioned into clusters, with the heaviest weighted node selected as the cluster leader. When a node wants to enter the critical section, it sends a request to its cluster leader. If the cluster leader has obtained over 50% of the total votes, it can grant permission. Otherwise, it requests votes from other cluster leaders until it reaches the majority. This clustering approach helps solve the mutual exclusion problem in mobile ad-hoc networks in an efficient
A New Approach to Improve the Efficiency of Distributed Scheduling in IEEE 80...IDES Editor
The recent standard for broadband wireless
access networks, IEEE 802.16, which resulted in the
development of metropolitan area wireless networks,
includes two network organization modes: Point to Multi
Point and Mesh. The mesh mode provides distributed
channel access operations of peering nodes and uses TDMA
technique for channel access modulation. According to
IEEE 802.16 MAC protocol, there are two scheduling
algorithms for assigning TDMA slots to each network node:
centralized and distributed. In distributed scheduling
algorithm, network nodes have to transmit scheduling
message in order to inform other nodes about their transfer
schedule. In this paper a new approach is proposed to
improve distributed scheduling efficiency in IEEE 802.16
mesh mode, with respect to network condition in every
transferring opportunity. For evaluating the proposed
algorithm efficiency, several extensive simulations are
performed in various network configurations and the most
important system parameters which affect the network
performance are analyzed.
Link aware nice application level multicast protocolIJCNCJournal
Multicast is one of the most efficient ways to dist
ribute data to multiple users. There are different
types of
Multicast such as IP Multicast, Overlay Multicast,
and Application Layer Multicast (ALM). In this pape
r,
we present a link-aware Application Layer (ALM) Mul
ticast algorithm. Our proposed algorithm, Link
Aware-NICE (LA-NICE) [1], is an enhanced version of
the NICE protocol [2]. LA-NICE protocol uses the
variations of bandwidth or capacity in communicatio
n links to improve multicast message delivery and
minimize end-to-end delay. OMNeT++ simulation frame
work [3] was used to evaluate LA-NICE. The
evaluation is done through a comparison between LA-
NICE and NICE. The simulation results showed that
LA-NICE produces an increased percentage of success
ful message delivery ranging from 2% to 10%
compared to NICE. Also, LA-NICE has less average de
lay and less average message hop count than NICE
which reduces the overall latency of message delive
ry
UTILIZING XAI TECHNIQUE TO IMPROVE AUTOENCODER BASED MODEL FOR COMPUTER NETWO...IJCNCJournal
Machine learning (ML) and Deep Learning (DL) methods are being adopted rapidly, especially in computer network security, such as fraud detection, network anomaly detection, intrusion detection, and much more. However, the lack of transparency of ML and DL based models is a major obstacle to their implementation and criticized due to its black-box nature, even with such tremendous results. Explainable Artificial Intelligence (XAI) is a promising area that can improve the trustworthiness of these models by giving explanations and interpreting its output. If the internal working of the ML and DL based models is understandable, then it can further help to improve its performance. The objective of this paper is to show that how XAI can be used to interpret the results of the DL model, the autoencoder in this case. And, based on the interpretation, we improved its performance for computer network anomaly detection. The kernel SHAP method, which is based on the shapley values, is used as a novel feature selection technique. This method is used to identify only those features that are actually causing the anomalous behaviour of the set of attack/anomaly instances. Later, these feature sets are used to train and validate the autoencoderbut on benign data only. Finally, the built SHAP_Model outperformed the other two models proposed based on the feature selection method. This whole experiment is conducted on the subset of the latest CICIDS2017 network dataset. The overall accuracy and AUC of SHAP_Model is 94% and 0.969, respectively.
This document discusses load balancing strategies for grid computing. It proposes a dynamic tree-based model to represent grid architecture in a hierarchical way that supports heterogeneity and scalability. It then develops a hierarchical load balancing strategy and algorithms based on neighborhood properties to decrease communication overhead. Conventional scheduling algorithms like Min-Min, Max-Min, and Sufferage are discussed but determined to ignore dynamic network status, which is important for load balancing. Genetic algorithms are also mentioned as a potential solution.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
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
Designing Run-Time Environments to have Predefined Global DynamicsIJCNCJournal
The stability and the predictability of a computer network algorithm's performance are as important as the
main functional purpose of networking software. However, asserting or deriving such properties from the
finite state machine implementations of protocols is hard and, except for singular cases like TCP, is not
done today. In this paper, we propose to design and study run-time environments for networking protocols
which inherently enforce desirable, predictable global dynamics. To this end we merge two complementary
design approaches: (i) A design-time and bottom up approach that enables us to engineer algorithms based
on an analyzable (reaction) flow model. (ii) A run-time and top-down approach based on an autonomous
stack composition framework, which switches among implementation alternatives to find optimal operation
configurations. We demonstrate the feasibility of our self-optimizing system in both simulations and realworld
Internet setups
This document summarizes a research paper that proposes a new permission-based clustering mutual exclusion algorithm for mobile ad-hoc networks. The algorithm uses a cluster-based hierarchical approach where only cluster leaders are responsible for granting or denying permission to enter the critical section, thereby reducing message complexity. Nodes are partitioned into clusters, with the heaviest weighted node selected as the cluster leader. When a node wants to enter the critical section, it sends a request to its cluster leader. If the cluster leader has obtained over 50% of the total votes, it can grant permission. Otherwise, it requests votes from other cluster leaders until it reaches the majority. This clustering approach helps solve the mutual exclusion problem in mobile ad-hoc networks in an efficient
A New Approach to Improve the Efficiency of Distributed Scheduling in IEEE 80...IDES Editor
The recent standard for broadband wireless
access networks, IEEE 802.16, which resulted in the
development of metropolitan area wireless networks,
includes two network organization modes: Point to Multi
Point and Mesh. The mesh mode provides distributed
channel access operations of peering nodes and uses TDMA
technique for channel access modulation. According to
IEEE 802.16 MAC protocol, there are two scheduling
algorithms for assigning TDMA slots to each network node:
centralized and distributed. In distributed scheduling
algorithm, network nodes have to transmit scheduling
message in order to inform other nodes about their transfer
schedule. In this paper a new approach is proposed to
improve distributed scheduling efficiency in IEEE 802.16
mesh mode, with respect to network condition in every
transferring opportunity. For evaluating the proposed
algorithm efficiency, several extensive simulations are
performed in various network configurations and the most
important system parameters which affect the network
performance are analyzed.
Link aware nice application level multicast protocolIJCNCJournal
Multicast is one of the most efficient ways to dist
ribute data to multiple users. There are different
types of
Multicast such as IP Multicast, Overlay Multicast,
and Application Layer Multicast (ALM). In this pape
r,
we present a link-aware Application Layer (ALM) Mul
ticast algorithm. Our proposed algorithm, Link
Aware-NICE (LA-NICE) [1], is an enhanced version of
the NICE protocol [2]. LA-NICE protocol uses the
variations of bandwidth or capacity in communicatio
n links to improve multicast message delivery and
minimize end-to-end delay. OMNeT++ simulation frame
work [3] was used to evaluate LA-NICE. The
evaluation is done through a comparison between LA-
NICE and NICE. The simulation results showed that
LA-NICE produces an increased percentage of success
ful message delivery ranging from 2% to 10%
compared to NICE. Also, LA-NICE has less average de
lay and less average message hop count than NICE
which reduces the overall latency of message delive
ry
UTILIZING XAI TECHNIQUE TO IMPROVE AUTOENCODER BASED MODEL FOR COMPUTER NETWO...IJCNCJournal
Machine learning (ML) and Deep Learning (DL) methods are being adopted rapidly, especially in computer network security, such as fraud detection, network anomaly detection, intrusion detection, and much more. However, the lack of transparency of ML and DL based models is a major obstacle to their implementation and criticized due to its black-box nature, even with such tremendous results. Explainable Artificial Intelligence (XAI) is a promising area that can improve the trustworthiness of these models by giving explanations and interpreting its output. If the internal working of the ML and DL based models is understandable, then it can further help to improve its performance. The objective of this paper is to show that how XAI can be used to interpret the results of the DL model, the autoencoder in this case. And, based on the interpretation, we improved its performance for computer network anomaly detection. The kernel SHAP method, which is based on the shapley values, is used as a novel feature selection technique. This method is used to identify only those features that are actually causing the anomalous behaviour of the set of attack/anomaly instances. Later, these feature sets are used to train and validate the autoencoderbut on benign data only. Finally, the built SHAP_Model outperformed the other two models proposed based on the feature selection method. This whole experiment is conducted on the subset of the latest CICIDS2017 network dataset. The overall accuracy and AUC of SHAP_Model is 94% and 0.969, respectively.
This document discusses load balancing strategies for grid computing. It proposes a dynamic tree-based model to represent grid architecture in a hierarchical way that supports heterogeneity and scalability. It then develops a hierarchical load balancing strategy and algorithms based on neighborhood properties to decrease communication overhead. Conventional scheduling algorithms like Min-Min, Max-Min, and Sufferage are discussed but determined to ignore dynamic network status, which is important for load balancing. Genetic algorithms are also mentioned as a potential solution.
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
The Border Gateway Protocol (BGP) provides crucial routing information for the Internet infrastructure. A problem with abnormal routing behavior affects the stability and connectivity of the global Internet. The biggest hurdles in detecting BGP attacks are extremely unbalanced data set category distribution and the dynamic nature of the network. This unbalanced class distribution and dynamic nature of the network results in the classifier's inferior performance. In this paper we proposed an efficient approach to properly managing these problems, the proposed approach tackles the unbalanced classification of datasets by turning the problem of binary classification into a problem of multiclass classification. This is achieved by splitting the majority-class samples evenly into multiple segments using Affinity Propagation, where the number of segments is chosen so that the number of samples in any segment closely matches the minority-class samples. Such sections of the dataset together with the minor class are then viewed as different classes and used to train the Extreme Learning Machine (ELM). The RIPE and BCNET datasets are used to evaluate the performance of the proposed technique. When no feature selection is used, the proposed technique improves the F1 score by 1.9% compared to state-of-the-art techniques. With the Fischer feature selection algorithm, the proposed algorithm achieved the highest F1 score of 76.3%, which was a 1.7% improvement over the compared ones. Additionally, the MIQ feature selection technique improves the accuracy by 3.5%. For the BCNET dataset, the proposed technique improves the F1 score by 1.8% for the Fisher feature selection technique. The experimental findings support the substantial improvement in performance from previous approaches by the new technique.
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
Designing Run-Time Environments to have Predefined Global DynamicsIJCNCJournal
The stability and the predictability of a computer network algorithm's performance are as important as the
main functional purpose of networking software. However, asserting or deriving such properties from the
finite state machine implementations of protocols is hard and, except for singular cases like TCP, is not
done today. In this paper, we propose to design and study run-time environments for networking protocols
which inherently enforce desirable, predictable global dynamics. To this end we merge two complementary
design approaches: (i) A design-time and bottom up approach that enables us to engineer algorithms based
on an analyzable (reaction) flow model. (ii) A run-time and top-down approach based on an autonomous
stack composition framework, which switches among implementation alternatives to find optimal operation
configurations. We demonstrate the feasibility of our self-optimizing system in both simulations and realworld
Internet setups
A COOPERATIVE LOCALIZATION METHOD BASED ON V2I COMMUNICATION AND DISTANCE INF...IJCNCJournal
Relative positions are recent solutions to overcome the limited accuracy of GPS in urban environment.
Vehicle positions obtained using V2I communication are more accurate because the known roadside unit
(RSU) locations help predict errors in measurements over time. The accuracy of vehicle positions depends
more on the number of RSUs; however, the high installation cost limits the use of this approach. It also
depends on nonlinear localization nature. They were neglected in several research papers. In these studies,
the accumulated errors increased with time due to the linearity localization problem. In the present study,
a cooperative localization method based on V2I communication and distance information in vehicular
networks is proposed for improving the estimates of vehicles’ initial positions. This method assumes that
the virtual RSUs based on mobility measurements help reduce installation costs and facilitate in handling
fault environments. The extended Kalman filter algorithm is a well-known estimator in nonlinear problem,
but it requires well initial vehicle position vector and adaptive noise in measurements. Using the proposed
method, vehicles’ initial positions can be estimated accurately. The experimental results confirm that the
proposed method has superior accuracy than existing methods, giving a root mean square error of
approximately 1 m. In addition, it is shown that virtual RSUs can assist in estimating initial positions in
fault environments.
Privacy Preserving Reputation Calculation in P2P Systems with Homomorphic Enc...IJCNCJournal
This document discusses a method for privacy-preserving reputation calculation in peer-to-peer systems using homomorphic encryption. Specifically, it proposes:
1) Extending the EigenTrust reputation system to calculate node reputations in a distributed manner while preserving evaluator privacy. It does this by successively updating encrypted reputation values through calculation to reflect trust values without disclosing the original values.
2) Improving calculation efficiency by offloading parts of the task to participating nodes and using different public keys during calculation to improve robustness against node churn.
3) Evaluating the performance of the proposed method, finding it reduces maximum circulation time for aggregating multiplication results by half, reducing computation time per round. The privacy preservation cost scales
Load balancing is one of the main challenges of every structured peer-to-peer (P2P) system that uses
distributed hash tables to map and distribute data items (objects) onto the nodes of the system. In a typical
P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can
lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2P systems are not
adaptable to objects’ variant loads in different system conditions, assume uniform distribution of objects in
the system, and often ignore node heterogeneity. In this paper we propose a load balancing algorithm that
considers the above issues by applying node movement and replication mechanisms while load balancing.
Given the high overhead of replication, we postpone this mechanism as much as possible, but we use it
when necessary. Simulation results show that our algorithm is able to balance the load within 85% of the
optimal value.
This document proposes a new method for extracting rules from trained multilayer artificial neural networks that can represent rules in both "if-then" and "M of N" formats. The method extracts an intermediate structure called a "generator list" from which both types of rules can be derived. This provides a more generic representation than existing methods that can only output one rule format. The generator list approach avoids preprocessing steps used in other methods that can modify the original network. It uses heuristics to prune the search space when extracting the generator list to address the computational complexity involved.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
Performance Evaluation using STP Across Layer 2 VLANsijcnesiir
This document discusses performance evaluation of Spanning Tree Protocol (STP) across Layer 2 VLANs. It begins with an introduction to STP and VLANs, explaining how STP prevents switching loops and VLANs logically segment networks. The document then details an experiment conducted using real networking devices to analyze STP performance under different STP modes (PVST, MST, RPVST), with a focus on security and loop prevention. Results are evaluated to determine the best STP mode for a given network configuration.
Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networkscscpconf
The document describes the design of a simulator for energy efficient clustering in mobile ad hoc networks. The simulator models nodes that can move randomly and establish wireless connections. It selects cluster heads based on two parameters: the degree of connectivity and average transmission power of each node. Nodes with the minimum combined weight of these parameters among their neighbors are chosen as cluster heads. The simulator allows analyzing how the network topology and cluster heads change over time as nodes move. It displays information like each node's connectivity, transmission power used, and energy consumed to help evaluate the clustering algorithm. The goal is to test clustering approaches that can improve energy efficiency and prolong the network lifetime.
Hierarchical Non-blocking Coordinated Checkpointing Algorithms for Mobile Dis...CSCJournals
Mobile system typically uses wireless communication which is based on electromagnetic waves and utilizes a shared broadcast medium. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. So many issues such as range of transmission, limited power supply due to battery capacity and mobility of processes. These new issue makes traditional recovery algorithm unsuitable. In this paper, we propose hierarchical non blocking coordinated checkpointing algorithms suitable for mobile distributed computing. The algorithm is non-blocking, requires minimum message logging, has minimum stable storage requirement and produce a consistent set of checkpoints. This algorithm requires minimum number of processes to take checkpoint.
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.
This document summarizes a research article that proposes a fast re-route method for alternate path finding after a link failure before interior gateway protocols have reconverged. The method is illustrated and proven to find a path if one exists for small regional networks. The paper reviews existing fast restoration techniques for IP networks and evaluates through simulation how many links can be protected in large ISP networks based on actual topologies.
Analyzing consistency models for semi active data replication protocol in dis...ijfcstjournal
Data replication is generally used for increasing
accessibility, availability, performance and scalability
of database systems. For implementing data replication mechanisms, we encounter with some consistency
problems.One of the important problems for implementing data replication mechanism is consistency. In this paper,
the performance tradeoffs of consistency models for semi-active data replication protocol in distributed systems
are analyzed.A brief deliberation about consistency models in data replication is shown.Research on how client-centric guarantees relate to data-centric models is discussed.How guaranteeing conditions of data -
centric consistency models and client - centric consistency models isprovided, is also analyzed.Analysis of the consistency models guarantee in terms of multi-client and single client for the semi-active data replication
protocol without failure and leader death is presented. The
experimental results show that semi-active data replication protocol is appropriate for distributed systems by multi-client replication such as web services.
CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMRijujournal
The checkpointing algorithm described in the document utilizes Triple Modular Redundancy (TMR) in a wireless ad hoc network. It proposes a distributed checkpointing and recovery protocol that eliminates unnecessary checkpoints and only recovers dependent processes. Each process tracks message dependencies during execution. When a checkpoint is initiated, processes exchange status information detailing messages sent and received. A process only checkpoints after receiving any expected messages, ensuring consistency. If a process fails, only dependent processes recover by rolling back to their last checkpoint, minimizing recovery overhead.
APPLICATION OF GENETIC ALGORITHM IN DESIGNING A SECURITY MODEL FOR MOBILE ADH...cscpconf
In recent years, the static shortest path (SP) problem has been well addressed using intelligent
optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle
swarm optimization, etc. However, with the advancement in wireless communications, more and
more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks
(MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile
wireless networks is the topology dynamics, i.e., the network topology changes over time due to
energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to
be a dynamic optimization problem. GA's are able to find, if not the shortest, at least an optimal
path between source and destination in mobile ad-hoc network nodes. And we obtain the alternative path or backup path to avoid reroute discovery in the case of link failure or nodeex
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Optimizing On Demand Weight -Based Clustering Using Trust Model for Mobile Ad...ijasuc
Mobile ad hoc networks are growing in popularity due to the explosive growth of modern
devices with wireless capability such as laptop, mobile phones, PDA, etc., makes the application more
challenging. The mobile nodes are vulnerable to security attacks. To protect the ad hoc network it is
essential to evaluate the trust worthiness. The proposed TWCA is similar to WCA in terms of cluster
formation and cluster head election. However, in WCA security features are not included. The proposed
TWCA is a cluster based trust evaluation, in which the mobile nodes are grouped into clusters with one
cluster head. It establishes trust relationship for the cluster based on the previous transaction result. The
simulation result confirms the efficiency of our scheme than the WCA and SEMC.
A FUZZY MATHEMATICAL MODEL FOR PEFORMANCE TESTING IN CLOUD COMPUTING USING US...ijseajournal
Software product development life cycle has software testing as an integral part. Conventional testing
requires dedicated infrastructure and resources that are expensive and only used sporadically. In the
growing complexity of business applications it is harder to build in-house testing facilities and also to
maintain that mimic real-time environments. By nature, cloud computing provides resources which are
unlimited in nature along with flexibility, scalability and availability of distributed testing environment,
thus it has opened up new opportunities for software testing. It leads to cost-effective solutions by reducing
the execution time of large application testing. As a part of infrastructure resource, cloud testing can attain
its efficiency by taking care of the parameters like network traffic, Disk Storage and RAM speed. In this
paper we propose a new fuzzy mathematical model to attain better scope for the above parameters.
In the earliest era of networking, computers could usually communicate only with computers, which were from the similar manufacturer.
The purpose of OSI model is to show how to facilitate communication between different systems without requiring changes to its underlying Hardware and Software.
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATIONIJCNCJournal
Internet of Things (IoT) allows communication among human-to-things, things-to-human, and things-tothings that are incorporated into an information networks allowing automatic information interchange and
the processing of data at real time. In this paper, we conduct a performance analysis of a real application
defined through four traffic classes with the priorities present in smart cities using Continuous Time
Markov Chains(CTMC). Based on a finite capacity queuing system, we propose a new cost-effective
analytical model with a push-out management scheme in favor of the highest priority (emergency) traffic.
Based on the analytical model, several performance measures for different traffic classes have been
studiedextensively including blocking probability; push out probability, delay, channel utilization as well as
overall system performance.
This paper summarizes and improves upon the NTBCBT mutual exclusion algorithm. The NTBCBT algorithm has problems related to safety, liveness, and scheduling when nodes request access to a critical resource. The paper proposes an improved algorithm called PBCBT that addresses these weaknesses. PBCBT requires only 3log(N) messages per access to the critical section, compared to 4log(N) for NTBCBT. It also has an improved synchronization delay of 2log(N) messages compared to 3log(N) for NTBCBT. The improvements are achieved through removing unnecessary messages, reorganizing node instructions, and prioritizing requests based on timestamps.
Mutual Exclusion in Wireless Sensor and Actor NetworksZhenyun Zhuang
This document discusses mutual exclusion in wireless sensor and actor networks. It begins by introducing wireless sensor networks and how they have evolved into wireless sensor and actor networks which can both sense and act on their environments. This introduces new challenges around resource utilization that must be addressed. Specifically, the document identifies the problem of mutual exclusion - ensuring only a minimum necessary subset of actors take action for a given event to avoid issues like inefficient resource usage. It defines different types of mutual exclusion and proposes both a greedy centralized approach and a distributed localized approach to address this problem efficiently while meeting application-specific delay bounds and fully covering the event region.
A COOPERATIVE LOCALIZATION METHOD BASED ON V2I COMMUNICATION AND DISTANCE INF...IJCNCJournal
Relative positions are recent solutions to overcome the limited accuracy of GPS in urban environment.
Vehicle positions obtained using V2I communication are more accurate because the known roadside unit
(RSU) locations help predict errors in measurements over time. The accuracy of vehicle positions depends
more on the number of RSUs; however, the high installation cost limits the use of this approach. It also
depends on nonlinear localization nature. They were neglected in several research papers. In these studies,
the accumulated errors increased with time due to the linearity localization problem. In the present study,
a cooperative localization method based on V2I communication and distance information in vehicular
networks is proposed for improving the estimates of vehicles’ initial positions. This method assumes that
the virtual RSUs based on mobility measurements help reduce installation costs and facilitate in handling
fault environments. The extended Kalman filter algorithm is a well-known estimator in nonlinear problem,
but it requires well initial vehicle position vector and adaptive noise in measurements. Using the proposed
method, vehicles’ initial positions can be estimated accurately. The experimental results confirm that the
proposed method has superior accuracy than existing methods, giving a root mean square error of
approximately 1 m. In addition, it is shown that virtual RSUs can assist in estimating initial positions in
fault environments.
Privacy Preserving Reputation Calculation in P2P Systems with Homomorphic Enc...IJCNCJournal
This document discusses a method for privacy-preserving reputation calculation in peer-to-peer systems using homomorphic encryption. Specifically, it proposes:
1) Extending the EigenTrust reputation system to calculate node reputations in a distributed manner while preserving evaluator privacy. It does this by successively updating encrypted reputation values through calculation to reflect trust values without disclosing the original values.
2) Improving calculation efficiency by offloading parts of the task to participating nodes and using different public keys during calculation to improve robustness against node churn.
3) Evaluating the performance of the proposed method, finding it reduces maximum circulation time for aggregating multiplication results by half, reducing computation time per round. The privacy preservation cost scales
Load balancing is one of the main challenges of every structured peer-to-peer (P2P) system that uses
distributed hash tables to map and distribute data items (objects) onto the nodes of the system. In a typical
P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can
lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2P systems are not
adaptable to objects’ variant loads in different system conditions, assume uniform distribution of objects in
the system, and often ignore node heterogeneity. In this paper we propose a load balancing algorithm that
considers the above issues by applying node movement and replication mechanisms while load balancing.
Given the high overhead of replication, we postpone this mechanism as much as possible, but we use it
when necessary. Simulation results show that our algorithm is able to balance the load within 85% of the
optimal value.
This document proposes a new method for extracting rules from trained multilayer artificial neural networks that can represent rules in both "if-then" and "M of N" formats. The method extracts an intermediate structure called a "generator list" from which both types of rules can be derived. This provides a more generic representation than existing methods that can only output one rule format. The generator list approach avoids preprocessing steps used in other methods that can modify the original network. It uses heuristics to prune the search space when extracting the generator list to address the computational complexity involved.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
- The document discusses a fuzzy logic-based method for efficient message routing in wireless sensor networks to prolong the network lifetime. It aims to balance energy load across nodes by selectively tagging nodes at risk of energy exhaustion and rerouting messages around them.
- It proposes using fuzzy logic to evaluate nodes based on their potential importance, energy level, and event occurrence frequency to determine tagging. Tagged nodes avoid routing traffic but still detect and generate reports.
- The method was tested by applying it to a probabilistic voting-based filtering security scheme and was shown to improve energy efficiency, node survival rate, and report transmission success compared to not tagging nodes.
Performance Evaluation using STP Across Layer 2 VLANsijcnesiir
This document discusses performance evaluation of Spanning Tree Protocol (STP) across Layer 2 VLANs. It begins with an introduction to STP and VLANs, explaining how STP prevents switching loops and VLANs logically segment networks. The document then details an experiment conducted using real networking devices to analyze STP performance under different STP modes (PVST, MST, RPVST), with a focus on security and loop prevention. Results are evaluated to determine the best STP mode for a given network configuration.
Simulator for Energy Efficient Clustering in Mobile Ad Hoc Networkscscpconf
The document describes the design of a simulator for energy efficient clustering in mobile ad hoc networks. The simulator models nodes that can move randomly and establish wireless connections. It selects cluster heads based on two parameters: the degree of connectivity and average transmission power of each node. Nodes with the minimum combined weight of these parameters among their neighbors are chosen as cluster heads. The simulator allows analyzing how the network topology and cluster heads change over time as nodes move. It displays information like each node's connectivity, transmission power used, and energy consumed to help evaluate the clustering algorithm. The goal is to test clustering approaches that can improve energy efficiency and prolong the network lifetime.
Hierarchical Non-blocking Coordinated Checkpointing Algorithms for Mobile Dis...CSCJournals
Mobile system typically uses wireless communication which is based on electromagnetic waves and utilizes a shared broadcast medium. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. So many issues such as range of transmission, limited power supply due to battery capacity and mobility of processes. These new issue makes traditional recovery algorithm unsuitable. In this paper, we propose hierarchical non blocking coordinated checkpointing algorithms suitable for mobile distributed computing. The algorithm is non-blocking, requires minimum message logging, has minimum stable storage requirement and produce a consistent set of checkpoints. This algorithm requires minimum number of processes to take checkpoint.
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.
This document summarizes a research article that proposes a fast re-route method for alternate path finding after a link failure before interior gateway protocols have reconverged. The method is illustrated and proven to find a path if one exists for small regional networks. The paper reviews existing fast restoration techniques for IP networks and evaluates through simulation how many links can be protected in large ISP networks based on actual topologies.
Analyzing consistency models for semi active data replication protocol in dis...ijfcstjournal
Data replication is generally used for increasing
accessibility, availability, performance and scalability
of database systems. For implementing data replication mechanisms, we encounter with some consistency
problems.One of the important problems for implementing data replication mechanism is consistency. In this paper,
the performance tradeoffs of consistency models for semi-active data replication protocol in distributed systems
are analyzed.A brief deliberation about consistency models in data replication is shown.Research on how client-centric guarantees relate to data-centric models is discussed.How guaranteeing conditions of data -
centric consistency models and client - centric consistency models isprovided, is also analyzed.Analysis of the consistency models guarantee in terms of multi-client and single client for the semi-active data replication
protocol without failure and leader death is presented. The
experimental results show that semi-active data replication protocol is appropriate for distributed systems by multi-client replication such as web services.
CHECKPOINTING WITH MINIMAL RECOVERY IN ADHOCNET BASED TMRijujournal
The checkpointing algorithm described in the document utilizes Triple Modular Redundancy (TMR) in a wireless ad hoc network. It proposes a distributed checkpointing and recovery protocol that eliminates unnecessary checkpoints and only recovers dependent processes. Each process tracks message dependencies during execution. When a checkpoint is initiated, processes exchange status information detailing messages sent and received. A process only checkpoints after receiving any expected messages, ensuring consistency. If a process fails, only dependent processes recover by rolling back to their last checkpoint, minimizing recovery overhead.
APPLICATION OF GENETIC ALGORITHM IN DESIGNING A SECURITY MODEL FOR MOBILE ADH...cscpconf
In recent years, the static shortest path (SP) problem has been well addressed using intelligent
optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle
swarm optimization, etc. However, with the advancement in wireless communications, more and
more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks
(MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile
wireless networks is the topology dynamics, i.e., the network topology changes over time due to
energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to
be a dynamic optimization problem. GA's are able to find, if not the shortest, at least an optimal
path between source and destination in mobile ad-hoc network nodes. And we obtain the alternative path or backup path to avoid reroute discovery in the case of link failure or nodeex
Wireless Mesh Network rose as a promising innovation for providing quick and productive communication for which numerous algorithms have been proposed in networking infrastructure. For routing there are various performance parameters such as throughput, network congestion, resiliency, fairness, robustness, network jitter, delay, stability, optimality, simplicity, completeness etc. Robustness provides the capability to deal with all the failures that come across during the connection in the network to increase the network performance. In this paper we have studied and analyzed three algorithms namely on robustness parameter Resilient multicasting [2], Resilient Opportunistic Mesh Routing for Wireless Mesh Network (ROMER) [3], and Buffer Based Routing (BBR) [4], in Wireless Mesh Networks. Analysis through various parameters such as network congestion, network throughput and resiliency [5], shows network performance of BBR is better.
Optimizing On Demand Weight -Based Clustering Using Trust Model for Mobile Ad...ijasuc
Mobile ad hoc networks are growing in popularity due to the explosive growth of modern
devices with wireless capability such as laptop, mobile phones, PDA, etc., makes the application more
challenging. The mobile nodes are vulnerable to security attacks. To protect the ad hoc network it is
essential to evaluate the trust worthiness. The proposed TWCA is similar to WCA in terms of cluster
formation and cluster head election. However, in WCA security features are not included. The proposed
TWCA is a cluster based trust evaluation, in which the mobile nodes are grouped into clusters with one
cluster head. It establishes trust relationship for the cluster based on the previous transaction result. The
simulation result confirms the efficiency of our scheme than the WCA and SEMC.
A FUZZY MATHEMATICAL MODEL FOR PEFORMANCE TESTING IN CLOUD COMPUTING USING US...ijseajournal
Software product development life cycle has software testing as an integral part. Conventional testing
requires dedicated infrastructure and resources that are expensive and only used sporadically. In the
growing complexity of business applications it is harder to build in-house testing facilities and also to
maintain that mimic real-time environments. By nature, cloud computing provides resources which are
unlimited in nature along with flexibility, scalability and availability of distributed testing environment,
thus it has opened up new opportunities for software testing. It leads to cost-effective solutions by reducing
the execution time of large application testing. As a part of infrastructure resource, cloud testing can attain
its efficiency by taking care of the parameters like network traffic, Disk Storage and RAM speed. In this
paper we propose a new fuzzy mathematical model to attain better scope for the above parameters.
In the earliest era of networking, computers could usually communicate only with computers, which were from the similar manufacturer.
The purpose of OSI model is to show how to facilitate communication between different systems without requiring changes to its underlying Hardware and Software.
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATIONIJCNCJournal
Internet of Things (IoT) allows communication among human-to-things, things-to-human, and things-tothings that are incorporated into an information networks allowing automatic information interchange and
the processing of data at real time. In this paper, we conduct a performance analysis of a real application
defined through four traffic classes with the priorities present in smart cities using Continuous Time
Markov Chains(CTMC). Based on a finite capacity queuing system, we propose a new cost-effective
analytical model with a push-out management scheme in favor of the highest priority (emergency) traffic.
Based on the analytical model, several performance measures for different traffic classes have been
studiedextensively including blocking probability; push out probability, delay, channel utilization as well as
overall system performance.
This paper summarizes and improves upon the NTBCBT mutual exclusion algorithm. The NTBCBT algorithm has problems related to safety, liveness, and scheduling when nodes request access to a critical resource. The paper proposes an improved algorithm called PBCBT that addresses these weaknesses. PBCBT requires only 3log(N) messages per access to the critical section, compared to 4log(N) for NTBCBT. It also has an improved synchronization delay of 2log(N) messages compared to 3log(N) for NTBCBT. The improvements are achieved through removing unnecessary messages, reorganizing node instructions, and prioritizing requests based on timestamps.
Mutual Exclusion in Wireless Sensor and Actor NetworksZhenyun Zhuang
This document discusses mutual exclusion in wireless sensor and actor networks. It begins by introducing wireless sensor networks and how they have evolved into wireless sensor and actor networks which can both sense and act on their environments. This introduces new challenges around resource utilization that must be addressed. Specifically, the document identifies the problem of mutual exclusion - ensuring only a minimum necessary subset of actors take action for a given event to avoid issues like inefficient resource usage. It defines different types of mutual exclusion and proposes both a greedy centralized approach and a distributed localized approach to address this problem efficiently while meeting application-specific delay bounds and fully covering the event region.
This lecture discusses concurrency and synchronization in operating systems. It introduces principles of concurrency and challenges such as sharing global resources. Mutual exclusion techniques like semaphores and monitors are presented to help manage concurrent access. The document also discusses interleaving and overlapping of processes on uni-processors and multi-processors. A simple example of an echo program is used to illustrate potential issues with determinism and reproducibility when processes run concurrently.
The document discusses principles of concurrency in operating systems, including mutual exclusion and synchronization. It covers various techniques for managing concurrent processes such as hardware support using interrupt disabling or compare-and-swap instructions. It also covers higher-level synchronization methods like semaphores, monitors, and message passing. It provides examples of how these techniques can solve concurrency issues like the bounded buffer problem and readers-writers problem.
Multiprocessors(performance and synchronization issues)Gaurav Dalvi
This document discusses performance and synchronization issues in multiprocessor systems. It describes shared memory architectures like UMA, NUMA and distributed shared memory. It discusses factors that affect cache performance like CPU count, cache size and block size. It also discusses synchronization mechanisms like locks, flags and barriers that are used to synchronize access to shared resources. Different hardware primitives for synchronization are described, including atomic exchange, test-and-set, and load-linked/store-conditional instructions.
This document discusses synchronization in distributed systems and various algorithms for achieving mutual exclusion. It covers centralized, distributed, and token ring algorithms for mutual exclusion. The centralized algorithm uses a coordinator but has a single point of failure. Distributed algorithms overcome this but require more messages. The token ring algorithm passes a token between processes but can lose the token if a process crashes. In comparing the algorithms, the document examines their message requirements, delay before entry, and potential problems.
This document discusses interprocess communication and synchronization. It describes race conditions that can occur when multiple processes access shared data concurrently. It introduces the concept of critical sections and mutual exclusion to prevent race conditions. Solutions to achieve mutual exclusion include semaphores and monitors. Semaphores use wait and signal operations while monitors provide mutual exclusion through language-level constructs. Condition variables allow processes to wait for and signal specific events within monitors.
Mutual Exclusion using Peterson's AlgorithmSouvik Roy
This document discusses mutual exclusion algorithms for ensuring processes can access shared resources safely. It introduces the critical section problem and requirements for a solution. Centralized and decentralized mutual exclusion approaches are described. Popular algorithms are compared, including Dekker's, Lamport's bakery, and Peterson's algorithms. The document outlines how these algorithms work and their limitations. It proposes improvements using time-stamped and lock-based approaches and discusses future work applying these algorithms in distributed systems.
The document discusses algorithms for solving the mutual exclusion problem in multithreaded programs. It begins by describing two inadequate algorithms for two threads that fail to guarantee deadlock freedom. It then presents Peterson's algorithm and Kessels' single-writer algorithm, proving they satisfy mutual exclusion, deadlock freedom, and starvation freedom for two threads. The document also discusses using tournament algorithms and the filter algorithm to generalize two-thread solutions to work for multiple threads by having threads progress through levels like a tournament bracket.
This document discusses synchronization and semaphores. It begins by explaining how mutual exclusion can be achieved in uni-processors using interrupt disabling, but this does not work in multi-processors. Semaphores provide a solution using atomic test-and-set instructions. Semaphores allow processes to suspend execution and wait for signals. They avoid busy waiting by putting processes to sleep when the semaphore value is not positive. The document provides examples of using binary and general semaphores for problems like mutual exclusion and process synchronization.
The document discusses several algorithms for process synchronization and mutual exclusion in distributed systems:
- Token ring algorithm passes an exclusive token around a logical ring of processes to control access to shared resources.
- Ricart-Agrawala algorithm uses message ordering and timestamps to elect a process to enter the critical section.
- Lamport's mutual exclusion algorithm uses request queues and timestamps to ensure only one process is in the critical section at a time.
- Election algorithms like the Bully and Ring algorithms elect a coordinator process to handle synchronization and recovery from failures.
1) A semaphore consists of a counter, a waiting list, and wait() and signal() methods. Wait() decrements the counter and blocks if it becomes negative, while signal() increments the counter and resumes a blocked process if the counter becomes positive.
2) The dining philosophers problem is solved using semaphores to lock access to shared chopsticks, with one philosopher designated as a "weirdo" to avoid deadlock by acquiring locks in a different order.
3) The producer-consumer problem uses three semaphores - one to limit buffer size, one for empty slots, and one for locks - to coordinate producers adding to a bounded buffer
OS Process Synchronization, semaphore and Monitorssgpraju
The document summarizes key concepts in process synchronization and concurrency control, including:
1) Process synchronization techniques like semaphores, monitors, and atomic transactions that ensure orderly access to shared resources. Semaphores use wait() and signal() operations while monitors provide mutual exclusion through condition variables.
2) Concurrency control algorithms like locking and two-phase locking that ensure serializability of concurrent transactions accessing a database. Locking associates locks with data items to control concurrent access.
3) Challenges in concurrency control like deadlocks, priority inversion, and starvation that synchronization mechanisms aim to prevent. Log-based recovery with write-ahead logging and checkpoints is used to ensure atomicity of transactions in
The document discusses various algorithms for achieving distributed mutual exclusion and process synchronization in distributed systems. It covers centralized, token ring, Ricart-Agrawala, Lamport, and decentralized algorithms. It also discusses election algorithms for selecting a coordinator process, including the Bully algorithm. The key techniques discussed are using logical clocks, message passing, and quorums to achieve mutual exclusion without a single point of failure.
TEDx Manchester: AI & The Future of WorkVolker Hirsch
TEDx Manchester talk on artificial intelligence (AI) and how the ascent of AI and robotics impacts our future work environments.
The video of the talk is now also available here: https://youtu.be/dRw4d2Si8LA
Comparative Study of Mutual Exclusion Algorithms in Distributed SystemsIJERA Editor
Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding the token can enter into the critical section. We present a comparative study of quorum based, token ring token asking and multiple token algorithms for mutual exclusion in distributed systems.
Dynamic Load Calculation in A Distributed System using centralized approachIJARIIT
The building of networks and the establishment of communication protocols have led to distributed systems, in which computers that are linked in a network cooperate on a task. The task is divided by the master node into small parts (sub problems) and is given to the nodes of the distributed system to solve, which gives better performance in time complexity to solve the problem compared to the time required to solve the problem in a single machine. Load balancing is the process of redistributing the work load among nodes of the distributed system to improve both resource utilization and job response time while also avoiding a situation where some nodes are heavily loaded while others are idle or doing little work. So before sending these parts of problem by the master to the nodes, master node should know the actual work load of all the nodes. We try a dynamic approach to find out the work load of each participating nodes in the distributed system by the master before sending the parts of the problem to the nodes.
This paper describes an algorithm which runs in the master machine and collects information from the nodes of the distributed system (client server application) and calculates the current work load of the nodes of the distributed system. The algorithm is developed in such a way that it can calculate the loads of the nodes dynamically. This means the loads can be evaluated if new nodes are added or deleted or during current performance of the nodes. The whole system is implemented on linux machine and local area network.
An Improved Leader Election Algorithm for Distributed Systemsijngnjournal
This document summarizes an article from the International Journal of Next-Generation Networks that proposes an improved leader election algorithm for distributed systems. The algorithm modifies the existing ring election algorithm to minimize the number of messages exchanged during leader election. Simulation results showed that the proposed algorithm reduces message complexity compared to the original ring algorithm. The document provides background on leader election algorithms and discusses related work that has aimed to improve leader election in distributed systems through approaches like failure detectors and modifying the bully algorithm.
Please answer all 3 question below. Thank you1. Give a short ans.docxajoy21
Please answer all 3 question below. Thank you
1. Give a short answer to the following topics:
Are all the layers necessary? If so, according to what criteria we may devise the number of layers?
Why do LANs tend to use broadcast networks? Why not use networks consisting of multiplexers and switches?
What are the advantages and disadvantages of the current approaches in packet-switching?
2. A university computer science department has 3 Ethernet segments, connected by two transparent bridges into a linear network. One day, the network administrator quits and is hastily replaced by someone from the computer center, which is a token ring shop. The new administrator, noticing that the ends of the network are not connected, quickly orders a new transparent bridge and connects both loose ends to it, making a closed ring. What happens next. Explain your answer.
3. Let's assume the following situation: In principle, we may have two acknowledgment strategies when a file is transferred between two computers. One is to segment the file into packets, that are individually acknowledged by the receiver, but the file transfer as a whole is not acknowledged. In the other one, packets are not acknowledged individually, but the entire file is acknowledged when it arrives.
Discuss these two approaches in terms of pros and cons.
The communication and processing functions of a computer network are done via several cooperating computing processes. The architectural model that defines the classes of functions or protocols involved in this cooperation is based on the concept of layering. So, the whole system is viewed as a hierarchy of functional layers. Every layer adds to the system a series of functions based on the services supplied by the below subordinate level. The functions are accomplished by the action of some entities or modules that belong to different nodes of the network. The entities on the same level coordinate their actions by transmitting a control information according to a certain protocol. Such a network with a perfect layering of its functions may be a reference model for open systems interconnection.
When a resource is shared among multiple independent stations or users, the need exists for a mechanism to control access to the resource, or in the absence of such a mechanism there must exist a course of action to be taken when two or more users attempt to acquire the resource at the same time. One solution would be to allow stations to transmit whenever they have data to send. A node transmits at random (i.e. there is no priory coordination among nodes) at the full rate of the channel. If two or more nodes collide, they retransmit at random times. Contention among users (or collisions of transmissions) limits network throughput and increase time delay. Thus, some protocols must be employed to exercise control over the access method of users. Random Access Protocols address this situation. The random access MAC protocol specifies how to detect.
Cooperating processes work together to complete tasks by sharing resources like CPU, memory, and I/O devices. They communicate using shared memory or message passing. Shared memory allows faster communication by sharing an address space, while message passing is slower but can be used across devices. The critical section problem occurs when multiple processes access shared resources simultaneously, potentially corrupting data. Solutions ensure mutual exclusion so only one process is in the critical section at a time through techniques like disabling interrupts or using lock variables.
ADVANCED DIFFUSION APPROACH TO DYNAMIC LOAD-BALANCING FOR CLOUD STORAGEijdpsjournal
This document summarizes a research paper that proposes an advanced diffusion approach for dynamic load balancing in cloud storage systems. The approach aims to [1] improve system performance by applying a dynamic load balancing technique using a "going vertical" principle, and [2] propose an algorithm that spontaneously rebalances tasks among storage nodes such that each node's load is proportional to its capacity, achieving fairness. The approach was evaluated through simulations and mathematical analysis, showing it outperformed centralized and original diffusion approaches in terms of throughput and response time. The key idea is to simplify complex heterogeneous networks into homogeneous domains or clusters based on node properties, reducing network diameter, nodes, and communication overhead to increase performance.
ADVANCED DIFFUSION APPROACH TO DYNAMIC LOAD-BALANCING FOR CLOUD STORAGEijdpsjournal
Load-balancing techniques have become a critical function in cloud storage systems that consist of
complex heterogeneous networks of nodes with different capacities. However, the convergence rate of any
load-balancing algorithm as well as its performance deteriorated as the number of nodes in the system, the
diameter of the network and the communication overhead increased. Therefore, this paper presents an
approach aims at scaling the system out not up - in other words, allowing the system to be expanded by
adding more nodes without the need to increase the power of each node while at the same time increasing
the overall performance of the system. Also, our proposal aims at improving the performance by not only
considering the parameters that will affect the algorithm performance but also simplifying the structure of
the network that will execute the algorithm. Our proposal was evaluated through mathematical analysis as
well as computer simulations, and it was compared with the centralized approach and the original diffusion
technique. Results show that our solution outperforms them in terms of throughput and response time.
Finally, we proved that our proposal converges to the state of equilibrium where the loads in all in-domain
nodes are the same since each node receives an amount of load proportional to its capacity. Therefore, we
conclude that this approach would have an advantage of being fair, simple and no node is privileged.
ADVANCED DIFFUSION APPROACH TO DYNAMIC LOAD-BALANCING FOR CLOUD STORAGEijdpsjournal
Load-balancing techniques have become a critical function in cloud storage systems that consist of complex heterogeneous networks of nodes with different capacities. However, the convergence rate of any load-balancing algorithm as well as its performance deteriorated as the number of nodes in the system, the diameter of the network and the communication overhead increased. Therefore, this paper presents an approach aims at scaling the system out not up - in other words, allowing the system to be expanded by adding more nodes without the need to increase the power of each node while at the same time increasing the overall performance of the system. Also, our proposal aims at improving the performance by not only
considering the parameters that will affect the algorithm performance but also simplifying the structure of the network that will execute the algorithm. Our proposal was evaluated through mathematical analysis as well as computer simulations, and it was compared with the centralized approach and the original diffusion technique. Results show that our solution outperforms them in terms of throughput and response time.
Finally, we proved that our proposal converges to the state of equilibrium where the loads in all in-domain nodes are the same since each node receives an amount of load proportional to its capacity. Therefore, we conclude that this approach would have an advantage of being fair, simple and no node is privileged.
Clustering Algorithm Based On Correlation Preserving IndexingIOSR Journals
Abstract: Fast retrieval of the relevant information from the databases has always been a significant issue.
Different techniques have been developed for this purpose; one of them is Data Clustering. In this paper Data
Clustering is discussed along with the applications of Data Clustering and Correlation Preserving Indexing. We
proposed a CPI (Correlation Preserving Indexing) algorithm and relate it to structural differences between the
data sets.
Keywords: Data Clustering, Data Mining, Clustering techniques, Correlation Preserving Indexing.
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.
A study of load distribution algorithms in distributed schedulingeSAT 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
This document describes a report submitted for a seminar assignment on dynamic load balancing in grid computing using a multi-agent system and tree structure. It was submitted by Vishnu Kumar Prajapati in 2013 for his M.Tech. in Advanced Networking at ABV Indian Institute of Information Technology and Management in Gwalior, India. The report discusses the historical background and motivation for grid computing and load balancing. It then reviews literature on dynamic load balancing policies, multi-agent systems, grid computing service architectures and objectives. The methodology section proposes reducing communication overhead compared to previous pool-based approaches to improve grid system performance.
Communication And Synchronization In Distributed Systemsguest61205606
This document discusses various topics related to communication and synchronization in distributed systems. It covers concepts like communication protocols, remote procedure calls, client-server and peer-to-peer models, blocking vs non-blocking communication, reliability, group communication, message ordering, and synchronization techniques including clock synchronization algorithms, mutual exclusion algorithms, and atomic transactions.
This document discusses various topics related to communication and synchronization in distributed systems. It covers concepts like communication protocols, remote procedure calls, client-server and peer-to-peer models, blocking vs non-blocking communication, reliability, group communication, message ordering, and synchronization techniques including clock synchronization algorithms, mutual exclusion algorithms, and atomic transactions.
Communication And Synchronization In Distributed Systemsguest61205606
This document discusses various topics related to communication and synchronization in distributed systems. It covers concepts like communication protocols, remote procedure calls, client-server and peer-to-peer models, blocking vs non-blocking communication, reliability, group communication, message ordering, and synchronization techniques including clock synchronization algorithms, mutual exclusion algorithms, and atomic transactions.
AUTOMATIC FAULT TOLERANCE USING SELF ADAPTIVE SYSTEMMichael George
Fault tolerance (F-T) was an important issue in electronic device. However, such system was still impractical in many cases, particularly due to the complex rerouting process that follows cell replacement. In this project, proposed a dynamic reconfiguration capabilities system, therefore, a faulty module could be replaced and the whole system’s functions and connections were maintained by simply assigning the same encoded data to a spare (stem) module. The proposed system reroutes data flow. To detect permanent errors at runtime, a novel in-line test (ILT) method using spare wires and a test pattern generator wass proposed. In addition, an improved syndrome storing-based detection (SSD) method was presented. In the presence of permanent errors, the probability of correct transmission in the proposed systems was improved by up to 140% over the standalone hamming code. Furthermore, this method achieves up to 38% area, 64% energy, and 61% latency improvements.
Extended pso algorithm for improvement problems k means clustering algorithmIJMIT JOURNAL
The clustering is a without monitoring process and one of the most common data mining techniques. The
purpose of clustering is grouping similar data together in a group, so were most similar to each other in a
cluster and the difference with most other instances in the cluster are. In this paper we focus on clustering
partition k-means, due to ease of implementation and high-speed performance of large data sets, After 30
year it is still very popular among the developed clustering algorithm and then for improvement problem of
placing of k-means algorithm in local optimal, we pose extended PSO algorithm, that its name is ECPSO.
Our new algorithm is able to be cause of exit from local optimal and with high percent produce the
problem’s optimal answer. The probe of results show that mooted algorithm have better performance
regards as other clustering algorithms specially in two index, the carefulness of clustering and the quality
of clustering.
A study on dynamic load balancing in grid environmentIJSRD
Grid computing is a collection of computer resources from multiple locations to reach a common goal. Grid computing distinguishes from conventional high performance computing systems that are heterogeneous and geographically dispersed than cluster computer. One of the major issues in grid computing is load balancing. Classification of load balancing is: Static – Dynamic, Centralized – Decentralized, Homogeneous – Heterogeneous. Techniques like: Ant Colony Optimization, Threshold based and Optimal Heterogeneous are used by some researcher to balance the load. This survey paper discusses set of parameters to be used for comparing performance of each of them. In addition to that it says which technique is more useful for grid environment.
Similar to A New Function-based Framework for Classification and Evaluation of Mutual Exclusion Algorithms in Distributed Systems (20)
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
How to Add Chatter in the odoo 17 ERP ModuleCeline George
In Odoo, the chatter is like a chat tool that helps you work together on records. You can leave notes and track things, making it easier to talk with your team and partners. Inside chatter, all communication history, activity, and changes will be displayed.
This presentation was provided by Steph Pollock of The American Psychological Association’s Journals Program, and Damita Snow, of The American Society of Civil Engineers (ASCE), for the initial session of NISO's 2024 Training Series "DEIA in the Scholarly Landscape." Session One: 'Setting Expectations: a DEIA Primer,' was held June 6, 2024.
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
Digital Artefact 1 - Tiny Home Environmental Design
A New Function-based Framework for Classification and Evaluation of Mutual Exclusion Algorithms in Distributed Systems
1. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 193
A New Function-based Framework for Classification and
Evaluation of Mutual Exclusion Algorithms in Distributed
Systems
Leila Omrani L.Omrani@Qiau.ac.ir
Department of Computer Engineering
Islamic Azad University of Qazvin
Qazvin , 34185-1416,Iran
Zahra Rafinezhad Z.Rafinezhad@Qiau.ac.ir
Department of Computer Engineering
Islamic Azad University of Qazvin
Qazvin , 34185-1416,Iran
Mohammadreza Keyvanpour Keyvanpour@Qiau.ac.ir
Department of Computer Engineering
Islamic Azad University of Qazvin
Qazvin , 34185-1416,Iran
Abstract
This paper presents a new function-based framework for mutual exclusion algorithms in
distributed systems. In the traditional classification mutual exclusion algorithms were divided
in to two groups: Token-based and Permission-based. Recently, some new algorithms are
proposed in order to increase fault tolerance, minimize message complexity and decrease
synchronization delay. Although the studies in this field up to now can compare and evaluate
the algorithms, this paper takes a step further and proposes a new function-based framework
as a brief introduction to the algorithms in the four groups as follows: Token-based,
Permission-based, Hybrid and K-mutual exclusion. In addition, because of being dispersal
and obscure performance criteria, introduces four parameters which can be used to compare
various distributed mutual exclusion algorithms such as message complexity, synchronization
delay, decision theory and nodes configuration. Hope the proposed framework provides a
suitable context for technical and clear evaluation of existing and future methods.
Keywords: Mutual Exclusion, Critical Section, Token
1. INTRODUCTION
The mutual exclusion problem involves the allocation of a single, non shareable resource
among n processes [1], by means that just one process can execute in its critical section at a
given time. Mutual exclusion problem was first introduced in centralized systems. In these
systems mutual exclusion ensure with preserving semaphores and monitors, and one of the
nodes function as a central coordinator which is fully responsible for having all the information
of the system and processes ask only the coordinator for permission to enter their critical
sections. But in distributed systems the decision making is distributed across the entire
system and the solution to the mutual exclusion problem is far more complicated because of
the lake of common shared memory and physical clock. So obtain a complete knowledge of
the total system is difficult.
Lots of algorithms are proposed in distributed systems. They classified into two groups
traditionally. One of them is token-based, in this group there is a unique token in the system
which ensure mutual exclusion. So the requesting node must have it to enter the critical
section. Another one is permission-based group, that requesting node has to ask all other
nodes for their permissions to enter the critical section [5]. According to approach of new
algorithms, in this paper we proposed a new function-based framework which classified these
algorithms in four groups as Token-based, Permission-based, Hybrid and K-mutual exclusion.
Also in new approach spite of synchronization delay and message complexity in light and
2. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 194
heavy loads, we introduced two new measures including decision theory and nodes
configuration.
This paper is organized as follows: in section 2, presents general model of distributed system
and formally describes the mutual exclusion problem. In section 3, introduces the proposed
framework and measures with classification of algorithms. Finally in last section concludes
our work.
2. MODEL AND PROBLEM DEFINITION
2.1. System Model
In general, most of mutual exclusion algorithms use a common model. In this model, a
distributed system is a set of independent and autonomous computers. These computers are
called as node or site and connected via a communication network. Each node has abstract
view of whole system that communicates with message passing [4]. The most important
purposes of distributed system are assigned as providing an appropriate and efficient
environment for sharing resource, having an acceptable speed and high reliability and
availability.
2.2. The Mutual Exclusion Problem
Mutual exclusion problem in distributed systems has received great consideration in recent 3
decades. This problem ensures that concurrent processes access common resource and
data sequentially. In addition each process that executes in its critical section for a finite time,
must do without interfering with other processes. Also, when no process is in a critical section,
any process that request entry to its critical section must be permitted to enter without delay
[3]. Eventually mutual exclusion must be without deadlock and starvation.
3. PROPOSED FRAMEWORK AND CRITERIA FOR CLASSIFICATION OF
MUTUAL EXCLUSION ALGORITHMS
By reason of the mutual exclusion importance in distributed system for keeping system
consistency and increasing concurrently, various algorithms are proposed. In order to
evaluate performance of these algorithms various criteria are defined as synchronization
delay and message complexity. Synchronization delay is the average time delay in granting
critical section. Message complexity is the number of messages exchanged by a process per
critical section entry. Also evaluates message complexity in different heavy and light load of
system state.
In addition, two new measures are proposed as decision theory and nodes configuration. In
the first one, if each node need not keep information about the concurrent state of the system,
the algorithm will be called static. On the other hand the algorithm is called dynamic. Also, in
nodes configuration if nodes are assumed to be arranged in logical configuration, the
algorithm is called structural, otherwise is called nonstructural. In next sections, the proposed
framework is presented for classifying mutual exclusion algorithms with their evaluation as
follows: 1.Token-based, 2.Permission-based, 3.Hybrid, 4.K-mutual exclusion.
3.1.Description of Token-based Approach
In this approach the right to enter a critical section is produced by a unique message, named
token. The concurrent owner of the token chooses the next token owner and sends it the
token. So granting the privilege to enter the critical section performs by the owner of the
token. In 1985, Suzuki and Kasami [5], presented an algorithm that token by means of
privilege message transmitted to requesting process based on sequence number.
Some of the algorithms use a logical structure like in Raymond [6]. In this algorithm, nodes
(each process performs in a node) arranged in rootless tree structure and every node is
related only to its neighbors and is aware of their information. In Naimi and Trehel algorithm
[7], each node sends its request only to another one that knows as a current root and waits for
its permission. In addition this algorithm uses two data structures, one of them is a queue for
keeping requests and the other is a logical rooted dynamic tree for assigning token. But this
algorithm is so sensitive to node failure and recovery. In consequence in [8] presented a
dynamic algorithm which is able to failure detection, regenerates lost token and robust against
failures.
3. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 195
In 2006 a new algorithm presented as queue migration [9], that nodes arranged in a
distributed and fully connected network. In this network, nodes in logical group can
communicate directly together for the purpose of entering the critical section. One node from
each group is selected to form part of the global group this node is called a link node. Link
node collects logical and global requests and sends them to the owner of token. So token
transmits among local and global groups for ensuring mutual exclusion.
3-1-1. Evaluation of Token-based Approach
The most advantage of Token-based approach is simplicity. In this approach, for example if
the logical structure of algorithm is a ring then the token transmits from a node to another
continuously. Table1 represent the comparison and evaluation of well-known algorithms
which mentioned in previous section according to proposed measures. Under light load, this
method is so expensive because token is broadcasted without using by any nodes. But under
heavy load it's so efficient. According to results that show in table1 Suzuki and Kasami's
algorithm [5] has least message complexity under light load and queue migration algorithm [9]
has least message complexity under heavy load. As you see in table1, the algorithm which
has a structural configuration and dynamic decision theory can has less synchronization
delay.
Token-based approach is so capable to lose token and deadlock occurs if it can't regenerate
token. But if algorithm assumes the existing token is lost and regenerate another one, it will
violate mutual exclusion [10]. Another problem of this approach is low scalability because all
nodes arranged in a logical structure. So, when the number of nodes increment, the average
of waiting time increase. Most of these algorithms have a structural configuration and decision
theory make dynamically.
3.2.Description of Permission-based Approach
In Permission-based approach, requesting node asks to obtain permissions from a set of
nodes in the systems. A priority or an order of events have to be established between
competing requesting nodes, so only one of them receives permission from all other nodes in
the set [5]. After receiving permission from a sufficient number of nodes, it is allowed to enter
the critical section. When a node is completed its execution in critical section must sends
release message to the other nodes. The main problem is finding a minimal number of nodes
from which a node has to obtain permission to enter its critical section. Many algorithms have
been developed to find this minimal, such as Lamport algorithm [11]. This algorithm uses a
mechanism based on logical clocks for the total ordering of requests in the system.
Description
Evaluation measures
Algorithm
name decision
theory
configuration
synchronization
delay
Message complexity
Light
load
Heavy
load
Token as a
privilege
message
dynamicNon structural_0N
Suzuki-
Kasami
Nodes in
rootless tree
staticstructural((log N)/2)TO(log N)O(log N)
Raymond
with tree
structure
Use two
structures
:queue&
logical tree
dynamicstructuralTO(log N)O(log N)
Naimi-
Trehel
With failure
detection &
recovery
dynamicstructuralTO(log N)O(log N)
Dynamic
tree
With global &
local groups
dynamicstructural_)( NO2
Queue
migration
TABLE 1: comparison and evaluation of Token-based approach
In Ricart and Agrawala algorithm [12], when a node receives a request compares its
sequence number with previous request and allows the request with smallest sequence
4. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 196
number to enter the critical section. After that in [13], both of above algorithms exchanged and
introduced a new algorithm which is the best known algorithm that guarantees fairness in the
same sense. It means, when there is a high priority request to do, the low priority request is
delayed.
3.2.1. The Group Mutual Exclusion Problem
In this problem, every request for a critical section is associated with a type or group. It means
at any time none of two processes which have requested critical sections belonging two
different groups in their critical sections are simultaneously. In addition it's free of starvation it
means a process wishing to enter critical section succeeds eventually.
Also, concurrent entry property is the most important issue in group mutual exclusion, it
means if all requests are for critical sections belonging to the same group, then no requesting
process should wait for entry in to its critical section until some other processes have left it
[14]. The concept of quorum is used to solve this problem. In fact quorum is a subset of
processes. Each process enters its critical section only after it has successfully locked all
nodes in its quorum. There are two properties in the concept of quorum which can ensure
mutual exclusion requirements: the first one is intersection and the second one is minimally
[14].
At first Maekawa in 1985[15], used the concept of quorum in his algorithm. In this algorithm
requests serviced based on their sequence numbers. After that another algorithm [16]
represented by using the concept of dynamic quorum. The purpose of this algorithm was high
scalability and low message complexity. This algorithm acts independent on its quorum
system. In Maekawa algorithm a node never changes its quorum or requests from the other
quorums but here a node can link to member of other quorums and respond all of its requests
by making some changes during execution. Hence the quorums change dynamically. Then,
the delay optimal algorithm was presented in [17]. This algorithm has least delay with fix
message complexity among of above algorithms.
3.2.2.Evaluation of Permission-based Approach
Fairness is a very important measure for solutions to the most contention problems. In the
concept of mutual exclusion is that requests for access to the critical section are satisfied in
the order of their timestamps. This concept is obvious in the algorithms which mentioned
above, clearly [13].
Table2 presents the comparison and evaluation of well-known algorithms which mentioned in
previous section according to proposed measures. Beside the number of messages are
exchanged for accessing the resources capture the overhead imposed on the system. In the
various algorithms are tried to get an optimal value. This value in group mutual exclusion
algorithms is limited to the number of quorum members [16].
As mentioned in section 3.1.1, most of the token-based algorithms configuration was
structural, which decreased scalability. Also detection of lost token and regenerate were the
other problems of this approach. But in permission-based approach, are tried to solve these
problems. Here configuration of nodes in most of the primary algorithms was nonstructural.
However after introducing the group mutual exclusion, is imposed the logical structure to the
system and the configuration is became structural. But as show in table2 synchronization
delay increased when the configuration of algorithms became structural. So delay optimal
algorithm solved this problem.
3.3. Description of Hybrid Approach
Providing deadlock-free distributed mutual exclusion algorithms is often difficult and it involves
passing many messages, so the hybrid algorithms are introduced. Since call such algorithm
hybrid that uses both Token-based and Permission-based approach for mutual exclusion
assurance, simultaneously. One of the algorithms of this group is proposed by Paydar et
al[10]. In which setsn nodes in 2-dimension array. This array is composed of rows and
5. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 197
Description
Evaluation measures
Algorithm
name decision
theory
configuration
synchronization
delay
Message complexity
Light
load
Heavy
load
Give priority
with timestamp
staticNon structuralT3(N-1)3(N-1)Lamport
Get n-1
permissions
dynamicNon structuralT2(N-1)2(N-1)
Ricart-
Agrawala
Give priority
with FIFO
dynamicNon structuralT(N-1)2(N-1)fair
Use quorumstaticstructural2TN3N5Maekawa
Generate
dynamic
quorum
dynamicstructural3TO(q)O(q)
quorum
Dynamic
Least
synchronization
delay
dynamicstructuralT)1(6 −N)1(6 −NDelay
optimal
TABLE 2: comparison and evaluation of Permission-based approach
columns. Every node i (i=1,2,3,…,n) with the other nodes in the same row and the
other nodes in the same column form the quorum Qi. Every node can enter to critical
section when it obtains the permissions of all nodes in the same quorum and gets the token
too.
Kakugawa et al [18] presented an algorithm that used the coterie concept. Coterie is a set of
quorums, each of which is a subset of the process set and any two quorums share at least
one process. In coterie concept both intersection and minimally properties are satisfied. This
algorithm uses two classes of token, main-token and sub-token. If each process of a coterie
requests to enter the critical section, the owner of the main-token by generating necessary
sub-tokens can respond their requests.
Then an algorithm based on Suzuki and Kasami's algorithm [27] is proposed in [19,20]. This
algorithm uses non-uniform groups, in which, the same groups set in one session. Also, uses
two kind of tokens to enhance concurrency of Suzuki and Kasami algorithm: primary and
secondary. The owner of the primary token can grant the secondary token to others.
3.3.1. Evaluation of Hybrid Approach
In algorithms of this approach, every node begin its function in a permission-based manner
but continues in token-based. This approach can overcome token-based problems, Because
of using both token-based and permission-based techniques.
Table3 represents the comparison and evaluation of well-known algorithms which mentioned
in previous section according to proposed measures. Most of the algorithms in this group
improve message complexity and increase the degree of concurrency. This issue avoids
unnecessary blocking [19,20], also they can increase fault tolerance by using failure recovery
and failure detection mechanisms.
According to table3 these algorithms because of using quorums have structural configuration
and their decision theory is dynamically, so these features help them to overcome the only
token-based or permission-based algorithm's problems.
3.4. Description of K-mutual Exclusion Approach
The K-mutual exclusion problem is a fundamental distributed problem that completes the
mutual exclusion issue. It guarantees the integrity of the k units of a shared resource by
restricting the number of processes that can access them simultaneously [21]. Likewise these
algorithms divided in to token-based and permission-based groups. In token-based group, k
tokens are generated to let requested processes to enter their critical sections. But in
permission-based group a node gets in to the critical section only after sending requests to
6. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 198
description
Evaluation measures
Algorithm
name decision
theory
configuration
synchronization
delay
Message
complexity
Light
load
Heavy
load
Quorum contains of
same column and
row nodes
Dynamicstructural_N4N4
Paydar
algorithm
With coterie and
main token & sub
token
Dynamicstructural3T05|Q|+1Kakugawa
With non-uniform
groups
DynamicstructuralT2N-12N-1
Non-uniform
groups
TABLE 3: Comparison and evaluation of Hybrid approach
the other nodes and receiving permission from nodes [22].
One of the algorithms of this group that uses queue migration is extended on [9]. In this
algorithm for ensuring mutual exclusion, the link node is the owner of parent token which has
the capacity of generating tokens. In [23] the Raymond's algorithm [6] extended.
Although in this algorithm each node has a sequence number, it has to obtain
permissions to enter the critical section. In [21] the Raymond's algorithm is extended again
and it increases fault tolerance to nodes, in which in Raymond's algorithm it was
nodes. So it ensures that even occurs failure, k processes can execute simultaneously.
3-4-1.Evaluation of K-mutual Exclusion Approach
Most of the k-mutual exclusion algorithms focus on fault tolerance. They provide using more
resource at the same time. For example, some of these algorithms can prevent the system
security until occurs failures. It means when a node fails, It is impossible to any others
can collect permissions and enter to the critical section. But after failures, the
most number of processes that can execute simultaneously reach to one. As a result the
algorithm's performance decreases. Also, if the number of the received permissions
decreased by occurring failures dynamically, the value of fault tolerance will reach to
nodes. So it ensures that even occur failures, k processes can execute in their critical
sections simultaneously [23,24].
Table 4 represents the comparison and evaluation of well-known algorithms which mentioned
in previous section according to proposed measures. As you see decision theory in these
algorithms are dynamically.
description
Evaluation measures
Algorithm
name decision
theory
configuration
synchronization
delay
Message
complexity
Light
load
Heavy
load
Use parent token
& generate k-1
tokens
dynamicstructural4T0)( NO
k-queue
migration
K resources & n-
k replies
dynamicNon structural_2N-k-12N-1
Raymond with
multi entries
Extended of
Raymond
algorithm
dynamicNon structural_2N-k-12N-1
Obtain ni-k
replies from ni
correct nodes
TABLE 4:comparison and evaluation of K-mutual approach
4. CONCLUSION
According to importance of mutual exclusion in achieving goals of distributed systems,
various approaches are proposed. In this research try to make a brief analyzing on most
7. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 199
common distributed mutual exclusion algorithms. Also, present a new classification based on
their functions in four groups: Token-based, Permission-based, Hybrid and K-mutual
exclusion. This framework helps novice researchers to set each new algorithm in specific
category. To achieving this purpose focus on four measures such as message complexity,
synchronization delay, decision theory and nodes configuration for comparison and evaluation
of them. Hope the proposed framework makes a convenient way for future researches.
5.REFERENCES
[1] N.A.Lynch . "Distributed Algorithms" , Morgan Kaufmann Publishers, pp.255-327,(1996)
[2] P.C.Saxena, and J.Rai. "A Survey Of Permission-based Distributed Mutual Exclusion
Algorithms" . Computer Standards & Interfaces, 25: 159-181, 2003
[3] M.G.Velaquez. "A Survey Of Distributed Mutual Exclusion Algorithms". Technical Report
CS. Colarido state university, September 1993
[4] W.Stallings. "Operating Systems Internals and Design Principls", Prentice Hall, pp.205-
261 (2009)
[5] I.Suzuki,and T.Kasami."A Distributed Mutual Exclusion Algorithm", ACM Transactions
On Computer Systems, Vol.3(No.4): 344-349, November 1985
[6] K.Paymond. "A TreeBased Algorithm For Distributed MutualExclusion",ACM Transactions
On Computer System, Vol.7(No.1): 61-77, February 1989
[7] M.Naimi, M.Trehel, and A.Arnold. "A Log(n) Distributed Mutual Exclusion Algorithm
Based On The Path Reversal", Journal Of Parallel And Distributed Computing,34(1): 1-
13 April 1996
[8] J.Sopena , L.Arantes, M.Bertier, and Pierre Sens. "A Fault-tolerant Token-based Mutual
Exclusion Algorithm Using A Dynamic Tree". Euro Par.LNCS 3648, 2005
[9] P.chaudhuri, and Tomas Edward. "An Distributed Mutual Exclusion Algorithm
Using Queue Migration". Journal Of Universal Computer Science, Vol.21(No.2):140-
159, 2006
[10] S.Paydar, M.Naghibzadeh , and A.Yavari. "A Hybrid Distributed Mutual Exclusion
Algorithm", IEEE International Conference On Emerging Technologies In Pakistan,
November 2006
[11] L.Lamport. "Times,Clocks,And The Ordering Of Events in a Distributed System".
Communications OF The ACM, Vol.21(No.7): 558-565, July 1978
[12]G.Ricart, and Ashok.K.Agrawala. "An Optimal Algorithm For Mutual Exclusion in
Computer Networks". Communication of The ACM, Vol.24(No.1):9-17, January 1981
[13] S.Lodha, and A.Kshemkalyani. "A Fair Distributed Mutual Exclusion algorithm".IEEE
Transactions On Parallel And Distributed Systems. Vol.11(No.6), June 2000
[14] R.Atreya , and N.Mittal. "A Dynamic Group Mutual Exclusion Using Surrogate-Quorums".
Proc,IEEE Int'l Conf. Distributed Computing System, June 2005
[15] M.Maekawa. "A Algorithm For Mutual Exclusion In Decentralized Systems". ACM
Transactions On Computer Systems , Vol.3 (No.2):145-159, May 1985
[16] R.Atreya , and N.Mittal. "a Quorum-based Group Mutual Exclusion Algorithm For A
Distrinbuted System With Dynamic Group Set". IEEE Transactions On Parallel And
Distributed Systems, Vol.18(No.10), October 2007
8. Leila Omrani, Zahra Rafinezhad & Mohammadreza keyvanpour
International Journal of Computer Science and Security (IJCSS), Volume (5) : Issue (2) : 2011 200
[17] G.Cao , and M.Singhal. "A Delay-optimal Quorum-based Mutual Exclusion Algorithm
For Distributed Systems". IEEE Transactions On Parallel And Distributed Systems,
Vol.12(No.12), December 2001
[18] H.Kakugawa , S.Kamei, and T.Masuzawa. "A Token-based Distributed Group Mutuaal
Exclusion Algorithm With Quorums", IEEE Transactions On Parallel And Distributed
Systems, Vol.19(No.9), 2008
[19] N.Mittal,and P.Mohan."An Efficient Distributed Group Mutual Exclusion Algorithm For
Non-uniform group access", proceedings Of The IASTED International Conference On
Parallel And Distributed Computing And Systems , Phoenix,Arizona,USA, 2005
[20] N.Mittal,and P.Mohan. "A Priority-based Distributed Group Mutual Exclusion Algorithm
When Group Access is Non-uniform". Journal Of Parallel And Distributed Computing,
No.67: 797-815, March 2007
[21] M.Bouillaguet,L.Arantes,and P.Sens. "Fault Tolerant K-mutual Exclusion Algorithm Using
Failure Detector" . International Symposium On Parallel And Distributed Computing,
2007
[22] P.Chaudhuri, and T.Edward. "An Algorithm for K-mutual Exclusion In Decentralized
Systems". Computer Communications 31: 3233-3235, 2008
[22] K.Raymond. "A Distributed Algorithm For Multiple Entries To A Critical Section",
Information Processing Letters, North-Holland, No.30, February 1989