Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311892
Gal Badishi, I. Keidar, Amir Sasson
We propose a framework and methodology for quantifying the effect of denial of service (DoS) attacks on a distributed system. We present a systematic study of the resistance of gossip-based multicast protocols to DoS attacks. We show that even distributed and randomized gossip-based protocols, which eliminate single points of failure, do not necessarily eliminate vulnerabilities to DoS attacks. We propose Drum - a simple gossip-based multicast protocol that eliminates such vulnerabilities. Drum was implemented in Java and tested on a large cluster. We show, using closed-form mathematical analysis, simulations, and empirical tests, that Drum survives severe DoS attacks.
{"title":"Exposing and eliminating vulnerabilities to denial of service attacks in secure gossip-based multicast","authors":"Gal Badishi, I. Keidar, Amir Sasson","doi":"10.1109/DSN.2004.1311892","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311892","url":null,"abstract":"We propose a framework and methodology for quantifying the effect of denial of service (DoS) attacks on a distributed system. We present a systematic study of the resistance of gossip-based multicast protocols to DoS attacks. We show that even distributed and randomized gossip-based protocols, which eliminate single points of failure, do not necessarily eliminate vulnerabilities to DoS attacks. We propose Drum - a simple gossip-based multicast protocol that eliminates such vulnerabilities. Drum was implemented in Java and tested on a large cluster. We show, using closed-form mathematical analysis, simulations, and empirical tests, that Drum survives severe DoS attacks.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130358024","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311933
Rajesh Venkatasubramanian, J. Hayes
Transmitting messages in mobile wireless networks typically involves on-demand route discovery implemented via network-wide broadcast. Due to the dynamic nature of the network topology the life-time of a route is very short, so a source frequently requires a new route to an old destination. Simultaneous discovery of multiple routes can reduce the overhead due to repeated route discovery broadcasts. Previously proposed multipath protocols do not guarantee discovery of alternative paths if they exist. We propose a multiple route discovery algorithm (ALTDSR) that finds a (multihop) primary path between a source and a destination, and a set of alternative paths. We introduce dominator relationships between primary and non-primary path nodes. Using dominators, we characterize alternative paths that bypass an intermediate node on the primary path. We develop algorithms that guarantee finding a set of alternative paths to tolerate any single node fault on the primary path, if such a set of alternative paths exists. We present simulation results which show that under high mobility conditions, ALTDSR delivers substantially more packets (around 75% more) than dynamic source routing (DSR) with moderate increase in routing overhead.
{"title":"Discovering 1-FT routes in mobile ad hoc networks","authors":"Rajesh Venkatasubramanian, J. Hayes","doi":"10.1109/DSN.2004.1311933","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311933","url":null,"abstract":"Transmitting messages in mobile wireless networks typically involves on-demand route discovery implemented via network-wide broadcast. Due to the dynamic nature of the network topology the life-time of a route is very short, so a source frequently requires a new route to an old destination. Simultaneous discovery of multiple routes can reduce the overhead due to repeated route discovery broadcasts. Previously proposed multipath protocols do not guarantee discovery of alternative paths if they exist. We propose a multiple route discovery algorithm (ALTDSR) that finds a (multihop) primary path between a source and a destination, and a set of alternative paths. We introduce dominator relationships between primary and non-primary path nodes. Using dominators, we characterize alternative paths that bypass an intermediate node on the primary path. We develop algorithms that guarantee finding a set of alternative paths to tolerate any single node fault on the primary path, if such a set of alternative paths exists. We present simulation results which show that under high mobility conditions, ALTDSR delivers substantially more packets (around 75% more) than dynamic source routing (DSR) with moderate increase in routing overhead.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125886313","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311957
A. Albinet, J. Arlat, J. Fabre
Drivers are becoming the larger part of operating systems kernels. Previous studies have shown that device drivers seem to be one of the most important sources of operating systems misbehavior. Their failure can have significant impact on the kernel and cause significant damages to the system as a whole. To objectively characterize the impact of faulty drivers, we have carried out a series of fault injection experiments. To conduct these experiments we have targeted the DPI (Driver Programming Interface) that implements the way device drivers interact with the kernel. Faults are injected on the parameters of these kernel core Junctions. This allows for the derivation of useful results about the failure modes induced and thus characterization of the robustness of a target kernel with respect to faulty drivers. The information gathered also enables to improve these interaction facilities.
{"title":"Characterization of the impact of faulty drivers on the robustness of the Linux kernel","authors":"A. Albinet, J. Arlat, J. Fabre","doi":"10.1109/DSN.2004.1311957","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311957","url":null,"abstract":"Drivers are becoming the larger part of operating systems kernels. Previous studies have shown that device drivers seem to be one of the most important sources of operating systems misbehavior. Their failure can have significant impact on the kernel and cause significant damages to the system as a whole. To objectively characterize the impact of faulty drivers, we have carried out a series of fault injection experiments. To conduct these experiments we have targeted the DPI (Driver Programming Interface) that implements the way device drivers interact with the kernel. Faults are injected on the parameters of these kernel core Junctions. This allows for the derivation of useful results about the failure modes induced and thus characterization of the robustness of a target kernel with respect to faulty drivers. The information gathered also enables to improve these interaction facilities.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956302","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311949
Patrick Downey, R. Cardell-Oliver
Wireless sensor networks (WSNs) are large collections of resource limited nodes, densely deployed over a landscape. They gather and disseminate local data using multi-hop broadcasting. WSN design and deployment is hampered by currently limited knowledge of the performance characteristics of network nodes and protocols. Their systematic development, thus, requires a flexible simulation environment in which new models of specific node or network behaviours can be integrated easily. This paper introduces a loosely coupled, object oriented simulation environment for this task. The simulator is used to investigate the efficiency of flooding protocols in WSNs. For dense networks with noisy transmission, we show that using low transmission power maximizes time and resource efficiency and that the scalability of flooding for large networks is excellent. We demonstrate ways of improving flooding performance given specific deployment constraints.
{"title":"Evaluating the impact of limited resource on the performance of flooding in wireless sensor networks","authors":"Patrick Downey, R. Cardell-Oliver","doi":"10.1109/DSN.2004.1311949","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311949","url":null,"abstract":"Wireless sensor networks (WSNs) are large collections of resource limited nodes, densely deployed over a landscape. They gather and disseminate local data using multi-hop broadcasting. WSN design and deployment is hampered by currently limited knowledge of the performance characteristics of network nodes and protocols. Their systematic development, thus, requires a flexible simulation environment in which new models of specific node or network behaviours can be integrated easily. This paper introduces a loosely coupled, object oriented simulation environment for this task. The simulator is used to investigate the efficiency of flooding protocols in WSNs. For dense networks with noisy transmission, we show that using low transmission power maximizes time and resource efficiency and that the scalability of flooding for large networks is excellent. We demonstrate ways of improving flooding performance given specific deployment constraints.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126871109","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311937
D. Tang, Dileep Kumar, Sreeram Duvur, Øystein Torbjørnsen
Application server is a standard middleware platform for deploying Web-based business applications which typically require the underlying platform to deliver high system availability and to minimize loss of transactions. This paper presents a measurement-based availability modeling and analysis for a fault tolerant application server system - Sun Java System Application Server, Enterprise Edition 7. The study applies hierarchical Markov reward modeling techniques on the target software system. The model parameters are conservatively estimated from lab or field measurements. The uncertainty analysis method is used on the model to obtain average system availability and confidence intervals by randomly sampling from possible ranges of parameters that cannot be accurately measured in limited time frames or may vary widely in customer sites. As demonstrated in this paper, the combined use of lab measurement, analytical modeling, and uncertainty analysis is a useful evaluation approach which can provide a conservative availability assessment at stated confidence levels for a new software product.
应用服务器是一个标准的中间件平台，用于部署基于web的业务应用程序，这些应用程序通常需要底层平台来提供高系统可用性和最小化事务损失。本文针对一个容错应用服务器系统——Sun Java system application server, Enterprise Edition 7，提出了一种基于度量的可用性建模和分析方法。本研究将层次马尔可夫奖励建模技术应用于目标软件系统。模型参数是根据实验室或现场测量保守估计的。该模型采用不确定性分析方法，从有限时间内无法精确测量或在客户现场可能变化很大的参数可能范围内随机抽样，获得平均系统可用性和置信区间。如本文所示，实验室测量、分析建模和不确定性分析的结合使用是一种有用的评估方法，它可以在规定的置信度水平上为新软件产品提供保守的可用性评估。
{"title":"Availability measurement and modeling for an application server","authors":"D. Tang, Dileep Kumar, Sreeram Duvur, Øystein Torbjørnsen","doi":"10.1109/DSN.2004.1311937","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311937","url":null,"abstract":"Application server is a standard middleware platform for deploying Web-based business applications which typically require the underlying platform to deliver high system availability and to minimize loss of transactions. This paper presents a measurement-based availability modeling and analysis for a fault tolerant application server system - Sun Java System Application Server, Enterprise Edition 7. The study applies hierarchical Markov reward modeling techniques on the target software system. The model parameters are conservatively estimated from lab or field measurements. The uncertainty analysis method is used on the model to obtain average system availability and confidence intervals by randomly sampling from possible ranges of parameters that cannot be accurately measured in limited time frames or may vary widely in customer sites. As demonstrated in this paper, the combined use of lab measurement, analytical modeling, and uncertainty analysis is a useful evaluation approach which can provide a conservative availability assessment at stated confidence levels for a new software product.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132078694","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311885
P. Koopman, T. Chakravarty
Cyclic redundancy codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly less error detection capability than they might. An exhaustive exploration reveals that most previously published CRC polynomials are either inferior to alternatives or are only good choices for particular message lengths. Unfortunately these shortcomings and limitations often seem to be overlooked. This paper describes a polynomial selection process for embedded network applications and proposes a set of good general-purpose polynomials. A set of 35 new polynomials in addition to 13 previously published polynomials provides good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits.
{"title":"Cyclic redundancy code (CRC) polynomial selection for embedded networks","authors":"P. Koopman, T. Chakravarty","doi":"10.1109/DSN.2004.1311885","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311885","url":null,"abstract":"Cyclic redundancy codes (CRCs) provide a first line of defense against data corruption in many networks. Unfortunately, many commonly used CRC polynomials provide significantly less error detection capability than they might. An exhaustive exploration reveals that most previously published CRC polynomials are either inferior to alternatives or are only good choices for particular message lengths. Unfortunately these shortcomings and limitations often seem to be overlooked. This paper describes a polynomial selection process for embedded network applications and proposes a set of good general-purpose polynomials. A set of 35 new polynomials in addition to 13 previously published polynomials provides good performance for 3- to 16-bit CRCs for data word lengths up to 2048 bits.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117203368","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311950
G. Khanna, S. Bagchi, Yu-Sung Wu
In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by the SPIN protocol which uses metadata negotiation to minimize data transmissions. We propose a protocol called shortest path minded SPIN (SPMS) in which every node has a zone defined by its maximum transmission radius. A data source node advertises the availability of data to all the nodes in its zone. Any interested node requests the data and gets sent the data using multi-hop communication via the shortest path. The failure of any node in the path is detected and recovered using backup routes. We build simulation models to compare SPMS against SPIN. The simulation results show that SPMS reduces the delay over 10 times and consumes 30% less energy in the static failure free scenario. Even with the addition of mobility, SPMS outperforms SPIN by energy gains between 5% and 21%. An analytical model is also constructed to compare the two protocols under a simplified topology.
{"title":"Fault tolerant energy aware data dissemination protocol in sensor networks","authors":"G. Khanna, S. Bagchi, Yu-Sung Wu","doi":"10.1109/DSN.2004.1311950","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311950","url":null,"abstract":"In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by the SPIN protocol which uses metadata negotiation to minimize data transmissions. We propose a protocol called shortest path minded SPIN (SPMS) in which every node has a zone defined by its maximum transmission radius. A data source node advertises the availability of data to all the nodes in its zone. Any interested node requests the data and gets sent the data using multi-hop communication via the shortest path. The failure of any node in the path is detected and recovered using backup routes. We build simulation models to compare SPMS against SPIN. The simulation results show that SPMS reduces the delay over 10 times and consumes 30% less energy in the static failure free scenario. Even with the addition of mobility, SPMS outperforms SPIN by energy gains between 5% and 21%. An analytical model is also constructed to compare the two protocols under a simplified topology.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122045076","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311905
Soila M. Pertet, P. Narasimhan
Unanticipated runtime events, such as faults, can lead to missed deadlines in real-time systems. While it is not always possible to know when a fault will occur, we can sometimes exploit pre-fault "symptoms" to initiate proactive (rather than reactive) fault-recovery. In this paper, we describe the design and implementation of a proactive recovery strategy for distributed CORBA applications in the presence of resource-exhaustion faults. We analyze the effect of different proactive recovery schemes on client/server response times, and we demonstrate a significant reduction, both in jitter and in the number of client-side failures.
{"title":"Proactive recovery in distributed CORBA applications","authors":"Soila M. Pertet, P. Narasimhan","doi":"10.1109/DSN.2004.1311905","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311905","url":null,"abstract":"Unanticipated runtime events, such as faults, can lead to missed deadlines in real-time systems. While it is not always possible to know when a fault will occur, we can sometimes exploit pre-fault \"symptoms\" to initiate proactive (rather than reactive) fault-recovery. In this paper, we describe the design and implementation of a proactive recovery strategy for distributed CORBA applications in the presence of resource-exhaustion faults. We analyze the effect of different proactive recovery schemes on client/server response times, and we demonstrate a significant reduction, both in jitter and in the number of client-side failures.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131414283","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311896
P. Popov, B. Littlewood
Previous models have investigated the impact upon diversity - and hence upon the reliability of fault-tolerant software built from 'diverse' versions - of the variation in 'difficulty' of demands over the demand space. These models are essentially static, taking a single snapshot view of the system. In this paper, we consider a generalisation in which the individual versions are allowed to evolve - and their reliability to grow - through debugging. In particular, we examine the trade-off that occurs in testing between, on the one hand, the increasing reliability of individual versions, and on the other hand the possible diminution of diversity.
{"title":"The effect of testing on reliability of fault-tolerant software","authors":"P. Popov, B. Littlewood","doi":"10.1109/DSN.2004.1311896","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311896","url":null,"abstract":"Previous models have investigated the impact upon diversity - and hence upon the reliability of fault-tolerant software built from 'diverse' versions - of the variation in 'difficulty' of demands over the demand space. These models are essentially static, taking a single snapshot view of the system. In this paper, we consider a generalisation in which the individual versions are allowed to evolve - and their reliability to grow - through debugging. In particular, we examine the trade-off that occurs in testing between, on the one hand, the increasing reliability of individual versions, and on the other hand the possible diminution of diversity.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131921394","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}
Pub Date : 2004-06-28DOI: 10.1109/DSN.2004.1311916
Lan Wang, D. Massey, K. Patel, Lixia Zhang
This paper presents a scalable mechanism, fast routing table recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of today's global routing table makes the conventional periodic update approach, used by most routing protocols, infeasible. FRTR lets neighboring routers periodically exchange Bloom filter digests of their routing state. The digest exchanges not only enable the detection of potential inconsistencies during normal operations, but also speed up recovery after a BGP session reset. FRTR achieves low bandwidth overhead by using small digests, and it achieves strong consistency by "salting" the digests with random seeds to remove false-positives. Our analysis and simulation results show that, with one round of message exchanges, FRTR can detect and recover over 91% of random errors that the current BGP would have missed with an overhead as low as 1.3% of a full routing table exchange. With salted digests FRTR can detect and recover all the errors with a probability close to 100% after a few rounds of message exchanges.
{"title":"FRTR: a scalable mechanism for global routing table consistency","authors":"Lan Wang, D. Massey, K. Patel, Lixia Zhang","doi":"10.1109/DSN.2004.1311916","DOIUrl":"https://doi.org/10.1109/DSN.2004.1311916","url":null,"abstract":"This paper presents a scalable mechanism, fast routing table recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of today's global routing table makes the conventional periodic update approach, used by most routing protocols, infeasible. FRTR lets neighboring routers periodically exchange Bloom filter digests of their routing state. The digest exchanges not only enable the detection of potential inconsistencies during normal operations, but also speed up recovery after a BGP session reset. FRTR achieves low bandwidth overhead by using small digests, and it achieves strong consistency by \"salting\" the digests with random seeds to remove false-positives. Our analysis and simulation results show that, with one round of message exchanges, FRTR can detect and recover over 91% of random errors that the current BGP would have missed with an overhead as low as 1.3% of a full routing table exchange. With salted digests FRTR can detect and recover all the errors with a probability close to 100% after a few rounds of message exchanges.","PeriodicalId":436323,"journal":{"name":"International Conference on Dependable Systems and Networks, 2004","volume":"256 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116588192","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
扫码关注我们
求助内容：
应助结果提醒方式：