{"title":"Temporal Reasoning about Resources for Deadline Assurance in Distributed Systems","authors":"Xinghui Zhao, Nadeem Jamali","doi":"10.1109/ICDCSW.2010.31","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.31","url":null,"abstract":"In an open distributed system, computations can be carried out without statically owned resources, harnessing the collective compute power of the resources connected by the Internet. However, realizing this potential requires efficient and scalable resource discovery, coordination and control, which present challenges in a dynamic, open environment. We present ROTA, a resource-oriented temporal logic, which addresses these challenges by enabling computations to reason about future availability of resources. In ROTA, computational resources are defined over time and space, and represented using resource terms, which specify key attributes of resources. Syntax and semantics of ROTA are described. Theorems are derived to illustrate how the logic can be used to express resource properties of the system in time and space, track resource utilization, and calculate future availability of resources. Particularly, at any time, given a computation, it is possible to evaluate whether its deadline constraint can be assured by the available resources.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117040762","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}
A. J. Yuste, A. Triviño-Cabrera, F. D. Trujillo, E. Casilari-Pérez
{"title":"Improved Scheme for Adaptive Gateway Discovery in Hybrid MANET","authors":"A. J. Yuste, A. Triviño-Cabrera, F. D. Trujillo, E. Casilari-Pérez","doi":"10.1109/ICDCSW.2010.63","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.63","url":null,"abstract":"This paper presents an adaptive scheme for gateway discovery in MANETs connected to the Internet. Basically, the proposed scheme reduces the flooding processes related to gateway discovery. To do so, the algorithm dynamically adjusts the interval of emission of the gateway advertisement messages to the need for updated routes to the gateway. The tuning is supported by the analysis of the spatial distribution of nodes in the MANET and by the impact that the relative position of nodes has on the route lifetimes. The simulations show that the proposed adaptive mechanism outperforms the conventional schemes: it decreases network saturation while it achieves lower end-to-end delay and it minimizes the routing overhead.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129028797","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}
{"title":"Innovations and Advances in Adaptive Secure Message Oriented Middleware","authors":"R. Savola, H. Abie, J. Bigham, D. Rotondi","doi":"10.1109/ICDCSW.2010.70","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.70","url":null,"abstract":"Increasing requirements for the resilience, security, adaptation, intelligence and scalability of complex business critical systems have set new challenges for system developers and application designers. Messaging infrastructures are often used to implement systems of this type. We provide an overview of the main advances in the adaptive security, security metrics, vulnerability discovery, anomaly detection and authentication solutions of the GEMOM (Genetic Message Oriented Secure Middleware) research project and discuss exploitation possibilities.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121689665","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}
{"title":"Verification and Performance Evaluation of S-MAC Protocol Based on Process Calculi","authors":"R. Abo, Kamel Barkaoui, Karim D Djouani","doi":"10.1109/ICDCSW.2010.54","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.54","url":null,"abstract":"This paper relates to the formal analysis of S-MAC, a medium-access protocol designed for wireless sensor networks. We study the synchronization mechanism of mobile nodes and the 4-way handshake mechanism of the Carrier Sense Multiple Access with Collision Avoidance scheme implemented by S-MAC. We model these previous mechanisms with the $pi$-calculus and the proof of their deadlocks-freeness is achieved by using the Mobility Workbench tool. A performance evaluation of S-MAC is also conducted by modeling and simulating the communications between fixed nodes with the Performance Evaluation Process Algebra (PEPA). The performance measurements are carried-out with the PEPA Eclipse plug-in.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115631104","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}
{"title":"W-Coolstreaming a Protocol for Collaborative Data Streaming for Wireless Networks","authors":"R. Beraldi, Marco Galiffa, H. Alnuweiri","doi":"10.1109/ICDCSW.2010.78","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.78","url":null,"abstract":"Coolstreaming is one of the first and currently most popular collaborative content distribution system working over the Internet. Such a system has demonstrated how live video streaming can be delivered by exploiting the peer-to-peer (p2p) paradigm. In this paper we propose W-Coolstreaming, a porting of Coolstreaming tailored to work over a mobile wireless network. We show how porting the whole architecture as-is provides very poor performance, whereas the performance of our implementation, which takes the main peculiarities of the wireless environment into account, are very encouraging in terms of scalability and adaptability to topological changes.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126912556","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}
{"title":"GRAT: Group Reputation Aggregation Trust for Unstructured Peer-to-Peer Networks","authors":"Masanori Yasutomi, Yo Mashimo, H. Shigeno","doi":"10.1109/ICDCSW.2010.46","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.46","url":null,"abstract":"Peer-to-Peer (P2P) reputation aggregation methods are used to evaluate the trustworthiness of participating peers and to combat dishonest and malicious peer behaviors. The reputation aggregation method is to calculate the global reputation score from local score gained from each individual peer in P2P networks. On unstructured P2P networks, each individual peer exchanges own local score for other's local score and calculates the global reputation score. In this paper, we propose reputation aggregation method called GRAT (Group Reputation Aggregation Trust). The proposed method calculates global reputation scores by dividing entire peers into groups. Some peers create one group per a peer that is calculated global reputation score. Each peer exchanges local score among peers that belong to same group. Thus, even if the number of peers increases in the network, it takes shorter time to calculate global reputation score by using GRAT. Simulation results show that GRAT can efficiently exchange local score and accurately calculate global score in unstructured P2P networks.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126221251","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}
{"title":"The Insecurity of Time-of-Arrival Distance-Ranging in IEEE 802.11 Wireless Networks","authors":"Steve Glass, V. Muthukkumarasamy, M. Portmann","doi":"10.1109/ICDCSW.2010.59","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.59","url":null,"abstract":"Two-way Time-of-Arrival (TOA) distance-ranging is well-suited for use in IEEE 802.11 MANETs and wireless mesh networks because it is simple, efficient and does not require precise time synchronization between network stations. Despite its utility we show that this distance-ranging procedure is completely insecure and demonstrate how it can be subverted by a simple but highly effective attack. This attack allows the adversary comprehensive and fine-grained control over the distance reported by the procedure. Such adversaries can appear to be either much further away or much closer than they are in reality. We demonstrate the attack experimentally and also show how it can be implemented using ordinary wireless network interfaces. Finally, the necessary and sufficient conditions for the secure use of two-way TOA distance-ranging procedure in IEEE 802.11 wireless networks are identified.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114758850","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}
{"title":"A Hierarchical Formal Framework for Adaptive N-variant Programs in Multi-core Systems","authors":"Li Tan, A. Krings","doi":"10.1109/ICDCSW.2010.30","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.30","url":null,"abstract":"We propose a formal framework for designing and developing adaptive N-variant programs. The framework supports multiple levels of fault detection, masking, and recovery through reconfiguration. Our approach is two-fold: we introduce an Adaptive Functional Capability Model (AFCM) to define levels of functional capabilities for each service provided by the system. The AFCM specifies how, once a fault is detected, a system shall scale back its functional capabilities while still maintaining essential services. Next, we propose a Multilayered Assured Architecture Design (MAAD) to implement reconfiguration requirements specified by AFCMs. The layered design improves system resilience in two dimensions: (1) unlike traditional fault-tolerant architectures that treat functional requirements uniformly, each layer of the assured architecture implements a level of functional capability defined in AFCM. The architecture design uses lower-layer functionalities (which are simpler and more reliable) as reference to monitor highlayer functionalities. The layered design also facilitates an orderly system reconfiguration (resulting in graceful degradation) while maintaining essential system services. (2) Each layer of the assured architecture uses N-variant techniques to improve fault detection. The degree of redundancy introduced by Nvariant implementation determines the mix of faults that can be tolerated at each layer. Our hybrid fault model allows us to consider fault types ranging from benign faults to Byzantine faults. Last but not least, multi-layers combined with N-variant implementations are especially suitable for multi-core systems.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130022611","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}
{"title":"AMBER Roadmap: Ongoing Research Directions","authors":"A. Bondavalli, P. Lollini, M. Vadursi","doi":"10.1109/ICDCSW.2010.67","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.67","url":null,"abstract":"The main outcome of AMBER Coordination Action was a roadmap for research in technologies for assessment, measurement and benchmarking (AMB) of the resilience of information, computer and communication systems. The roadmap integrates the AMBER consortium experience in the field with the insights resulting from a long discussion on scenarios, drivers and inputs from stakeholders and experts. In this paper we concretely discuss some of the items composing the roadmap in the context of recently started European and National research projects in which the authors of this paper are involved.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133747199","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}
{"title":"Testing the Fidelity of an Emulab Testbed","authors":"A. Perez-Garcia, C. Siaterlis, M. Masera","doi":"10.1109/ICDCSW.2010.74","DOIUrl":"https://doi.org/10.1109/ICDCSW.2010.74","url":null,"abstract":"Studying the resilience of complex systems and Critical Infrastructures (CI), e.g., the Internet, in order to improve protection and response mechanisms is an important research activity due to their vital role in modern economy and society. Such studies are frequently based on experimentation using a) real systems, b) software simulation or c) hardware emulation. In this paper we present how our emulation testbed, based on Emulab, is able to realistically reproduce real system configurations (fidelity or system representativeness). We compare experimental results between two different emulation configurations against a reference configuration without use of emulation (real). Our results lead to two main contributions. First, we confirm that the current trend of using emulation testbeds is justified as both realistic and efficient. We highlight the fact that Emulab-based configurations are representative of real systems in terms of emerging behavior (qualitative) and that the interpretation of experimental results should not be based on absolute numbers, e.g., performance metrics, because exact values are highly hardware dependent. Secondly, we indicate that users of Emulab-based testbeds should favor the ”delay-nodeshaping” rather than the ”end-node-shaping” strategy because it frequently leads to more consistent results.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"101 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893582","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}