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 New Architecture for Group Replication in Data GridEditor IJCATR
Nowadays, grid systems are vital technology for programs running with high performance and problems solving with largescale
in scientific, engineering and business. In grid systems, heterogeneous computational resources and data should be shared
between independent organizations that are scatter geographically. A data grid is a kind of grid types that make relations computational
and storage resources. Data replication is an efficient way in data grid to obtain high performance and high availability by saving
numerous replicas in different locations e.g. grid sites. In this research, we propose a new architecture for dynamic Group data
replication. In our architecture, we added two components to OptorSim architecture: Group Replication Management component
(GRM) and Management of Popular Files Group component (MPFG). OptorSim developed by European Data Grid projects for
evaluate replication algorithm. By using this architecture, popular files group will be replicated in grid sites at the end of each
predefined time interval.
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
35 content distribution with dynamic migration of services for minimum cost u...INFOGAIN PUBLICATION
Content Delivery Networks are the key for today’s internet content delivery. Users are knowingly or unknowingly accessing the CDN via internet. No matter how much the data retrieved by the user it may contain the CDN hand behind every character of text and every pixel of image. CDN came into existence to solve the delay problem. The moment when a user requests for a web page and the response delivered to the corresponding users web browser facing a huge delay. The main goal of this paper is content distribution of web services to multiple data centers placed in different geographical locations and providing security. A content distribution service is a major part of popular Internet applications. In proposed system hybrid clouds are used i.e., both private cloud as well as public cloud. One data center is allocated to each region. Providing security to the data is always an important issue because of the critical nature of the cloud and very large amount of complicated data it carries. To provide security cipher text policy algorithm is used. Authentication technique is used to verify the user authentication. If the user is authorized to access services then and only he receives configuration key to use.
Maximizing p2 p file access availability in mobile ad hoc networks though rep...LeMeniz Infotech
Maximizing p2 p file access availability in mobile ad hoc networks though replication for efficient file sharing
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
A New Architecture for Group Replication in Data GridEditor IJCATR
Nowadays, grid systems are vital technology for programs running with high performance and problems solving with largescale
in scientific, engineering and business. In grid systems, heterogeneous computational resources and data should be shared
between independent organizations that are scatter geographically. A data grid is a kind of grid types that make relations computational
and storage resources. Data replication is an efficient way in data grid to obtain high performance and high availability by saving
numerous replicas in different locations e.g. grid sites. In this research, we propose a new architecture for dynamic Group data
replication. In our architecture, we added two components to OptorSim architecture: Group Replication Management component
(GRM) and Management of Popular Files Group component (MPFG). OptorSim developed by European Data Grid projects for
evaluate replication algorithm. By using this architecture, popular files group will be replicated in grid sites at the end of each
predefined time interval.
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
35 content distribution with dynamic migration of services for minimum cost u...INFOGAIN PUBLICATION
Content Delivery Networks are the key for today’s internet content delivery. Users are knowingly or unknowingly accessing the CDN via internet. No matter how much the data retrieved by the user it may contain the CDN hand behind every character of text and every pixel of image. CDN came into existence to solve the delay problem. The moment when a user requests for a web page and the response delivered to the corresponding users web browser facing a huge delay. The main goal of this paper is content distribution of web services to multiple data centers placed in different geographical locations and providing security. A content distribution service is a major part of popular Internet applications. In proposed system hybrid clouds are used i.e., both private cloud as well as public cloud. One data center is allocated to each region. Providing security to the data is always an important issue because of the critical nature of the cloud and very large amount of complicated data it carries. To provide security cipher text policy algorithm is used. Authentication technique is used to verify the user authentication. If the user is authorized to access services then and only he receives configuration key to use.
Maximizing p2 p file access availability in mobile ad hoc networks though rep...LeMeniz Infotech
Maximizing p2 p file access availability in mobile ad hoc networks though replication for efficient file sharing
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
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.
Survey on caching and replication algorithm for content distribution in peer ...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
Dynamic Resource Provisioning with Authentication in Distributed DatabaseEditor IJCATR
Data center have the largest consumption amounts of energy in sharing the power. The public cloud workloads of different
priorities and performance requirements of various applications [4]. Cloud data center have capable of sensing an opportunity to present
different programs. In my proposed construction and the name of the security level of imperturbable privacy leakage rarely distributed
cloud system to deal with the persistent characteristics there is a substantial increases and information that can be used to augment the
profit, retrenchment overhead or both. Data Mining Analysis of data from different perspectives and summarizing it into useful
information is a process. Three empirical algorithms have been proposed assignments estimate the ratios are dissected theoretically and
compared using real Internet latency data recital of testing methods
Heterogeneous Device-to-Device mobile networks
are characterised by frequent network disruption and unreliability
of peers delivering messages to destinations. Trust-based
protocols has been widely used to mitigate the security and
performance problems in D2D networks. Despite several efforts
made by previous researchers in the design of trust-based routing
for efficient collaborative networks, there are fewer related
studies that focus on the peers’ neighbourhood as a routing
metrics’ element for a secure and efficient trust-based protocol.
In this paper, we propose and validate a trust-based protocol
that takes into account the similarity of peers’ neighbourhood
coefficients to improve routing performance in mobile HetNets
environments. The results of this study demonstrate that peers’
neighbourhood connectivity in the network is a characteristic
that can influence peers’ routing performance. Furthermore, our
analysis shows that our proposed protocol only forwards the
message to the companions with a higher probability of delivering
the packets, thus improving the delivery ratio and minimising
latency and mitigating the problem of malicious peers ( using
packet dropping strategy).
In this paper we explore the issue of store determination in a portable shared specially appointed system. In our vision reserve determination ought to fulfill the accompanying prerequisites: (i) it ought to bring about low message overhead and (ii) the data ought to be recovered with least postponement. In this paper, we demonstrate that these objectives can be accomplished by part the one bounce neighbors into two sets in view of the transmission run. The proposed approach lessens the quantity of messages overflowed into the system to discover the asked for information. This plan is completely circulated and comes requiring little to no effort as far as store overhead. The test comes about gives a promising outcome in view of the measurements of studies.
PROVABLE MULTICOPY DYNAMIC DATA POSSESSION IN CLOUD COMPUTING SYSTEMSNexgen Technology
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONSIJCNC
The trust and reputation models were introduced to restrain the impacts caused by rational but selfish
peers in P2P streaming systems. However, these models face with two major challenges from dishonest
feedback and strategic altering behaviors. To answer these challenges, we present a global trust model
based on network community, evaluation correlations, and punishment mechanism. We also propose a
two-layered overlay to provide the function of peers’ behaviors collection and malicious detection.
Furthermore, we analysis several security threats in P2P streaming systems, and discuss how to defend
with them by our trust mechanism. The simulation results show that our trust framework can successfully
filter out dishonest feedbacks by using correlation coefficients. It can effectively defend against the
security threats with good load balance as well.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IDENTIFICATION OF EFFICIENT PEERS IN P2P COMPUTING SYSTEM FOR REAL TIME APPLI...ijp2p
Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale
computation problems. However due to the dynamic nature of peers it is very difficult to use this type of
systems for the computations of real time applications. Strict deadline of scientific and real time
applications require predictable performance in such applications. We propose an algorithm to identify the
group of reliable peers, from the available peers on the Internet, for the processing of real time
application’s tasks. The algorithm is based on joint evaluation of peer properties like peer availability,
credibility, computation time and the turnaround time of the peer with respect to the task distributor peer.
Here we also define a method to calculate turnaround time (distance) on task distributor peers at
application level.
DWDM-RAM: a data intensive Grid service architecture enabled by dynamic optic...Tal Lavian Ph.D.
Next generation applications and architectures (for example, Grids) are driving radical changes in the nature of traffic, service models, technology, and cost, creating opportunities for an advanced communications infrastructure to tackle next generation data services. To take advantage of these trends and opportunities, research communities are creating new architectures, such as the Open Grid Service Architecture (OGSA), which are being implemented in new prototype advanced infrastructures.
The DWDM-RAM project, funded by DARPA, is actively addressing the challenges of next generation applications. DWDM-RAM is an architecture for data- intensive services enabled by next generation dynamic optical networks. It develops and demonstrates a novel architecture for new data communication services, within the OGSA context, that allows for managing extremely large sets of distributed data. Novel features move network services beyond notions of the network as a managed resource, for example, by including capabilities for dynamic on-demand provisioning and advance scheduling. DWDM-RAM encapsulates optical network resources (Lambdas, lightpaths) into a Grid Service and integrates their management within the Open Grid Service Architecture. Migration to emerging standards such as WS-Resource Framework (WS-RF) should be staright forward.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
A Survey of File Replication Techniques In Grid SystemsEditor IJCATR
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies.
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.
Survey on caching and replication algorithm for content distribution in peer ...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
A New Efficient Cache Replacement Strategy for Named Data NetworkingIJCNCJournal
The Information-Centric Network (ICN) is a future internet architecture with efficient content retrieval and distribution. Named Data Networking (NDN) is one of the proposed architectures for ICN. NDN’s innetwork caching improves data availability, reduce retrieval delays, network load, alleviate producer load, and limit data traffic. Despite the existence of several caching decision algorithms, the fetching and distribution of contents with minimum resource utilization remains a great challenge. In this paper, we introduce a new cache replacement strategy called Enhanced Time and Frequency Cache Replacement strategy (ETFCR) where both cache hit frequency and cache retrieval time are used to select evicted data chunks. ETFCR adds time cycles between the last two requests to adjust data chunk’s popularity and cache hits. We conducted extensive simulations using the ccnSim simulator to evaluate the performance of ETFCR and compare it to that of some well-known cache replacement strategies. Simulations results show that ETFCR outperforms the other cache replacement strategies in terms of cache hit ratio, and lower content retrieval delay.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
In this paper, we focuses on caching and replication algorithm for content distribution in peer to peer
networks. Caching and replication is a key strategy for improve the reliability, availability, and
performance in peer to peer networks. This paper gives a brief introduction to caching, replication and
various algorithms have been discussed and a detailed study has been performed. The comparison table
shows it clearly that an algorithm satisfies the caching and replication requirement.
Dynamic Resource Provisioning with Authentication in Distributed DatabaseEditor IJCATR
Data center have the largest consumption amounts of energy in sharing the power. The public cloud workloads of different
priorities and performance requirements of various applications [4]. Cloud data center have capable of sensing an opportunity to present
different programs. In my proposed construction and the name of the security level of imperturbable privacy leakage rarely distributed
cloud system to deal with the persistent characteristics there is a substantial increases and information that can be used to augment the
profit, retrenchment overhead or both. Data Mining Analysis of data from different perspectives and summarizing it into useful
information is a process. Three empirical algorithms have been proposed assignments estimate the ratios are dissected theoretically and
compared using real Internet latency data recital of testing methods
Heterogeneous Device-to-Device mobile networks
are characterised by frequent network disruption and unreliability
of peers delivering messages to destinations. Trust-based
protocols has been widely used to mitigate the security and
performance problems in D2D networks. Despite several efforts
made by previous researchers in the design of trust-based routing
for efficient collaborative networks, there are fewer related
studies that focus on the peers’ neighbourhood as a routing
metrics’ element for a secure and efficient trust-based protocol.
In this paper, we propose and validate a trust-based protocol
that takes into account the similarity of peers’ neighbourhood
coefficients to improve routing performance in mobile HetNets
environments. The results of this study demonstrate that peers’
neighbourhood connectivity in the network is a characteristic
that can influence peers’ routing performance. Furthermore, our
analysis shows that our proposed protocol only forwards the
message to the companions with a higher probability of delivering
the packets, thus improving the delivery ratio and minimising
latency and mitigating the problem of malicious peers ( using
packet dropping strategy).
In this paper we explore the issue of store determination in a portable shared specially appointed system. In our vision reserve determination ought to fulfill the accompanying prerequisites: (i) it ought to bring about low message overhead and (ii) the data ought to be recovered with least postponement. In this paper, we demonstrate that these objectives can be accomplished by part the one bounce neighbors into two sets in view of the transmission run. The proposed approach lessens the quantity of messages overflowed into the system to discover the asked for information. This plan is completely circulated and comes requiring little to no effort as far as store overhead. The test comes about gives a promising outcome in view of the measurements of studies.
PROVABLE MULTICOPY DYNAMIC DATA POSSESSION IN CLOUD COMPUTING SYSTEMSNexgen Technology
bulk ieee projects in pondicherry,ieee projects in pondicherry,final year ieee projects in pondicherry
Nexgen Technology Address:
Nexgen Technology
No :66,4th cross,Venkata nagar,
Near SBI ATM,
Puducherry.
Email Id: praveen@nexgenproject.com.
www.nexgenproject.com
Mobile: 9751442511,9791938249
Telephone: 0413-2211159.
NEXGEN TECHNOLOGY as an efficient Software Training Center located at Pondicherry with IT Training on IEEE Projects in Android,IEEE IT B.Tech Student Projects, Android Projects Training with Placements Pondicherry, IEEE projects in pondicherry, final IEEE Projects in Pondicherry , MCA, BTech, BCA Projects in Pondicherry, Bulk IEEE PROJECTS IN Pondicherry.So far we have reached almost all engineering colleges located in Pondicherry and around 90km
A MALICIOUS USERS DETECTING MODEL BASED ON FEEDBACK CORRELATIONSIJCNC
The trust and reputation models were introduced to restrain the impacts caused by rational but selfish
peers in P2P streaming systems. However, these models face with two major challenges from dishonest
feedback and strategic altering behaviors. To answer these challenges, we present a global trust model
based on network community, evaluation correlations, and punishment mechanism. We also propose a
two-layered overlay to provide the function of peers’ behaviors collection and malicious detection.
Furthermore, we analysis several security threats in P2P streaming systems, and discuss how to defend
with them by our trust mechanism. The simulation results show that our trust framework can successfully
filter out dishonest feedbacks by using correlation coefficients. It can effectively defend against the
security threats with good load balance as well.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
IDENTIFICATION OF EFFICIENT PEERS IN P2P COMPUTING SYSTEM FOR REAL TIME APPLI...ijp2p
Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale
computation problems. However due to the dynamic nature of peers it is very difficult to use this type of
systems for the computations of real time applications. Strict deadline of scientific and real time
applications require predictable performance in such applications. We propose an algorithm to identify the
group of reliable peers, from the available peers on the Internet, for the processing of real time
application’s tasks. The algorithm is based on joint evaluation of peer properties like peer availability,
credibility, computation time and the turnaround time of the peer with respect to the task distributor peer.
Here we also define a method to calculate turnaround time (distance) on task distributor peers at
application level.
DWDM-RAM: a data intensive Grid service architecture enabled by dynamic optic...Tal Lavian Ph.D.
Next generation applications and architectures (for example, Grids) are driving radical changes in the nature of traffic, service models, technology, and cost, creating opportunities for an advanced communications infrastructure to tackle next generation data services. To take advantage of these trends and opportunities, research communities are creating new architectures, such as the Open Grid Service Architecture (OGSA), which are being implemented in new prototype advanced infrastructures.
The DWDM-RAM project, funded by DARPA, is actively addressing the challenges of next generation applications. DWDM-RAM is an architecture for data- intensive services enabled by next generation dynamic optical networks. It develops and demonstrates a novel architecture for new data communication services, within the OGSA context, that allows for managing extremely large sets of distributed data. Novel features move network services beyond notions of the network as a managed resource, for example, by including capabilities for dynamic on-demand provisioning and advance scheduling. DWDM-RAM encapsulates optical network resources (Lambdas, lightpaths) into a Grid Service and integrates their management within the Open Grid Service Architecture. Migration to emerging standards such as WS-Resource Framework (WS-RF) should be staright forward.
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
A mobile peer-to-peer computer network is the one in which each computer in the network can act as a
client or server for the other computers in the network. The communication process among the nodes in the
mobile peer to peer network requires more no of messages. Due to this large number of messages passing,
propose an interconnection structure called distributed Spanning Tree (DST) and it improves the efficiency
of the mobile peer to peer network. The proposed method improves the data availability and consistency
across the entire network and also reduces the data latency and the required number of message passes for
any specific application in the network. Further to enhance the effectiveness of the proposed system, the
DST network is optimized with the Ant Colony Optimization method. It gives the optimal solution of the
DST method and increased availability, enhanced consistency and scalability of the network. The
simulation results shows that reduces the number of message sent for any specific application and average
delay and increases the packet delivery ratio in the network.
A Survey of File Replication Techniques In Grid SystemsEditor IJCATR
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies.
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies
A Survey of File Replication Techniques In Grid SystemsEditor IJCATR
Grid is a type of parallel and distributed systems that is designed to provide reliable access to data
and computational resources in wide area networks. These resources are distributed in different geographical
locations. Efficient data sharing in global networks is complicated by erratic node failure, unreliable network
connectivity and limited bandwidth. Replication is a technique used in grid systems to improve the
applications’ response time and to reduce the bandwidth consumption. In this paper, we present a survey on
basic and new replication techniques that have been proposed by other researchers. After that, we have a full
comparative study on these replication strategies
IEEE 2014 DOTNET NETWORKING PROJECTS A proximity aware interest-clustered p2p...IEEEMEMTECHSTUDENTPROJECTS
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
To Get any Project for CSE, IT ECE, EEE Contact Me @ 09666155510, 09849539085 or mail us - ieeefinalsemprojects@gmail.com-Visit Our Website: www.finalyearprojects.org
Peer to peer cache resolution mechanism for mobile ad hoc networksijwmn
In this paper we investigate the problem of cache resolution in a mobile peer to peer ad hoc network. In our
vision cache resolution should satisfy the following requirements: (i) it should result in low message
overhead and (ii) the information should be retrieved with minimum delay. In this paper, we show that
these goals can be achieved by splitting the one hop neighbours in to two sets based on the transmission
range. The proposed approach reduces the number of messages flooded in to the network to find the
requested data. This scheme is fully distributed and comes at very low cost in terms of cache overhead. The
experimental results gives a promising result based on the metrics of studies
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
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Efficient Resource Sharing In Cloud Using Neural NetworkIJERA Editor
In cloud computing, collaborative cloud computing(CCC) is the emerging technology where globally-dispersed cloud resource belonging to different organization are collectively used in a cooperative manner to provide services. In previous research, Harmony enables a node to locate its desired resources and also find the reputation of the located resources, so that a client can choose resource providers not only by resource availability but also by the provider’s reputation of providing the resource. In proposed system to reform resource utilization based on optimal time period to allocate resources to the neural network training and to load factor calculation the dynamic priority scheduling technique is used to assign the priority to the cloud users according to their load. The dynamic priority scheduling algorithm strikes the right balance between performance and power efficiency.
Abstract— Cloud storage is usually distributed infrastructure, where data is not stored in a single device but is spread to several storage nodes which are located in different areas. To ensure data availability some amount of redundancy has to be maintained. But introduction of data redundancy leads to additional costs such as extra storage space and communication bandwidth which required for restoring data blocks. In the existing system, the storage infrastructure is considered as homogeneous where all nodes in the system have same online availability which leads to efficiency losses. The proposed system considers that distributed storage system is heterogeneous where each node exhibit different online availability. Monte Carlo Sampling is used to measure the online availability of storage nodes. The parallel version of Particle Swarm Optimization is used to assign redundant data blocks according to their online availability. The optimal data assignment policy reduces the redundancy and their associated cost.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Similar to ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIBUTION IN DISTRIBUTED COMPUTING NETWORKS (20)
COMPARATIVE STUDY OF CAN, PASTRY, KADEMLIA AND CHORD DHTSijp2p
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.
International Journal of Peer to Peer Networks .docxijp2p
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.
International Journal of peer-to-peer networks (IJP2P)ijp2p
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.
International Journal of peer-to-peer networks (IJP2P)ijp2p
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.
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022)ijp2p
2nd International Conference on Big Data, IoT and Machine Learning (BIOM 2022) will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the areas of Big Data, Internet of Things (IoT) and Machine Learning. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of Big Data, IoT and Machine Learning.
7th International Conference on Networks, Communications, Wireless and Mobile...ijp2p
7th International Conference on Networks, Communications, Wireless and Mobile Computing (NCWMC 2022) looks for significant contributions to the Computer Networks, Communications, wireless and mobile computing for wired and wireless networks in theoretical and practical aspects. Original papers are invited on computer Networks, network protocols and wireless networks, Data communication Technologies, network security and mobile computing. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
4th International Conference on Internet of Things (CIoT 2022)ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
11th International conference on Parallel, Distributed Computing and Applicat...ijp2p
11th International conference on Parallel, Distributed Computing and Applications (IPDCA 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Parallel, Distributed Computing. Original papers are invited on Algorithms and Applications, computer Networks, Cyber trust and security, Wireless networks and mobile Computing and Bioinformatics. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022)ijp2p
3rd International Conference on Machine learning and Cloud Computing (MLCL 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Cloud computing. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
4th International Conference on Internet of Things (CIoT 2022) ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
International Journal of peer-to-peer networks (IJP2P)ijp2p
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.
3rd International Conference on Networks, Blockchain and Internet of Things (...ijp2p
3rd International Conference on Networks, Blockchain and Internet of Things (NBIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Networks, Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Networks, Blockchain and Internet of Things in theoretical and practical aspects.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas but are not limited to:
3rd International Conference on NLP & Information Retrieval (NLPI 2022)ijp2p
3rd International Conference on NLP & Information Retrieval (NLPI 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Natural Language Computing and Information Retrieval.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the following areas, but are not limited to.
CALL FOR PAPERS - 14th International Conference on Wireless & Mobile Networks...ijp2p
14th International Conference on Wireless & Mobile Networks (WiMoNe 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Wireless & Mobile computing Environment. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Wireless, Mobile Networks & its applications had received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PUBLISH YOUR PAPER - INTERNATIONAL JOURNAL OF PEER-TO-PEER NETWORKS (IJP2P)ijp2p
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.
International Journal of peer-to-peer networks (IJP2P)ijp2p
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.
3rd International Conference on Blockchain and Internet of Things (BIoT 2022)ijp2p
3rd International Conference on Blockchain and Internet of Things (BIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and
applications of Blockchain and Internet of Things. The Conference looks for significant contributions to all major fields of the Blockchain and Internet of Things in theoretical and
practical aspects. Authors are solicited to contribute to the conference by submitting articles that illustrate research
results, projects, surveying works and industrial experiences that describe significant advances in the areas of Blockchain and Internet of Things.
International Journal of peer-to-peer networks (IJP2P)ijp2p
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.
CALL FOR PAPERS - 4th International Conference on Internet of Things (CIoT 2022)ijp2p
4th International Conference on Internet of Things (CIoT 2022) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of IoT.
Authors are solicited to contribute to the conference by submitting articles that illustrate research results, projects, surveying works and industrial experiences that describe significant advances in the areas of Internet of Things.
Meet up Milano 14 _ Axpo Italia_ Migration from Mule3 (On-prem) to.pdfFlorence Consulting
Quattordicesimo Meetup di Milano, tenutosi a Milano il 23 Maggio 2024 dalle ore 17:00 alle ore 18:30 in presenza e da remoto.
Abbiamo parlato di come Axpo Italia S.p.A. ha ridotto il technical debt migrando le proprie APIs da Mule 3.9 a Mule 4.4 passando anche da on-premises a CloudHub 1.0.
1.Wireless Communication System_Wireless communication is a broad term that i...JeyaPerumal1
Wireless communication involves the transmission of information over a distance without the help of wires, cables or any other forms of electrical conductors.
Wireless communication is a broad term that incorporates all procedures and forms of connecting and communicating between two or more devices using a wireless signal through wireless communication technologies and devices.
Features of Wireless Communication
The evolution of wireless technology has brought many advancements with its effective features.
The transmitted distance can be anywhere between a few meters (for example, a television's remote control) and thousands of kilometers (for example, radio communication).
Wireless communication can be used for cellular telephony, wireless access to the internet, wireless home networking, and so on.
2.Cellular Networks_The final stage of connectivity is achieved by segmenting...JeyaPerumal1
A cellular network, frequently referred to as a mobile network, is a type of communication system that enables wireless communication between mobile devices. The final stage of connectivity is achieved by segmenting the comprehensive service area into several compact zones, each called a cell.
Italy Agriculture Equipment Market Outlook to 2027harveenkaur52
Agriculture and Animal Care
Ken Research has an expertise in Agriculture and Animal Care sector and offer vast collection of information related to all major aspects such as Agriculture equipment, Crop Protection, Seed, Agriculture Chemical, Fertilizers, Protected Cultivators, Palm Oil, Hybrid Seed, Animal Feed additives and many more.
Our continuous study and findings in agriculture sector provide better insights to companies dealing with related product and services, government and agriculture associations, researchers and students to well understand the present and expected scenario.
Our Animal care category provides solutions on Animal Healthcare and related products and services, including, animal feed additives, vaccination
Bridging the Digital Gap Brad Spiegel Macon, GA Initiative.pptxBrad Spiegel Macon GA
Brad Spiegel Macon GA’s journey exemplifies the profound impact that one individual can have on their community. Through his unwavering dedication to digital inclusion, he’s not only bridging the gap in Macon but also setting an example for others to follow.
guildmasters guide to ravnica Dungeons & Dragons 5...
ANALYSIS STUDY ON CACHING AND REPLICA PLACEMENT ALGORITHM FOR CONTENT DISTRIBUTION IN DISTRIBUTED COMPUTING NETWORKS
1. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
DOI : 10.5121/ijp2p.2012.3602 13
ANALYSIS STUDY ON CACHING AND REPLICA
PLACEMENT ALGORITHM FOR CONTENT
DISTRIBUTION IN DISTRIBUTED COMPUTING
NETWORKS
Dr. Anna Saro Vijendran1
and S.Thavamani2
1
Director of M.C.A, S.N.R SONS College, Coimbatore, Tamil Nadu, India.
saroviji@rediffmail.com
2
Assistant Professor in Computer Applications, S.N.R SONS College, Coimbatore, Tamil
Nadu, India.
thavamaniphd11@gmail.com
ABSTRACT
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.
KEYWORDS
Distributed computing network, Peer-to-Peer network, Replica placement, Decentralized, Access Latency,
and Network traffic, Redundancy, Fault tolerance.
1. INTRODUCTION
A distributed computing system consists of multiple software components that are on multiple
computers, but run as a single system [12, 19]. Internet is uprising as a new platform for
distributed computing. Each computer in a distributed system is connected by a local network, or
by a wide area network; interact with each other in order to achieve a common goal. A distributed
system consists of any different possible configurations [19].
In recent years, the emergence of Internet-scale distributed systems including storage
administration in global companies, entertainment file sharing, and large distributed database
systems have led to extensive research on efficient and scalable distributed computing
architectures. Among the other distributed computing models, P2P computing exhibits good
scalability and stability [4]. P2P system is an alternative to conventional client/server systems and
it supports applications that offer file sharing and content exchange. A node (peer) may act as a
2. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
14
client or a server or router when requested or served or forwarded an object. The participating
peers mark at least part of their resources as 'shared', allowing other contributing peers to access
these shared resources. As a result, as new peers access a particular file, the system's capacity to
provide that file increases [12]. P2P system proved to be an efficient and successful way for
content distribution in distributed computing and file sharing over the Internet [4].
P2P systems are classified into two types namely; Centralized P2P system and Decentralized P2P
system. The paper mainly deals with decentralized P2P system. Decentralized P2P system can be
classified into decentralized structured and unstructured system. In Decentralized Structured P2P
architecture network topology is tightly controlled, whereas Decentralized Unstructured P2P
systems do not have any control over the network topology, and placement files over the network.
The most general P2P system is the decentralized unstructured system [18]. Peers form a network
among them on top of the existing inter infrastructure, which is known as the Overlay Network
[6,22]. The challenges facing in P2P systems are scalability, reliability, access latency, network
traffic, fault tolerance, bandwidth utilization, security, and load balancing.
Data replication and caching techniques are the important two services in distributed computing
networks. It increases data availability by creating local or nearly available copies of popularly
used items, by forwarding each query to its nearest copy; the query search latency can be
effectively reduced. It also reduces communication overhead, increased system performance,
achieves fault-tolerance, and enhances reliability and load balancing [10].
The web content and streaming media is the growing importance in efficient distribution. To
provide content distribution to the clients with good Quality of Service (QOS), retaining efficient
and balanced resources is a very big challenge [21]. QOS is a method to guarantee a bandwidth
relationship between individual applications or protocols. It minimizes access latency, cost and
increase the availability through replication technique. There are two classes of service models
namely: Replica-Aware Service (RAS) model and Replica-Blind Service (RBS) model. In RAS
model, the servers in the system are aware of the locations of replicas. By using this information's
the servers direct the request to the nearest replica of the target object. In RBS model, the servers
in the system are not aware of the locations of replicas or even their existence. So, request routing
is independent of where the replicas of the target object are placed. Each replica only serves the
requests flowing through some routing techniques which can be implemented at either the
application level or at the network level [20].
2. REPLICATION
Replication is the process of creation and maintenance of duplicate copies of objects in internet-
scale distributed system. Replication improves the system performance, fault tolerance, reduces a
network bandwidth usage and increases the availability of popular data objects by distributing the
source of information in globally [13]. To efficiently use the server storage we need to replicate
objects that will yield the best performance [17]. Replication is needed in the case of System
failure, network traffic and to increase system scalability, load balancing, and to reduce access
cost. For example, users can access a local object rather than origin server to minimize network
traffic, access latency and provide location transparency [13].
There are different models of object replication. We mainly deal with a distributed replication
group. A distributed replication group contains several servers dedicating some storage for the
replicas. A server has to serve requests from its clients and also from other servers in the group.
When a server receives a request from a client, it immediately responds to the client if the object
is in its local storage. Otherwise, the object is fetched from other servers within the group at a
higher access cost or from the origin server, at an even higher cost; in the case no server within
3. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
15
the group stores a replica of the object [2]. The purpose of the replication group is to achieve
minimum access cost [8, 17]. Among different methods of object replication, we have analyzed
only some methods of replica placement problems. And also pros and cons of the replication
techniques are analyzed and summarized in Table 1.
3. RESEARCH ISSUES IN REPLICATION TECHNIQUES
In this paper we have analyzed only some methods of replica placement problems in
decentralized unstructured P2P systems are as follows:
3.1. Replication Algorithms in a Remote Caching Architecture (RARCA) [1]
This paper talks about distributed object replication policies that are designed to implement
different optimization goals and the availability of high speed interconnections for the potential of
resource sharing. Resource sharing takes place in the remote sites. The ability to access the
objects cached at the remote sites are done at the remote memory. A Remote Caching
Architecture (RCA) uses a remote memory by allowing all sites in the system to take the
advantages of each other's local memory. RCA focuses on what objects should be cached at what
site instead of simply caching objects on a demand basis. In RCA's remote memory are not
mapped into a single coherent virtual memory space.
3.2. QoS-Aware Intelligent Replica Management Architecture for Content
Distribution in P2P Overlay Networks (QIRMA) [2]
In this paper the author deals with Intelligent Replica placement algorithm, which the requested
contents are classified into class I and class II. In class I most frequently accessed contents are
replicated in strong cluster which is having high weight values and in number copies. In class II
least frequently accessed contents are replicated in weak cluster which is having low weight
values and in less number of copies. Routing is performed hierarchically by broadcasting the
query only to the strong clusters. This method has a caching technique, to reduce the search
latency. Using this method System scalability can be improved by distributing the load across
multiple servers which is proposed by replication. The demanded contents can be brought much
closer to the clients through replication techniques, thus reducing both the access latency and
network traffic and increase the system performance by avoiding hot peers which becomes a
bottleneck. The limitation in this method is that in strong clusters a few replicated items have
more number of copies. So, this consumes more cost, memory space, bandwidth and redundancy.
In weak clusters a few replicated items have less number of copies. Increased user response time
and performance are the bottleneck of the system.
3.3. Clustered KCenter: Effective Replica Placement in P2P Systems (CKERP) [4]
In this paper the authors have proved that the replica placement problem in P2P networks has
represented as a Clustered K-Center problem and is proven to be NP-complete. To overcome this
problem, the author developed an approximation algorithm in the form of a distance graph for the
network topology; the replica placement solution has built out of (m-1) power of current distance
graph. This system also considers a group of nodes but not the individual system.
3.4. Replica Placement Algorithm in Content Distribution Network (RPACDN) [5]
This paper deals with replica placement problems in CDN. The author models the CDN
consisting of CDN server's, which can store replicas and deliver replicas to other CDN server's
4. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
16
whenever necessary. The users of the CDN's are considering in a clustering view in order to
minimize the total cost of the network. The algorithm used by the author includes three parts
namely replication algorithm preprocess, constraint p-median model and algorithm of solving
constraint p-median problems with the iteration method. The results specify that the CPM
algorithms perform better than Random algorithm with less total cost.
3.5. Distributed Selfish Replication (DSR) [8]
In this work their main contribution is deriving Equilibrium Object (EO) placement strategies that
improves local utilities for all nodes concurrently than local utilities under greedy local object
placement, do not suffer from object mistreatment problems, and provides only demanded content
instead of complete information to all nodes by applying EO strategies. They described a Two-
Step Local Search (TSLS (k)) algorithm which employees Bloom Filters to distribute object,
selected for replication in demanded patterns. TSLS (k) works in a round- robin fashion that
allows each node to perform up to k rounds to improve the current placement of objects till it
receives the final copy of demanded object. It reduces bandwidth, access cost. It does not
consider storage capacity on the node, number of rounds needed to replicate the complete
demanded object which consumes more time to replicate.
3.6. Distributed Selfish Caching (DSC) [9]
In Distributed selfish caching deals with loosely coupled group of nodes to share their resources
in order to achieve higher efficiency and scalability. Here the author talks about two causes of
mistreatments namely, mistreatment due to cache state interactions between various members of
the group and mistreatment due to the use of common scheme for cache management across all
members of the group. The author suggest that on demand distributed caching is fairly resilient to
the onset of mistreatment as long as proxying is not enabled and intra-group access cost do not
include outliers. .
3.7. Fast Replication in Content Distribution Overlays (FRCDO) [3]
SPIDER (Spatial Indirection for path Diversity for Expedited Replication) employs two
orthogonal components to minimize the maximum time to replicate to all destination sites by
creation of multiple dynamic distribution trees using Transit Nodes. End to end reliable data
transport. In this algorithm content is not directly pushed to the clients but replicated only to the
small set of edge servers, catches or data centers. Through edge servers client fetches the data.
Thus it reduces the make-span in the data replication.
Make-span (Time) = the moment the data download completes at the last destination - The
moment that the data transfer is initiated.
Here trees can be reconfigured quickly without losses. It overcomes Transit Node failures. Since
tree construction by this system does not consider the bandwidth of different paths it leads to low
quality trees. It also does not consider the amount of data transfer which may leads to tree
bottleneck.
3.8. Distributed Algorithm for Web Content Replication (DAWCR) [16]
This method deals with caching and replication of most popular web content which reduces
bandwidth usage and the access latency by designing a distributed approximation algorithm. The
main objective of this algorithm is to improve the efficiency of popular web content replication
within a distributed replication group. The group may consist of several servers that spent some
5. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
17
memory space for replicated web content which is requested by their clients. When a server
receives a request from its client, it response if the web content is in its local storage otherwise it
fetches from other replication servers within the group or from the origin server. In this method
the replicas are placed by considering the availability of server capacities and the request rates for
web content. Replication of popular web content at a server much closer to the user could reduces
the access time and network bandwidth. Thus it increases the overall system performance. By
comparing with centralized algorithm this algorithm shows only one percentage degradation of
system performance. And also does not provide the number of copies of replicated content.
3.9. Distributed Algorithm for the Replica Placement Problem (DARPP) [17]
Caching and Replication of most popular data objects results in reduction of network bandwidth
usage and the access latency by designing a distributed approximation algorithm. The main focus
is to improve the efficiency of popular object replication within a distributed replication group.
The group may consist of several servers that allocate certain amount of memory to place the
replicated object which is requested by their clients. When a server receives a request from its
client, it response if the object is in its local storage otherwise it fetches from other replication
servers within the group or from the origin server. By analyzing the request rates for objects and
the server capacities the replicas are placed by considering the availability of server capacities.
Replication of popular data objects at a server closer to the user reduces the access time and
network bandwidth. Thus it increases the overall system performance with all objects. By
comparing with centralized algorithm this shows only one percentage degradation of system
performance and not decided how many copies of objects should be replicated in the group.
3.10. On Replica Placement for QoS-Aware Content Distribution Method
(RPQACD) [20]
In this method several algorithms like greedy algorithm, tree based algorithm have been proposed
for solving the web server replica placement problem. This method optimizes an average access
latency of all clients that were in the online Content Distribution Network (CDN). Growing
importance needs good Quality of Service (QOS) while retaining efficient and balanced resource
consumption of the underlying infrastructure. In this method they consider replica-aware service
model for directing requests to the nearest replica of the target object with the help of the location
information's. From the study of this method it is seen that the average performance measurement
of the entire clients have been calculated and not the individual.
3.11. Dynamic Replica Placement for Scalable Content Delivery (DRPSCD) [21]
In this technique a balanced dissemination-tree (d-tree) is proposed which reduces the number of
replicas deployed by comparing several replica placement algorithms. A dynamic web content
distribution system (d-tree) built on top of a peer-to-peer overlay network called tapestry has need
developed. This is used to find nearby replicas for the client. This novel algorithm meets the
clients request by placing minimum replicas to the closest systems with the consideration of QOS
and server capacity. A node in a d-tree maintains state root server. Thus, it reduces QOS matrices
vise, access delay, bandwidth consumption and improve information only for its parent and client
children. So, client gets content from its children without contacting the scalability. But all these
are achieved with limited local network topology.
6. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
18
3.12. An Overlay Network for Replica Placement within a P2P VoD Network
(ONRPP2P) [6]
In this paper the author have proposed techniques and algorithms for point-to-point streaming in
autonomous systems as it might occur in large companies, a campus or even in large hotels. Their
major aim was to create a replica situation that inter-sub network RSVP streams are reduced to a
minimum. They have introduced the architecture of an overlay network for interconnecting sub
networks. Each sub network contains a Local Active Rendezvous Server (LARS), not only act as
directory server but also controls availability of movie content in its subnet work. Due to this,
they have considered data placement strategies depending on restrictions of network bandwidth,
peer capabilities, and also movie’s access frequency.
3.13. On the Placement of Web Server Replicas (PWSR) [11]
In this paper the authors have proposed that several algorithms like greedy algorithm , tree based
algorithm for solving the web server replica placement problem that optimizing an average access
latency of all clients that were in the online CDN’s. From the analysis we came to know that the
author calculated the average performance measurement of the entire clients but it does not
provide the individual system performance.
3.14. The Cache Location Problem (CLP) [7]
In this paper the author talks about the problem of where to place net-work caches, these location
problems both for general caches and for transparent en-route caches (TERCs), and identify that
are intractable. They had given Greedy optimal algorithms for line and ring networks, and present
closed form formulate for some special cases. And also they presented a model for a Network and
computationally efficient dynamic programming algorithm for the single web server that wishes
to minimize the average access delay. This Greedy algorithm greedily replaces some already
assigned caches with caches to improve the objective cost function. They had observed that a
small number of TERCs are sufficient to reduce the network traffic significantly and to reduce
traffic load in their network. TERCs have the advantage that they do not require changes (like a
proxy assignment) by a user, and are easy to install and manage locally within a provider net-
work. The main problem in evaluating any multi-server placement algorithm is that it is harder to
obtain general network web traffic data.
3.15. Heuristic Replica Placement Algorithms in Content Distribution Networks
(HRPACDN) [23]
In this paper the author proposed a new optimization model with server storage capacity
constraints for the replica placement problems. They divide the replica placement problems into
two sub-problems: the number of each replica and which servers to store the replicas. And also
they designed an efficient algorithm (CPM) for allocate replicas of files to minimize the total
cost. It includes three parts: replication algorithm pre-process, constraint P-median model and
algorithm of solving constraint P-median problems which were solved by iteration methods. This
CPM algorithm performs better than random algorithm with less total cost.
7. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
19
3.16. Tables
Table 1. Pros and Cons of the various replication techniques are summarized below
Algori
thm
Author Year Journa
ls
Advantages Improved
Parameters
Limitations
DARP
P [17]
S.Zaman
&
D.Grosu.
2011
IEEE
Minimizes
Response Time,
Cost & Increase
Availability
Cost, access
latency,
Network
bandwidth
Not provide
individual system
performance, &
number of copies
HRPA
CDN[
23]
J.Sun,
S.Gao &
at el.
2011
JNW
Less total cost,
Better than random
algorithm
Network
bandwidth,
Access cost
Limited Topology
RPAC
DN [5]
J.Sun, &
at el 2010 IEEC
Minimize total
cost
Access cost Can't adapt dynamic
user request
QIRM
A [2]
S.Ayyas
amy &
S.Nataraj
an
2009 IJCSE
Access latency,
Network traffic,
Scalability, Fault
Tolerance, Search
Latency
Throughput,
Delay,
Bandwidth,
Query
Efficiency,
High availability,
Redundancy, Low
Availability,
Bottleneck Problem,
DAW
CR
[16]
S.Zaman
&
D.Grosu.
2009
IEEE
Response Time &
Cost, Increase
Availability &
Performance
Access time,
Cost,
Network
Bandwidth
not provide
individual system
performance, &
number of replicated
copies
DSC
[9]
N.Laouta
ris, & at
el.
2007
IEEE
Improve scalability
and higher
efficiency
Access
latency,
bandwidth
utilization
Vulnerability
CKER
PP2P
[4]
J.Zhou
& at el. 2007 IEEE
F Query Latency,
Faster than the
optimal solution
Time
complexity
Not consider the
individual system.
DSR
[8]
N.
Laoutari
s & at el.
2006 IEEE
Replicate only
demanded pattern of
content, Network
Traffic, Access Cost
Access
latency,
Bandwidth,
Delay
Does not consider
storage capacity, too
many rounds,
additional protocols
& mechanisms.
FRCD
O [3]
S.Gangul
y, & at
el.
2005 IEEE
Replication time,
Transit Nodes
failover requirement
Transfer
time, Speed
Tree bottleneck
problem
ONRP
P2P
[6]
K.H.
wan & at
el.
2005 JHPCN
Access Frequency,
reduce the number
of RSVP based
inter-subnetwork
Waiting
time
Restrictions on
network, expensive
ORPQ
ACD
M
[20]
X.Tang
& at el. 2004 IEEE
Response time,
cost & increase the
availability
Throughput,
Latency,
Bandwidth,
Delay
Does not provide
individual
performance
measurement
DRPS
CD
[21]
Yan
Chen &
at el.
2002
Notes
in CS
Reduces network
Traffic, Improve
Scalability
Bandwidth
access delay
Limited local
network topology
knowledge
PWSR
[11]
L.Qiu.
& at el. 2001 IEEE
Better performance,
Availability,
Request Latency,
Load Balancing
Request
rate,
Bandwidth,
access delay
Depends upon
estimates of Clients
Distance & Load
Predictions
CLP
[7]
P.Krishn
an, & at
el.
2000 IEEE/A
CM
Minimize overflow,
Do not require
changes, Easy to
install & manage l
Average
Delay,
Network
Traffic
Limited Network
Topology, Does not
support worst case
level
RARC
A
[1]
Avraham
Leff & at
el.
1993
IEEE
Reduces a number
of disk access,
improves
performance
Throughput,
Latency,
Bandwidth,
Delay
Deals with only
limited network
topologies
8. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
20
4. SUGGESTION
In order to address the limitations popularity based QoS-aware smart replica placement algorithm
for content distribution in P2P overlay network is being developed based on weight vector values
of peers and the accessing popularity of requested objects. The suggested algorithm contains a
smart replica placement algorithm and modified robust query searching technique for data
retrieval. The suggested system solves replica placement problem and is defined as follows: In
this algorithm, according to the peer's weight vector values the peers are grouped as strong
cluster, medium cluster and weak clusters. And followed by the requested objects are classified
into Class I, Class II and class III. In class I, most frequently accessed objects are replicated in
strong clusters which are having high weight values. In class II, medium accessed objects are
placed in medium clusters which are having medium weight values. In class III, least frequently
accessed objects are replicated in weak clusters and having low weight values. Routing is
performed hierarchically by broadcasting the query to the strong , medium group of peers. In
addition this algorithm also possesses caching techniques to the reduction of search latency. It
minimizes the access time and reduces the memory space, cost, redundancy, bandwidth
consumption. And also it increases the system performance and availability.
5. CONCLUSIONS
This paper conducts a theoretical analysis study on caching and replication strategies in
distributed computing system (peer-to- peer network). A brief discussion of those techniques is
summarized. The advantages and limitations of caching and replication techniques are
summarized with reference to various issues related to caching and replication techniques in
distributed computing networks.
ACKNOWLEDGEMENTS
Our thanks to AIRCC for allowing us to modify templates they had developed. And also our
sincere thanks to our Management of SNR Sons Institutions for allowing us to utilize their
resources for doing our research work. Our sincere thanks to our Principal & Secretary
Dr.H.Balakrishnan M.Com., M.Phil., Ph.D., for his support and encouragement in our research
work. And my grateful thanks to my guide Dr. Anna Saro Vijendran, M.C.A., M.Phil., Ph.D.,
Director of M.C.A, SNR Sons College, Coimbatore-6 for her valuable guidance and giving me a
lot of suggestions & proper solutions for critical situations in our research work.
REFERENCES
[1]Avraham Leff, Joel L. Wolf, and Philip S. Yu, (1993) “Replication Algorithms in a Remote Caching
Architectures”, IEEE Trans. On Parallel and Distributed Systems, Vol.4, No.11, PP 1185-1204.
[2]S. Ayyasamy and S.N. Sivanandam,(2009) “ A QOS-Aware Intelligent Replica Management
Architecture for Content Distribution in Peer-to-Peer Overlay Networks “, International Journal on
Computer Science and Engineering, Vol.1, No.2, PP 71-77.
[3]S. Ganguly, A. Saxena, S. Bhatnagar, and R. Izmailov are with the Broadband and Mobile Networking
Department,NEC laboratories, Princeton, NJ, 08540, USA,(2005) “Fast Replication in Content
Distribution Overlays”, SUBMITTED TO IEEE INFOCOM 2005.
[4]Jian Zhou, Xin Zhang, Laxmi Bhuyan and Bin Liu. (2007) “Clustered KCenter: Effective Replica
Placement in Peer-to-Peer Systems”, IEEE conference on Global Telecommunications, PP.2008-
2013.
[5]Jing Sun, Suixiang Gao, Wenguo Yang, Fei Huang. (2010),” Replica Placement Algorithms in Content
Distribution Networks”, Information Engineering and Electronic Commerce (IEEC) 2nd
International symposium on 23-25 July 2010.
9. International Journal of Peer to Peer Networks (IJP2P) Vol.3, No 6, November 2012
21
[6]Kan Hung Wan, Chris Loeser,(2005), "An Overlay Network for Replica Placement within a P2P VoD
Network”, Journal Of High Performance Computing And Networking, Vol.3, No.5/6, pp.320-
335,December 2005.
[7]P. Krishnan, D. Raz, and Y. Shavitt,(2000), “The cache location problem,” IEEE/ACM Transactions on
Networking, vol. 8, no. 5, pp. 568–582, Oct. 2000.
[8]N. Laoutaris, O. Telelis, V. Zissimopoulos, and I. Stavrakakis.(2006). “Distributed Selfish Replication”,
IEEE Transaction on Parallel and Distributed Systems. vol. 17, no. 12. PP.1401-1413 Dec. 2006.
[9]N. Laoutaris, G. Smaragdakis, A. Bestavros, and I. Matta. (2007).” Distributed Selfish Caching”, IEEE
Trans. Parallel and Distributed Systems, Vol. 4, No.11,PP.1185-1204, Nov- 1993.
[10]Pooja Sharma, Kamal kant and Naveen Chauhan. July-Dec 2010. “A Comparative Study of Cluster-
Based Data Replication Techniques for MANETs “, International journal of information technology
and knowledge management. Vol. 2, No. 2. (July-Dec 2010). 665-667.
[11]L. Qiu. , V. N Padmanabhan, and G. M., Apr. 2001 Voelker, “On the placement of web server
replicas,” in Proceedings of IEEE INFOCOM’01, pp. 1587–1596.
[12]Sabu M.Thampi. 2010. Survey of search and replication schemes in unstructured p2p networks.
Network protocols and Algorithms. Vol.2, No.1. (2010).
[13]Salman Abdual Moiz at el. Jan-2011. “Database Replication: A Survey of Open Source and
Commercial Tools”, International Journal of Computer Applications. Vol. 13, No .6. (Jan-2011).
[14]Samee Ullah Khan and Cemal Ardil. 2009. “A Fast Replica Placement Methodology for Large-scale
Distributed Computing Systems”, World Academy of Science, Engineering and Technology. 55.
(2009).
[15]Saurabh Tewari. 2007. "Performance Study of Peer-to-Peer File Sharing” . Doctorial Thesis,
University of California, Los Angeles. (2007).
[16]Sharrukh Zaman and Daniel Grosu. 2009.” A Distributed Algorithm for Web content Replication”, 8th
IEEE International symposium on network computing and applications. (2009).
[17]Sharrukh Zaman and Daniel Grosu. Sep-2011. “A Distributed Algorithm for the Replica Placement
Problem”, IEEE Trans.Parallel and Distributed Systems. vol. 22, no.9. ( sep-2011) 1455-1468
[18]Stephanos, Routsellis-Theotokis and Diomidis Spinellis. Dec-2004.” A Survey of Peer-to-Peer Content
Distribution Technologies”, ACM Computing Surveys. Vol. 36, No.4. (2004). 335-371.
[19]What is distributed computing? http://www.wikipedia.com
[20]Xueyan Tang Jianliang Xu. Mar-2004. “On Replica Placement for QoS-Aware Content Distribution”,
INFOCOM 2004. 23rd AnnualJoint Conference of the IEEE Computer and Communications
Societies. (March 2004). 7-11.
[21]Yan Chen, Randy H. Katz and John D. Kubiatowicz. 2002. “Dynamic Replica Placement for Scalable
Content Delivery”. Lecture Notes in Computer Science, Vol. 2429. (2002). 306¬318.
[22]Guruprasad Khataniar and Diganta Goswami, Sep-2012. “ SHP: A Hierarchical Protocal to Improve
Performance of Peer-to-Peer Systems”, International Journal of Peer to Peer Networks.(September -
2012) . Vol.3, No5.
[23]Jing Sun, S.Gao, W.Yang and Z.Jiang, March-2011. “Heuristic Replica Placement Algorithms in
Content Distribution Networks”, Journal of Networks. Vol.6, No.3,pp.416-423. (March 2011).
Authors
Dr. Anna Saro Vijendran is the Director – MCA in SNR Sons College, Coimbatore,
India. She has a teaching experience of 20 years in the field of Computer science. Her
area of Specialization is Digital Image Processing and Artificial Neural Networks .She
has presented more than 30 Papers in various Conferences and her research works have
been published in International Journals. She is currently a Supervisor for research
works of various Universities and also Reviewer for reputed Journals.
S, Thavamani is an Assistant Professor in Department of Computer Applications, SNR
Sons College, Coimbatore, India. She has a teaching experience of 12 years in the field
of Computer science. Her area of Specialization is Distributed Computing and Networks.
She has presented more than 15 Papers in various International and National
Conferences. She is currently a supervisor for M.Phil research works of various
Universities. She is currently pursuing Ph.D Degree in SNR Sons College, under
Bharathiar University, Coimbatore.