37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)最新文献_第4页

A Lightweight Mechanism for Dependable Communication in Untrusted Networks 非可信网络中可靠通信的轻量级机制

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.9

M. Rogers, S. Bhatti

{"title":"A Lightweight Mechanism for Dependable Communication in Untrusted Networks","authors":"M. Rogers, S. Bhatti","doi":"10.1109/DSN.2007.9","DOIUrl":"https://doi.org/10.1109/DSN.2007.9","url":null,"abstract":"We describe a method for enabling dependable forwarding of messages in untrusted networks. Nodes perform only relatively lightweight operations per message, and only the originator and destination need to trust each other. Whereas existing protocols for dependable communication rely on establishing a verifiable identity for every node, our protocol can operate in networks with unknown or varying membership and with no limits on the creation of new identities. Our protocol supports the maintenance of unlinkability: relays cannot tell whether a given originator and destination are communicating. The destination of each message generates an unforgeable acknowledgement (U-ACK) that allows relays and the originator to verify that the message was delivered unmodified to the destination, but relays do not need to share keys with the originator or destination, or to know their identities. Similarly, the endpoints do not need to know the identities of the relays. U-ACKs can be seen as a building block for dependable communication systems; they enable nodes to measure the level of service provided by their neighbours and optionally to adjust the level of service they provide in return, creating an incentive for nodes to forward messages. Our work is ongoing.","PeriodicalId":405751,"journal":{"name":"37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132261884","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}

引用次数: 5

Confidence: Its Role in Dependability Cases for Risk Assessment 信心:它在风险评估的可靠性案例中的作用

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.29

R. Bloomfield, B. Littlewood, David Wright

引用次数: 63

A Fast Rejuvenation Technique for Server Consolidation with Virtual Machines 服务器与虚拟机整合的快速复兴技术

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.6

Kenichi Kourai, S. Chiba

引用次数: 74

Assessing Robustness of Web-Services Infrastructures 评估web服务基础设施的健壮性

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.16

M. Vieira, N. Laranjeiro, H. Madeira

引用次数: 58

A Tunable Add-On Diagnostic Protocol for Time-Triggered Systems 时间触发系统的可调附加诊断协议

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.12

M. Serafini, N. Suri, J. Vinter, A. Ademaj, Wolfgang Brandstätter, Fulvio Tagliabo, Jens Koch

引用次数: 19

Bounding Peer-to-Peer Upload Traffic in Client Networks 客户端网络点对点上传流量绑定

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.24

Chun-Ying Huang, C. Lei

{"title":"Bounding Peer-to-Peer Upload Traffic in Client Networks","authors":"Chun-Ying Huang, C. Lei","doi":"10.1109/DSN.2007.24","DOIUrl":"https://doi.org/10.1109/DSN.2007.24","url":null,"abstract":"Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-to-peer traffic increases, a network administrator would like to control the network resources consumed by peer-to-peer applications. Due to the use of random ports and protocol encryption, it is hard to identify and apply proper control policies to peer-to-peer traffic. How do we properly bound the peer-to-peer traffic and prevent it from consuming all the available network resources? In this paper, we propose an algorithm that tries to approximately bound the network resources consumed by peer-to-peer traffic without examining packet payloads. Our methodology especially focuses on upload traffic for that the upload bandwidth for an ISP are usually more precious than download bandwidth. The method is constructed in two stages. First, we observe several traffic characteristics of peer-to-peer applications and traditional client-server based Internet services. We also observe the generic traffic properties in a client network. Then, based on the symmetry of network traffic in both temporal and spatial domains, we propose to use a bitmap filter to bound the network resources consumed by peer-to-peer applications. The proposed algorithm takes only constant storage and computation time. The evaluation also shows that with a small amount of memory, the peer-to-peer traffic can be properly bounded close to a predefined amount.","PeriodicalId":405751,"journal":{"name":"37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129199139","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

Understanding Resiliency of Internet Topology against Prefix Hijack Attacks 了解互联网拓扑对前缀劫持攻击的弹性

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.95

Mohit Lad, R. Oliveira, Beichuan Zhang, Lixia Zhang

引用次数: 79

E2EProf: Automated End-to-End Performance Management for Enterprise Systems E2EProf:企业系统的自动化端到端性能管理

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.38

S. Agarwala, Fernando Alegre, Karsten Schwan, Jegannathan Mehalingham

{"title":"E2EProf: Automated End-to-End Performance Management for Enterprise Systems","authors":"S. Agarwala, Fernando Alegre, Karsten Schwan, Jegannathan Mehalingham","doi":"10.1109/DSN.2007.38","DOIUrl":"https://doi.org/10.1109/DSN.2007.38","url":null,"abstract":"Distributed systems are becoming increasingly complex, caused by the prevalent use of Web services, multi-tier architectures, and grid computing, where dynamic sets of components interact with each other across distributed and heterogeneous computing infrastructures. For these applications to be able to predictably and efficiently deliver services to end users, it is therefore, critical to understand and control their runtime behavior. In a datacenter environment, for instance, understanding the end-to-end dynamic behavior of certain IT subsystems, from the time requests are made to when responses are generated and finally, received, is a key prerequisite for improving application response, to provide required levels of performance, or to meet service level agreements (SLAs). The E2EProf toolkit enables the efficient and nonintrusive capture and analysis of end-to-end program behavior for complex enterprise applications. E2EProf permits an enterprise to recognize and analyze performance problems when they occur - online, to take corrective actions as soon as possible and wherever necessary along the paths currently taken by user requests - end-to-end, and to do so without the need to instrument applications - nonintrusively. Online analysis exploits a novel signal analysis algorithm, termed pathmap, which dynamically detects the causal paths taken by client requests through application and backend servers and annotates these paths with end-to-end latencies and with the contributions to these latencies from different path components. Thus, with pathmap, it is possible to dynamically identify the bottlenecks present in selected servers or services and to detect the abnormal or unusual performance behaviors indicative of potential problems or overloads. Pathmap and the E2EProf toolkit successfully detect causal request paths and associated performance bottlenecks in the RUBiS ebay-like multi-tier Web application and in one of the datacenter of our industry partner, Delta Air Lines.","PeriodicalId":405751,"journal":{"name":"37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124557349","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}

引用次数: 77

Multiprocessors May Reduce System Dependability under File-Based Race Condition Attacks 在基于文件的竞争条件攻击下，多处理器可能降低系统的可靠性

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.67

Jinpeng Wei, C. Pu

{"title":"Multiprocessors May Reduce System Dependability under File-Based Race Condition Attacks","authors":"Jinpeng Wei, C. Pu","doi":"10.1109/DSN.2007.67","DOIUrl":"https://doi.org/10.1109/DSN.2007.67","url":null,"abstract":"Attacks exploiting race conditions have been considered rare and \"low risk\". However, the increasing popularity of multiprocessors has changed this situation: instead of waiting for the victim process to be suspended to carry out an attack, the attacker can now run on a dedicated processor and actively seek attack opportunities. This change from fortuitous encountering to active exploiting may greatly increase the success probability of race condition attacks. This point is exemplified by studying the TOCTTOU (Time-of- Check-to-Time-of-Use) race condition attacks in this paper. We first propose a probabilistic model for predicting TOCTTOU attack success rate on both uniprocessors and multiprocessors. Then we confirm the applicability of this model by carrying out TOCTTOU attacks against two widely used utility programs: vi and gedit. The success probability of attacking vi increases from low single digit percentage on a uniprocessor to almost 100% on a multiprocessor. Similarly, the success rate of attacking gedit jumps from almost zero to 83%. These case studies suggest that our model captures the sharply increased risks, and hence the decreased dependability of our systems, represented by race condition attacks such as TOCTTOU on the next generation multiprocessors.","PeriodicalId":405751,"journal":{"name":"37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123293315","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}

引用次数: 12

Fault Tolerant Planning for Critical Robots 关键机器人的容错规划

37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07) Pub Date : 2007-06-25 DOI: 10.1109/DSN.2007.50

B. Lussier, Matthieu Gallien, Jérémie Guiochet, F. Ingrand, M. Killijian, D. Powell

引用次数: 34