Anonymous communications in mobile ad hoc networks is an important and effective way against malicious traffic analysis. Various anonymous routing schemes have been proposed for MANETs. However, most works failed to resist the global tracker, and always ignored the reliability of data delivery. In this paper, a comprehensive anonymous communication protocol, called ARSC, is proposed. The ARSC consists of anonymous routing, which is based on identity-based encryption pseudonym and single-round onion, and secure checking of traffic forwarding in data transmission phase, to achieve strong route anonymity and improve reliability of packet delivery in the data transmission phase. From the security analysis, our protocol ARSC is more secure than other schemes such as ANODR, SDAR, AnonDSR, CAR and MASK. Moreover, simulation experiments show that the ARSC has better performance than any other onion-structured anonymous routing protocols.
{"title":"Anonymous On-Demand Routing and Secure Checking of Traffic Forwarding for Mobile Ad Hoc Networks","authors":"R. Jiang, Yuan Xing","doi":"10.1109/SRDS.2012.6","DOIUrl":"https://doi.org/10.1109/SRDS.2012.6","url":null,"abstract":"Anonymous communications in mobile ad hoc networks is an important and effective way against malicious traffic analysis. Various anonymous routing schemes have been proposed for MANETs. However, most works failed to resist the global tracker, and always ignored the reliability of data delivery. In this paper, a comprehensive anonymous communication protocol, called ARSC, is proposed. The ARSC consists of anonymous routing, which is based on identity-based encryption pseudonym and single-round onion, and secure checking of traffic forwarding in data transmission phase, to achieve strong route anonymity and improve reliability of packet delivery in the data transmission phase. From the security analysis, our protocol ARSC is more secure than other schemes such as ANODR, SDAR, AnonDSR, CAR and MASK. Moreover, simulation experiments show that the ARSC has better performance than any other onion-structured anonymous routing protocols.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132909937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Aggressive technology scaling in deep sub micron regime makes chips more susceptible to failures. This causes multiple realibility challenges in the design of modern chips, including manufacturing defects, wear-out, and parametric variations. With increasing area occupied by different on-chip memories in modern computing platforms such as Chip Multi-Processors (CMPs), memory reliability becomes a challenging issue. Traditional on-chip memory reliability techniques (e.g., ECC) incur significant power and performance overheads. To tackle such challenges, my research introduces several designs for fault-tolerance of both L1 and L2 cache memories in uni-core processors [1], Last-level Cache (LLC) in CMPs [3][4], and LLC in Networks-on-Chip (NoCs) [2].
{"title":"Reliable On-Chip Memory Design for CMPs","authors":"Abbas BanaiyanMofrad","doi":"10.1109/SRDS.2012.60","DOIUrl":"https://doi.org/10.1109/SRDS.2012.60","url":null,"abstract":"Aggressive technology scaling in deep sub micron regime makes chips more susceptible to failures. This causes multiple realibility challenges in the design of modern chips, including manufacturing defects, wear-out, and parametric variations. With increasing area occupied by different on-chip memories in modern computing platforms such as Chip Multi-Processors (CMPs), memory reliability becomes a challenging issue. Traditional on-chip memory reliability techniques (e.g., ECC) incur significant power and performance overheads. To tackle such challenges, my research introduces several designs for fault-tolerance of both L1 and L2 cache memories in uni-core processors [1], Last-level Cache (LLC) in CMPs [3][4], and LLC in Networks-on-Chip (NoCs) [2].","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133175837","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cloud computing has become increasingly popular by obviating the need for users to own and maintain complex computing infrastructure. However, due to their inherent complexity and large scale, production cloud computing systems are prone to various runtime problems caused by hardware and software failures. Autonomic failure detection is a crucial technique for understanding emergent, cloudwide phenomena and self-managing cloud resources for system-level dependability assurance. To detect failures, we need to monitor the cloud execution and collect runtime performance data. These data are usually unlabeled, and thus a prior failure history is not always available in production clouds, especially for newly managed or deployed systems. In this paper, we present an Adaptive Anomaly Detection (AAD) framework for cloud dependability assurance. It employs data description using hypersphere for adaptive failure detection. Based on the cloud performance data, AAD detects possible failures, which are verified by the cloud operators. They are confirmed as either true failures with failure types or normal states. The algorithm adapts itself by recursively learning from these newly verified detection results to refine future detections. Meanwhile, it exploits the observed but undetected failure records reported by the cloud operators to identify new types of failures. We have implemented a prototype of the algorithm and conducted experiments in an on-campus cloud computing environment. Our experimental results show that AAD can achieve more efficient and accurate failure detection than other existing scheme.
{"title":"AAD: Adaptive Anomaly Detection System for Cloud Computing Infrastructures","authors":"H. Pannu, Jianguo Liu, Song Fu","doi":"10.1109/SRDS.2012.3","DOIUrl":"https://doi.org/10.1109/SRDS.2012.3","url":null,"abstract":"Cloud computing has become increasingly popular by obviating the need for users to own and maintain complex computing infrastructure. However, due to their inherent complexity and large scale, production cloud computing systems are prone to various runtime problems caused by hardware and software failures. Autonomic failure detection is a crucial technique for understanding emergent, cloudwide phenomena and self-managing cloud resources for system-level dependability assurance. To detect failures, we need to monitor the cloud execution and collect runtime performance data. These data are usually unlabeled, and thus a prior failure history is not always available in production clouds, especially for newly managed or deployed systems. In this paper, we present an Adaptive Anomaly Detection (AAD) framework for cloud dependability assurance. It employs data description using hypersphere for adaptive failure detection. Based on the cloud performance data, AAD detects possible failures, which are verified by the cloud operators. They are confirmed as either true failures with failure types or normal states. The algorithm adapts itself by recursively learning from these newly verified detection results to refine future detections. Meanwhile, it exploits the observed but undetected failure records reported by the cloud operators to identify new types of failures. We have implemented a prototype of the algorithm and conducted experiments in an on-campus cloud computing environment. Our experimental results show that AAD can achieve more efficient and accurate failure detection than other existing scheme.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131403111","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Designing dynamically robust protocols is not a simple task with current classic work-conserving scheduling, where packets are sent out as soon as processing and transmission capacity is available. We show that deviating from this fundamental queuing assumption leads to much more controllable and analyzable forms of protocols. At the core of our work is a queue-scheduling discipline based on the chemical "Law of Mass Action" (LoMA) that serves a queue with a rate proportional to its fill level. In this paper we introduce our LoMA-scheduling approach and provide a solid mathematical framework adopted from chemistry that simplifies the analysis of the corresponding queueing networks, including the prediction of the underlying protocols' dynamics. We demonstrate the elegance of our model by implementing and analyzing a TCP-compatible "chemical" congestion control algorithm C3A with only a few interacting queues (another novelty of our approach). We also show the application of our theory to gossip protocols, explain an effective implementation of the scheduler and discuss possibilities of how to integrate mass-action scheduling into traditional networking environments.
{"title":"A Theory of Packet Flows Based on Law-of-Mass-Action Scheduling","authors":"Thomas Meyer, C. Tschudin","doi":"10.1109/SRDS.2012.2","DOIUrl":"https://doi.org/10.1109/SRDS.2012.2","url":null,"abstract":"Designing dynamically robust protocols is not a simple task with current classic work-conserving scheduling, where packets are sent out as soon as processing and transmission capacity is available. We show that deviating from this fundamental queuing assumption leads to much more controllable and analyzable forms of protocols. At the core of our work is a queue-scheduling discipline based on the chemical \"Law of Mass Action\" (LoMA) that serves a queue with a rate proportional to its fill level. In this paper we introduce our LoMA-scheduling approach and provide a solid mathematical framework adopted from chemistry that simplifies the analysis of the corresponding queueing networks, including the prediction of the underlying protocols' dynamics. We demonstrate the elegance of our model by implementing and analyzing a TCP-compatible \"chemical\" congestion control algorithm C3A with only a few interacting queues (another novelty of our approach). We also show the application of our theory to gossip protocols, explain an effective implementation of the scheduler and discuss possibilities of how to integrate mass-action scheduling into traditional networking environments.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"744 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122983380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Randomized Byzantine Consensus can be an interesting building block in the implementation of asynchronous distributed systems. Despite its exponential worst-case complexity, which would make it less appealing in practice, a few experimental works have argued quite the opposite. To bridge the gap between theory and practice, we analyze a well-known state-of-the-art algorithm in normal system conditions, in which crash failures may occur but no malicious attacks, proving that it is fast on average. We then leverage our analysis to improve its best-case complexity from three to two phases, by reducing the communication operations through speculative executions. Our findings are confirmed through an experimental validation.
{"title":"Robust and Speculative Byzantine Randomized Consensus with Constant Time Complexity in Normal Conditions","authors":"Bruno Vavala, N. Neves","doi":"10.1109/SRDS.2012.62","DOIUrl":"https://doi.org/10.1109/SRDS.2012.62","url":null,"abstract":"Randomized Byzantine Consensus can be an interesting building block in the implementation of asynchronous distributed systems. Despite its exponential worst-case complexity, which would make it less appealing in practice, a few experimental works have argued quite the opposite. To bridge the gap between theory and practice, we analyze a well-known state-of-the-art algorithm in normal system conditions, in which crash failures may occur but no malicious attacks, proving that it is fast on average. We then leverage our analysis to improve its best-case complexity from three to two phases, by reducing the communication operations through speculative executions. Our findings are confirmed through an experimental validation.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116191826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sebastiano Peluso, João Fernandes, P. Romano, F. Quaglia, L. Rodrigues
This paper introduces SPECULA, a novel replication protocol for Software Transactional Memory (STM) systems that seeks maximum overlap between transaction execution and replica synchronization phases via speculative processing techniques. By removing the replica synchronization phase from the critical path of execution of transactions, SPECULA allows threads to speculatively pipeline the execution of both transactional and/or non-transactional code. The core of SPECULA is a multi-version concurrency control algorithm that supports speculative transaction processing while ensuring the strong consistency criteria that are desirable in non-sand-boxed environments like STMs. Via an experimental study, based on a fully-fledged prototype and on both synthetic and standard STM benchmarks, we demonstrate that SPECULA can achieve speedups of up to one order of magnitude with respect to state-of-the-art non-speculative replication techniques.
{"title":"SPECULA: Speculative Replication of Software Transactional Memory","authors":"Sebastiano Peluso, João Fernandes, P. Romano, F. Quaglia, L. Rodrigues","doi":"10.1109/SRDS.2012.67","DOIUrl":"https://doi.org/10.1109/SRDS.2012.67","url":null,"abstract":"This paper introduces SPECULA, a novel replication protocol for Software Transactional Memory (STM) systems that seeks maximum overlap between transaction execution and replica synchronization phases via speculative processing techniques. By removing the replica synchronization phase from the critical path of execution of transactions, SPECULA allows threads to speculatively pipeline the execution of both transactional and/or non-transactional code. The core of SPECULA is a multi-version concurrency control algorithm that supports speculative transaction processing while ensuring the strong consistency criteria that are desirable in non-sand-boxed environments like STMs. Via an experimental study, based on a fully-fledged prototype and on both synthetic and standard STM benchmarks, we demonstrate that SPECULA can achieve speedups of up to one order of magnitude with respect to state-of-the-art non-speculative replication techniques.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129786474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We present two new key generation schemes for secure communication between a pair of mobile nodes (cell phones). Unlike existing algorithms, our scheme does not (a) store a key chain in the memory from a universal key space, (b) use key broadcast, (c) distribute selected keys to the network nodes, and (d) use database of keys for selecting keys for communication. Rather, the pair of nodes that want to communicate securely generate identical keys independently with the help of a head node. We show the behavior of these schemes through a simple analytical model.
{"title":"Pairwise Key Generation Scheme for Cellular Mobile Communication","authors":"Chetan Jaiswal, Vijay Kumar","doi":"10.1109/SRDS.2012.48","DOIUrl":"https://doi.org/10.1109/SRDS.2012.48","url":null,"abstract":"We present two new key generation schemes for secure communication between a pair of mobile nodes (cell phones). Unlike existing algorithms, our scheme does not (a) store a key chain in the memory from a universal key space, (b) use key broadcast, (c) distribute selected keys to the network nodes, and (d) use database of keys for selecting keys for communication. Rather, the pair of nodes that want to communicate securely generate identical keys independently with the help of a head node. We show the behavior of these schemes through a simple analytical model.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121699903","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaoyan Yin, Javier Alonso, F. Machida, E. Andrade, Kishor S. Trivedi
Data backup operation is an essential part of common IT system administration to protect against data loss caused by any storage failures, human errors, or disasters. Lost data can be recovered from the backed up data if it exists. Since the backup and restore operations accrue downtime overhead or performance degradation, they have to be designed to ensure the data reliability while minimizing the performance and availability overhead. In this paper, we study the impacts of different backup policies on availability measures such as storage availability, system availability, and user-perceived availability. Backup and restore operations are designed using SysML Activity diagrams that are automatically translated into Stochastic Reward Net (SRN) to compute the availability measures. Our numerical results show the effectiveness of the combination of full backup and partial backup in terms of user-perceived data availability and data loss rate. Furthermore, the sensitivity ranking can help improve the availability measures.
{"title":"Availability Modeling and Analysis for Data Backup and Restore Operations","authors":"Xiaoyan Yin, Javier Alonso, F. Machida, E. Andrade, Kishor S. Trivedi","doi":"10.1109/SRDS.2012.9","DOIUrl":"https://doi.org/10.1109/SRDS.2012.9","url":null,"abstract":"Data backup operation is an essential part of common IT system administration to protect against data loss caused by any storage failures, human errors, or disasters. Lost data can be recovered from the backed up data if it exists. Since the backup and restore operations accrue downtime overhead or performance degradation, they have to be designed to ensure the data reliability while minimizing the performance and availability overhead. In this paper, we study the impacts of different backup policies on availability measures such as storage availability, system availability, and user-perceived availability. Backup and restore operations are designed using SysML Activity diagrams that are automatically translated into Stochastic Reward Net (SRN) to compute the availability measures. Our numerical results show the effectiveness of the combination of full backup and partial backup in terms of user-perceived data availability and data loss rate. Furthermore, the sensitivity ranking can help improve the availability measures.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115166162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Vehicular Ad-hoc Networks (VANETs) form the basis for critical services that improve traffic safety and alleviate traffic congestion. The reliability of VANET-based services and applications that are based solely on vehicle-to-vehicle (V2V) communications, however, is hindered due primarily to limited and often fluctuating V2V communications. To address this limitation, Road-Side Units (RSU) have been proposed to complement V2V communications by providing stable event and data brokering capability. Effective placement of the RSUs is a key requirement in improving reliability of VANET services. This poster describes a novel Voronoi network-based algorithm for the effective placement of RSUs. The reliability metric considered in placing the RSUs involves bounding both the delay incurred by communication packets and packet loss, which in turn ensure timeliness and correct operation of the VANET services.
{"title":"Improving the Reliability and Availability of Vehicular Communications Using Voronoi Diagram-Based Placement of Road Side Units","authors":"Prithviraj Patil, A. Gokhale","doi":"10.1109/SRDS.2012.39","DOIUrl":"https://doi.org/10.1109/SRDS.2012.39","url":null,"abstract":"Vehicular Ad-hoc Networks (VANETs) form the basis for critical services that improve traffic safety and alleviate traffic congestion. The reliability of VANET-based services and applications that are based solely on vehicle-to-vehicle (V2V) communications, however, is hindered due primarily to limited and often fluctuating V2V communications. To address this limitation, Road-Side Units (RSU) have been proposed to complement V2V communications by providing stable event and data brokering capability. Effective placement of the RSUs is a key requirement in improving reliability of VANET services. This poster describes a novel Voronoi network-based algorithm for the effective placement of RSUs. The reliability metric considered in placing the RSUs involves bounding both the delay incurred by communication packets and packet loss, which in turn ensure timeliness and correct operation of the VANET services.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131605810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The eventual goal of any notification system is to deliver appropriate messages to all relevant recipients with very high reliability in a timely manner. In particular, we focus on notification in extreme situations (e.g. disasters) where geographically correlated failures hinder the ability to reach recipients inside the corresponding failed region. In this paper, we present GSFord, a reliable geo-social notification system that is aware of (a) the geographies in which the message needs to be disseminated and (b) the social network characteristics of the intended recipient, in order to maximize/increase the coverage and reliability. GSFord builds robust geo-aware P2P overlays to provide efficient location-based message delivery and reliable storage of geo-social information of recipients. When an event occurs, GSFord is able to efficiently deliver the message to recipients who are either (a) located in the event area or (b) socially correlated to the event (e.g. relatives/friends of those who are impacted by an event). Furthermore, GSFord leverages the geo-social information to trigger a social diffusion process, which operates through out-of band channels such as phone calls and human contacts, in order to reach recipients which are isolated in the failed region. Through extensive evaluations, we show that GSFord is reliable, the social diffusion process enhanced by GSFord reaches up to 99.9% of desired recipients even under massive geographically correlated regional failures. We also show that GSFord is efficient even under skewed distribution of user populations.
{"title":"GSFord: Towards a Reliable Geo-social Notification System","authors":"Kyungbaek Kim, Ye Zhao, N. Venkatasubramanian","doi":"10.1109/SRDS.2012.35","DOIUrl":"https://doi.org/10.1109/SRDS.2012.35","url":null,"abstract":"The eventual goal of any notification system is to deliver appropriate messages to all relevant recipients with very high reliability in a timely manner. In particular, we focus on notification in extreme situations (e.g. disasters) where geographically correlated failures hinder the ability to reach recipients inside the corresponding failed region. In this paper, we present GSFord, a reliable geo-social notification system that is aware of (a) the geographies in which the message needs to be disseminated and (b) the social network characteristics of the intended recipient, in order to maximize/increase the coverage and reliability. GSFord builds robust geo-aware P2P overlays to provide efficient location-based message delivery and reliable storage of geo-social information of recipients. When an event occurs, GSFord is able to efficiently deliver the message to recipients who are either (a) located in the event area or (b) socially correlated to the event (e.g. relatives/friends of those who are impacted by an event). Furthermore, GSFord leverages the geo-social information to trigger a social diffusion process, which operates through out-of band channels such as phone calls and human contacts, in order to reach recipients which are isolated in the failed region. Through extensive evaluations, we show that GSFord is reliable, the social diffusion process enhanced by GSFord reaches up to 99.9% of desired recipients even under massive geographically correlated regional failures. We also show that GSFord is efficient even under skewed distribution of user populations.","PeriodicalId":447700,"journal":{"name":"2012 IEEE 31st Symposium on Reliable Distributed Systems","volume":"18 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130754737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：