International Journal of peer-to-peer networks (IJP2P)

•Télécharger en tant que DOCX, PDF•

0 j'aime•13 vues

The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P.

Ingénierie

International Journal of peer-to-peer networks (IJP2P)
ISSN: 2229 - 3930 [Online]; 2229 - 5240 [Print]
https://ijp2pjournals.wordpress.com
Scope & Topics
The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed
journal that publishes articles that contribute new results in all areas of P2P Networks. The
journal provides a platform to disseminate new ideas and new research, advance theories, and
propagate best practices in the area of P2P networking. This will include works that relate to
peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems,
and overlay networks. The journal offers a forum in which academics, consultants, and
practitioners in a variety of fields can exchange ideas to further research and improve practices in
all areas of P2P.
Authors are solicited to contribute to the journal by submitting articles that illustrate research
results, projects, surveying works and industrial experiences that describe significant advances in
the areas of P2P networks.
Topics considered include but are not limited to:
 Cooperation and collaboration in P2P systems
 Delay-tolerant P2P systems
 Higher-level query support in P2P systems
 Mobile P2P
 Overlay architectures and topologies
 Overlay monitoring and management
 P2P and wireless convergence
 P2P applications and services
 P2P economics
 P2P grids
 P2P information retrieval
 P2P overlay interaction with underlying infrastructure
 P2P systems over mobile networks
 P2P technology and sensors
 P2P workload characterization and simulation
 Performance and robustness of P2P systems
 Protocols and Algorithms for Mobile and Wireless Peer-to-peer Networks
 Security in P2P systems
 Self-organization in P2P systems
 Semantic overlay networks and semantic query routing in P2P systems
 Social networks
 Trust, Reputation and Fairness in P2P Systems
 ad hoc and sensor networks

Paper Submission
Authors are invited to submit papers for this journal through Email: check web page or through
Submission System. Submissions must be original and should not have been published
previously or be under consideration for publication while being evaluated for this Journal.
Important Dates
 Submission Deadline : July 10, 2021
 Notification : August 10, 2021
 Final Manuscript Due : August 18,2021
 Publication Date : Determined by the Editor-in-Chief

International Journal of peer-to-peer networks (IJP2P)

Contenu connexe

Plus de ijfcstjournal

The Major Occupation in India is the Agriculture; the people involved in the Agriculture belong to the poor class and category. The people of the farming community are unaware of the new techniques and Agromachines, which would direct the world to greater heights in the field of agriculture. Though the farmers work hard, they are cheated by agents in today’s market. This serves as a opportunity to solve all the problems that farmers face in the current world. The eAgro crop marketing will serve as a better way for the farmers to sell their products within the country with some mediocre knowledge about using the website. This would provide information to the farmers about current market rate of agro-products, their sale history and profits earned in a sale. This site will also help the farmers to know about the market information and to view agricultural schemes of the Government provided to farmers.

EAGRO CROP MARKETING FOR FARMING COMMUNITY

ijfcstjournal

EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS

ijfcstjournal

This Paper provides a brief description of the Genetic Algorithm (GA), the Simulated Annealing (SA) Algorithm, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm and attempts to explain the way as how the Proposed Genetic Algorithm (GA), the Proposed Simulated Annealing (SA) Algorithm using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm can be employed in finding the best solution of N Queens Problem and also, makes a comparison between these four algorithms. It is entirely a review based work. The four algorithms were written as well as implemented. From the Results, it was found that, the Proposed Genetic Algorithm (GA) performed better than the Proposed Simulated Annealing (SA) Algorithm using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm and it also provided better fitness value (solution) than the Proposed Simulated Annealing Algorithm (SA) using GA, the Backtracking (BT) Algorithm and the Brute Force (BF) Search Algorithm, for different N values. Also, it was noticed that, the Proposed GA took more time to provide result than the Proposed SA using GA.

COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEM

ijfcstjournal

In recent years, the complex event processing technology has been used to process the VANET’s temporal and spatial event streams. However, we usually cannot get the accurate data because the device sensing accuracy limitations of the system. We only can get the uncertain data from the complex and limited environment of the VANET. Because the VANET’s event streams are consist of the uncertain data, so they are also uncertain. How effective to express and process these uncertain event streams has become the core issue for the VANET system. To solve this problem, we propose a novel complex event query language PSTeCEQL (probabilistic spatio-temporal constraint event query language). Firstly, we give the definition of the possible world model of VANET’s uncertain event streams. Secondly, we propose an event query language PSTeCEQL and give the syntax and the operational semantics of the language. Finally, we illustrate the validity of the PSTeCEQL by an example.

PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMS

ijfcstjournal

Now a day enormous amount of data is getting explored through Internet of Things (IoT) as technologies are advancing and people uses these technologies in day to day activities, this data is termed as Big Data having its characteristics and challenges. Frequent Itemset Mining algorithms are aimed to disclose frequent itemsets from transactional database but as the dataset size increases, it cannot be handled by traditional frequent itemset mining. MapReduce programming model solves the problem of large datasets but it has large communication cost which reduces execution efficiency. This proposed new pre-processed k-means technique applied on BigFIM algorithm. ClustBigFIM uses hybrid approach, clustering using kmeans algorithm to generate Clusters from huge datasets and Apriori and Eclat to mine frequent itemsets from generated clusters using MapReduce programming model. Results shown that execution efficiency of ClustBigFIM algorithm is increased by applying k-means clustering algorithm before BigFIM algorithm as one of the pre-processing technique.

CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...

ijfcstjournal

Software testing is a testing which conducted a test to provide information to client about the quality of the product under test. Software testing can also provide an objective, independent view of the software to allow the business to appreciate and understand the risks of software implementation. In this paper we focused on two main software testing –mutation testing and mutation testing. Mutation testing is a procedural testing method, i.e. we use the structure of the code to guide the test program, A mutation is a little change in a program. Such changes are applied to model low level defects that obtain in the process of coding systems. Ideally mutations should model low-level defect creation. Mutation testing is a process of testing in which code is modified then mutated code is tested against test suites. The mutations used in source code are planned to include in common programming errors. A good unit test typically detects the program mutations and fails automatically. Mutation testing is used on many different platforms, including Java, C++, C# and Ruby. Regression testing is a type of software testing that seeks to uncover new software bugs, or regressions, in existing functional and non-functional areas of a system after changes such as enhancements, patches or configuration changes, have been made to them. When defects are found during testing, the defect got fixed and that part of the software started working as needed. But there may be a case that the defects that fixed have introduced or uncovered a different defect in the software. The way to detect these unexpected bugs and to fix them used regression testing. The main focus of regression testing is to verify that changes in the software or program have not made any adverse side effects and that the software still meets its need. Regression tests are done when there are any changes made on software, because of modified functions.

A MUTATION TESTING ANALYSIS AND REGRESSION TESTING

ijfcstjournal

Advances in micro fabrication and communication techniques have led to unimaginable proliferation of WSN applications. Research is focussed on reduction of setup operational energy costs. Bulk of operational energy costs are linked to communication activities of WSN. Any progress towards energy efficiency has a potential of huge savings globally. Therefore, every energy efficient step is an endeavour to cut costs and ‘Go Green’. In this paper, we have proposed a framework to reduce communication workload through: Innetwork compression and multiple query synthesis at the base-station and modification of query syntax through introduction of Static Variables. These approaches are general approaches which can be used in any WSN irrespective of application.

GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...

ijfcstjournal

Accurate and realistic estimation is always considered to be a great challenge in software industry. Software Cost Estimation (SCE) is the standard application used to manage software projects. Determining the amount of estimation in the initial stages of the project depends on planning other activities of the project. In fact, the estimation is confronted with a number of uncertainties and barriers’, yet assessing the previous projects is essential to solve this problem. Several models have been developed for the analysis of software projects. But the classical reference method is the COCOMO model, there are other methods which are also applied such as Function Point (FP), Line of Code(LOC); meanwhile, the expert`s opinions matter in this regard. In recent years, the growth and the combination of meta-heuristic algorithms with high accuracy have brought about a great achievement in software engineering. Meta-heuristic algorithms which can analyze data from multiple dimensions and identify the optimum solution between them are analytical tools for the analysis of data. In this paper, we have used the Harmony Search (HS)algorithm for SCE. The proposed model which is a collection of 60 standard projects from Dataset NASA60 has been assessed.The experimental results show that HS algorithm is a good way for determining the weight similarity measures factors of software effort, and reducing the error of MRE.

A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCH

ijfcstjournal

Mining biological data is an emergent area at the intersection between bioinformatics and data mining (DM). The intelligent agent based model is a popular approach in constructing Distributed Data Mining (DDM) systems to address scalable mining over large scale distributed data. The nature of associations between different amino acids in proteins has also been a subject of great anxiety. There is a strong need to develop new models and exploit and analyze the available distributed biological data sources. In this study, we have designed and implemented a multi-agent system (MAS) called Agent enriched Quantitative Association Rules Mining for Amino Acids in distributed Protein Data Banks (AeQARM-AAPDB). Such globally strong association rules enhance understanding of protein composition and are desirable for synthesis of artificial proteins. A real protein data bank is used to validate the system.

AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKS

ijfcstjournal

International Journal on Foundations of Computer Science & Technology (IJFCST) is a Bi-monthly peer-reviewed and refereed open access journal that publishes articles which contribute new results in all areas of the Foundations of Computer Science & Technology. Over the last decade, there has been an explosion in the field of computer science to solve various problems from mathematics to engineering. This journal aims to provide a platform for exchanging ideas in new emerging trends that needs more focus and exposure and will attempt to publish proposals that strengthen our goals. Topics of interest include, but are not limited to the following:

International Journal on Foundations of Computer Science & Technology (IJFCST)

ijfcstjournal

Because the technology is used largely in the last decades; cybercrimes have become a significant international issue as a result of the huge damage that it causes to the business and even to the ordinary users of technology. The main aims of this paper is to shed light on digital crimes and gives overview about what a person who is related to computer science has to know about this new type of crimes. The paper has three sections: Introduction to Digital Crime which gives fundamental information about digital crimes, Digital Crime Investigation which presents different investigation models and the third section is about Cybercrime Law.

AN INTRODUCTION TO DIGITAL CRIMES

ijfcstjournal

In this paper, we analyze the evolution of a small-world network and its subsequent transformation to a random network using the idea of link rewiring under the well-known Watts-Strogatz model for complex networks. Every link u-v in the regular network is considered for rewiring with a certain probability and if chosen for rewiring, the link u-v is removed from the network and the node u is connected to a randomly chosen node w (other than nodes u and v). Our objective in this paper is to analyze the distribution of the maximal clique size per node by varying the probability of link rewiring and the degree per node (number of links incident on a node) in the initial regular network. For a given probability of rewiring and initial number of links per node, we observe the distribution of the maximal clique per node to follow a Poisson distribution. We also observe the maximal clique size per node in the small-world network to be very close to that of the average value and close to that of the maximal clique size in a regular network. There is no appreciable decrease in the maximal clique size per node when the network transforms from a regular network to a small-world network. On the other hand, when the network transforms from a small-world network to a random network, the average maximal clique size value decreases significantly

DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...

ijfcstjournal

This research paper is a statistical comparative study of a few average case asymptotically optimal sorting algorithms namely, Quick sort, Heap sort and K- sort. The three sorting algorithms all with the same average case complexity have been compared by obtaining the corresponding statistical bounds while subjecting these procedures over the randomly generated data from some standard discrete and continuous probability distributions such as Binomial distribution, Uniform discrete and continuous distribution and Poisson distribution. The statistical analysis is well supplemented by the parameterized complexity analysis

A STATISTICAL COMPARATIVE STUDY OF SOME SORTING ALGORITHMS

ijfcstjournal

Available recommender systems mostly provide recommendations based on the users’ preferences by utilizing traditional methods such as collaborative filtering which only relies on the similarities between users and items. However, collaborative filtering might lead to provide poor recommendation because it does not rely on other useful available data such as users’ locations and hence the accuracy of the recommendations could be very low and inefficient. This could be very obvious in the systems that locations would affect users’ preferences highly such as movie recommender systems. In this paper a new locationbased movie recommender system based on the collaborative filtering is introduced for enhancing the accuracy and the quality of recommendations. In this approach, users’ locations have been utilized and take in consideration in the entire processing of the recommendations and peer selections. The potential of the proposed approach in providing novel and better quality recommendations have been discussed through experiments in real datasets.

A LOCATION-BASED MOVIE RECOMMENDER SYSTEM USING COLLABORATIVE FILTERING

ijfcstjournal

The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is proved that the best algorithm for the Bin Packing Problem has the approximation ratio 3/2 and the time orderO(n), unlessP=NP. In this paper, first, a -approximation algorithm is presented, then a modification to FFD algorithm is proposed to decrease time order to linear. Finally, these suggested approximation algorithms are compared with some other approximation algorithms. The experimental results show the suggested algorithms perform efficiently. In summary, the main goal of the research is presenting methods which not only enjoy the best theoretical criteria, but also perform considerably efficient in practice.

BIN PACKING PROBLEM: TWO APPROXIMATION ALGORITHMS

ijfcstjournal

In this paper, a hybrid method for solving multi-objective problem has been provided. The proposed method is combining the ε-Constraint and the Cuckoo algorithm. First the multi objective problem transfers into a single-objective problem using ε-Constraint, then the Cuckoo optimization algorithm will optimize the problem in each task. At last the optimized Pareto frontier will be drawn. The advantage of this method is the high accuracy and the dispersion of its Pareto frontier. In order to testing the efficiency of the suggested method, a lot of test problems have been solved using this method. Comparing the results of this method with the results of other similar methods shows that the Cuckoo algorithm is more suitable for solving the multi-objective problems.

A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS

ijfcstjournal

International Journal on Foundations of Computer Science & Technology (IJFCST)

ijfcstjournal

Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and communicating abilities. One of current concerns in wireless sensor networks is developing a stable clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery power. In the recent times, many routing protocols have been proposed increasing the network lifetime, stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption and Packet transmission.

MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR H...

ijfcstjournal

Call For Papers - International Journal on Foundations of Computer Science & ...

ijfcstjournal

In this paper, we consider a random network such that there could be a link between any two nodes in the network with a certain probability (plink). Diffusion is the phenomenon of spreading information throughout the network, starting from one or more initial set of nodes (called the early adopters). Information spreads along the links with a certain probability (pdiff). Diffusion happens in rounds with the first round involving the early adopters. The nodes that receive the information for the first time are said to be covered and become candidates for diffusion in the subsequent round. Diffusion continues until all the nodes in the network have received the information (successful diffusion) or there are no more candidate nodes to spread the information but one or more nodes are yet to receive the information (diffusion failure). On the basis of exhaustive simulations conducted in this paper, we observe that for a given plink and pdiff values, the fraction of successful diffusion attempts does not appreciably change with increase in the number of early adopters; whereas, the average number of rounds per successful diffusion attempt decreases with increase in the number of early adopters. The invariant nature of the fraction of successful diffusion attempts with increase in the number of early adopters for a random network (for fixed plink and pdiff values) is an interesting and noteworthy observation (for further research) and it has not been hitherto reported in the literature.

PROBABILISTIC DIFFUSION IN RANDOM NETWORK GRAPHS

ijfcstjournal

Plus de ijfcstjournal (20)

EAGRO CROP MARKETING FOR FARMING COMMUNITY

EDGE-TENACITY IN CYCLES AND COMPLETE GRAPHS

COMPARATIVE STUDY OF DIFFERENT ALGORITHMS TO SOLVE N QUEENS PROBLEM

PSTECEQL: A NOVEL EVENT QUERY LANGUAGE FOR VANET’S UNCERTAIN EVENT STREAMS

CLUSTBIGFIM-FREQUENT ITEMSET MINING OF BIG DATA USING PRE-PROCESSING BASED ON...

A MUTATION TESTING ANALYSIS AND REGRESSION TESTING

GREEN WSN- OPTIMIZATION OF ENERGY USE THROUGH REDUCTION IN COMMUNICATION WORK...

A NEW MODEL FOR SOFTWARE COSTESTIMATION USING HARMONY SEARCH

AGENT ENABLED MINING OF DISTRIBUTED PROTEIN DATA BANKS

International Journal on Foundations of Computer Science & Technology (IJFCST)

AN INTRODUCTION TO DIGITAL CRIMES

DISTRIBUTION OF MAXIMAL CLIQUE SIZE UNDER THE WATTS-STROGATZ MODEL OF EVOLUTI...

A STATISTICAL COMPARATIVE STUDY OF SOME SORTING ALGORITHMS

A LOCATION-BASED MOVIE RECOMMENDER SYSTEM USING COLLABORATIVE FILTERING

BIN PACKING PROBLEM: TWO APPROXIMATION ALGORITHMS

A HYBRID COA/ε-CONSTRAINT METHOD FOR SOLVING MULTI-OBJECTIVE PROBLEMS

International Journal on Foundations of Computer Science & Technology (IJFCST)

MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR H...

Call For Papers - International Journal on Foundations of Computer Science & ...

PROBABILISTIC DIFFUSION IN RANDOM NETWORK GRAPHS

Dernier

Employee leave management system project.

Kamal Acharya

FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads

Arindam Chakraborty, Ph.D., P.E. (CA, TX)

scipt v1.pptxcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...

HenryBriggs2

notes on Evolution Of Analytic Scalability.ppt

MsecMca

Online electricity billing project report..pdf

Kamal Acharya

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRLS IN bhubaneswar ESCORT SERVICE❤CALL GIRL No Advance Pay 💋💋 Book Now +91-9777949614 Discover Bhubaneswar Finest Call GirlsY ou're heading to Bhubaneswar for business or pleasure and want to experience the city to the fullest. What better way than in the company of a beautiful, intelligent companion to show you around town? Look no further than Bhubaneswar's finest Call Girls. These lovely ladies know all the hot spots and hidden gems that only locals are privy to. From the top restaurants and bars to the most stunning sights, they'll ensure you make unforgettable memories.

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

Call Girls Mumbai

DeepFakes presentation : brief idea of DeepFakes

MayuraD1

Learn the concepts of Thermodynamics on Magic Marks

Magic Marks

data_management_and _data_science_cheat_sheet.pdf

JiananWang21

AIRCANVAS[1].pdf mini project for btech students

vanyagupta248

Introduction to Serverless with AWS Lambda

Omar Fathy

Rule 1 − Check for the blocks connected in series and simplify. Rule 2 − Check for the blocks connected in parallel and simplify. Rule 3 − Check for the blocks connected in feedback loop and simplify. Rule 4 − If there is difficulty with take-off point while simplifying, shift it towards right. Rule 5 − If there is difficulty with summing point while simplifying, shift it towards left. Rule 6 − Repeat the above steps till you get the simplified form, i.e., single block.

Block diagram reduction techniques in control systems.ppt

NANDHAKUMARA10

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

ssuser89054b

LECTURE 01 Introduction to Computers Computers in Society Components of a Computer Types of Computers Definition: “A computer is an electronic device that manipulates information, or data. It has the ability to store, retrieve, and process data” The word "computer" is derived from the Latin word "computare," which means "to calculate" Computers are used for Businesses Communication Entertainment Education Medical Field

Computer Lecture 01.pptxIntroduction to Computers

MairaAshraf6

Double Revolving field theory-how the rotor develops torque

BhangaleSonal

Unleashing the Power of the SORA AI lastest leap

RishantSharmaFr

Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil

Cara Menggugurkan Kandungan 087776558899

Minimum and Maximum Modes of microprocessor 8086

anil_gaur

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

maisarahman1

S1S2 B.Arch MGU - HOA1&2 Module 3 -Temple Architecture of Kerala.pptx

SCMS School of Architecture

Dernier (20)

Employee leave management system project.

FEA Based Level 3 Assessment of Deformed Tanks with Fluid Induced Loads

scipt v1.pptxcxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx...

notes on Evolution Of Analytic Scalability.ppt

Online electricity billing project report..pdf

Bhubaneswar🌹Call Girls Bhubaneswar ❤Komal 9777949614 💟 Full Trusted CALL GIRL...

DeepFakes presentation : brief idea of DeepFakes

Learn the concepts of Thermodynamics on Magic Marks

data_management_and _data_science_cheat_sheet.pdf

AIRCANVAS[1].pdf mini project for btech students

Introduction to Serverless with AWS Lambda

Block diagram reduction techniques in control systems.ppt

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Computer Lecture 01.pptxIntroduction to Computers

Double Revolving field theory-how the rotor develops torque

Unleashing the Power of the SORA AI lastest leap

Cara Menggugurkan Sperma Yang Masuk Rahim Biyar Tidak Hamil

Minimum and Maximum Modes of microprocessor 8086

A CASE STUDY ON CERAMIC INDUSTRY OF BANGLADESH.pptx

S1S2 B.Arch MGU - HOA1&2 Module 3 -Temple Architecture of Kerala.pptx

International Journal of peer-to-peer networks (IJP2P)

1. International Journal of peer-to-peer networks (IJP2P) ISSN: 2229 - 3930 [Online]; 2229 - 5240 [Print] https://ijp2pjournals.wordpress.com Scope & Topics The International Journal of peer-to-peer networking is a quarterly open access peer-reviewed journal that publishes articles that contribute new results in all areas of P2P Networks. The journal provides a platform to disseminate new ideas and new research, advance theories, and propagate best practices in the area of P2P networking. This will include works that relate to peer-to-peer systems, peer-to-peer applications, grid systems, large-scale distributed systems, and overlay networks. The journal offers a forum in which academics, consultants, and practitioners in a variety of fields can exchange ideas to further research and improve practices in all areas of P2P. Authors are solicited to contribute to the journal by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of P2P networks. Topics considered include but are not limited to:  Cooperation and collaboration in P2P systems  Delay-tolerant P2P systems  Higher-level query support in P2P systems  Mobile P2P  Overlay architectures and topologies  Overlay monitoring and management  P2P and wireless convergence  P2P applications and services  P2P economics  P2P grids  P2P information retrieval  P2P overlay interaction with underlying infrastructure  P2P systems over mobile networks  P2P technology and sensors  P2P workload characterization and simulation  Performance and robustness of P2P systems  Protocols and Algorithms for Mobile and Wireless Peer-to-peer Networks  Security in P2P systems  Self-organization in P2P systems  Semantic overlay networks and semantic query routing in P2P systems  Social networks  Trust, Reputation and Fairness in P2P Systems  ad hoc and sensor networks

2. Paper Submission Authors are invited to submit papers for this journal through Email: check web page or through Submission System. Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this Journal. Important Dates  Submission Deadline : July 10, 2021  Notification : August 10, 2021  Final Manuscript Due : August 18,2021  Publication Date : Determined by the Editor-in-Chief

International Journal of peer-to-peer networks (IJP2P)

Recommandé

Recommandé

Contenu connexe

Plus de ijfcstjournal

Plus de ijfcstjournal (20)

Dernier

Dernier (20)

International Journal of peer-to-peer networks (IJP2P)