Proceedings. International Conference on Dependable Systems and Networks最新文献_第4页

Generic timing fault tolerance using a timely computing base 通用时序容错使用及时计算库

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028883

A. Casimiro, P. Veríssimo

{"title":"Generic timing fault tolerance using a timely computing base","authors":"A. Casimiro, P. Veríssimo","doi":"10.1109/DSN.2002.1028883","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028883","url":null,"abstract":"Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper we follow the perspective of timing fault tolerance: tinting errors occur and they are processed using redundancy, e.g., component replication, to recover and deliver timely service. We introduce a paradigm for generic tinting fault tolerance with replicated state machines. The paradigm is based on the existence of Timing Failure Detection with tinted completeness and accuracy properties. Generic timing fault tolerance implies the ability to dependably observe the system and to timely notify timing failures, which we discuss in the paper On the other hand, it ensures replica determinism with respect to time (temporal consistency), and safety in case of spare exhaustion. We show that the paradigm can be addressed and realized in the framework of the timely computing base (TCB) model and architecture. Furthermore, we illustrate the generality, of our approach by reviewing previous existing solutions and by showing that in contrast with ours, they, only secure a restricted semantics, or simply provide ad-hoc solutions.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"1 1","pages":"27-36"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82998908","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}

引用次数: 17

Resource management policies in GPRS wireless internet access systems GPRS无线互联网接入系统中的资源管理策略

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1029016

M. Meo, M. Marsan, Cecilia Batetta

{"title":"Resource management policies in GPRS wireless internet access systems","authors":"M. Meo, M. Marsan, Cecilia Batetta","doi":"10.1109/DSN.2002.1029016","DOIUrl":"https://doi.org/10.1109/DSN.2002.1029016","url":null,"abstract":"In this paper we consider the problem of resource management in GSM/GPRS cellular networks offering not only mobile telephony services, but also data services for the wireless access to the Internet. In particular we investigate channel allocation policies that can provide a good tradeoff between the QoS guaranteed to voice and data services end users, considering three different alternatives, and developing analytical techniques for the assessment of their relative merits. The first channel allocation policy is called voice priority, since it gives priority to voice in the access to radio channels; we show that this policy cannot provide acceptable performance to data services, and we discuss the reasons for this shortcoming. The second channel allocation policy is called R-reservation; it statically reserves a fixed number of channels to data services, thus drastically improving their performance, but subtracting resources from voice users, even when these are not needed for data, thus inducing an unnecessary performance degradation for voice services. The third channel allocation policy is called dynamic reservation; as the name implies, it dynamically allocates channels to data when necessary, using the information about the queue length of GPRS data units within the base station. A threshold on the queue length is used in order to decide when channels must be allocated to data. Numerical results, show that the dynamic reservation channel allocation policy can provide very effective performance tradeoffs for data and voice services, with the additional advantage of being easily managed through the setting of the threshold value.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"3 1","pages":"707-716"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80497567","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

CLAIRE: an event-driven simulation tool for test and validation of software programs 克莱儿:一个事件驱动的模拟工具，用于测试和验证软件程序

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028954

A. Carloganu, J. Raguideau

引用次数: 4

Developing a heterogeneous intrusion tolerant CORBA system 开发异构入侵容忍CORBA系统

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028905

D. Sames, B. Matt, B. Niebuhr, G. Tally, B. Whitmore, D. Bakken

{"title":"Developing a heterogeneous intrusion tolerant CORBA system","authors":"D. Sames, B. Matt, B. Niebuhr, G. Tally, B. Whitmore, D. Bakken","doi":"10.1109/DSN.2002.1028905","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028905","url":null,"abstract":"Intrusion tolerant systems provide high-integrity and high-availability services to their clients in the face of successful attacks from an adversary. The Intrusion Tolerant Distributed Object Systems (ITDOS) research project is developing an architecture for a heterogeneous intrusion tolerant distributed object system. ITDOS integrates a Byzantine Fault Tolerant multicast protocol into an open-source CORBA ORB to provide intrusion tolerant middleware. This foundation allows up to f simultaneous Byzantine failures of replicated servers in a system of at least 3f+1 replicas. Voting on unmarshalled CORBA messages allows heterogeneous application implementations for a given service, allowing for greater diversity in implementation and greater survivability. Symmetric encryption session keys generated by distributed pseudo-random function techniques provide confidential client-server communications. This paper overviews the ITDOS architecture, discusses some of the challenging technical issues related to intrusion tolerance in heterogeneous middleware systems, and offers views on future areas of work.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"9 1","pages":"239-248"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76370254","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

Robust software - no more excuses 强大的软件-没有更多的借口

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028895

John DeVale, P. Koopman

引用次数: 27

Detecting processor hardware faults by means of automatically generated virtual duplex systems 利用自动生成的虚拟双工系统检测处理器硬件故障

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028925

M. Jochim

引用次数: 12

SWIM: scalable weakly-consistent infection-style process group membership protocol SWIM:可伸缩的弱一致感染式进程组成员协议

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028914

Abhinandan Das, Indranil Gupta, Ashish Motivala

{"title":"SWIM: scalable weakly-consistent infection-style process group membership protocol","authors":"Abhinandan Das, Indranil Gupta, Ashish Motivala","doi":"10.1109/DSN.2002.1028914","DOIUrl":"https://doi.org/10.1109/DSN.2002.1028914","url":null,"abstract":"Several distributed peer-to-peer applications require weakly-consistent knowledge of process group membership information at all participating processes. SWIM is a generic software module that offers this service for large scale process groups. The SWIM effort is motivated by the unscalability of traditional heart-beating protocols, which either impose network loads that grow quadratically with group size, or compromise response times or false positive frequency w.r.t. detecting process crashes. This paper reports on the design, implementation and performance of the SWIM sub-system on a large cluster of commodity PCs. Unlike traditional heart beating protocols, SWIM separates the failure detection and membership update dissemination functionalities of the membership protocol. Processes are monitored through an efficient peer-to-peer periodic randomized probing protocol. Both the expected time to first detection of each process failure, and the expected message load per member do not vary with group size. Information about membership changes, such as process joins, drop-outs and failures, is propagated via piggybacking on ping messages and acknowledgments. This results in a robust and fast infection style (also epidemic or gossip-style) of dissemination. The rate of false failure detections in the SWIM system is reduced by modifying the protocol to allow group members to suspect a process before declaring it as failed - this allows the system to discover and rectify false failure detections. Finally, the protocol guarantees a deterministic time bound to detect failures. Experimental results from the SWIM prototype are presented. We discuss the extensibility of the design to a WAN-wide scale.","PeriodicalId":93807,"journal":{"name":"Proceedings. International Conference on Dependable Systems and Networks","volume":"6 1","pages":"303-312"},"PeriodicalIF":0.0,"publicationDate":"2002-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81743479","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}

引用次数: 176

An adaptive architecture for monitoring and failure analysis of high-speed networks 一种高速网络监测与故障分析的自适应体系结构

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028888

Benjamin Floering, B. Brothers, Z. Kalbarczyk, R. Iyer

引用次数: 5

Model checking safety properties of servo-loop control systems 伺服环控制系统安全特性的模型校核

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1028885

Paul Ammann, Wei Ding, Daling Xu

引用次数: 9

Evaluation of the maximum level reached by a queue over a finite period 对队列在有限时间内达到的最大级别进行评估

Proceedings. International Conference on Dependable Systems and Networks Pub Date : 2002-06-23 DOI: 10.1109/DSN.2002.1029019

G. Rubino

引用次数: 1