{"_id":"YoknshsduCqXyCDzo","bibbaseid":"anonymous-recursivereplicationasurvivalsolutionforstructuredp2pinformationsystemstodenialofserviceattacks-2007","downloads":0,"creationDate":"2017-03-31T20:15:32.830Z","title":"Recursive replication: A survival solution for structured P2P information systems to denial of service attacks","author_short":null,"year":2007,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Structured Peer to Peer overlays have shown to be a very good solution for building very large scale distributed information systems. Most of them are based on Distributed Hash Tables (DHTs) that provide an easy way to manage replicas, thus facilitating high availability of data as well as fault tolerance. However, DHTs can also be affected by some well known Distributed Denial of Services attacks that can lead to almost complete unavailability of the stored objects. Very few powerful solutions exist for this kind of security weakness, and increasing the number of replicas for a given object seems to be the best known one. In this paper, we show how a recursive replicating schema can provide a good solution for this kind of attack. © Springer-Verlag Berlin Heidelberg 2007.","number":"PART 2","year":"2007","title":"Recursive replication: A survival solution for structured P2P information systems to denial of service attacks","volume":"4806 LNCS","pages":"931-940","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inproceedings{38349013311,\n abstract = \"Structured Peer to Peer overlays have shown to be a very good solution for building very large scale distributed information systems. Most of them are based on Distributed Hash Tables (DHTs) that provide an easy way to manage replicas, thus facilitating high availability of data as well as fault tolerance. However, DHTs can also be affected by some well known Distributed Denial of Services attacks that can lead to almost complete unavailability of the stored objects. Very few powerful solutions exist for this kind of security weakness, and increasing the number of replicas for a given object seems to be the best known one. In this paper, we show how a recursive replicating schema can provide a good solution for this kind of attack. © Springer-Verlag Berlin Heidelberg 2007.\",\n number = \"PART 2\",\n year = \"2007\",\n title = \"Recursive replication: A survival solution for structured P2P information systems to denial of service attacks\",\n volume = \"4806 LNCS\",\n pages = \"931-940\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\"\n}\n\n","key":"38349013311","id":"38349013311","bibbaseid":"anonymous-recursivereplicationasurvivalsolutionforstructuredp2pinformationsystemstodenialofserviceattacks-2007","urls":{},"downloads":0,"html":""},"search_terms":["recursive","replication","survival","solution","structured","p2p","information","systems","denial","service","attacks"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}