2014 IEEE 33rd International Symposium on Reliable Distributed Systems最新文献_第2页

AcTinG: Accurate Freerider Tracking in Gossip 表演:《绯闻》中准确的自由骑手追踪

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.12

Sonia Ben Mokhtar, Jérémie Decouchant, Vivien Quéma

{"title":"AcTinG: Accurate Freerider Tracking in Gossip","authors":"Sonia Ben Mokhtar, Jérémie Decouchant, Vivien Quéma","doi":"10.1109/SRDS.2014.12","DOIUrl":"https://doi.org/10.1109/SRDS.2014.12","url":null,"abstract":"Gossip-based content dissemination protocols are a scalable and cheap alternative to centralized content sharing systems. However, it is well known that these protocols suffer from rational nodes, i.e., nodes that aim at downloading the content without contributing their fair share to the system. While the problem of rational nodes that act individually has been well addressed in the literature, colluding rational nodes is still an open issue. Indeed, LiFTinG, the only existing gossip protocol addressing this issue, yields a high ratio of false positive accusations of correct nodes. In this paper, we propose AcTinG, a protocol that prevents rational collusions in gossip-based content dissemination protocols, while guaranteeing zero false positive accusations. We assess the performance of AcTinG on a testbed comprising 400 nodes running on 100 physical machines, and compare its behaviour in the presence of colluders against two state-of-the-art protocols: BAR Gossip that is the most robust protocol handling non-colluding rational nodes, and LiFTinG, the only existing gossip protocol that handles colluding nodes. The performance evaluation shows that AcTinG is able to deliver all messages despite the presence of colluders, whereas LiFTinG and BAR Gossip, both suffer heavy message losses. Finally, using simulations involving up to a million nodes, we show that AcTinG exhibits similar scalability properties as standard gossip-based dissemination protocols.","PeriodicalId":440331,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems","volume":"34 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123479026","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}

引用次数: 20

Dependable Admission Control for Mission-Critical Mobile Applications in Wireless Mesh Networks 无线网状网络中关键任务移动应用的可靠准入控制

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.39

Timo Lindhorst, B. Weseloh, E. Nett

引用次数: 1

DATAFLASKS: Epidemic Store for Massive Scale Systems DATAFLASKS:大规模系统的流行病存储

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.34

Francisco Maia, M. Matos, R. Vilaça, J. Pereira, R. Oliveira, E. Rivière

引用次数: 9

Transfer as a Service: Towards a Cost-Effective Model for Multi-site Cloud Data Management 传输即服务:迈向多站点云数据管理的经济高效模式

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.11

R. Tudoran, Alexandru Costan, Gabriel Antoniu

{"title":"Transfer as a Service: Towards a Cost-Effective Model for Multi-site Cloud Data Management","authors":"R. Tudoran, Alexandru Costan, Gabriel Antoniu","doi":"10.1109/SRDS.2014.11","DOIUrl":"https://doi.org/10.1109/SRDS.2014.11","url":null,"abstract":"The global deployment of cloud datacenters is enabling large web services to deliver fast response to users worldwide. This unprecedented geographical distribution of the computation also brings new challenges related to the efficient data management across sites. High throughput, low latencies, cost-or energy-related trade-offs are just a few concerns for both cloud providers and users when it comes to handling data across datacenters. Existing cloud data management solutions are limited to cloud-provided storage, which offers low performance based on rigid cost schemas. In this paper, we are proposing a dedicated cloud data transfer service that supports large-scale data dissemination across geographically distributed sites, advocating for a Transfer as a Service (TaaS) paradigm. The system aggregates the available bandwidth by enabling multiroute transfers across cloud sites. For users of multi-site or federated clouds, our proposal is able to decrease the variability of transfers and increase the throughput up to three times compared to baseline user options, while benefiting from the well-known high availability of cloud-provided services. For cloud providers, such a service can decrease the energy consumption within a datacenter down to half compared to user-based transfers.","PeriodicalId":440331,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132282148","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}

引用次数: 8

Device Collaboration for Stability Assurance in Distributed Cyber-Physical Systems 分布式网络物理系统稳定性保证的设备协作

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.22

Tao Li, Jiannong Cao

{"title":"Device Collaboration for Stability Assurance in Distributed Cyber-Physical Systems","authors":"Tao Li, Jiannong Cao","doi":"10.1109/SRDS.2014.22","DOIUrl":"https://doi.org/10.1109/SRDS.2014.22","url":null,"abstract":"Distributed Cyber-Physical Systems (DCPS) are special control systems because of involving distributed systems characteristics. To enable reliable DCPS, stability assurance is of utmost importance. But due to the system's distributed nature, network delay is inevitable and can affect stability adversely. Existing work to assure stability in DCPS has to rely on either a fixed and accurate model of network delay, or the scheduling of messages in the network. However, in reality, it is difficult to obtain an accurate network delay model to support the former approach, because the network can exhibit very complex behaviors. The latter approach also suffers from a notable problem, that is, message scheduling is often not allowed or supported by the network. In this paper, we propose a novel approach to overcome these drawbacks. We augment DCPS devices, including sensor, actuator and controller, with certain distributed intelligence. Thus, they can collaborate to understand the characteristics of network delay at runtime, and then adapt their behaviors accordingly to achieve stability. In this way, we avoid the reliance on network delay modeling and message scheduling, and also make DCPS adaptive to the dynamic network environment. Furthermore, we conduct theoretical analysis, and derive some stability criteria to guide the distributed collaboration and adaptation. The effectiveness of our approach has been validated in a simulated green building application.","PeriodicalId":440331,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125917553","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}

引用次数: 0

PROPS: A PRivacy-Preserving Location Proof System 道具:保护隐私的位置证明系统

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.37

S. Gambs, M. Killijian, Matthieu Roy, Moussa Traoré

引用次数: 35

A Practical Experience on the Impact of Plugins in Web Security 关于插件对Web安全影响的实践经验

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.20

C. M. D. Fonseca, M. Vieira

引用次数: 24

ByzID: Byzantine Fault Tolerance from Intrusion Detection 拜占庭:入侵检测的拜占庭容错

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.28

Sisi Duan, K. Levitt, H. Meling, S. Peisert, Haibin Zhang

引用次数: 21

End-to-End Congestion Control for Content-Based Networks 基于内容网络的端到端拥塞控制

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.24

A. Malekpour, Antonio Carzaniga, F. Pedone

{"title":"End-to-End Congestion Control for Content-Based Networks","authors":"A. Malekpour, Antonio Carzaniga, F. Pedone","doi":"10.1109/SRDS.2014.24","DOIUrl":"https://doi.org/10.1109/SRDS.2014.24","url":null,"abstract":"Publish/subscribe or \"push\" communication has been proposed as a new network service. In particular, in a content-based network, messages sent by publishers are delivered to subscribers based on the message content and on subscribers' long-term interests (subscriptions). In most systems that implement this form of communication, messages are treated as datagrams transmitted without end-to-end or in-network acknowledgments or without any form of flow control. In such systems, publishers do not avoid or even detect congestion, and brokers/routers respond to congestion by simply dropping overflowing messages. These systems are therefore unable to provide fair resource allocation and to properly handle traffic anomalies, and therefore are not suitable for large-scale deployments. With this motivation, we propose an end-to-end congestion control for content-based networks. In particular, we propose a practical and effective congestion-control protocol that is also content-aware, meaning that it modulates specific content-based traffic flows along a congested path. Inspired by an existing rate-control scheme for IP multicast, this protocol uses an equation-based flow-control algorithm that reacts to congestion in a manner similar to and compatible with TCP. We demonstrate experimentally that the protocol improves fairness among concurrent data flows and also reduces message loss significantly.","PeriodicalId":440331,"journal":{"name":"2014 IEEE 33rd International Symposium on Reliable Distributed Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126843404","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}

引用次数: 3

A Distributed NameNode Cluster for a Highly-Available Hadoop Distributed File System 高可用性Hadoop分布式文件系统的分布式NameNode集群

2014 IEEE 33rd International Symposium on Reliable Distributed Systems Pub Date : 2014-10-06 DOI: 10.1109/SRDS.2014.61

Yonghwan Kim, Tadashi Araragi, Junya Nakamura, T. Masuzawa

引用次数: 11