International Conference on Dependable Systems and Networks (DSN'06)最新文献

筛选
英文 中文
One-step Consensus with Zero-Degradation 零退化的一步共识
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.55
D. Dobre, N. Suri
{"title":"One-step Consensus with Zero-Degradation","authors":"D. Dobre, N. Suri","doi":"10.1109/DSN.2006.55","DOIUrl":"https://doi.org/10.1109/DSN.2006.55","url":null,"abstract":"In the asynchronous distributed system model, consensus is obtained in one communication step if all processes propose the same value. Assuming f<n/3, this is regardless of the failure detector output. A zero-degrading protocol reaches consensus in two communication steps in every stable run, i.e., when the failure detector makes no mistakes and its output does not change. We show that no leader-based consensus protocol can be simultaneously one-step and zero-degrading. We propose two approaches to circumvent the impossibility result and present corresponding consensus protocols. Further, we present an atomic broadcast protocol that has a latency of 3delta in every stable run and a latency of 2delta in case of no collisions. Finally, we evaluate its performance in a cluster of workstations","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"46 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131589139","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}
引用次数: 36
Honeypot-Aware Advanced Botnet Construction and Maintenance 蜜罐感知高级僵尸网络构建与维护
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.38
C. Zou, Ryan Cunningham
{"title":"Honeypot-Aware Advanced Botnet Construction and Maintenance","authors":"C. Zou, Ryan Cunningham","doi":"10.1109/DSN.2006.38","DOIUrl":"https://doi.org/10.1109/DSN.2006.38","url":null,"abstract":"Because \"botnets\" can be used for illicit financial gain, they have become quite popular in recent Internet attacks. \"Honeypots\" have been successfully deployed in many defense systems. Thus, attackers constructing and maintaining botnets are forced to find ways to avoid honeypot traps. In this paper, we present a hardware and software independent honeypot detection methodology based on the following assumption: security professionals deploying honeypots have liability constraints such that they cannot allow their honeypots to participate in real (or too many real) attacks. Based on this assumption, attackers can detect honeypots in their botnet by checking whether the compromised machines in the botnet can successfully send out unmodified malicious traffic to attackers' sensors or whether the bot controller in their botnet can successfully relay potential attack commands. In addition, we present a novel \"two-stage reconnaissance\" worm that can automatically construct a peer-to-peer structured botnet and detect and remove infected honeypots during its propagation stage. Finally, we discuss some guidelines for defending against the general honeypot-aware attacks","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128791212","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}
引用次数: 150
R-Opus: A Composite Framework for Application Performability and QoS in Shared Resource Pools R-Opus:共享资源池中应用程序性能和QoS的复合框架
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.59
L. Cherkasova, J. Rolia
{"title":"R-Opus: A Composite Framework for Application Performability and QoS in Shared Resource Pools","authors":"L. Cherkasova, J. Rolia","doi":"10.1109/DSN.2006.59","DOIUrl":"https://doi.org/10.1109/DSN.2006.59","url":null,"abstract":"We consider shared resource pool management taking into account per-application quality of service (QoS) requirements and server failures. Application QoS requirements are defined by complementary specifications for acceptable and time-limited degraded performance. Furthermore, a requirement specification is provided for both the normal case and for the case where an application server fails in the pool. Independently, the resource pool operator provides a resource access QoS commitment for two classes of service (CoS). These govern statistical multiplexing within the pool. A QoS translation automatically maps application demands onto the resource pool's CoS to best enable sharing. A workload placement service consolidates applications to a small number of servers while satisfying application QoS requirements. The service reports whether a spare server is needed or how applications affected by a single failure can operate according to failure QoS constraints using remaining servers until the failure can be repaired. A case study demonstrates the approach","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114883842","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}
引用次数: 32
Empirical and Analytical Evaluation of Systems with Multiple Unreliable Servers 多不可靠服务器系统的实证与分析评价
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.32
J. Palmer, I. Mitrani
{"title":"Empirical and Analytical Evaluation of Systems with Multiple Unreliable Servers","authors":"J. Palmer, I. Mitrani","doi":"10.1109/DSN.2006.32","DOIUrl":"https://doi.org/10.1109/DSN.2006.32","url":null,"abstract":"We construct, analyze and solve models of systems where a number of servers offer services to an incoming stream of demands. Each server goes through alternating periods of being operative and inoperative. The objective is to evaluate and optimize performance and cost metrics. A large real-life data set containing information about server breakdowns is analyzed first. The results indicate that the durations of the operative periods are not distributed exponentially. However, hyper exponential distributions are found to be a good fit for the observed data. A model based on these distributions is then formulated, and is solved exactly using the method of spectral expansion. A simple approximation which is accurate for heavily loaded systems is also proposed. The results of a number of numerical experiments are reported","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130455589","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}
引用次数: 10
Workshop on Applied Software Reliability (WASR) 应用软件可靠性研讨会
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.77
A. Agbaria, C. Basile, Z. Kalbarczyk
{"title":"Workshop on Applied Software Reliability (WASR)","authors":"A. Agbaria, C. Basile, Z. Kalbarczyk","doi":"10.1109/DSN.2006.77","DOIUrl":"https://doi.org/10.1109/DSN.2006.77","url":null,"abstract":"Research on software reliability has been active for several decades now and has produced massive amount of literature to explore new ideas, and system prototypes to experiment with the proposed ideas. Notwithstanding this proficiency, only in a few instances has research work found its way into industrial applications. This apparent uncoordination is exacerbated by the increasing need for quality and dependability guarantees in the more and more computerized modern world.","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130822870","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}
引用次数: 1
Storage Allocation in Unreliable Peer-to-Peer Systems 不可靠对等系统中的存储分配
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.67
J. Chandy
{"title":"Storage Allocation in Unreliable Peer-to-Peer Systems","authors":"J. Chandy","doi":"10.1109/DSN.2006.67","DOIUrl":"https://doi.org/10.1109/DSN.2006.67","url":null,"abstract":"Peer-to-peer systems provide the opportunity to pool large amounts of distributed resources to enable Internet-scale applications. However, the participant nodes are highly dynamic and unreliable. Thus, any shared resource such as file objects must incorporate redundancy to be useful. While many studies have proposed heuristics to determine redundancy levels based on object popularity, there has been little work in determining optimal or near-optimal resource allocation based on node reliability. In this paper, we present a strategy for the allocation of objects in the presence of dynamic and unreliable peers. We have built an availability model of peer-to-peer storage systems based on the bimodal and time-dependent availability characteristics of a P2P node. Using this model, we can select the size of a candidate node set for storage allocation and assign storage objects to maximize availability while still maintaining a balanced distribution of objects","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132492372","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}
引用次数: 7
Hotspots: The Root Causes of Non-Uniformity in Self-Propagating Malware 热点:自传播恶意软件不均匀性的根本原因
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.39
Evan Cooke, Z. Morley Mao, F. Jahanian
{"title":"Hotspots: The Root Causes of Non-Uniformity in Self-Propagating Malware","authors":"Evan Cooke, Z. Morley Mao, F. Jahanian","doi":"10.1109/DSN.2006.39","DOIUrl":"https://doi.org/10.1109/DSN.2006.39","url":null,"abstract":"Self-propagating malware like worms and bots can dramatically impact the availability and reliability of the Internet. Techniques for the detection and mitigation of Internet threats using content prevalence and scan detectors are based on assumptions of how threats propagate. Some of these assumptions have recently been called into question by observations of huge discrepancies in the quantity of specific threats detected at different points around the Internet. We call these deviations from uniform propagation \"hotspots\". This paper quantifies and explains these influences on malware propagation. We then propose that hotspots can be explained by two fundamental influences on propagation: algorithmic factors and environmental factors. We use measurement data from sensors deployed at 11 locations around the Internet to demonstrate the impact of these factors on worm and bot propagation. With this understanding, we simulate the outbreak of new threats with hotspots and show how algorithmic and environmental factors reduce the visibility of distributed detectors resulting in the inability to identify new threats","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123983472","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}
引用次数: 13
Efficient High Hamming Distance CRCs for Embedded Networks 用于嵌入式网络的高效高汉明距离crc
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.30
Justin Ray, P. Koopman
{"title":"Efficient High Hamming Distance CRCs for Embedded Networks","authors":"Justin Ray, P. Koopman","doi":"10.1109/DSN.2006.30","DOIUrl":"https://doi.org/10.1109/DSN.2006.30","url":null,"abstract":"Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techniques. 24- and 32-bit CRC computations are becoming necessary to provide sufficient error detection capability (Hamming distance) for critical embedded network applications. However, the computational cost of such CRCs can be too high for resource-constrained embedded systems, which are predominantly equipped with 8-bit microcontrollers that have limited computing power and small memory size. We evaluate the options for speeding up CRC computations on 8-bit processors, including comparing variants of table lookup approaches for memory cost and speed. We also evaluate classes of CRC generator polynomials which have the same computational cost as 24- or 16-bit CRCs, but provide 32-bit CRC levels of error detection, and recommend good polynomials within those classes for data word lengths typical of embedded networking applications","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115742170","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}
引用次数: 46
A Multi-Resolution Approach forWorm Detection and Containment 蠕虫检测和遏制的多分辨率方法
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.6
V. Sekar, Yinglian Xie, M. Reiter, Hui Zhang
{"title":"A Multi-Resolution Approach forWorm Detection and Containment","authors":"V. Sekar, Yinglian Xie, M. Reiter, Hui Zhang","doi":"10.1109/DSN.2006.6","DOIUrl":"https://doi.org/10.1109/DSN.2006.6","url":null,"abstract":"Despite the proliferation of detection and containment techniques in the worm defense literature, simple threshold-based methods remain the most widely deployed and most popular approach among practitioners. This popularity arises out of the simplistic appeal, ease of use, and independence from attack-specific properties such as scanning strategies and signatures. However, such approaches have known limitations: they either fail to detect low-rate attacks or incur very high false positive rates. We propose a multi-resolution approach to enhance the power of threshold-based detection and rate-limiting techniques. Using such an approach we can not only detect fast attacks with low latency, but also discover low-rate attacks - several orders of magnitude less aggressive than today's fast propagating attacks -with low false positive rates. We also outline a multi-resolution rate limiting mechanism for throttling the number of new connections a host can make, to contain the spread of worms. Our trace analysis and simulation experiments demonstrate the benefits of a multi-resolution approach for worm defense","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131394171","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}
引用次数: 55
An Approach for Detecting and Distinguishing Errors versus Attacks in Sensor Networks 传感器网络中错误与攻击的检测与区分方法
International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI: 10.1109/DSN.2006.11
C. Basile, M. Gupta, Z. Kalbarczyk, R. Iyer
{"title":"An Approach for Detecting and Distinguishing Errors versus Attacks in Sensor Networks","authors":"C. Basile, M. Gupta, Z. Kalbarczyk, R. Iyer","doi":"10.1109/DSN.2006.11","DOIUrl":"https://doi.org/10.1109/DSN.2006.11","url":null,"abstract":"Distributed sensor networks are highly prone to accidental errors and malicious activities, owing to their limited resources and tight interaction with the environment. Yet only a few studies have analyzed and coped with the effects of corrupted sensor data. This paper contributes with the proposal of an on-the-fly statistical technique that can detect and distinguish faulty data from malicious data in a distributed sensor network. Detecting faults and attacks is essential to ensure the correct semantic of the network, while distinguishing faults from attacks is necessary to initiate a correct recovery action. The approach uses hidden Markov models (HMMs) to capture the error/attack-free dynamics of the environment and the dynamics of error/attack data. It then performs a structural analysis of these HMMs to determine the type of error/attack affecting sensor observations. The methodology is demonstrated with real data traces collected over one month of observation from motes deployed on the Great Duck Island","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128368602","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}
引用次数: 34
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信