{"title":"o型环:点对点系统的容错和负载平衡架构","authors":"P. Melliar-Smith, L. Moser","doi":"10.1109/SCCC.2009.15","DOIUrl":null,"url":null,"abstract":"O-Ring is a novel architecture that provides fault tolerance and load balancing for peer-to-peer systems. As the number of peers increases, faults become more frequent and fault tolerance becomes important. As the number of users increases, demand becomes more variable and load balancing becomes necessary. In O-Ring, data items are replicated on successive peers around the ring, with an overlap of data items stored at consecutive peers. Each peer holds data items for which it is directly responsible. It also holds backup copies of data items held by the peer preceding it on the ring and the peer following it on the ring. O-Ring allows peers to adjust their loads dynamically, without the overhead of transferring data items and without delay in request processing.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"O-Ring: A Fault Tolerance and Load Balancing Architecture for Peer-to-Peer Systems\",\"authors\":\"P. Melliar-Smith, L. Moser\",\"doi\":\"10.1109/SCCC.2009.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"O-Ring is a novel architecture that provides fault tolerance and load balancing for peer-to-peer systems. As the number of peers increases, faults become more frequent and fault tolerance becomes important. As the number of users increases, demand becomes more variable and load balancing becomes necessary. In O-Ring, data items are replicated on successive peers around the ring, with an overlap of data items stored at consecutive peers. Each peer holds data items for which it is directly responsible. It also holds backup copies of data items held by the peer preceding it on the ring and the peer following it on the ring. O-Ring allows peers to adjust their loads dynamically, without the overhead of transferring data items and without delay in request processing.\",\"PeriodicalId\":398661,\"journal\":{\"name\":\"2009 International Conference of the Chilean Computer Science Society\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference of the Chilean Computer Science Society\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCCC.2009.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of the Chilean Computer Science Society","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCCC.2009.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
O-Ring: A Fault Tolerance and Load Balancing Architecture for Peer-to-Peer Systems
O-Ring is a novel architecture that provides fault tolerance and load balancing for peer-to-peer systems. As the number of peers increases, faults become more frequent and fault tolerance becomes important. As the number of users increases, demand becomes more variable and load balancing becomes necessary. In O-Ring, data items are replicated on successive peers around the ring, with an overlap of data items stored at consecutive peers. Each peer holds data items for which it is directly responsible. It also holds backup copies of data items held by the peer preceding it on the ring and the peer following it on the ring. O-Ring allows peers to adjust their loads dynamically, without the overhead of transferring data items and without delay in request processing.