R. Ranchal, B. Bhargava, L. B. Othmane, L. Lilien, Anya Kim, Myong H. Kang, M. Linderman
Cloud computing allows the use of Internet-based services to support business processes and rental of IT-services on a utility-like basis. It offers a concentration of resources but also poses risks for data privacy. A single breach can cause significant loss. The heterogeneity of “users” represents a danger of multiple, collaborative threats. In cloud computing, entities may have multiple accounts associated with a single or multiple service providers (SPs). Sharing sensitive identity information (that is, Personally Identifiable information or PII) along with associated attributes of the same entity across services can lead to mapping of the identities to the entity, tantamount to privacy loss. Identity management (IDM) is one of the core components in cloud privacy and security and can help alleviate some of the problems associated with cloud computing. Available solutions use trusted third party (TTP) in identifying entities to SPs. The solution providers do not recommend the usage of their solutions on untrusted hosts. We propose an approach for IDM, which is independent of TTP and has the ability to use identity data on untrusted hosts. The approach is based on the use of predicates over encrypted data and multi-party computing for negotiating a use of a cloud service. It uses active bundle—which is a middleware agent that includes PII data, privacy policies, a virtual machine that enforces the policies, and has a set of protection mechanisms to protect itself. An active bundle interacts on behalf of a user to authenticate to cloud services using user’s privacy policies.
{"title":"Protection of Identity Information in Cloud Computing without Trusted Third Party","authors":"R. Ranchal, B. Bhargava, L. B. Othmane, L. Lilien, Anya Kim, Myong H. Kang, M. Linderman","doi":"10.1109/SRDS.2010.57","DOIUrl":"https://doi.org/10.1109/SRDS.2010.57","url":null,"abstract":"Cloud computing allows the use of Internet-based services to support business processes and rental of IT-services on a utility-like basis. It offers a concentration of resources but also poses risks for data privacy. A single breach can cause significant loss. The heterogeneity of “users” represents a danger of multiple, collaborative threats. In cloud computing, entities may have multiple accounts associated with a single or multiple service providers (SPs). Sharing sensitive identity information (that is, Personally Identifiable information or PII) along with associated attributes of the same entity across services can lead to mapping of the identities to the entity, tantamount to privacy loss. Identity management (IDM) is one of the core components in cloud privacy and security and can help alleviate some of the problems associated with cloud computing. Available solutions use trusted third party (TTP) in identifying entities to SPs. The solution providers do not recommend the usage of their solutions on untrusted hosts. We propose an approach for IDM, which is independent of TTP and has the ability to use identity data on untrusted hosts. The approach is based on the use of predicates over encrypted data and multi-party computing for negotiating a use of a cloud service. It uses active bundle—which is a middleware agent that includes PII data, privacy policies, a virtual machine that enforces the policies, and has a set of protection mechanisms to protect itself. An active bundle interacts on behalf of a user to authenticate to cloud services using user’s privacy policies.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130816285","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}
Mobile robot applications operating in wireless environments require fast detection of link failures in order to enable fast repair. In previous work, we have shown that cross-layer failure detection can reduce failure detection latency significantly. In particular, we monitor the behavior of the WLAN MAC layer to predict failures on the link layer. In this paper, we investigate data mining techniques to determine which parameters, i.e., the events, or combination and timing of events, occurring on the MAC layer most probably lead to link failures. Our results show, that the parameters revealed with the data mining approach produce similar or even more accurate failure predictions than achieved so far.
{"title":"Data-Mining-Based Link Failure Detection for Wireless Mesh Networks","authors":"Timo Lindhorst, G. Lukas, E. Nett, M. Mock","doi":"10.1109/SRDS.2010.51","DOIUrl":"https://doi.org/10.1109/SRDS.2010.51","url":null,"abstract":"Mobile robot applications operating in wireless environments require fast detection of link failures in order to enable fast repair. In previous work, we have shown that cross-layer failure detection can reduce failure detection latency significantly. In particular, we monitor the behavior of the WLAN MAC layer to predict failures on the link layer. In this paper, we investigate data mining techniques to determine which parameters, i.e., the events, or combination and timing of events, occurring on the MAC layer most probably lead to link failures. Our results show, that the parameters revealed with the data mining approach produce similar or even more accurate failure predictions than achieved so far.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123571329","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. Gorbenko, V. Kharchenko, Seyran Mamutov, O. Tarasyuk, Yuhui Chen, A. Romanovsky
is paper reports our practical experience of benchmarking a complex System Biology Web Service, and investigates the instability of its behaviour and the delays induced by the communication medium. We present the results of our statistical data analysis and distributions which fit and predict the response time instability typical of Service-Oriented Architectures (SOAs) built over the Internet. Our experiment has shown that the request processing time of the target e-science Web Service (WS) has a higher instability than the network round trip time. It has been found that by using a particular theoretical distribution, within short time intervals the request processing time can be represented better than the network round trip time. Moreover, certain characteristics of the probability distribution series of the round trip time make it particularly difficult to fit them theoretically. The experimental work reported in the paper supports our claim that dealing with the uncertainty inherent in the very nature of SOA and WSs is one of the main challenges in building dependable service-oriented systems. In particular, this uncertainty exhibits itself through very unstable web service response times and Internet data transfer delays that are hard to predict. Our findings indicate that the more experimental data is considered the less precise distributional approximations become. The paper concludes with a discussion of the lessons learnt about the analysis techniques to be used in such experiments, the validity of the data, the main causes of uncertainty and possible remedial actions.
{"title":"Real Distribution of Response Time Instability in Service-Oriented Architecture","authors":"A. Gorbenko, V. Kharchenko, Seyran Mamutov, O. Tarasyuk, Yuhui Chen, A. Romanovsky","doi":"10.1109/SRDS.2010.40","DOIUrl":"https://doi.org/10.1109/SRDS.2010.40","url":null,"abstract":"is paper reports our practical experience of benchmarking a complex System Biology Web Service, and investigates the instability of its behaviour and the delays induced by the communication medium. We present the results of our statistical data analysis and distributions which fit and predict the response time instability typical of Service-Oriented Architectures (SOAs) built over the Internet. Our experiment has shown that the request processing time of the target e-science Web Service (WS) has a higher instability than the network round trip time. It has been found that by using a particular theoretical distribution, within short time intervals the request processing time can be represented better than the network round trip time. Moreover, certain characteristics of the probability distribution series of the round trip time make it particularly difficult to fit them theoretically. The experimental work reported in the paper supports our claim that dealing with the uncertainty inherent in the very nature of SOA and WSs is one of the main challenges in building dependable service-oriented systems. In particular, this uncertainty exhibits itself through very unstable web service response times and Internet data transfer delays that are hard to predict. Our findings indicate that the more experimental data is considered the less precise distributional approximations become. The paper concludes with a discussion of the lessons learnt about the analysis techniques to be used in such experiments, the validity of the data, the main causes of uncertainty and possible remedial actions.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126010313","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}
Pin Zhou, Binny S. Gill, W. Belluomini, Avani Wildani
We present GAUL, a system to automate the whole log comparison between a new problem and the ones diagnosed in the past to identify recurring problems. GAUL uses a fuzzy match algorithm based on the contextual overlap between log lines and efficiently implements this using scalable index/search. The accuracy and efficiency of the comparison is further improved by leveraging problem set information and noise tolerance techniques. We evaluate GAUL using 4339 customer problems that occurred in all field deployments of an enterprise storage system over the course of a year. Our results show that with human-filtered logs, GAUL can identify the correct problem set 66% of the time among the top10 matches, which is 15% more accurate than the VSM system that uses cosine similarity and 19% more accurate than the ERRCMP system that uses error codes for log comparison. With unfiltered logs, the top10 match accuracy of GAUL is 40%, which is 22% more accurate than VSM and 26% more accurate than ERRCMP.
{"title":"GAUL: Gestalt Analysis of Unstructured Logs for Diagnosing Recurring Problems in Large Enterprise Storage Systems","authors":"Pin Zhou, Binny S. Gill, W. Belluomini, Avani Wildani","doi":"10.1109/SRDS.2010.25","DOIUrl":"https://doi.org/10.1109/SRDS.2010.25","url":null,"abstract":"We present GAUL, a system to automate the whole log comparison between a new problem and the ones diagnosed in the past to identify recurring problems. GAUL uses a fuzzy match algorithm based on the contextual overlap between log lines and efficiently implements this using scalable index/search. The accuracy and efficiency of the comparison is further improved by leveraging problem set information and noise tolerance techniques. We evaluate GAUL using 4339 customer problems that occurred in all field deployments of an enterprise storage system over the course of a year. Our results show that with human-filtered logs, GAUL can identify the correct problem set 66% of the time among the top10 matches, which is 15% more accurate than the VSM system that uses cosine similarity and 19% more accurate than the ERRCMP system that uses error codes for log comparison. With unfiltered logs, the top10 match accuracy of GAUL is 40%, which is 22% more accurate than VSM and 26% more accurate than ERRCMP.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124616759","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}
Pelin Angin, B. Bhargava, R. Ranchal, Noopur Singh, M. Linderman, L. B. Othmane, L. Lilien
Entities (e.g., users, services) have to authenticate themselves to service providers (SPs) in order to use their services. An entity provides personally identifiable information (PII) that uniquely identifies it to an SP. In the traditional application-centric Identity Management (IDM) model, each application keeps trace of identities of the entities that use it. In cloud computing, entities may have multiple accounts associated with different SPs, or one SP. Sharing PIIs of the same entity across services along with associated attributes can lead to mapping of PIIs to the entity. We propose an entity-centric approach for IDM in the cloud. The approach is based on: (1) active bundles—each including a payload of PII, privacy policies and a virtual machine that enforces the policies and uses a set of protection mechanisms to protect themselves, (2) anonymous identification to mediate interactions between the entity and cloud services using entity’s privacy policies. The main characteristics of the approach are: it is independent of third party, gives minimum information to the SP and provides ability to use identity data on untrusted hosts.
{"title":"An Entity-Centric Approach for Privacy and Identity Management in Cloud Computing","authors":"Pelin Angin, B. Bhargava, R. Ranchal, Noopur Singh, M. Linderman, L. B. Othmane, L. Lilien","doi":"10.1109/SRDS.2010.28","DOIUrl":"https://doi.org/10.1109/SRDS.2010.28","url":null,"abstract":"Entities (e.g., users, services) have to authenticate themselves to service providers (SPs) in order to use their services. An entity provides personally identifiable information (PII) that uniquely identifies it to an SP. In the traditional application-centric Identity Management (IDM) model, each application keeps trace of identities of the entities that use it. In cloud computing, entities may have multiple accounts associated with different SPs, or one SP. Sharing PIIs of the same entity across services along with associated attributes can lead to mapping of PIIs to the entity. We propose an entity-centric approach for IDM in the cloud. The approach is based on: (1) active bundles—each including a payload of PII, privacy policies and a virtual machine that enforces the policies and uses a set of protection mechanisms to protect themselves, (2) anonymous identification to mediate interactions between the entity and cloud services using entity’s privacy policies. The main characteristics of the approach are: it is independent of third party, gives minimum information to the SP and provides ability to use identity data on untrusted hosts.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114371579","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}
Monitoring virtual machine (VM) is an essential function for virtualized platforms. Existing solutions are either coarse-grained – monitoring in granularity of VM level, or not general – only support specific monitoring functions for particular guest operating system (OS). Thus they do not satisfy the monitoring requirement in large-scale server cluster such as data center and public cloud platform, where each physical platform runs hundreds of VMs with different guest OSes. In this paper, we propose VMDriver, a general and fine-grained approach for virtualization monitoring. The novel design of VMDriver is the separation of event interception point in VMM level and rich guest OS semantic reconstructions in management domain. With this design, variant monitoring drivers in management domain can mask the differences of guest OSes. We implement VMDriver on Xen and our experimental study shows that it introduces very small performance overhead. We demonstrate its generality by inspecting four aspects information about the target virtual machines with different guest OSes. The unified interface of VMDriver brings convenience to develop complex monitoring tools for distributed virtualization environment.
{"title":"VMDriver: A Driver-Based Monitoring Mechanism for Virtualization","authors":"Guofu Xiang, Hai Jin, Deqing Zou, Xinwen Zhang, Sha Wen, Feng Zhao","doi":"10.1109/SRDS.2010.38","DOIUrl":"https://doi.org/10.1109/SRDS.2010.38","url":null,"abstract":"Monitoring virtual machine (VM) is an essential function for virtualized platforms. Existing solutions are either coarse-grained – monitoring in granularity of VM level, or not general – only support specific monitoring functions for particular guest operating system (OS). Thus they do not satisfy the monitoring requirement in large-scale server cluster such as data center and public cloud platform, where each physical platform runs hundreds of VMs with different guest OSes. In this paper, we propose VMDriver, a general and fine-grained approach for virtualization monitoring. The novel design of VMDriver is the separation of event interception point in VMM level and rich guest OS semantic reconstructions in management domain. With this design, variant monitoring drivers in management domain can mask the differences of guest OSes. We implement VMDriver on Xen and our experimental study shows that it introduces very small performance overhead. We demonstrate its generality by inspecting four aspects information about the target virtual machines with different guest OSes. The unified interface of VMDriver brings convenience to develop complex monitoring tools for distributed virtualization environment.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134028484","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}
Unreliable failure detectors are a fundamental building block in the design of reliable distributed systems. But unreliability must be bounded, despite the uncertainties affecting the timeliness of communication. This is why it is important to reason in terms of the quality of service (QoS) of failure detectors, both in their specification and evaluation. We propose a novel dependability-oriented approach for specifying the QoS of failure detectors, and introduce Adapt are-FD, an autonomous and adaptive failure detector that executes according to this new specification. The main distinguishing features of Adapt are-FD with respect to existing adaptive failure detection approaches are discussed and explained in detail. A comparative evaluation of Adapt are-FD is presented. We highlight the practical differences between our approach and the well known Chen et al. approach for the specification of QoS requirements. We show that Adapt are-FD is easily configured, independently of the specific network environment. Furthermore, the results obtained using the Planet Lab platform indicate that Adapt are-FD outperforms other timeout-based solutions, combining versatility with improved QoS and dependability assurance.
{"title":"Adaptare-FD: A Dependability-Oriented Adaptive Failure Detector","authors":"M. Dixit, A. Casimiro","doi":"10.1109/SRDS.2010.24","DOIUrl":"https://doi.org/10.1109/SRDS.2010.24","url":null,"abstract":"Unreliable failure detectors are a fundamental building block in the design of reliable distributed systems. But unreliability must be bounded, despite the uncertainties affecting the timeliness of communication. This is why it is important to reason in terms of the quality of service (QoS) of failure detectors, both in their specification and evaluation. We propose a novel dependability-oriented approach for specifying the QoS of failure detectors, and introduce Adapt are-FD, an autonomous and adaptive failure detector that executes according to this new specification. The main distinguishing features of Adapt are-FD with respect to existing adaptive failure detection approaches are discussed and explained in detail. A comparative evaluation of Adapt are-FD is presented. We highlight the practical differences between our approach and the well known Chen et al. approach for the specification of QoS requirements. We show that Adapt are-FD is easily configured, independently of the specific network environment. Furthermore, the results obtained using the Planet Lab platform indicate that Adapt are-FD outperforms other timeout-based solutions, combining versatility with improved QoS and dependability assurance.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132544400","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}
In a Mobile Ad-Hoc Network environment, wireless devices have finite resources such as memory, energy and they work within the wireless constraints such as limited bandwidth and unreliable communication. Therefore, storage space, bandwidth, and battery life must be managed effectively in order to extend the usefulness and lifespan of wireless devices and the network. Caching is one of those techniques which reduce the latency and tuning time for mobile devices in the wireless network. We propose a novel scheme that seeks to distribute the storage, bandwidth and energy burden through a resource efficient adaptive caching scheme for mobile ad-hoc networks. Our performance results show that our scheme reduces both response time and bandwidth utilization by, 36%, through a reduction in hop count, as well as both a 79% increase in energy efficiency and a 53% reduction in storage utilization when compared with a leading alternate methodology.
{"title":"A Resource-Efficient Adaptive Caching Scheme for Mobile Ad Hoc Networks","authors":"D. Hirsch, S. Madria","doi":"10.1109/SRDS.2010.16","DOIUrl":"https://doi.org/10.1109/SRDS.2010.16","url":null,"abstract":"In a Mobile Ad-Hoc Network environment, wireless devices have finite resources such as memory, energy and they work within the wireless constraints such as limited bandwidth and unreliable communication. Therefore, storage space, bandwidth, and battery life must be managed effectively in order to extend the usefulness and lifespan of wireless devices and the network. Caching is one of those techniques which reduce the latency and tuning time for mobile devices in the wireless network. We propose a novel scheme that seeks to distribute the storage, bandwidth and energy burden through a resource efficient adaptive caching scheme for mobile ad-hoc networks. Our performance results show that our scheme reduces both response time and bandwidth utilization by, 36%, through a reduction in hop count, as well as both a 79% increase in energy efficiency and a 53% reduction in storage utilization when compared with a leading alternate methodology.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123251831","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}
In this paper we provide an architecture for Tactical Information Middleware for bandwidth constrained information management. We propose the ideas of rank-based data dissemination, and the use of a tactical information management query language. These ideas will deal with dynamic changes in bandwidth and explore opportunistic data dissemination. Thus, will lead to a cross layer design of a system capable of handling the dynamic data management issues relevant in many mission critical applications.
{"title":"A Tactical Information Management Middleware for Resource-Constrained Mobile P2P Networks","authors":"Bo Xu, M. Linderman, S. Madria, O. Wolfson","doi":"10.1109/SRDS.2010.41","DOIUrl":"https://doi.org/10.1109/SRDS.2010.41","url":null,"abstract":"In this paper we provide an architecture for Tactical Information Middleware for bandwidth constrained information management. We propose the ideas of rank-based data dissemination, and the use of a tactical information management query language. These ideas will deal with dynamic changes in bandwidth and explore opportunistic data dissemination. Thus, will lead to a cross layer design of a system capable of handling the dynamic data management issues relevant in many mission critical applications.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121753999","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}
Rolando Martins, P. Narasimhan, Luís M. B. Lopes, Fernando M A Silva
We address the problem of providing transparent, lightweight, fault-tolerance mechanisms for generic peer-to-peer middleware systems. The main idea is to use the peer-to-peer overlay to provide for fault-tolerance rather than support it higher up in the middleware architecture, e.g. in the form of services. To evaluate our approach we have implemented a fault-tolerant middleware prototype that uses a hierarchical peer-to-peer overlay in which the leaf peers connect to sensors that provide data streams. Clients connect to the root of the overlay and request streams that are routed upwards through intermediate peers in the overlay up to the client. We report encouraging preliminary results for latency, jitter and resource consumption for both the non-faulty and faulty cases.
{"title":"Lightweight Fault-Tolerance for Peer-to-Peer Middleware","authors":"Rolando Martins, P. Narasimhan, Luís M. B. Lopes, Fernando M A Silva","doi":"10.1109/SRDS.2010.43","DOIUrl":"https://doi.org/10.1109/SRDS.2010.43","url":null,"abstract":"We address the problem of providing transparent, lightweight, fault-tolerance mechanisms for generic peer-to-peer middleware systems. The main idea is to use the peer-to-peer overlay to provide for fault-tolerance rather than support it higher up in the middleware architecture, e.g. in the form of services. To evaluate our approach we have implemented a fault-tolerant middleware prototype that uses a hierarchical peer-to-peer overlay in which the leaf peers connect to sensors that provide data streams. Clients connect to the root of the overlay and request streams that are routed upwards through intermediate peers in the overlay up to the client. We report encouraging preliminary results for latency, jitter and resource consumption for both the non-faulty and faulty cases.","PeriodicalId":219204,"journal":{"name":"2010 29th IEEE Symposium on Reliable Distributed Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128890709","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
扫码关注我们
求助内容：
应助结果提醒方式：