Due to the growing application of peer to peer computing, distributed applications are continuously spreading over an extensive number of nodes. To cope with this large number of participants, various hierarchical cluster based solutions have been proposed. Cluster or group based solutions are scalable for a large number of participants. As far as group mutual exclusion solutions are concerned, some of them have good complexity but do not take into account the growing number of participants. Others take into account the previous aspect but do not have good complexity. In this paper we present two group mutual exclusion algorithms namely; TBGMEACα and TBGMEACβ to deal both with the growing number of nodes and the matter of having a good complexity. The proposed logical structure is a cluster tree. The first solution uses the partial flooding method, which is the partial propagation of informations available at root level. In the second solution, informations available at root level are propagated only towards the processes which issued a request for a session. Both algorithms have complexities of O(p) and O(log p) respectively (p is the number of clusters in the system).
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
GET IEEE BIG DATA,JAVA ,DOTNET,ANDROID ,NS2,MATLAB,EMBEDED AT LOW COST WITH BEST QUALITY PLEASE CONTACT BELOW NUMBER
FOR MORE INFORMATION PLEASE FIND THE BELOW DETAILS:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com
Mobile: 9791938249
Telephone: 0413-2211159
www.nexgenproject.com
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DE...ijcsit
With the growing popularity of mobile smart devices, the existing networks are unable to meet the requirement of many complex scenarios; current network architectures and protocols do not work well with the network with high latency and frequent disconnections. To improve the performance of these networks some scholars opened up a new research field, delay-tolerant networks, in which one of the important
research subjects is the forwarding and routing mechanism of data packets. This paper presents a routing
scheme based on social networks owing to the fact that nodes in computer networks and social networks
have high behavioural similarity. To further improve efficiency this paper also suggests a mechanism,which is the improved version of an existing betweenness centrality based routing algorithm [1]. The experiments showed that the proposed scheme has better performance than the existing friendship routing algorithms.
Designing an opportunistic routing scheme for adaptive clustering in mobile a...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
GET IEEE BIG DATA,JAVA ,DOTNET,ANDROID ,NS2,MATLAB,EMBEDED AT LOW COST WITH BEST QUALITY PLEASE CONTACT BELOW NUMBER
FOR MORE INFORMATION PLEASE FIND THE BELOW DETAILS:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com
Mobile: 9791938249
Telephone: 0413-2211159
www.nexgenproject.com
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
NLP Project: Machine Comprehension Using Attention-Based LSTM Encoder-Decoder...Eugene Nho
Machine comprehension remains a challenging open area of research. While many question answering models have been explored for existing datasets, little work has been done with the newly released MS MARCO dataset, which mirrors the reality much more closely and poses many unique challenges. We explore an end-to-end neural architecture with attention mechanisms for comprehending relevant information and generating text answers for MS MARCO.
A Text-Independent Speaker Identification System based on The Zak TransformCSCJournals
A novel text-independent speaker identification system based on the Zak transform is implemented. The data used in this paper are drawn from the ELSDSR database. The efficiency of identification approaches 91.3% using single test file and 100% using two test files. The method shows comparable efficiency results with the well known MFCC method with an advantage of being faster in both modeling and identification.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
Machine learning in Dynamic Adaptive Streaming over HTTP (DASH)Eswar Publications
Recently machine learning has been introduced into the area of adaptive video streaming. This paper explores a novel taxonomy that includes six state of the art techniques of machine learning that have been applied to Dynamic Adaptive Streaming over HTTP (DASH): (1) Q-learning, (2) Reinforcement learning, (3) Regression, (4) Classification, (5) Decision Tree learning, and (6) Neural networks.
Packet Classification using Support Vector Machines with String KernelsIJERA Editor
Since the inception of internet many methods have been devised to keep untrusted and malicious packets away
from a user’s system . The traffic / packet classification can be used
as an important tool to detect intrusion in the system. Using Machine Learning as an efficient statistical based
approach for classifying packets is a novel method in practice today . This paper emphasizes upon using an
advanced string kernel method within a support vector machine to classify packets .
There exists a paper related to a similar problem using Machine Learning [2]. But the researches mentioned in
their paper are not up-to date and doesn’t account for modern day
string kernels that are much more efficient . My work extends their research by introducing different approaches
to classify encrypted / unencrypted traffic / packets .
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
An in-depth exploration of Bangla blog post classificationjournalBEEI
Bangla blog is increasing rapidly in the era of information, and consequently, the blog has a diverse layout and categorization. In such an aptitude, automated blog post classification is a comparatively more efficient solution in order to organize Bangla blog posts in a standard way so that users can easily find their required articles of interest. In this research, nine supervised learning models which are Support Vector Machine (SVM), multinomial naïve Bayes (MNB), multi-layer perceptron (MLP), k-nearest neighbours (k-NN), stochastic gradient descent (SGD), decision tree, perceptron, ridge classifier and random forest are utilized and compared for classification of Bangla blog post. Moreover, the performance on predicting blog posts against eight categories, three feature extraction techniques are applied, namely unigram TF-IDF (term frequency-inverse document frequency), bigram TF-IDF, and trigram TF-IDF. The majority of the classifiers show above 80% accuracy. Other performance evaluation metrics also show good results while comparing the selected classifiers.
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...paperpublications3
Abstract: Data gathering in wireless sensor network (WSN) is a crucial field of study and it can be optimized various algorithms like clustering, aggregation, and cryptographic technique in order to reliably transfer data between sensor and sink. But these techniques do not provide an optimized data gathering wireless sensor network because of the fact that they do not leverage the advantages of various techniques. Our problem definition is to create a reliable data gathering wireless sensor network which ensures good energy efficiency and lower delay as compared to existing techniques.
Keywords: Aggregation, Clustering, Data Gathering, Cryptography, Data Compression, Run Length Encoding.
Title: Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency and Delay
Author: Neelam Ashok Meshram
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitiv...paperpublications3
Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio. Although it improves the infrastruc¬ture based networks it has a weakness in case of ad-hoc mobile net¬works. The energy constraints and the total mobility of the net¬work complicate the selection of the appropriate teacher for a student. By selecting the wrong teacher, there is a high probabil¬ity that the taught information may be faulty, and thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for teacher selection based on the auto-correla¬tion degree of the teacher’s candidate environment and the cross-correlation degree between the teacher candidate and the student environments. We validate our approach in the context of coexist¬ence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
Title: Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
Author: Dr. Charbel Nicolas
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
Parallel and distributed genetic algorithm with multiple objectives to impro...khalil IBRAHIM
we argue that the timetabling problem reflects the problem of scheduling university courses, So you must specify the range of time periods and a group of instructors for a range of lectures to check a set of constraints and reduce the cost of other constraints ,this is the problem called NP-hard, it is a class of problems that are informally, it’s mean that necessary operations to solve the problem will increase exponentially and directly proportional to the size of the problem, The construction of timetable is the most complicated problem that was facing many universities, and increased by size of the university data and overlapping disciplines between colleges, and when a traditional algorithm (EA) is unable to provide satisfactory results, a distributed EA (dEA), which deploys the population on distributed systems, it also offers an opportunity to solve extremely high dimensional problems through distributed coevolution using a divide-and-conquer mechanism, Further, the distributed environment allows a dEA to maintain population diversity, thereby avoiding local optima and also facilitating multi-objective search, by employing different distribution models to parallelize the processing of EAs, we designed a genetic algorithm suitable for Universities environment and the constraints facing it when building timetable for lectures.
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.
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 stochastic algorithm for solving the posterior inference problem in topic m...TELKOMNIKA JOURNAL
Latent Dirichlet allocation (LDA) is an important probabilistic generative model and has usually used in many domains such as text mining, retrieving information, or natural language processing domains. The posterior inference is the important problem in deciding the quality of the LDA model, but it is usually non-deterministic polynomial (NP)-hard and often intractable, especially in the worst case. For individual texts, some proposed methods such as variational Bayesian (VB), collapsed variational Bayesian (CVB), collapsed Gibb’s sampling (CGS), and online maximum a posteriori estimation (OPE) to avoid solving this problem directly, but they usually do not have any guarantee of convergence rate or quality of learned models excepting variants of OPE. Based on OPE and using the Bernoulli distribution combined, we design an algorithm namely general online maximum a posteriori estimation using two stochastic bounds (GOPE2) for solving the posterior inference problem in LDA model. It also is the NP-hard non-convex optimization problem. Via proof of theory and experimental results on the large datasets, we realize that GOPE2 is performed to develop the efficient method for learning topic models from big text collections especially massive/streaming texts, and more efficient than previous methods.
Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a frame-work for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is implemented by movement models. These are either synthetic models or existing movement traces. Connectivity between the nodes is based on their location, communication range and the bit-rate. The routing function is implemented by routing modules that decide which messages to forward over existing contacts. Finally, the messages themselves are generated either through event generators that generate random traffic between the nodes, or through applications that generate traffic based on application interactions. The main functions of the simulator are the modelling of node movement, inter-node contacts using various interfaces, routing, message handling and application interactions. Result collection and analysis are done through visualization, reports and post-processing tools.
NLP Project: Machine Comprehension Using Attention-Based LSTM Encoder-Decoder...Eugene Nho
Machine comprehension remains a challenging open area of research. While many question answering models have been explored for existing datasets, little work has been done with the newly released MS MARCO dataset, which mirrors the reality much more closely and poses many unique challenges. We explore an end-to-end neural architecture with attention mechanisms for comprehending relevant information and generating text answers for MS MARCO.
A Text-Independent Speaker Identification System based on The Zak TransformCSCJournals
A novel text-independent speaker identification system based on the Zak transform is implemented. The data used in this paper are drawn from the ELSDSR database. The efficiency of identification approaches 91.3% using single test file and 100% using two test files. The method shows comparable efficiency results with the well known MFCC method with an advantage of being faster in both modeling and identification.
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
Machine learning in Dynamic Adaptive Streaming over HTTP (DASH)Eswar Publications
Recently machine learning has been introduced into the area of adaptive video streaming. This paper explores a novel taxonomy that includes six state of the art techniques of machine learning that have been applied to Dynamic Adaptive Streaming over HTTP (DASH): (1) Q-learning, (2) Reinforcement learning, (3) Regression, (4) Classification, (5) Decision Tree learning, and (6) Neural networks.
Packet Classification using Support Vector Machines with String KernelsIJERA Editor
Since the inception of internet many methods have been devised to keep untrusted and malicious packets away
from a user’s system . The traffic / packet classification can be used
as an important tool to detect intrusion in the system. Using Machine Learning as an efficient statistical based
approach for classifying packets is a novel method in practice today . This paper emphasizes upon using an
advanced string kernel method within a support vector machine to classify packets .
There exists a paper related to a similar problem using Machine Learning [2]. But the researches mentioned in
their paper are not up-to date and doesn’t account for modern day
string kernels that are much more efficient . My work extends their research by introducing different approaches
to classify encrypted / unencrypted traffic / packets .
Efficient routing mechanism using cycle based network and k hop security in a...ijait
In a multi-domain network, Topology Aggregation (TA) may be adopted to provide limited information
regarding intra cluster connectivity without revealing detailed topology information. Nodes are grouped
into the cluster. Every cluster has border nodes, which is used for data transmission between source and
destination. The K-hop security can be used for the purpose of securing the data communication. The
topologies are spanning tree and balanced tree that can be used to reduce bandwidth overhead, delivery
delay and to increase throughput and packet delivery ratio. The shortest path can be found using
Bhandari’s algorithm and Cycle-Based Minimum-Cost Domain-Disjoint Paths (CMCDP) Algorithm for
establish the second path in the network . These topologies are compared to demonstrate the advantage of
finding shortest path using Bhandari’s algorithm.
An in-depth exploration of Bangla blog post classificationjournalBEEI
Bangla blog is increasing rapidly in the era of information, and consequently, the blog has a diverse layout and categorization. In such an aptitude, automated blog post classification is a comparatively more efficient solution in order to organize Bangla blog posts in a standard way so that users can easily find their required articles of interest. In this research, nine supervised learning models which are Support Vector Machine (SVM), multinomial naïve Bayes (MNB), multi-layer perceptron (MLP), k-nearest neighbours (k-NN), stochastic gradient descent (SGD), decision tree, perceptron, ridge classifier and random forest are utilized and compared for classification of Bangla blog post. Moreover, the performance on predicting blog posts against eight categories, three feature extraction techniques are applied, namely unigram TF-IDF (term frequency-inverse document frequency), bigram TF-IDF, and trigram TF-IDF. The majority of the classifiers show above 80% accuracy. Other performance evaluation metrics also show good results while comparing the selected classifiers.
Impact of mobility models on supp tran optimized dtn spray and wait routing p...ijmnct
The delay-tolerant networks (DTN) are networks that support communication between nodes when
connectivity is intermittent, due to the difficulties encountered in this type of environment, such as node
mobility frequently changing network topology, this which does not allow to route messages directly
between the source and destination, the routing algorithms must consider mobility to increase the rate of
message delivery. In our previous work of Supp-Tran we examine that spray and wait router was not
showing good delivery probability in case of SPMBM mobility model and FIFO forwarding strategy
compared to our Supp-Tran strategy.
This paper compares the behavior of the FIFO strategy used by default with spray and wait routing
protocol and that of our Supp-Tran strategy under different type of mobility, to do that the most mobility
models used are chosen to show how mobility model affects the forwarding strategy using as performance
metric such as delivery probability, the number of dropped messages , buffer time average, the overhead
ratio and average number of hops.
Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency...paperpublications3
Abstract: Data gathering in wireless sensor network (WSN) is a crucial field of study and it can be optimized various algorithms like clustering, aggregation, and cryptographic technique in order to reliably transfer data between sensor and sink. But these techniques do not provide an optimized data gathering wireless sensor network because of the fact that they do not leverage the advantages of various techniques. Our problem definition is to create a reliable data gathering wireless sensor network which ensures good energy efficiency and lower delay as compared to existing techniques.
Keywords: Aggregation, Clustering, Data Gathering, Cryptography, Data Compression, Run Length Encoding.
Title: Design of a Reliable Wireless Sensor Network with Optimized Energy Efficiency and Delay
Author: Neelam Ashok Meshram
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitiv...paperpublications3
Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio. Although it improves the infrastruc¬ture based networks it has a weakness in case of ad-hoc mobile net¬works. The energy constraints and the total mobility of the net¬work complicate the selection of the appropriate teacher for a student. By selecting the wrong teacher, there is a high probabil¬ity that the taught information may be faulty, and thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for teacher selection based on the auto-correla¬tion degree of the teacher’s candidate environment and the cross-correlation degree between the teacher candidate and the student environments. We validate our approach in the context of coexist¬ence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
Title: Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
Author: Dr. Charbel Nicolas
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
Parallel and distributed genetic algorithm with multiple objectives to impro...khalil IBRAHIM
we argue that the timetabling problem reflects the problem of scheduling university courses, So you must specify the range of time periods and a group of instructors for a range of lectures to check a set of constraints and reduce the cost of other constraints ,this is the problem called NP-hard, it is a class of problems that are informally, it’s mean that necessary operations to solve the problem will increase exponentially and directly proportional to the size of the problem, The construction of timetable is the most complicated problem that was facing many universities, and increased by size of the university data and overlapping disciplines between colleges, and when a traditional algorithm (EA) is unable to provide satisfactory results, a distributed EA (dEA), which deploys the population on distributed systems, it also offers an opportunity to solve extremely high dimensional problems through distributed coevolution using a divide-and-conquer mechanism, Further, the distributed environment allows a dEA to maintain population diversity, thereby avoiding local optima and also facilitating multi-objective search, by employing different distribution models to parallelize the processing of EAs, we designed a genetic algorithm suitable for Universities environment and the constraints facing it when building timetable for lectures.
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.
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 stochastic algorithm for solving the posterior inference problem in topic m...TELKOMNIKA JOURNAL
Latent Dirichlet allocation (LDA) is an important probabilistic generative model and has usually used in many domains such as text mining, retrieving information, or natural language processing domains. The posterior inference is the important problem in deciding the quality of the LDA model, but it is usually non-deterministic polynomial (NP)-hard and often intractable, especially in the worst case. For individual texts, some proposed methods such as variational Bayesian (VB), collapsed variational Bayesian (CVB), collapsed Gibb’s sampling (CGS), and online maximum a posteriori estimation (OPE) to avoid solving this problem directly, but they usually do not have any guarantee of convergence rate or quality of learned models excepting variants of OPE. Based on OPE and using the Bernoulli distribution combined, we design an algorithm namely general online maximum a posteriori estimation using two stochastic bounds (GOPE2) for solving the posterior inference problem in LDA model. It also is the NP-hard non-convex optimization problem. Via proof of theory and experimental results on the large datasets, we realize that GOPE2 is performed to develop the efficient method for learning topic models from big text collections especially massive/streaming texts, and more efficient than previous methods.
A New Function-based Framework for Classification and Evaluation of Mutual Ex...CSCJournals
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.
MULTIPROCESSOR SCHEDULING AND PERFORMANCE EVALUATION USING ELITIST NON DOMINA...ijcsa
Task scheduling plays an important part in the improvement of parallel and distributed systems. The problem of task scheduling has been shown to be NP hard. The time consuming is more to solve the problem in deterministic techniques. There are algorithms developed to schedule tasks for distributed environment, which focus on single objective. The problem becomes more complex, while considering biobjective.This paper presents bi-objective independent task scheduling algorithm using elitist Nondominated
sorting genetic algorithm (NSGA-II) to minimize the makespan and flowtime. This algorithm generates pareto global optimal solutions for this bi-objective task scheduling problem. NSGA-II is implemented by using the set of benchmark instances. The experimental result shows NSGA-II generates efficient optimal schedules.
TOWARDS MORE ACCURATE CLUSTERING METHOD BY USING DYNAMIC TIME WARPINGijdkp
An intrinsic problem of classifiers based on machine learning (ML) methods is that their learning time
grows as the size and complexity of the training dataset increases. For this reason, it is important to have
efficient computational methods and algorithms that can be applied on large datasets, such that it is still
possible to complete the machine learning tasks in reasonable time. In this context, we present in this paper
a more accurate simple process to speed up ML methods. An unsupervised clustering algorithm is
combined with Expectation, Maximization (EM) algorithm to develop an efficient Hidden Markov Model
(HMM) training. The idea of the proposed process consists of two steps. In the first step, training instances
with similar inputs are clustered and a weight factor which represents the frequency of these instances is
assigned to each representative cluster. Dynamic Time Warping technique is used as a dissimilarity
function to cluster similar examples. In the second step, all formulas in the classical HMM training
algorithm (EM) associated with the number of training instances are modified to include the weight factor
in appropriate terms. This process significantly accelerates HMM training while maintaining the same
initial, transition and emission probabilities matrixes as those obtained with the classical HMM training
algorithm. Accordingly, the classification accuracy is preserved. Depending on the size of the training set,
speedups of up to 2200 times is possible when the size is about 100.000 instances. The proposed approach
is not limited to training HMMs, but it can be employed for a large variety of MLs methods.
In recent machine learning community, there is a trend of constructing a linear logarithm version of
nonlinear version through the ‘kernel method’ for example kernel principal component analysis, kernel
fisher discriminant analysis, support Vector Machines (SVMs), and the current kernel clustering
algorithms. Typically, in unsupervised methods of clustering algorithms utilizing kernel method, a
nonlinear mapping is operated initially in order to map the data into a much higher space feature, and then
clustering is executed. A hitch of these kernel clustering algorithms is that the clustering prototype resides
in increased features specs of dimensions and therefore lack intuitive and clear descriptions without
utilizing added approximation of projection from the specs to the data as executed in the literature
presented. This paper aims to utilize the ‘kernel method’, a novel clustering algorithm, founded on the
conventional fuzzy clustering algorithm (FCM) is anticipated and known as kernel fuzzy c-means algorithm
(KFCM). This method embraces a novel kernel-induced metric in the space of data in order to interchange
the novel Euclidean matric norm in cluster prototype and fuzzy clustering algorithm still reside in the space
of data so that the results of clustering could be interpreted and reformulated in the spaces which are
original. This property is used for clustering incomplete data. Execution on supposed data illustrate that
KFCM has improved performance of clustering and stout as compare to other transformations of FCM for
clustering incomplete data.
Scalable Static and Dynamic Community Detection Using Grappolo : NOTESSubhajit Sahu
A **community** (in a network) is a subset of nodes which are _strongly connected among themselves_, but _weakly connected to others_. Neither the number of output communities nor their size distribution is known a priori. Community detection methods can be divisive or agglomerative. **Divisive methods** use _betweeness centrality_ to **identify and remove bridges** between communities. **Agglomerative methods** greedily **merge two communities** that provide maximum gain in _modularity_. Newman and Girvan have introduced the **modularity metric**. The problem of community detection is then reduced to the problem of modularity maximization which is **NP-complete**. **Louvain method** is a variant of the _agglomerative strategy_, in that is a _multi-level heuristic_.
https://gist.github.com/wolfram77/917a1a4a429e89a0f2a1911cea56314d
In this paper, the authors discuss **four heuristics** for Community detection using the _Louvain algorithm_ implemented upon recently developed **Grappolo**, which is a parallel variant of the Louvain algorithm. They are:
- Vertex following and Minimum label
- Data caching
- Graph coloring
- Threshold scaling
With the **Vertex following** heuristic, the _input is preprocessed_ and all single-degree vertices are merged with their corresponding neighbours. This helps reduce the number of vertices considered in each iteration, and also help initial seeds of communities to be formed. With the **Minimum label heuristic**, when a vertex is making the decision to move to a community and multiple communities provided the same modularity gain, the community with the smallest id is chosen. This helps _minimize or prevent community swaps_. With the **Data caching** heuristic, community information is stored in a vector instead of a map, and is reused in each iteration, but with some additional cost. With the **Vertex ordering via Graph coloring** heuristic, _distance-k coloring_ of graphs is performed in order to group vertices into colors. Then, each set of vertices (by color) is processed _concurrently_, and synchronization is performed after that. This enables us to mimic the behaviour of the serial algorithm. Finally, with the **Threshold scaling** heuristic, _successively smaller values of modularity threshold_ are used as the algorithm progresses. This allows the algorithm to converge faster, and it has been observed a good modularity score as well.
From the results, it appears that _graph coloring_ and _threshold scaling_ heuristics do not always provide a speedup and this depends upon the nature of the graph. It would be interesting to compare the heuristics against baseline approaches. Future work can include _distributed memory implementations_, and _community detection on streaming graphs_.
A Comparison between FPPSO and B&B Algorithm for Solving Integer Programming ...Editor IJCATR
Branch and Bound technique (B&B) is commonly used for intelligent search in finding a set of integer solutions within a space of interest. The corresponding binary tree structure provides a natural parallelism allowing concurrent evaluation of sub-problems using parallel computing technology. Flower pollination Algorithm is a recently-developed method in the field of computational intelligence. In this paper is presented an improved version of Flower pollination Meta-heuristic Algorithm, (FPPSO), for solving integer programming problems. The proposed algorithm combines the standard flower pollination algorithm (FP) with the particle swarm optimization (PSO) algorithm to improve the searching accuracy. Numerical results show that the FPPSO is able to obtain the optimal results in comparison to traditional methods (branch and bound) and other harmony search algorithms. However, the benefits of this proposed algorithm is in its ability to obtain the optimal solution within less computation, which save time in comparison with the branch and bound algorithm.Branch and bound, flower pollination Algorithm; meta-heuristics; optimization; the particle swarm optimization; integer programming.
Text classification based on gated recurrent unit combines with support vecto...IJECEIAES
As the amount of unstructured text data that humanity produce largely and a lot of texts are grows on the Internet, so the one of the intelligent technique is require processing it and extracting different types of knowledge from it. Gated recurrent unit (GRU) and support vector machine (SVM) have been successfully used to Natural Language Processing (NLP) systems with comparative, remarkable results. GRU networks perform well in sequential learning tasks and overcome the issues of “vanishing and explosion of gradients in standard recurrent neural networks (RNNs) when captureing long-term dependencies. In this paper, we proposed a text classification model based on improved approaches to this norm by presenting a linear support vector machine (SVM) as the replacement of Softmax in the final output layer of a GRU model. Furthermore, the cross-entropy function shall be replaced with a margin-based function. Empirical results present that the proposed GRU-SVM model achieved comparatively better results than the baseline approaches BLSTM-C, DABN.
An Efficient Clustering Method for Aggregation on Data FragmentsIJMER
Clustering is an important step in the process of data analysis with applications to numerous fields. Clustering ensembles, has emerged as a powerful technique for combining different clustering results to obtain a quality cluster. Existing clustering aggregation algorithms are applied directly to large number of data points. The algorithms are inefficient if the number of data points is large. This project defines an efficient approach for clustering aggregation based on data fragments. In fragment-based approach, a data fragment is any subset of the data. To increase the efficiency of the proposed approach, the clustering aggregation can be performed directly on data fragments under comparison measure and normalized mutual information measures for clustering aggregation, enhanced clustering aggregation algorithms are described. To show the minimal computational complexity. (Agglomerative, Furthest, and Local Search); nevertheless, which increases the accuracy.
FAST DETECTION OF DDOS ATTACKS USING NON-ADAPTIVE GROUP TESTINGIJNSA Journal
Network security has become more important role today to personal users and organizations. Denial-of-
Service (DoS) and Distributed Denial-of-Service (DDoS) attacks are serious problem in network. The
major challenges in design of an efficient algorithm in data stream are one-pass over the input, poly-log
space, poly-log update time and poly-log reporting time. In this paper, we use strongly explicit construction
d-disjunct matrices in Non-adaptive group testing (NAGT) to adapt these requirements and propose a
solution for fast detecting DoS and DDoS attacks based on NAGT approach
X-TREPAN: A MULTI CLASS REGRESSION AND ADAPTED EXTRACTION OF COMPREHENSIBLE D...cscpconf
In this work, the TREPAN algorithm is enhanced and extended for extracting decision trees from neural networks. We empirically evaluated the performance of the algorithm on a set of databases from real world events. This benchmark enhancement was achieved by adapting Single-test TREPAN and C4.5 decision tree induction algorithms to analyze the datasets. The models are then compared with X-TREPAN for comprehensibility and classification accuracy. Furthermore, we validate the experimentations by applying statistical methods. Finally, the modified algorithm is extended to work with multi-class regression problems and the ability to comprehend generalized feed forward networks is achieved.
X-TREPAN : A Multi Class Regression and Adapted Extraction of Comprehensible ...csandit
In this work, the TREPAN algorithm is enhanced and extended for extracting decision trees
from neural networks. We empirically evaluated the performance of the algorithm on a set of
databases from real world events. This benchmark enhancement was achieved by adapting
Single-test TREPAN and C4.5 decision tree induction algorithms to analyze the datasets. The
models are then compared with X-TREPAN for comprehensibility and classification accuracy.
Furthermore, we validate the experimentations by applying statistical methods. Finally, the
modified algorithm is extended to work with multi-class regression problems and the ability to
comprehend generalized feed forward networks is achieved.
FAST DETECTION OF DDOS ATTACKS USING NON-ADAPTIVE GROUP TESTINGIJNSA Journal
Network security has become more important role today to personal users and organizations. Denial-ofService (DoS) and Distributed Denial-of-Service (DDoS) attacks are serious problem in network. The major challenges in design of an efficient algorithm in data stream are one-pass over the input, poly-log space, poly-log update time and poly-log reporting time. In this paper, we use strongly explicit construction d-disjunct matrices in Non-adaptive group testing (NAGT) to adapt these requirements and propose a solution for fast detecting DoS and DDoS attacks based on NAGT approach.
A COMPREHENSIVE ANALYSIS OF QUANTUM CLUSTERING : FINDING ALL THE POTENTIAL MI...IJDKP
Quantum clustering (QC), is a data clustering algorithm based on quantum mechanics which is
accomplished by substituting each point in a given dataset with a Gaussian. The width of the Gaussian is a
σ value, a hyper-parameter which can be manually defined and manipulated to suit the application.
Numerical methods are used to find all the minima of the quantum potential as they correspond to cluster
centers. Herein, we investigate the mathematical task of expressing and finding all the roots of the
exponential polynomial corresponding to the minima of a two-dimensional quantum potential. This is an
outstanding task because normally such expressions are impossible to solve analytically. However, we
prove that if the points are all included in a square region of size σ, there is only one minimum. This bound
is not only useful in the number of solutions to look for, by numerical means, it allows to to propose a new
numerical approach “per block”. This technique decreases the number of particles by approximating some
groups of particles to weighted particles. These findings are not only useful to the quantum clustering
problem but also for the exponential polynomials encountered in quantum chemistry, Solid-state Physics
and other applications.
Similar to Permission based group mutual exclusion (20)
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
JMeter webinar - integration with InfluxDB and GrafanaRTTS
Watch this recorded webinar about real-time monitoring of application performance. See how to integrate Apache JMeter, the open-source leader in performance testing, with InfluxDB, the open-source time-series database, and Grafana, the open-source analytics and visualization application.
In this webinar, we will review the benefits of leveraging InfluxDB and Grafana when executing load tests and demonstrate how these tools are used to visualize performance metrics.
Length: 30 minutes
Session Overview
-------------------------------------------
During this webinar, we will cover the following topics while demonstrating the integrations of JMeter, InfluxDB and Grafana:
- What out-of-the-box solutions are available for real-time monitoring JMeter tests?
- What are the benefits of integrating InfluxDB and Grafana into the load testing stack?
- Which features are provided by Grafana?
- Demonstration of InfluxDB and Grafana using a practice web application
To view the webinar recording, go to:
https://www.rttsweb.com/jmeter-integration-webinar
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
Permission based group mutual exclusion
1. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
DOI:10.5121/ijdps.2016.7102 19
PERMISSION BASED GROUP MUTUAL EXCLUSION
ALGORITHMS FOR A CLUSTER TREE NETWORK
Touomguem Nzeumbeu Arlette Sylvie1
, Kamla Vivient Corneille2
, and Tcha’wu
Gatsing Elvire Cheryl1
1
Departement of mathematics and Computer Science, Faculty of Science, the University
of Ngaoundere, Cameroon
2
Departement of mathematics and Computer Science, National School of Agro-industrial
sciences, the University of Ngaoundere, Cameroon
ABSTRACT
Due to the growing application of peer to peer computing, distributed applications are continuously
spreading over an extensive number of nodes. To cope with this large number of participants, various
hierarchical cluster based solutions have been proposed. Cluster or group based solutions are scalable for
a large number of participants. As far as group mutual exclusion solutions are concerned, some of them
have good complexity but do not take into account the growing number of participants. Others take into
account the previous aspect but do not have good complexity. In this paper we present two group mutual
exclusion algorithms namely; TBGMEACα and TBGMEACβ to deal both with the growing number of
nodes and the matter of having a good complexity. The proposed logical structure is a cluster tree. The first
solution uses the partial flooding method, which is the partial propagation of informations available at root
level. In the second solution, informations available at root level are propagated only towards the
processes which issued a request for a session. Both algorithms have complexities of O(p) and O(log p)
respectively (p is the number of clusters in the system).
KEYWORDS
Distributed system, resource management, group mutual exclusion, cluster tree network & partial flooding.
1. INTRODUCTION
1.1 Preliminaries
In a computer system, a process executes one part of his program called critical section (CS)
when it accesses a shared or critical resource. For certain shared resource, the critical section of a
process can be associated to a type or a group. Critical sections belonging to the same group can
be executed concurrently while critical sections belonging to different groups must be executed in
a mutual exclusive manner [1]. Thus, the problem of shared resource appear, when different
groups of processes have to access exclusively to a critical resource. That problem is known since
many decades in computer science research community as mutual exclusion problem. In terms of
the maximal number of processes in a group, two classes of mutual exclusion problem are
distinguished in the literature. The first class, called the basic mutual exclusion problem [2, 3, 4,5,
6, 7, 8, 9], where the maximum size of groups is one, and the second class called group mutual
exclusion (GME) problem, where every group can have more than one process [1,10,11,12, 13,
14, 15, 16].
2. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
20
The focus of this paper is the GME problem. The issue of this problem is to manage a mutually
exclusive resource among n processes. Processes are allowed to be in critical section
simultaneously only if they belong to the same group. A conference room, classroom, CD-
jukebox, Internet server, and railway are examples of GME problems. At least one conference can
take place in the conference room at the same time. In this first example, participants are
processes attending the conference, conferences are groups, and the conference room is the
critical resource. With regard to a classroom, only one lesson can be given at the same time. In
this second example, students are processes attending the lesson, lessons are groups, and the
classroom is the critical resource. The example of CD-juke (resp. Internet server) is well
described in [11, 12] (resp. [13]). Regarding the example of the railway, it has only two sides and
trains can leave from one side to another, but only one side is opened at the same time. In this last
example, and in relation with the GME problem, trains are processes, the two sides of railway are
groups, and the railway is the critical resource.
1.2 Related work
Several solutions of the GME problem in computer system exist. The main challenge of these
solutions resides in the number of exchanged messages through the computer system in order to
avoid concurrent use of a critical resource by different groups. Many existing solutions for the
GME problem can be classify in permission based and token based categories. Algorithms for
the first category can be found in [11, 17] for the shared memory model and in [12, 18, 19, 20,
21] for the message passing model. In [20, 21] solutions are provided for fully connected network
while in [18, 19] they are provided for ring network. Solutions have been also proposed for tree
network [12] where processes are assumed to be arranged in the form of a tree and groups of
processes are called sessions. Any process interested in session y can enter and exit the session
any number of time till a session x ≠ y is requested. In [12], three algorithms have been proposed
namely GMEα, GMEβ and GMEγ. GMEα has a message complexity of 3 (N-1) + h1 where h1 is
the initial tree height. GMEβ is an improvement of GMEα. The message complexity here has
been reduced to 4h1. GMEγ, which is an improvement of GMEβ has a message complexity of
4hmax (hmax is the Maximum height of the tree). The trick used here is that the root is no longer a
fixed root like in GMEα, and GMEβ; any process can become the root. For the token based
category, solutions can be found in [19, 22, 23]. The solution in [22] uses the notion of priority.
To ensure the GME two tokens are used; a process with the primary token can send the secondary
token to a process wishing to access the same session, while the process holding the secondary
token cannot do so. The algorithm requires 2(N-1) messages per entry in the critical section
where N is the number of nodes. The algorithm in [19] is for an asynchronous ring and its
message complexity is N2
. A solution has also been provided for hierarchical structure [23]; here
processes are grouped to form clusters which in turn are used to build a two-level hierarchy. The
algorithm uses the notion of coordinator and requires that these are all connected. Its message
complexity is O (p), where p is the number of clusters.
1.3 Our contributions
We present two permission based group mutual exclusion algorithms for cluster tree networks
(TBGMEAC) ; both solutions have an unbounded degree of concurrency and use fixed root. The
first solution TBGMEACα uses the partial flooding method, which is the partial propagation of
informations available at root level. The message complexity is (4h0+ hmax +3 (P-1)) where p is
the number of clusters, hmax the maximum height of the cluster tree and h0 the distance between a
node and its coordinator. In the second solution TBGMEACβ, informations available at root level
are propagated only towards the processes which issued a request for a session. The message
complexity is 4 (hmax + h0).
3. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
21
1.4 Paper organisation
We present our system model and formally describe the group mutual exclusion problem in
section 2. We describe our group mutual exclusion algorithm for a cluster tree network in section
3. In section 4, we give the correctness proof of our GME algorithms. Finally, we present our
conclusion, and future works in section 5.
2. MODEL AND PROBLEM DEFINITION
2.1. System model
We assume an asynchronous distributed system that consist of N nodes numbered 1, 2 …N; the
only way of communication between different nodes is message exchange. We also assume that
each node can communicate directly with every other and that the links are both FIFO (First In
First Out) and infallible. There is neither overall time in the system or shared memory. The
propagation delay of messages between two nodes is finite but unpredictable. A process should
not issue a new request before the old query is satisfied. In the following we assume that the
terms node, site and process designate one and the same thing; the nodes are also assumed not to
crash.
In the network, nodes are logically partitioned into separated groups and each group is called
cluster; clusters are then arranged to form a tree. N nodes are thus divided into P clusters
numbered p1, p2…pp, each cluster containing Ni nodes such as the following equality is
verified: . Each node is represented by its identifier and there is no need to mention
the reference of the cluster to which it belongs, in the course of algorithm. In every cluster, a node
is responsible for the task of leading and has as its parent the cluster leader at the top level, except
for the case of the root cluster leader. A hierarchy of three levels consisting of ten clusters and
sixty-one nodes is presented in the figure 1 below.
Figure 1. A three level hierarchy cluster tree network
2.2. The Group Mutual Exclusion Problem
The group mutual exclusion (GME) problem is an extension to the basic mutual exclusion
problem. It sets the problem of sharing m resources in mutual exclusion by n processes; a group is
then associated with each resource type and critical sections belonging to the same group can run
concurrently, while critical sections belonging to different groups must be executed in mutual
exclusion. The properties of GME algorithms are:
4. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
22
Group mutual exclusion (safety): At any time, no two processes that have requested critical
sections belonging to different groups are in their critical sections simultaneously.
Starvation freedom (liveness): A process requesting entry into its critical section should
eventually be able to enter the critical section.
Concurrent entry (non-triviality): If all requests are for critical sections belonging to the same
group, then a requesting process should not be required to wait for entering its critical section
until some other process has left its critical section.
To measure the performance of a group mutual exclusion algorithm, we use the following
metrics:
The message complexity: it is a measure of the number of messages generated per entry to the
critical section.
The synchronization delay: the time elapsed between when some process leaves its critical
section and some other process can enter its critical section of different type.
The waiting time: the time elapsed between when a process issues a request for critical section
and when it actually enters the critical section.
The system throughput: the number of critical section requests fulfilled per unit time.
The concurrency: the number of processes that are in their critical sections at the same time.
3. OUR ALGORITHMS
Our algorithms are derived from the GMEβ solution proposed in [12]. We modified GMEβ
extending it to take into account the growth in the number of participants while maintaining good
message complexity.
3.1 Overall System Architecture
We assume that there are two layers in the system such as, the application layer (upper layer) and
the GME layer (lower layer). The interface between these two layers is implemented using three
types of messages: Request_Session, Grant_Session and Exit_Session. Thus, when a process p
running at the application layer solicits any X session, it sends Request_session (X) to the GME
layer. Eventually, the GME layer grants access to it by sending Grant_session (X); at the end of
the use of the session X, p sends Exit_session (X) to GME layer.
To maintain the hierarchy processes are divided into two classes such as the non-leaders and
leaders processes. Each process maintain two pointer variable. The non-leaders processes of each
cluster are all connected to their leaders which are their parents. They each maintain a pointer
variable parp that contains a value in Np. Since these processes are leaves in each cluster, they
therefore have no descendants. Leader processes in turn maintain a variable parp that contains this
time a value in Np ᴗ Nil. If parp ϵ Np then, parp contains the link label of a particular neighbor of p,
called the parent of p. Another variable, DP, is a subset of Np {Parp}, called the set of descendants
of p. The parent pointer of processes form an oriented spanning tree rooted in a particular process,
referred to as the root of the spanning tree, such that Parracine = nil.
3.2. The first algorithm: TBGMEACα
The algorithm proceeds in two phases that are opening and closing of sessions. These phases are
initiated by the root.
Suppose a process P makes a first request (the first in the system) for a session X, which is sent to
the cluster leader through the message ASK (X). The leader records the session X as the requested
session and, sends the request to the next level cluster leader; so, from leader to leader the
message finally reach the root. Once the root receives the ASK (X), it starts the opening operation
5. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
23
of session X by sending OS (X) not only towards the process that is causing the ASK (X), but also
to any leader which received no request from their descendants. It is this technique that we call
partial flooding. To achieve this, we introduce a new variable New_Openset which will contain
both all processes that requested a session (the set Openset), and any leader in which did not
receive any request from its descendants. By doing so, those of such leaders who will later
receive requests will in turn serve only those of their descendants which issued requests for the
current session.
To identify the leaders which have not requested (or received requests from their descendants)
session, we must distinguish in a leader’s descent, leaders of lower- level cluster from proper
members of the cluster. So a leader must have as descent D = Dc ᴗ Dinf where Dc contains the
descendants belonging to the cluster of the corresponding cluster leader and Dinf contains the
descendants which are leaders of lower-level clusters so, New_Openset = Openset ᴗ Dinf. From
the moment the root propagated the opening session message for X, process p or other processes
can enter and exit the critical section as many times as they wish.
Now we suppose that another session, say Y ≠ X is requested by another process, say q; the
request is routed to the root, and it begins the second phase which is that of the closing of X by
sending the message CS (X) to all its descendants contained in New_Openset. Leaders do the
same for their descendants. Upon receipt of CS (X), p (or other processes) and the leaders which
received no request from their descendants must send a message to confirm that they have exited
session X. At this point, it is possible that the message CS (X) reaches a process while it is still in
critical section; in this case, it will delay sending his confirmation and will only do that once out
of the critical section. Once the root has received all the confirmations of the closing of session X,
it organizes the opening operation of session Y.
Since TBGMEACα is derived from GMEβ, as a description of TBGMEACα, we are going to show
the parts which have been modified to obtain our algorithm. For this we present the used
procedures and the used messages firstly for the leader side, then for the non-leader side.
Procedures from the leader’s side
6. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
24
Procedures from the non-leader’s side
Message section executed by the leaders
Message section executed by the non-leaders
Complexity analyses
Message complexity: We will consider two cases to compute the message complexity. Assume
that a process P requests the current opened session X; in this case it needs 2h0 messages because
the opening session message have also been sent to the all the leaders in the network. Assume
now that P requests a session Y≠X; this generates (4h0+ hmax +3 (P-1)) messages that is, h0+ hmax
7. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
25
messages to send the request of q to the root, 2((p-1) + h0) messages for the closing of the current
opened session (X) and ((p-1) + h0) for the opening of session Y.
The synchronization delay: this complexity measure is considered in our algorithm from the
point of view of sending and receiving messages and generates 3(h0 + (p-1)) messages that is, ((p-
1) + h0) messages from the root to the last process to exit the current opened session, ((p-1) + h0)
messages from that process to the root, and ((p-1) + h0) messages from the root to the waiting
process to enter the new opened session.
The waiting time: this complexity is also considered as for the previous complexity measure.
Assume that P wants to access the current opened session; it will have to wait for 2h0. Assuming
now that it wants to access a different session Y, it will have to wait T (4h0+ hmax +3 (P-1)),
where T is the transfer time of a message.
The degree of concurrency: the degree of concurrency is unbounded because, since a session is
opened processes can enter and exit the critical section as many time as they want.
3.3. The second algorithm: TBGMEACβ
Here we present an algorithm which reduces the message complexity from (4h0+ hmax +3 (P-1) to
2(h max + h0), that is from O (P) to O (log p). The astuteness used to do this is that once the root
receives a request, it sends the consequent messages only towards the processes which issued a
request. This algorithm also proceeds in two phases. Assume a process P requests a session X; the
request is sent towards the root as in the first algorithm. Then root then starts the opening of
session X by sending the OS (X) message only towards the process which issued a request for X;
this time, P can enter and exit session X as many times as it wants. Assume now that q wants to
access a session Y ≠ X; the request normally reaches the root which starts the closing of session X
by sending the message CS (X) towards the process which issued the request for X. Here also,
process p can delay sending the exit message from session X and send it only once out of the
critical session. Once the closing session message now reaches the root, it starts the opening of
session Y.
As the description of the pseudo code of TBGMEACβ the leaders are going to execute entirely
GMEβ, while the non-leaders are going to execute the same code presented previously for the
non-leaders side.
Complexity analyses
Message complexity: We will consider two cases to compute the message complexity. Assume
that a process P requests the current opened session X. in this case it needs 2h0 messages because
the leader has already recorded X as the current session. In the case the request is the first in the
system, this generates 2 (hmax + h0). Assume now that P requests a session Y≠X; this generates 4
(hmax + h0) messages that is, (hmax + h0) messages for the request to reach the root, 2 (hmax + h0)
messages to close the current opened session and (hmax + h0) messages to open the new requested
session.
The synchronization delay: this complexity measure is considered in our algorithm from the
point of view of sending and receiving messages and generates 3(h0 + hmax) messages that is, (h0
+ hmax) messages from the root to the last process to exit the current opened session, (h0 + hmax)
messages from that process to the root, and (h0 + hmax) messages from the root to the waiting
process to enter the new opened session.
8. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
26
The waiting time: this complexity is also considered as for the previous complexity measure.
Assume that P wants to access the current opened session; it will have to wait for 2h0. Assuming
now that it wants to access a different session Y, it will have to wait 4T (h0+ hmax) where T is the
transfer time of a message.
The degree of concurrency: the degree of concurrency is unbounded because, since a session is
opened processes can enter and exit the critical section as many time as they want.
4. CORRECTNESS PROOF
For a GME algorithm to be deemed correct, it must satisfy the properties of safety, liveness and
concurrent entry.
4.1 Safety
Here we want to show that if two processes p and q are running simultaneously their critical
sections Sp and Sq then Sp= Sq. for this we designed the lemma and theorem that follow.
Lemma 4.1: If two leaders say Cpi, and Cpj grant access to a session in their respective clusters,
then they do so for the same session.
Proof: Only the root is responsible of both the opening and the closing of sessions; thus in one
case or another, the root sends the same information to all its descendants in New_Openset. By
this way the lemma 4.1 holds.
Theorem 3.1: If two processes p and q are simultaneously in critical section, then they are for the
same session.
Proof: The only condition for a process to be in critical section is to receive the message OS(X)
from its leader. According to lemma 3.1 whichever the leader, the opened session is the same;
consequently processes which are concurrently in critical section are for the same session.
4.2 Liveness
Here the purpose is to proof that if a process, say p wants to access a session then, it finally
executes its critical section.
Lemma 4.2: A request sent by a leader, say Cpi eventually reaches the root or a leader which has
received the message OS(X).
Proof: Once a leader receives the message ASK (S) from its descendants, it has to do the test “if
Open^Current S=S” that is to say, if the current opened session is S. In case of unfavorable
opinion, the leader has to send in turn an ASK (S) message to its parent; in the case the opinion is
still unfavorable a leader has to react as previously until the request reaches the root. By this way
the request of a leader will be satisfied in case of favorable opinion or in the case its request
reaches the root. Consequently, a request sent by a leader, say Cpi eventually reaches the root or a
leader which has received the message OS(S).
Lemma 4.3: If there is a conflicting request in the system, then the current opened session
terminates in a finite time.
Proof: If there is a conflicting request in the system, then according to lemma4.2 it will finally
reach the root or a leader which have received the message OS(S) in a finite time.
9. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
27
Again, in of reception of a request for a session different from the current session the root stops
sending OS(S) messages to its cluster members and to any other process which requested the
current session. It after sends the closing session messages to its descendants; these messages will
reach the descendants at a finite time as it was the case during the forwarding of the request to the
root, according to lemma4.2. By the same way, the descendants in turn will send the closing
session messages towards the root in a finite time. Consequently, if there is a conflicting in the
system, then the current session terminates in a finite time.
Theorem4.2: If a process p requests a session X, then p finally enters in critical section.
Proof: Assume that p can suffer from starvation. P can suffer from starvation if its leader did not
receive the message OS (S) after it received the request.
This can happen in the following cases:
i) The request of the leader did not reach the root or any other process which received the
message OS (S). This is not possible according to the lemma4.2.
ii) The request of the leader reached the root but the requested session has not been chosen
as the next session to be opened.
The case (ii) is possible in the following cases:
a) The current session did not terminate in a finite time. This is not possible according to
lemma4.3.
b) The other sessions different from the current session are selected one after another.
Since the links are FIFO, the root will not select the sessions different from X during an
infinite long time after the request for X has been added to the root’s queue. Thus the
situations (a) and (b) are not possible and consequently (ii) is not possible. Since (i) and (ii)
are not possible, then our initial assumption is false and consequently the theorem holds.
4.3 Concurrent entry
The aim here is to show that if processes want to access a session and no other processes want to
access a different session, then these processes can access the session concurrently. The following
theorem demonstrates it.
Theorem 4.3: If processes request a session and no other one request a different session, then
all of them execute their critical section concurrently.
Proof: Assume that a process p requests a session X while no other process requests a session
different from X. Two cases must be considered at this level:
a) Session X is not opened when p requests it. According to theorem 4.2, once the request of
p reaches the root, it starts the opening of session X; then all the processes that have
requested X can concurrently enter the critical section once they received the OS (X)
message.
b) Session X is opened when p requests it. In this case either p has received the OS (X)
message, or has not received. In the first case, p enters immediately in critical section. In
the second case, p can concurrently enter in critical section with other processes once it
receives OS (X). Consequently the theorem 4.3 holds.
The previous correctness proof also holds for the second algorithm.
7. CONCLUSION AND FUTURE WORK
We have presented two group mutual exclusion solutions for cluster tree networks. The first
solution TBGMEACα is very efficient in terms of concurrency since the degree of concurrency is
unbounded; each entry in the critical section generates between 0 and O(p) messages. The second
10. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
28
solution TBGMEACβ achieves the average number of messages per entry in a critical section in
O(log p). It also provides an unbounded degree of concurrency. Both TBGMEACα and
TBGMEACβ use a fixed root.
A comparison of our solutions with the one of Swaroop [23] is given in the table 1.
Table1. Results comparison
Algorithms and authors Swaroop
HGME algorithm
Our TBGMEACα
algorithm
Our TBGMEACβ
algorithm
Year 2009 2016 2016
Type Token based Permission based Permission based
Message complexity O(p) O(p) O(log p)
Degree of concurrency Bounded Unbounded Unbounded
In our two solutions only the root has the task of opening and closing of sessions even if a process
in the root cluster is not interested in the requested session. As future work, we want to rebuild
the solution so that it can take into account the dynamic root cluster. Also, we considered that the
links are all infallible; it will be very interesting to reconsider that nodes can crash in order to
build a fault tolerant solution.
REFERENCES
[1] A. Swaroop and A. K. Singh, (2013) “A Hybrid Algorithm to Solve Group Mutual Exclusion
Problem in Message passing Distributed Systems”, International Journal of Computer Applications
(0975 – 8887) Volume 67– No.9 pp 51-59.
[2] Aoxueluo, W. Wu, J. Cao, and M. Raynal, (2013) “A generalized mutual exclusion problem and its
algorithm”, In Parallel Processing (ICPP), 42nd International Conference, pp 300–309.
[3] J. Lejeune, L. Arantes, J. Sopena and P. Sens, (2012) “Service level agreement for distributed mutual
exclusion in cloud computing”, In 12th
IEEE/ACM International Conference on Cluster, cloud and
Grid Computing (CCGRID’12), pp 180-187.
[4] J. Lejeune, (2014), Algorithme distribué d’exclusion mutuelle: vers une gestion efficace des
ressources, PhD thesis, Université Pierre et Marie Curie.
[5] M. A. Rahman and M. Mostofa, (2010), “Permission Based Hierarchical Algorithm for Mutual
Exclusion”, Journal of Computers (JCP), Academy Publisher, Vol. 5, No. 12, pp 1789-1799.
[6] M. A. Rahman and M. Mostofa, (2012), “A Permission based Multilevel Parallel Solution for
Distributed Mutual Exclusion”, Journal of Computers (JCP), Academy Publisher, Vol. 7, No. 8, pp
1831-1846.
[7] M. Naimi, M. Tréhel, and A. Arnold, (1996) “Distributed mutual exclusion algorithm based on path
reversal”, Journal of Parallel and Distributed Computing, Vol. 34, pp. 1-13.
[8] G. Richa, G. Shikha, and D. Pooja, (2011) “NTBCBT: a distributed mutual exclusion algorithm”,
International Journal of Peer to Peer Networks (IJP2P), Vol. 2, No. 3, pp. 25-31.
[9] V. C. Kamla, Souleymanou and I. Damakoa, (2014) “PBCBT: An improvement of NTBCBT
algorithm”, International Journal of Peer to Peer Networks (IJP2P), Vol. 5, No 1, pp 1-8 .
[10] Y. Joung, (1998) “Asynchronous group mutual exclusion algorithm (extended abstract)”. Proc.in the
17t h annual ACM symposium on principles of distributed computing.
[11] Y. J. Joung, (2000), “Asynchronous group mutual exclusion”, Distributed Computing, Vol. 13, pp.
189-206.
[12] J. Beauquier, S. Cantarell, A. K. Datta, and F. Petit, (2003), “Group mutual exclusion in tree
networks”, Journal of Information Science and Engineering, Vol. 19, pp. 415-432.
[13] O. Thiare, (2007), “Exclusion Mutuelle de Groupe dans les Systèmes distribués”, Thèse, Laboratoire
Informatique de Cergy-Pontoise (LICP) EA 2175.
11. International Journal of Distributed and Parallel Systems (IJDPS) Vol.7, No.1, January 2016
29
[14] V. Madenur and N. Mittal, (2008), “A Delay-Optimal Group Mutual Exclusion Algorithm for a Tree
Network”, Journal of Information Science and Engineering, Vol. 24, pp. 573-583.
[15] S. Dehghan and A.M. Rahmani, (2010), “A New Extended Group Mutual Exclusion Algorithm with
Low Message Complexity in Distributed Systems”, International Journal of Computer, Electrical,
Automation, Control and Information Engineering Vol: 4, No: 4, pp 748-753.
[16] A. Swaroop and A. k. singh, (2010), “An Improved Quorum-Based Algorithm for Extended GME
Problem in Distributed Systems”, Journal of Information Science and Engineering Vol 26, pp 57-69.
[17] V. Hadzilacos, (2001) “A note on group mutual exclusion”, in Proceedings of the 20th ACM
Symposium on Principles of Distributed Computing, pp. 100-106.
[18] K. P. Wu and Y. J. Joung, (2000) “Asynchronous group mutual exclusion in ring networks”, in IEE
Proceedings of Computers and Digital Techniques, Vol. 147, pp. 1-8.
[19] S. Cantarell, A. K. Datta, F. Petit, and V. Villain, (2001) “Token based group mutual exclusion for
asynchronous rings”, in Proceedings of the IEEE International Conference on Distributed Computing
Systems, pp. 691-694,.
[20] Y. J. Joung, (2002) “The congenial talking philosophers problem in computer networks” Distributed
Computing, pp. 155-175.
[21] N. Mittal and P. K. Mohan, (2005) “An efficient distributed group mutual exclusion algorithm for
non-uniform group access”, in Proceedings of the IASTED International Conference on Parallel and
Distributed Computing and Systems, pp. 367-372.
[22] N. Mittal and Mohan (2007) “A priority-based distributed group mutual exclusion when group access
is non-uniform”, Journal of parallel and distributed computing, vol 67, no 7, pp 796-815.
[23] A. Swaroop, (2009) “Efficient Group Mutual Exclusion Protocols for Message Passing Distributed
computing Systems”, PhD thesis, National Institute of technology, Kurukshetra, Haryana, India, PIN-
136119.