The document proposes a query registration and processing system for unstructured peer-to-peer networks. The system addresses limitations of traditional ad hoc query models which only support queries for currently available data and cannot retrieve data added later. The proposed system registers queries for unavailable data with "beacon" nodes, and notifies queryers when matching data becomes available. It also utilizes a "split and merge" technique to distribute file chunks to clients for maximum throughput during downloads. Experimental results show improved search times and throughput utilization compared to methods without query registration or optimized distribution.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Textual based retrieval system with bloom in unstructured Peer-to-Peer networksUvaraj Shan
This document summarizes a research article about a textual retrieval system using Bloom filters in unstructured peer-to-peer networks. It discusses how Bloom Cast replicates document content across the network using Bloom filters to encode documents. This allows for efficient full-text searches with guaranteed recall rates while reducing communication costs compared to replicating raw documents. The system samples nodes randomly using a lightweight distributed hash table to support searches in an unstructured P2P network where the network size is unknown.
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies’ solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a research paper on secure cooperative caching in wireless peer-to-peer (P2P) networks. The paper proposes using encryption and digital signatures to authenticate data and ensure its integrity as it is cached and shared between wireless nodes. It describes greedy cache placement and mutual cache-based data access schemes to efficiently manage caching in wireless P2P networks. Experimental results show that a hybrid caching approach, which dynamically selects between caching data or caching paths to data, has better performance than solely caching data or paths. Future work areas include mechanisms for data owners to control caching scope while maintaining flexibility, and defending against security threats to data consistency.
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIB...ijp2p
Recently there has been significant research focus on distributed computing network massively caching
and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides
dynamically decentralized, self organized, scalable objects in distributed computing system. However such
networks suffer from high latency, network traffic and cache update problems. The existing caching and
replica placement techniques for placing objects across peer-to-peer network have no complete solution to
these problems. This paper presents an overview of the current challenges present in P2P overlay
networks, followed by describes briefly the analysis study of the existing algorithms and their merits and
demerits. And also suggest a new popularity based QoS-aware(Quality of Service) smart replica
placement algorithm for content distribution in peer- to-peer overlay networks which overcomes the access
latency, fault tolerance, network traffic and redundancy problems with low cost. The new algorithm
suggested is based on the outcome of the analysis study
Iaetsd an enhancement for content sharing overIaetsd Iaetsd
This document proposes an efficient content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). It uses a hidden Markov model to predict individual mobility information to improve content discovery and delivery. The existing system results in a 2% CPU overhead and reduces smartphone battery life by 15%. To minimize energy consumption, the document proposes using sensor scheduling schemes in an opportunistic context. It aims to solve problems in content sharing and minimize energy use through sensor scheduling.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Textual based retrieval system with bloom in unstructured Peer-to-Peer networksUvaraj Shan
This document summarizes a research article about a textual retrieval system using Bloom filters in unstructured peer-to-peer networks. It discusses how Bloom Cast replicates document content across the network using Bloom filters to encode documents. This allows for efficient full-text searches with guaranteed recall rates while reducing communication costs compared to replicating raw documents. The system samples nodes randomly using a lightweight distributed hash table to support searches in an unstructured P2P network where the network size is unknown.
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
Peer-to-Peer (P2P) overlay networks wide adoption has also created vast dangers due to the millions of users who are not conversant with the potential security risks. Lack of centralized control creates great risks to the P2P systems. This is mainly due to the inability to implement proper authentication approaches for threat management. The best possible solutions, however, include encryption, utilization of administration, implementing cryptographic protocols, avoiding personal file sharing, and unauthorized downloads. Recently a new non-DHT based structured P2P system is very suitable for designing secured communication protocols. This approach is based on Linear Diophantine Equation (LDE) [1]. The P2P architectures based on this protocol offer simplified methods to integrate symmetric and asymmetric cryptographies’ solutions into the P2P architecture with no need of utilizing Transport Layer Security (TLS), and its predecessor, Secure Sockets Layer (SSL) protocols.
IJERD (www.ijerd.com) International Journal of Engineering Research and Devel...IJERD Editor
This document summarizes a research paper on secure cooperative caching in wireless peer-to-peer (P2P) networks. The paper proposes using encryption and digital signatures to authenticate data and ensure its integrity as it is cached and shared between wireless nodes. It describes greedy cache placement and mutual cache-based data access schemes to efficiently manage caching in wireless P2P networks. Experimental results show that a hybrid caching approach, which dynamically selects between caching data or caching paths to data, has better performance than solely caching data or paths. Future work areas include mechanisms for data owners to control caching scope while maintaining flexibility, and defending against security threats to data consistency.
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIB...ijp2p
Recently there has been significant research focus on distributed computing network massively caching
and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides
dynamically decentralized, self organized, scalable objects in distributed computing system. However such
networks suffer from high latency, network traffic and cache update problems. The existing caching and
replica placement techniques for placing objects across peer-to-peer network have no complete solution to
these problems. This paper presents an overview of the current challenges present in P2P overlay
networks, followed by describes briefly the analysis study of the existing algorithms and their merits and
demerits. And also suggest a new popularity based QoS-aware(Quality of Service) smart replica
placement algorithm for content distribution in peer- to-peer overlay networks which overcomes the access
latency, fault tolerance, network traffic and redundancy problems with low cost. The new algorithm
suggested is based on the outcome of the analysis study
Iaetsd an enhancement for content sharing overIaetsd Iaetsd
This document proposes an efficient content sharing scheme called discover-predict-deliver (DPD) for smartphone-based delay tolerant networks (DTNs). It uses a hidden Markov model to predict individual mobility information to improve content discovery and delivery. The existing system results in a 2% CPU overhead and reduces smartphone battery life by 15%. To minimize energy consumption, the document proposes using sensor scheduling schemes in an opportunistic context. It aims to solve problems in content sharing and minimize energy use through sensor scheduling.
Effective Approach For Content Based Image Retrieval In Peer-Peer To NetworksIRJET Journal
The document describes a proposed approach for content-based image retrieval in peer-to-peer networks. Existing methods represent images as high-dimensional feature vectors and index them using distributed high-dimensional indexes or locality sensitive hashing over distributed hash tables. However, these approaches have high network costs and workload imbalances. The proposed approach uses the bag-of-visual-words model to represent images, building inverted indexes of visual codewords over the distributed hash table. It also develops a dynamic codebook updating method to optimize the mutual information between the codebook and relevance information, balancing the workload among nodes as the peer-to-peer network and data evolve dynamically.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
A study of index poisoning in peer topeerIJCI JOURNAL
P2P file sharing systems are the most popular forms of file sharing to date. Its client-server architecture
attains faster file transfers, however with its peer anonymity and lack of authentication it has become a
gold mine for malicious attacks. One of the leading sources of disruptions in the P2P file sharing systems is
the index poisoning attacks. This attack seeks to corrupt the indexes used to reference files available for
download in P2P systems with false data. In order to protect the users from these attacks it is important to
find solutions to eliminate or mitigate the effects of index poisoning attacks. This paper will analyze index
poisoning attacks, their uses and solutions proposed to defend against them.
On client’s interactive behaviour to design peer selection policies for bitto...IJCNCJournal
Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet.
This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand
streaming system. The vast majority of these proposals focus on modifying the piece and peer selection
policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been
given to the piece selection policy rather than to the peer selection policy. Within this context, this article
proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols,
considering interactive scenarios. To this end, we analyze the client’s interactive behaviour when accessing
real multimedia systems. This analysis consists of looking into workloads of real content providers and
assessing three important metrics, namely temporal dispersion, spatial dispersion and object position
popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our
knowledge, this is the first time that the client’s interactive behaviour is specially considered to derive an
algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges
and possible future work in this research field.
A Novel High Order Tree for Securing Key Management for Multicast ServicesIOSR Journals
The document proposes a novel high order tree scheme called MKE-MGKM for securing key management in multiple multicast group environments. The MKE-MGKM scheme uses asymmetric master and slave keys generated from a master key encryption algorithm. This asymmetry allows rekeying overhead to be reduced by modifying only the master key when a slave key is updated, while keeping other slave keys unchanged. Numerical analysis and simulations show the MKE-MGKM scheme can reduce the storage overhead of a key distribution center by 75% and the storage overhead of a user by up to 85%, as well as communication overhead by 60%, compared to existing schemes. The scheme aims to address limitations of existing group key management schemes for multiple co-existing multicast
Caching on Named Data Network: a Survey and Future Research IJECEIAES
The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance.
IRJET - A Secure Access Policies based on Data Deduplication SystemIRJET Journal
This document summarizes a research paper on a secure access policies based data deduplication system. The system uses attribute-based encryption and a hybrid cloud model with a private cloud for deduplication and a public cloud for storage. It allows defining access policies for encrypted data files. When a user uploads a duplicate file, the system checks for a matching file and replaces it with a reference to the existing copy to save storage. The system provides file and block-level deduplication for efficient storage and uses cryptographic techniques like MD5, 3DES and RSA for encryption, tagging and access control of encrypted duplicate data across clouds.
International Refereed Journal of Engineering and Science (IRJES) is a peer reviewed online journal for professionals and researchers in the field of computer science. The main aim is to resolve emerging and outstanding problems revealed by recent social and technological change. IJRES provides the platform for the researchers to present and evaluate their work from both theoretical and technical aspects and to share their views.
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTS ijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally
Trust Based Content Distribution for Peer-ToPeer Overlay NetworksIJNSA Journal
In peer-to-peer content distribution the lack of a central authority makes authentication difficult. Without authentication, adversary nodes can spoof identity and falsify messages in the overlay. This enables malicious nodes to launch man-in-the-middle or denial-of-service attacks. In this paper, we present a trust based content distribution for peer-to-peer overlay networks, which is built on the trust management scheme. The main concept is, before sending or accepting the traffic, the trust of the peer must be validated. Based on the success of data delivery and searching time, we calculate the trust index of a node. Then the aggregated trust index of the peers whose value is below the threshold value is considered as distrusted and the corresponding traffic is blocked. By simulation results we show that our proposed scheme achieves increased success ratio with reduced delay and drop.
SECURITY PROPERTIES IN AN OPEN PEER-TO-PEER NETWORKIJNSA Journal
This paper proposes to address new requirements of confidentiality, integrity and availability properties fitting to peer-to-peer domains of resources. The enforcement of security properties in an open peer-topeer network remains an open problem as the literature have mainly proposed contribution on availability of resources and anonymity of users. That paper proposes a novel architecture that eases the administration of a peer-to-peer network. It considers a network of safe peer-to-peer clients in the sense that it is a commune client software that is shared by all the participants to cope with the sharing of various resources associated with different security requirements. However, our proposal deals with possible malicious peers that attempt to compromise the requested security properties. Despite the safety of an open peer-to-peer network cannot be formally guaranteed, since a end user has privileges on the target host, our solution provides several advanced security enforcement. First, it enables to formally define the requested security properties of the various shared resources. Second, it evaluates the trust and the reputation of the requesting peer by sending challenges that test the fairness of its peer-to-peer security policy. Moreover, it proposes an advanced Mandatory Access Control that enforces the required peer-to-peer security properties through an automatic projection of the requested properties onto SELinux policies. Thus, the SELinux system of the requesting peer is automatically configured with respect to the required peer-to-peer security properties. That solution prevents from a malicious peer that could use ordinary applications such as a video reader to access confidential files such as a video requesting fee paying. Since the malicious peer could try to abuse the system, SELinux challenges and traces are also used to evaluate the fairness of the requester. That paper ends with different research perspectives such as a dedicated MAC system for the peer-to-peer client and honeypots for testing the security of the proposed peer-to-peer infrastructure.
Secure and distributed data discovery and dissemination in wireless sensor ne...Pvrtechnologies Nellore
This document proposes a secure and distributed data discovery and dissemination protocol for wireless sensor networks called DiDrip. It addresses limitations of existing centralized protocols by allowing multiple authorized users and network owners to directly disseminate data items to sensor nodes. DiDrip provides authenticity and integrity of data items through digital signatures combined with efficient data structures. It aims to be scalable, resilient to node compromise and user collusion, and impose low overhead on resource-limited sensor nodes. The paper analyzes the security properties of DiDrip and implements it on an experimental sensor network to demonstrate its efficiency in practice.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
A Proximity-Aware Interest-Clustered P2P File Sharing System 1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
This document summarizes a study that analyzed the physicochemical properties of clay mineral from Nteje, Nigeria after activation with sulfuric acid. The clay was treated with sulfuric acid at concentrations ranging from 2-7 mol/L. Characterization showed acid activation modified the chemical composition by exchanging octahedral cations for hydrogen ions, altering the crystalline structure and increasing surface area over three times that of the raw sample. Bleaching tests using the activated clays showed adsorption capacity and color removal from palm oil increased, with the 6 mol/L activated clay achieving 92.5% removal compared to 43.4% for the raw clay. The results indicate acid activation enhanced the adsorptive properties of the Nte
The document proposes a new "bound and decomposition method" to find an optimal fuzzy solution for fully fuzzy linear programming problems. The method decomposes the given fully fuzzy linear programming problem into three crisp linear programming problems: a middle level problem, upper level problem, and lower level problem. The three crisp linear programming problems are then solved separately. Using the optimal solutions from these problems, an optimal fuzzy solution for the original fully fuzzy linear programming problem is obtained. The proposed method does not require fuzzy ranking functions or restrictions on the coefficients matrix elements.
1) The document examines the seismic response of flat slab and grid slab buildings through dynamic analysis.
2) Two flat slab buildings and their inherent seismic resistance are evaluated when designed only for wind loads.
3) The conclusions show that while specific design parameters like drift, base shear, and overturning moment exceed wind design values, the structures have sufficient inherent capacity to resist moderate seismic loads if they satisfy wind criteria.
4) Dynamic analysis is performed to determine design seismic forces and their distribution for evaluation.
This document summarizes a study that used computational fluid dynamics (CFD) modeling to simulate the operation of a catalytic converter used to reduce nitrogen oxide (NOx) emissions from automobile exhaust. Specifically, it used the Comsol Multiphysics software to model a catalytic converter that injects ammonia to selectively reduce NOx to nitrogen and water through heterogeneous surface reactions on the catalyst. The model considers fluid flow, mass transfer, heat transfer and chemical reactions in both the channels and walls of the monolith structure. The study aims to optimize the ammonia injection level and investigate other operating parameters to improve the catalytic converter's NOx reduction efficiency.
The document describes the design and development of a contactless communication module for underwater vehicles. The module establishes wireless communication between a ship and underwater vehicle using infrared transmission. The hardware uses an MSP430 microcontroller and TFDU4101 IR transceiver. The software is developed in C using an IDE. The module transmits preset parameters from the ship to the vehicle before launch and receives sensor data from the vehicle for analysis. A GUI allows control and monitoring of the vehicle from the ship. The system provides contactless parameter loading and status monitoring of underwater vehicles.
This document discusses scheduling optimization for flexible manufacturing systems using genetic algorithms. It begins with an introduction to flexible manufacturing systems and some of the challenges in scheduling their operations. The author then reviews previous research on scheduling in flexible manufacturing systems using various methods like heuristics, mathematical programming, and metaheuristics. The paper goes on to present a genetic algorithm approach for scheduling a flexible manufacturing system with the goals of minimizing machine idle time and penalty costs for missed deadlines. Software is developed to obtain an optimal schedule. The genetic algorithm finds the global optimum schedule after 1700 generations.
#NG755298 (Human Resources Assistant (Military) GS-05/06/07, Jefferson City, ...Steven Brothers
This document announces a job opening for a Human Resources Assistant position with the Missouri National Guard. The position is located in Jefferson City, Missouri and is open from September 26, 2012 to October 18, 2012. It pays between $31,315 to $50,431 annually depending on qualifications and experience. Applicants must be members of the Missouri Army National Guard and have experience with military human resources operations. Duties include reviewing personnel files and actions, providing counseling to military personnel, and preparing reports.
Effective Approach For Content Based Image Retrieval In Peer-Peer To NetworksIRJET Journal
The document describes a proposed approach for content-based image retrieval in peer-to-peer networks. Existing methods represent images as high-dimensional feature vectors and index them using distributed high-dimensional indexes or locality sensitive hashing over distributed hash tables. However, these approaches have high network costs and workload imbalances. The proposed approach uses the bag-of-visual-words model to represent images, building inverted indexes of visual codewords over the distributed hash table. It also develops a dynamic codebook updating method to optimize the mutual information between the codebook and relevance information, balancing the workload among nodes as the peer-to-peer network and data evolve dynamically.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
A study of index poisoning in peer topeerIJCI JOURNAL
P2P file sharing systems are the most popular forms of file sharing to date. Its client-server architecture
attains faster file transfers, however with its peer anonymity and lack of authentication it has become a
gold mine for malicious attacks. One of the leading sources of disruptions in the P2P file sharing systems is
the index poisoning attacks. This attack seeks to corrupt the indexes used to reference files available for
download in P2P systems with false data. In order to protect the users from these attacks it is important to
find solutions to eliminate or mitigate the effects of index poisoning attacks. This paper will analyze index
poisoning attacks, their uses and solutions proposed to defend against them.
On client’s interactive behaviour to design peer selection policies for bitto...IJCNCJournal
Peer-to-peer swarming protocols have been proven to be very efficient for content replication over Internet.
This fact has certainly motivated proposals to adapt these protocols to meet the requirements of on-demand
streaming system. The vast majority of these proposals focus on modifying the piece and peer selection
policies, respectively, of the original protocols. Nonetheless, it is true that more attention has often been
given to the piece selection policy rather than to the peer selection policy. Within this context, this article
proposes a simple algorithm to be used as basis for peer selection policies of BitTorrent-like protocols,
considering interactive scenarios. To this end, we analyze the client’s interactive behaviour when accessing
real multimedia systems. This analysis consists of looking into workloads of real content providers and
assessing three important metrics, namely temporal dispersion, spatial dispersion and object position
popularity. These metrics are then used as the main guidelines for writing the algorithm. To the best of our
knowledge, this is the first time that the client’s interactive behaviour is specially considered to derive an
algorithm for peer selection policies. Finally, the conclusion of this article is drawn with key challenges
and possible future work in this research field.
A Novel High Order Tree for Securing Key Management for Multicast ServicesIOSR Journals
The document proposes a novel high order tree scheme called MKE-MGKM for securing key management in multiple multicast group environments. The MKE-MGKM scheme uses asymmetric master and slave keys generated from a master key encryption algorithm. This asymmetry allows rekeying overhead to be reduced by modifying only the master key when a slave key is updated, while keeping other slave keys unchanged. Numerical analysis and simulations show the MKE-MGKM scheme can reduce the storage overhead of a key distribution center by 75% and the storage overhead of a user by up to 85%, as well as communication overhead by 60%, compared to existing schemes. The scheme aims to address limitations of existing group key management schemes for multiple co-existing multicast
Caching on Named Data Network: a Survey and Future Research IJECEIAES
The IP-based system cause inefficient content delivery process. This inefficiency was attempted to be solved with the Content Distribution Network. A replica server is located in a particular location, usually on the edge router that is closest to the user. The user’s request will be served from that replica server. However, caching on Content Distribution Network is inflexible. This system is difficult to support mobility and conditions of dynamic content demand from consumers. We need to shift the paradigm to content-centric. In Named Data Network, data can be placed on the content store on routersthat are closest to the consumer. Caching on Named Data Network must be able to store content dynamically. It should be selectively select content that is eligible to be stored or deleted from the content storage based on certain considerations, e.g. the popularity of content in the local area. This survey paper explains the development of caching techniques on Named Data Network that are classified into main points. The brief explanation of advantages and disadvantages are presented to make it easy to understand. Finally, proposed the open challenge related to the caching mechanism to improve NDN performance.
IRJET - A Secure Access Policies based on Data Deduplication SystemIRJET Journal
This document summarizes a research paper on a secure access policies based data deduplication system. The system uses attribute-based encryption and a hybrid cloud model with a private cloud for deduplication and a public cloud for storage. It allows defining access policies for encrypted data files. When a user uploads a duplicate file, the system checks for a matching file and replaces it with a reference to the existing copy to save storage. The system provides file and block-level deduplication for efficient storage and uses cryptographic techniques like MD5, 3DES and RSA for encryption, tagging and access control of encrypted duplicate data across clouds.
International Refereed Journal of Engineering and Science (IRJES) is a peer reviewed online journal for professionals and researchers in the field of computer science. The main aim is to resolve emerging and outstanding problems revealed by recent social and technological change. IJRES provides the platform for the researchers to present and evaluate their work from both theoretical and technical aspects and to share their views.
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTS ijp2p
Peer-to-Peer (P2P) systems allow decentralization, sharing of all the resources of a network with direct
communication and collaboration between nodes. There are three main families of P2P networks: the
centralized architecture, the decentralized architecture that can be structured or unstructured and the
hybrid architecture. Today, there are several implementations for structured decentralized architectures.
This implies that the insertion and search algorithms are different. Among them we have; Chord, Pastry,
Kademlia, CAN(Content Addressable Network) . The choice of these DHTs (Distributed Hash Table) for an
application is made on the basis of their performances. Studies of each of these DHTs mentioned have been
done, proving their performance. But a comparative study of the four DHTs Chord, Pastry, CAN, Kademlia
has not been clearly addressed by previous works. In this paper, we have conducted a comparative
theoretical study of the DHTs Chord, Pastry, CAN, Kademlia. Then, by simulation, we have evaluated the
performances in terms of latency, number of hops and number of transmitted messages. Our study clearly
shows the differences between mathematically established performance and actual performance in an
environment with less restriction. This analysis was made from the data obtained by using the simple
network layer of the PeerfactSim simulator. This simulator abstracts the different network layers, which
gives the advantage of testing the performances with reasonable accuracy. The use of the single network
layer can be considered an ideal case because the node searches are done locally
Trust Based Content Distribution for Peer-ToPeer Overlay NetworksIJNSA Journal
In peer-to-peer content distribution the lack of a central authority makes authentication difficult. Without authentication, adversary nodes can spoof identity and falsify messages in the overlay. This enables malicious nodes to launch man-in-the-middle or denial-of-service attacks. In this paper, we present a trust based content distribution for peer-to-peer overlay networks, which is built on the trust management scheme. The main concept is, before sending or accepting the traffic, the trust of the peer must be validated. Based on the success of data delivery and searching time, we calculate the trust index of a node. Then the aggregated trust index of the peers whose value is below the threshold value is considered as distrusted and the corresponding traffic is blocked. By simulation results we show that our proposed scheme achieves increased success ratio with reduced delay and drop.
SECURITY PROPERTIES IN AN OPEN PEER-TO-PEER NETWORKIJNSA Journal
This paper proposes to address new requirements of confidentiality, integrity and availability properties fitting to peer-to-peer domains of resources. The enforcement of security properties in an open peer-topeer network remains an open problem as the literature have mainly proposed contribution on availability of resources and anonymity of users. That paper proposes a novel architecture that eases the administration of a peer-to-peer network. It considers a network of safe peer-to-peer clients in the sense that it is a commune client software that is shared by all the participants to cope with the sharing of various resources associated with different security requirements. However, our proposal deals with possible malicious peers that attempt to compromise the requested security properties. Despite the safety of an open peer-to-peer network cannot be formally guaranteed, since a end user has privileges on the target host, our solution provides several advanced security enforcement. First, it enables to formally define the requested security properties of the various shared resources. Second, it evaluates the trust and the reputation of the requesting peer by sending challenges that test the fairness of its peer-to-peer security policy. Moreover, it proposes an advanced Mandatory Access Control that enforces the required peer-to-peer security properties through an automatic projection of the requested properties onto SELinux policies. Thus, the SELinux system of the requesting peer is automatically configured with respect to the required peer-to-peer security properties. That solution prevents from a malicious peer that could use ordinary applications such as a video reader to access confidential files such as a video requesting fee paying. Since the malicious peer could try to abuse the system, SELinux challenges and traces are also used to evaluate the fairness of the requester. That paper ends with different research perspectives such as a dedicated MAC system for the peer-to-peer client and honeypots for testing the security of the proposed peer-to-peer infrastructure.
Secure and distributed data discovery and dissemination in wireless sensor ne...Pvrtechnologies Nellore
This document proposes a secure and distributed data discovery and dissemination protocol for wireless sensor networks called DiDrip. It addresses limitations of existing centralized protocols by allowing multiple authorized users and network owners to directly disseminate data items to sensor nodes. DiDrip provides authenticity and integrity of data items through digital signatures combined with efficient data structures. It aims to be scalable, resilient to node compromise and user collusion, and impose low overhead on resource-limited sensor nodes. The paper analyzes the security properties of DiDrip and implements it on an experimental sensor network to demonstrate its efficiency in practice.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
A Proximity-Aware Interest-Clustered P2P File Sharing System 1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
This document summarizes a study that analyzed the physicochemical properties of clay mineral from Nteje, Nigeria after activation with sulfuric acid. The clay was treated with sulfuric acid at concentrations ranging from 2-7 mol/L. Characterization showed acid activation modified the chemical composition by exchanging octahedral cations for hydrogen ions, altering the crystalline structure and increasing surface area over three times that of the raw sample. Bleaching tests using the activated clays showed adsorption capacity and color removal from palm oil increased, with the 6 mol/L activated clay achieving 92.5% removal compared to 43.4% for the raw clay. The results indicate acid activation enhanced the adsorptive properties of the Nte
The document proposes a new "bound and decomposition method" to find an optimal fuzzy solution for fully fuzzy linear programming problems. The method decomposes the given fully fuzzy linear programming problem into three crisp linear programming problems: a middle level problem, upper level problem, and lower level problem. The three crisp linear programming problems are then solved separately. Using the optimal solutions from these problems, an optimal fuzzy solution for the original fully fuzzy linear programming problem is obtained. The proposed method does not require fuzzy ranking functions or restrictions on the coefficients matrix elements.
1) The document examines the seismic response of flat slab and grid slab buildings through dynamic analysis.
2) Two flat slab buildings and their inherent seismic resistance are evaluated when designed only for wind loads.
3) The conclusions show that while specific design parameters like drift, base shear, and overturning moment exceed wind design values, the structures have sufficient inherent capacity to resist moderate seismic loads if they satisfy wind criteria.
4) Dynamic analysis is performed to determine design seismic forces and their distribution for evaluation.
This document summarizes a study that used computational fluid dynamics (CFD) modeling to simulate the operation of a catalytic converter used to reduce nitrogen oxide (NOx) emissions from automobile exhaust. Specifically, it used the Comsol Multiphysics software to model a catalytic converter that injects ammonia to selectively reduce NOx to nitrogen and water through heterogeneous surface reactions on the catalyst. The model considers fluid flow, mass transfer, heat transfer and chemical reactions in both the channels and walls of the monolith structure. The study aims to optimize the ammonia injection level and investigate other operating parameters to improve the catalytic converter's NOx reduction efficiency.
The document describes the design and development of a contactless communication module for underwater vehicles. The module establishes wireless communication between a ship and underwater vehicle using infrared transmission. The hardware uses an MSP430 microcontroller and TFDU4101 IR transceiver. The software is developed in C using an IDE. The module transmits preset parameters from the ship to the vehicle before launch and receives sensor data from the vehicle for analysis. A GUI allows control and monitoring of the vehicle from the ship. The system provides contactless parameter loading and status monitoring of underwater vehicles.
This document discusses scheduling optimization for flexible manufacturing systems using genetic algorithms. It begins with an introduction to flexible manufacturing systems and some of the challenges in scheduling their operations. The author then reviews previous research on scheduling in flexible manufacturing systems using various methods like heuristics, mathematical programming, and metaheuristics. The paper goes on to present a genetic algorithm approach for scheduling a flexible manufacturing system with the goals of minimizing machine idle time and penalty costs for missed deadlines. Software is developed to obtain an optimal schedule. The genetic algorithm finds the global optimum schedule after 1700 generations.
#NG755298 (Human Resources Assistant (Military) GS-05/06/07, Jefferson City, ...Steven Brothers
This document announces a job opening for a Human Resources Assistant position with the Missouri National Guard. The position is located in Jefferson City, Missouri and is open from September 26, 2012 to October 18, 2012. It pays between $31,315 to $50,431 annually depending on qualifications and experience. Applicants must be members of the Missouri Army National Guard and have experience with military human resources operations. Duties include reviewing personnel files and actions, providing counseling to military personnel, and preparing reports.
This document discusses several topics including Ghhhgfh, Gfhgfjg, Dfghfhj, and bgngjh as well as Dsjgsjdhd and afsdjgsfjds. It concludes by mentioning Shgsahgjhgsdf.
El documento presenta tres fichas de evaluación de recursos multimedia. La primera ficha evalúa el portal educativo Eduteka, calificándolo como correcto generalmente. La segunda ficha evalúa la comunidad de videos Metacafe, calificándola como alta en general. La tercera ficha evalúa el sitio ArgentinaWarez para compartir software, calificándolo como correcto en sus aspectos funcionales.
O documento discute os conceitos de liberdade e inexorabilidade. Afirma que a liberdade humana é o livre arbítrio e está sujeita à responsabilidade, enquanto a inexorabilidade é aquilo que está fora de nosso controle. Também apresenta condições para o exercício responsável da liberdade, como autocontrole e consideração das consequências dos atos.
El ecoturismo es una forma de turismo alternativo que privilegia la sustentabilidad y preservación del medio ambiente natural y cultural. La Sociedad Internacional de Ecoturismo lo define como un viaje responsable a áreas naturales que conservan el ambiente y mejoran el bienestar de la población local. El gobierno peruano ha creado zonas intangibles para proteger la geografía, agua, flora y fauna únicas del país, las cuales forman parte del Sistema de Áreas Naturales Protegidas. Perú cuenta con una gran diversidad de
La identidad digital se refiere a nuestra representación en Internet, que incluye nuestro nombre, fotos y datos personales. En Internet, lo único que identifica a una persona son los bytes que comparte, a diferencia de la vida real donde se puede reconocer la voz o rostro de alguien. Es importante proteger nuestra privacidad e información personal en Internet mediante contraseñas seguras y configurando adecuadamente la privacidad en redes sociales. También hay que tener cuidado con el contenido que se publica o con quién se comparte información personal para evitar ries
Este documento presenta un resumen de una clase sobre psicología del conocimiento. La clase discute cuatro tipos de funciones mentales y cómo la escuela promueve el desarrollo de las funciones mentales de tipo 4, las cuales son específicas de los humanos y requieren del desarrollo previo de las funciones mentales de tipo 3 como la comprensión del lenguaje. La clase usa varios ejemplos como la visión en ranas y la caza en tigres para explicar los primeros tipos de funciones mentales.
The document discusses automation and safety considerations for the polymerization of vinyl chloride monomer (VCM) in polyvinyl chloride (PVC) production. VCM is flammable and toxic, and the exothermic polymerization reaction must be carefully controlled to prevent runaway reactions. Hazards include fires, explosions, and toxic emissions. A hazard assessment identifies scenarios like cooling failure, overfilling, and loss of agitation that could lead to runaway. Prevention strategies include alarms, addition of chemical inhibitors, and automatic depressurization of reactors in emergencies.
1. O documento apresenta os conceitos teóricos e práticos sobre circuitos RC, incluindo carga e descarga de capacitores através de resistores.
2. São mostrados exemplos de circuitos RC e equações que descrevem a carga e descarga de capacitores.
3. A experiência prática envolve a medição da carga e descarga de um capacitor em circuitos RC e a observação das formas de onda em um osciloscópio.
La persona propone cinco preguntas para enmiendas a la constitución y apoya enérgicamente la patria y eliminar a los "ponchos dorados", aparentemente refiriéndose a algún grupo o institución.
Flexible bloom for searching textual contentUvaraj Shan
This document describes BloomCast, a system that uses Bloom filters to encode document content and replicate it across peers in an unstructured peer-to-peer (P2P) network. BloomCast aims to achieve high recall for search queries at low communication cost. It hybridizes a lightweight distributed hash table (DHT) with the P2P overlay to enable random node sampling and network size estimation. The DHT helps meet two constraints: query and document replicas are randomly distributed across the network, and peers know the network size. By uniformly replicating content across the network, BloomCast can guarantee search recall. It utilizes Bloom filters to compress document replicas and reduce replication costs.
Flexible bloom for searching textual contentUvaraj Shan
This document presents the BloomCast scheme for efficient full-text retrieval in unstructured peer-to-peer networks. BloomCast replicates document content across the network in the form of Bloom filters to reduce communication costs while still guaranteeing recall. It hybridizes a lightweight distributed hash table with the unstructured overlay to support random node sampling and network size estimation. Queries are evaluated based on Bloom filter membership verification to support full-text searches with the potential for false positives but no false negatives. The system aims to provide efficient and effective full-text retrieval in unstructured P2P networks.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
This document summarizes the CoQUOS approach for maintaining consistency of continuous queries in unstructured peer-to-peer networks. CoQUOS is a lightweight middleware that supports registering long-standing queries and notifying peers when new matching content appears. It uses cluster-resilient random walks and dynamic probability-based query registration. The consistency maintenance mechanism ensures timely updates and avoids unnecessary replication by adaptively polling replicas based on query and update rates. Evaluation shows CoQUOS achieves high consistency efficiency at low cost.
This document proposes a framework for managing and querying multidimensional historical data distributed across an unstructured peer-to-peer network. When data is published, it is summarized into a synopsis containing an index and sub-synopses storing compressed data portions. The index and sub-synopses are distributed across the network with suitable replication to provide coverage for queries. The framework supports data publication and querying while ensuring peer autonomy and handling volatile peers through prompt reaction to disconnections to prevent broken index references.
This document describes a peer-to-peer messaging system built using the JXTA platform. The system allows instant messages to be sent between peers in a decentralized JXTA network. JXTA defines protocols for peer-to-peer communication, where all peers have equal status and can request or provide services. The system includes a JXTA relay that receives commands from J2ME clients, performs actions on their behalf, and represents the clients on the JXTA network by discovering peers and routing messages. The goal of the project is to enable instant messaging between peers in a peer-to-peer manner without a centralized server.
Peer-to-peer Systems – Introduction – Napster and its legacy – Peer-to-peer – Middleware – Routing overlays. Overlay case studies: Pastry, Tapestry- Distributed File Systems –Introduction – File service architecture – Andrew File system. File System: Features-File model -File accessing models – File sharing semantics Naming: Identifiers, Addresses, Name Resolution – Name Space Implementation – Name Caches – LDAP.
Ontology-Based Routing for Large-Scale Unstructured P2P Publish/Subscribe Systemtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Design and evaluation of a proxy cache foringenioustech
The document describes the design and evaluation of pCache, a proxy cache for peer-to-peer (P2P) traffic. Key contributions include:
1) A new storage system optimized for P2P caching that efficiently handles requests for object segments of arbitrary lengths.
2) An algorithm to infer information required for caching P2P traffic when this information is not directly available.
3) Achieving full transparency in the proxy cache and efficiently handling non-P2P connections to reduce processing overhead.
Extensive experiments evaluate pCache using real P2P traffic and show that it benefits both clients and ISPs without hurting P2P network performance.
International Refereed Journal of Engineering and Science (IRJES) is a peer reviewed online journal for professionals and researchers in the field of computer science. The main aim is to resolve emerging and outstanding problems revealed by recent social and technological change. IJRES provides the platform for the researchers to present and evaluate their work from both theoretical and technical aspects and to share their views.
International Refereed Journal of Engineering and Science (IRJES)irjes
International Refereed Journal of Engineering and Science (IRJES) is a leading international journal for publication of new ideas, the state of the art research results and fundamental advances in all aspects of Engineering and Science. IRJES is a open access, peer reviewed international journal with a primary objective to provide the academic community and industry for the submission of half of original research and applications
P2P DOMAIN CLASSIFICATION USING DECISION TREE ijp2p
The increasing interest in Peer-to-Peer systems (such as Gnutella) has inspired many research activities
in this area. Although many demonstrations have been performed that show that the performance of a
Peer-to-Peer system is highly dependent on the underlying network characteristics, much of the
evaluation of Peer-to-Peer proposals has used simplified models that fail to include a detailed model of
the underlying network. This can be largely attributed to the complexity in experimenting with a scalable
Peer-to-Peer system simulator built on top of a scalable network simulator. A major problem of
unstructured P2P systems is their heavy network traffic. In Peer-to-Peer context, a challenging problem
is how to find the appropriate peer to deal with a given query without overly consuming bandwidth?
Different methods proposed routing strategies of queries taking into account the P2P network at hand.
This paper considers an unstructured P2P system based on an organization of peers around Super-Peers
that are connected to Super-Super-Peer according to their semantic domains; in addition to integrating
Decision Trees in P2P architectures to produce Query-Suitable Super-Peers, representing a community
of peers where one among them is able to answer the given query. By analyzing the queries log file, a
predictive model that avoids flooding queries in the P2P network is constructed after predicting the
appropriate Super-Peer, and hence the peer to answer the query. A challenging problem in a schemabased Peer-to-Peer (P2P) system is how to locate peers that are relevant to a given query. In this paper,
architecture, based on (Super-)Peers is proposed, focusing on query routing. The approach to be
implemented, groups together (Super-)Peers that have similar interests for an efficient query routing
method. In such groups, called Super-Super-Peers (SSP), Super-Peers submit queries that are often
processed by members of this group. A SSP is a specific Super-Peer which contains knowledge about: 1.
its Super-Peers and 2. The other SSP. Knowledge is extracted by using data mining techniques (e.g.
Decision Tree algorithms) starting from queries of peers that transit on the network. The advantage of
this distributed knowledge is that, it avoids making semantic mapping between heterogeneous data
sources owned by (Super-)Peers, each time the system decides to route query to other (Super-) Peers.
The set of SSP improves the robustness in queries routing mechanism, and the scalability in P2P
Network. Compared with a baseline approach,the proposal architecture shows the effect of the data
mining with better performance in respect to response time and precision.
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIB...ijp2p
Recently there has been significant research focus on distributed computing network massively caching
and replica placement problems for content distribution in globally. Peer-to-Peer (P2P) network provides
dynamically decentralized, self organized, scalable objects in distributed computing system. However such
networks suffer from high latency, network traffic and cache update problems. The existing caching and
replica placement techniques for placing objects across peer-to-peer network have no complete solution to
these problems. This paper presents an overview of the current challenges present in P2P overlay
networks, followed by describes briefly the analysis study of the existing algorithms and their merits and
demerits. And also suggest a new popularity based QoS-aware(Quality of Service) smart replica
placement algorithm for content distribution in peer- to-peer overlay networks which overcomes the access
latency, fault tolerance, network traffic and redundancy problems with low cost. The new algorithm
suggested is based on the outcome of the analysis study.
A Brief Note On Peer And Peer ( P2P ) Applications Have No...Brenda Thomas
The document discusses peer-to-peer (P2P) networks and server-based client/server networks. In a P2P network, all computers have equal privileges to share and access information directly without restrictions. P2P networks are easier to set up but provide less security. In a client/server network, file storage and management is centralized on a server. This provides better security but is more complex to set up and manage. The document explores the advantages and disadvantages of each type of network for different usage contexts.
This document discusses web and social computing and peer-to-peer networks. It provides an overview of peer-to-peer network types including unstructured and structured networks. It also describes PeerSim, a peer-to-peer network simulator. The document outlines implementing maximum and minimum functions in PeerSim and analyzing the results. New methods were designed, run, and graphs of the outputs were generated to study how the maximum and minimum values changed over simulations.
IEEE 2014 DOTNET NETWORKING PROJECTS A proximity aware interest-clustered p2p...IEEEMEMTECHSTUDENTPROJECTS
This document describes a proposed proximity-aware and interest-clustered peer-to-peer (P2P) file sharing system (PAIS) that forms physically close nodes into clusters and further groups nodes with common interests into subclusters. It aims to improve file searching efficiency by creating replicas of frequently requested files within subclusters. The system analyzes user interests and file sharing behaviors to construct the network topology and uses an intelligent file replication algorithm. The experimental results show this approach improves file searching performance compared to existing P2P systems.
IEEE 2014 DOTNET NETWORKING PROJECTS A proximity aware interest-clustered p2p...
Cs24613620
1. Md Hussain Khusro, Yasmeen Begum / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.613-620
Maximum Coverage Probability based Query Registration and
Processing in Unstructured P2P Network
Md Hussain Khusro1 , Yasmeen Begum2
1
Pursuing M.tech (CSE) from Khaja Banda Nawaz College of Engineering, Gulbarga.
Affiliated to VTU Belgaum, Karnataka, India.
2
Prof. Yasmeen Begum, Department of Computer Science and Engineering, Khaja Banda Nawaz College of
Engineering, Gulbarga.
Affiliated to VTU Belgaum, Karnataka, India.
Abstract:
systems are invariably unstructured. However, most
Large amount of data are available in
unstructured P2P content distribution systems only
large-scale networks of autonomous data sources
support a very simple model for data sharing and
dispersed over a wide area. P2P is a system of
discovery called the ad hoc query model. A peer that
acquiring data directly from the clients using a
is interested in discovering data items initiates a
discovery process monitored by the server. As
query with a set of search parameters, which is then
such, in such a system only information about the
circulated among the peers according to the specific
data and the nodes are maintained at the server
query forwarding mechanism employed by the
and the communication is in Peer to peer manner
network. A peer receiving a query responds to the
between the clients.
query initiator, if it has any content satisfying the
If we assume a network where data is
search criterion. Once a query has been processed at
consistently being changed or new data are
a node, it is removed from the local buffers (some
released and that the client is continuously
systems cache recently received queries, but for a
generating query than, unavailability of the data
very short duration and in an ad hoc fashion).
at the instance of query generation leads to
Therefore, a query exists within the P2P network
information loss. In order to overcome this
only until it is propagated to various nodes and
problem, we propose a unique query processing
processed by them (or for a short duration thereafter,
based P2P system where query for which no data
if the network employs caching). Once a query
is available are stored in special nodes called
completes its circulation, the system essentially
Beacons. Once the data is available by some
forgets it.
client, the beacon announces the same to the
While the ad hoc query model for data
querying client.
discovery is essential for P2P content distribution
To transfer the data by utilizing minimum
networks, it suffers from two serious limitations.
bandwidth and maximum coverage, split and
First, due to its very nature, an ad hoc query is only
merge algorithm is proposed. For each
capable of retrieving content that exists in the P2P
downloading, a file is chunked in equal parts
network during the time period when it is actively
equivalent to number of clients. Clients start
propagated and processed in the network. Further,
downloading the parts in parallel. Once each
an ad hoc query can never reach a peer that joins the
client has different chunks, they download the
network after the query has completed its
missing chunks from each other thus balancing
circulation, and hence cannot discover matching
the load at the seeder. Result show improved
data-items on the new peer. In this scenario, the only
search time and throughput utilization for this
way for a peer to discover newly added data-items
method.
would be to repeatedly issue the same query,
thereby imposing unnecessary overheads on the
Keywords: P2P Network, Query Registration,
network. Second, the ad hoc query model provides
Query Processing, Searching in P2P, Maximum
no support for peers to advertise or announce the
Coverage.
data-items they own to other interested peers. Such
capabilities are important for P2P communities
I. Introduction: where peers trade content.
In recent years unstructured peer-to-peer These shortcomings limit the utility of the
(P2P) systems have evolved as a popular paradigm ad hoc query model for several advanced
for content/resource distribution and sharing [1, 6]. collaborative applications, such as a community of
Owing to the simplicity of design and flexibility researchers sharing their recent research results or a
towards transient node population, the real-world community of amateur musicians and their patrons
P2P who are interested in buying the music produced by
613 | P a g e
2. Md Hussain Khusro, Yasmeen Begum / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.613-620
the musicians. In applications such as these, constructing P2P-based pub-sub systems, namely (a)
participating peers would not only be interested in adopting a structured P2P network like Chord [15]
searching for existing content, but would also want or CAN [13] as the underlying substrate, and
to be pro-actively informed when content matching utilizing its indexing schemes for mapping
their interests is added to the network. Further, some subscriptions and events to nodes of the P2P
communities also need a mechanism through which systems [10, 16]; (b) organizing the nodes of the
peers can advertise their content to other interested P2P system into specialized topologies and/or
peers. Blind broadcast of advertisement would not embedding application specific distributed index
only result in high overheads, but could also annoy structures within nodes of the P2P network [7, 17,
participants who would be receiving large numbers 19]. The Sub-2-Sub system [17] organizes the peers
of advertisement about data-items that they are not into clusters using an epidemic-style algorithm such
interested in. that nodes with similar subscriptions are put into the
An approach that can partially mitigate same cluster. The publisher of an event joins the
these limitations would be to implement a publish- corresponding cluster and disseminates the event to
subscribe (pub-sub) system on top of the the cluster members.
unstructured overlay network. A generic pub-sub The proposed system differs from the
system enables its users to register subscriptions above works in terms of motivation, goals and
expressing their interests and to announce the approach. The goal of the above systems is to
occurrence of certain events by publishing them. improve the various performance parameters of pub-
The pub-sub system matches incoming sub systems and they use P2P-based techniques as a
announcements to the existing subscriptions means towards this end. In contrast, our goal is to
and notifies the users that have registered the enhance the P2P data sharing systems, and
matching subscriptions. An important point to note continuous queries (that bear similarity to pub-sub
is that the pub-sub systems attempt to provide model) is a means towards that end. Second, the
guaranteed notification service (although it might above pub-sub systems cannot be implemented on
not be possible always due to system failures). top of generic P2P networks; they need specialized
Researchers have studied the problem of overlays (specific topologies and/or indexing
implementingP2P-based pub-sub systems on mechanisms). Contrastingly, our system does not
unstructured overlay networks[7, 17]. However, need any complex distributed indexing structures,
most of these systems require the underlying P2P nor does it impose any topological constraints on the
networks to be organized according to specific overlay network. Finally, the above systems are
architectures, and hence they cannot be used in essentially pub-sub systems, and hence guaranteed
generic overlays. Many of these systems also notification is one of their design goals. Our system
require the peers to maintain intricate index provides best-effort notification, which is in tune
structures which add significant complexity to the with design principles of unstructured P2P
design of the P2P network. This additional networks. P2P-DIET [11] supports both ad-hoc and
complexity can adversely affect the flexibility, continuous queries, however, it assumes a super
efficiency, and scalability of the unstructured P2P peer-based overlay.
system. Furthermore, it also makes the design,
implementation, and management of P2P content In short, the work presented in this paper
distribution networks harder. has several unique aspects, and it addresses an
important problem in the area of P2P data sharing
II. Related Works: systems.
The work presented in this paper is
primarily related to two fields, namely P2P III. Our Approach
networks [6, 9, 14] and publish subscribe systems 3.1 Problem Formation
(event-delivery systems) [3,5], both of which have Peer to peer networks uses different
been very active areas of research in the past few computers or peers to share the files amongst
years. themselves rather than keeping the files in a single
Pub-sub systems can be classified into two server. Hence same file may be downloaded from
broad categories: different nodes in a peer. But due to non-central
(1) topic-based – wherein users join specific topic nature of the communication, such network looses
groups in which all the messages related to the topic control and finding out group of nodes relevant to
are broadcast; and (2) content-based – wherein data sharing is low. Therefore here we propose a
users specify their interests through predicates. With system to
the aim of enhancing scalability, efficiency and 1) Index the files at the server
scalability several distributed pub-sub systems have 2) A search engine to respond to the queries.
been proposed [3, 5]. Recently, P2P computing 3) Maximum neighborhood based beacon selection
models have been utilized for this purpose. for registering queries
Researchers have explored two strategies for
614 | P a g e
3. Md Hussain Khusro, Yasmeen Begum / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.613-620
4) Chunking based parallel file download for load The source ID uniquely identies the peer issuing the
balancing query. The query predicate is the matching
5) Achieve scalability for new information condition of the query, and is used by the source
peer to specify its interests. In general, the predicate
3.2 Proposed System can be of any form such as range predicates or even
a regular expression. We assume that the predicate
is a list of keywords describing the content the
source peer is interested in. Validity time (V Time)
represents the time until which the source node is
interested in receiving notifications. Peers announce
their new data items through announcements.
An announcement is represented as Ad
=(AID;MData). The announcing peer ID (AID)
identifies the advertising peer and the metadata
(MData) is the metadata of the content being
advertised. A data item Dr (and analogously its
announcement) is said to match a continuous query
Qm, if Dr's metadata contains all the keywords in
Qm's predicate. We use the word query and
continuous query[8,12] interchangeably.
Figure 1:Pure Decentralized P2P Content-
Sharing Architecture 3.3 System Design
Algorithm: The proposed system is
The above fig1shows decentralized P2P explained as bellow.
content sharing system where a user register a query *Generate Random set of nodes.
at peer4 called beacon node at time t. Once the data * Index a set of information-TF-IDF(term
is available by some client, the beacon announces frequency–inverse document frequency).
the same to the requesting client. * Randomly distribute the information to the Nodes.
Further in present system, a client can download * One or more clients query for a specific
only the information that is available at that instance information.
of time. But in the proposed system, a client can * Search and locate the clients where the
download the information after the information is information is available.
added at a later time. Further the system proposes a * Request the Seeder for downloading
chunking based technique with maximum coverage. * divide the data into equal pieces equivalent to
Generally in P2P system a client downloads the number of lecher.
information from the best possible path, so the * Data is sent to the clients through a route from
coverage is least. Hence if any intermediate client seeder to lecher. Each lecher than connects with
seeks the information in between a session, then each other and downloads the missing
without having to re-establish a fresh session, nodes chunks.(Maximum Coverage Technique).
can join the existing transmission and start * If there is no data available for a query, it is
downloading the needed chunks. registered at a node called a beacon node with
maximum reachibility ratio.
3.2 Concepts and Notations * Once the data is available, the information is
Consider an unstructured P2P system announced to the lechers and the downloading
comprising of peers (P0,P1,…..PN-1). Let begins as above.
(L0,L1……LM-1) represent the logical links * After certain time period the query is expired to
(connections) in the network. For simplicity, we maintain the integrity of the freshness of the
assume that the links are bidirectional. Two peers Pi information.
and Pj are said to be neighbors of each other if there * For query processing, exponential time-maximum
exists a link Lv = (Pi; Pj ) connecting them. likelihood estimation query registration and
We assume that each data item Dr in the system has forwarding is used.
associated metadata (represented as MData(Dr)) that
describes it. In the current context, the metadata is a IV. Diagrams
list of keywords describing the data item.
Continuous query is the means through which a peer
can register its interests with the network. A
continuous query, represented as Q =(SID;
Predicate; V Time), is essentially a tuple of three
components, namely, source ID (SID) , query
predicate (Predicate) and validity time (V Time).
615 | P a g e
4. Md Hussain Khusro, Yasmeen Begum / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.613-620
Figure2: First Level Data Flow Diagram
Figure4: Use Case Specification Diagram
Figure3: Second Level Data Flow Diagram
Figure5: Sequence Diagram
616 | P a g e
5. Md Hussain Khusro, Yasmeen Begum / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.613-620
V. Experiment and Results
5.1 Experiment:
Figure9: Now a matching data for registered query is
appeared in the network, our system automatically
notify a registered query file appeared and its
location.
Figure6: Here we create a p2p network of 15 nodes.
Figure7: Now we perform indexing of files and
announce the data randomly at peers.
Figure10: Now we create a route from seeder to
leecher(s)(requesting clients) with maximum
coverage and divide the file into chunks equivalent
to number of leechers and perform transmission.
Figure8: Here we show announcement of data files at
peers and perform search that generate a query for
which data is not available in the network and query
is registered at beacon node indicated with blue
rectangle in above figure8.
Figure11: Finally we get the data for registered query
and measure its latency and chunks and determine the
throughput.
617 | P a g e
6. Md Hussain Khusro, Yasmeen Begum / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.613-620
5.2 Results grows, availability of the data also increases which is
most desirable property of the P2P system.
200
180 Indexing time
160 0.19
140
Latency 0.185
120 for 2
100 clients 0.18
80 latency 0.175 Indexing
60 for 3 time
0.17
40 clients
20 0.165
0
0.16
20 30 40 4 5 6 7 8
Result1: Number of Node v/s Latency Result 3: Number of Data Items v/s the indexing
Latency is defined as the end to end delay for a node time. This experiment was conducted by considering
to acquire an entire file through collecting of chunks different length of text documents. The indexing is
from seeder and through transformed seeders. The considered as TF-IDF score of the documents.
graph shows that the latency of the system depends Indexing time increases with increase of number of
upon the leechers rather than the network size. for files and is independent of the file size. Therefore as
limited leechers, the transmission time is low and for the network grows, indexing the entire set consumes
the higher leechers, the same is increased. time. Hence the concept of query processing is used
which eliminates the indexing for every query. Once
a query is unanswered the query is stored. Hence
0.8
only re indexing is needed once a new data is made
0.7 available which is relevant to the query.
0.6
0.5 Reindexing time
TP for
0.4 2clients 0.06
0.3 TP for 0.05
3clients
0.2 0.04
0.1 0.03 Reindexing
0 0.02 time
20 25 30
0.01
0
Result 2: Number of Nodes v/s Throughput. 4 5 6 7 8
The performance graph shows that the chunking and
parallel downloading and maximum coverage routing
helps in enhancing the throughput. Generally Result 4: Number of Files v/s Reindexing time
throughput decreases significantly in P2P system. But The performance graph clearly explains the utility of
in the current process, throughput is increased with the technique. Once a new data is matched with
increase of nodes which suggest that as the network query it is reindexed. Numbers of reindexing
618 | P a g e
7. Md Hussain Khusro, Yasmeen Begum / International Journal of Engineering Research and
Applications (IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue 4, July-August 2012, pp.613-620
iterations are limited. Hence the system takes lesser publish/subscribe over P2P networks. In
time for announcement of new files. Proceedings of Middleware 2004, 2004.
[11] S. Idreos, M. Koubarakis, and C.
VI. Conclusion Tryfonopoulos. P2P-DIET: One-Time and
Peer-to-peer systems have become a popular Continuous Queries in Super-Peer
media for sharing large amount of information among Networks. In Proceedings of EDBT, 2004.
millions of users. While previous research efforts are [12] L. Ramaswamy, J. Chen, P. Parate, and A.
focusing on supporting search in P2P systems, Meka. Lightweight Support for Continuous
obtaining hidden and valuable knowledge from these Queries in Unstructured Overlays. Technical
data through data mining techniques is essential for report, The University of Georgia, 2006.
scientific findings and many other applications. In [13] S. Ratnasamy, P. Francis, M. Handley, R.
this work, we investigate searching and query Karp, and S. Schenker. A Scalable Content-
registration for fast information announcement to the Addressable Network. In Proceedings of
nodes. We provide complexity analysis on the ACM SIGCOMM 2001, Aug 2001.
transmission incurred by the system. The analytic [14] P. Reynolds and A.Vahdat. Efcient peer-to-
result indicates that proposed system can efficiently peer keyword searching. In Proceedings of
mitigate data to the nodes seeking the information. Middleware 2003.
The system can be further improved by adopting [15] I. Stoica, R. Morris, D. Karger, M. F.
passive replication technique. Kaashoek, and H. Balakrishnan. Chord: A
scalable peer-to-peer lookup service for
VII. References internet applications. In Proceedings of
[1] Gnutella P2P Network. www.gnutella.com. ACM SIGCOMM 2001, Aug 2001.
[2] Kazaa P2P Network. www.kazaa.com. [16] P. Triantallou and I. Aekaterinidis. Content-
[3] G. Banavar, T. Chandra, B. Mukherjee, J. Based Publish-Subscribe Over Structured
Nagarajarao, R. E. Strom, and D. C. P2P Networks. In Proceedings of the
Sturman. An Efcient Multicast Protocol for International Workshop on Distributed
Content-Based Publish-Subscribe Systems. Event-Based Systems (DEBS), 2004.
In Proceedings of ICDCS 1999, 1999. [17] S. Voulgaris, E. Riviere, A.-M. Kermarrec,
[4] N. Bisnik and A. Abouzeid. Modeling and and M. van Steen. Sub-2-Sub: Self-
analysis of random walk search algorithms Organizing Content-Based Publish
in P2P networks. In Proceedings of HOT- Subscribe for Dynamic Large Scale
P2P, 2005. Collaborative Networks. In Proceedings of
[5] A. Carzaniga, D. S. Rosenblum, and A. the 5th international workshop on peer-
L.Wolf. Design and evaluation of a wide- topeer systems, Feb 2006.
area event notication service. ACM [18] B. Yang and H. Garcia-Molina. Improving
Transactions on Computer Systems, search in peer to peer systems. In
19(3):332– 383, 2001. Proceedings of ICDCS 2002.
[6] Y. Chawathe, S. Ratnasamy, L. Breslau, N. [19] C. Zhang, A. Krishnamurthy, and R. Wang.
Lanham, and S. Shenker. Making Gnutella- Combining fexibility and scalability in a
like P2P Systems Scalable. In Proceedings peer-to-peer publish/subscribe system. In
of ACM SIGCOMM 2003, 2003. Middleware 2005.
[7] P. Chirita, S. Idreos, M. Koubarakis, and W.
Nejdl. Publish/Subscribe for RDF-based Author’s Profile:
P2P Networks. In Proceedings of the 1st
European Semantic Web Symposium, May Mr. Md Hussain Khusro
2004. pursuing M.Tech in
[8] Lakshmish Ramaswamy, Member, IEEE, Computer Science and
and Jianxia Chen, Student Member, IEEE. Engineering from Khaja Banda
The CoQUOS Approach to Continuous Nawaz(K.B.N) College of
Queries in Unstructured Overlays.IEEE Engineering Gulbarga.
TRANSACTIONS ON KNOWLEDGE Affiliated to V. T. U.,
AND DATA ENGINEERING, VOL.23, Belgaum, Karnataka, India. My research areas of
NO. 4, April 2011 interest are data mining and data warehousing.
[9] S. Androutsellis-Theotokis and D. Spinellis.
A Survey of Peer-to-Peer Content Mrs. Yasmeen Begum, Professor, Department of
Distribution Technologies. ACM Comput. Computer Science and Engineering, Khaja Banda
Surv., 2004. Nawaz College of Engineering Gulbarga. Affiliated
[10] A. Gupta, O. D. Sahin, D. Agrawal, and A. to V. T. U., Belgaum, Karnataka., India.
E. Abbadi.Meghdoot: content-based
619 | P a g e