Zhi Guan, Z. Cao, Xuan Zhao, Ruichuan Chen, Zhong Chen, Xianghao Nan
The growing popularity of web applications in the last few years has led users to give the management of their data to online application providers, which will endanger the security and privacy of the users. In this paper, we present WebIBC, which integrates public key cryptography into web applications without any browser plugins. The public key of WebIBC is provided by identity based cryptography, eliminating the need of public key and certificate online retrieval; the private key is supplied by the fragment identifier of the URL inspired by BeamAuth. The implementation and performance evaluation demonstrate that WebIBC is secure and efficient both in theory and practice.
{"title":"WebIBC: Identity Based Cryptography for Client Side Security in Web Applications","authors":"Zhi Guan, Z. Cao, Xuan Zhao, Ruichuan Chen, Zhong Chen, Xianghao Nan","doi":"10.1109/ICDCS.2008.24","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.24","url":null,"abstract":"The growing popularity of web applications in the last few years has led users to give the management of their data to online application providers, which will endanger the security and privacy of the users. In this paper, we present WebIBC, which integrates public key cryptography into web applications without any browser plugins. The public key of WebIBC is provided by identity based cryptography, eliminating the need of public key and certificate online retrieval; the private key is supplied by the fragment identifier of the URL inspired by BeamAuth. The implementation and performance evaluation demonstrate that WebIBC is secure and efficient both in theory and practice.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186448","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}
This paper presents a scalable and adaptive decentralized metadata lookup scheme for ultra large-scale file systems (ges Petabytes or even Exabytes). Our scheme logically organizes metadata servers (MDS) into a multi-layered query hierarchy and exploits grouped bloom filters to efficiently route metadata requests to desired MDS through the hierarchy. This metadata lookup scheme can be executed at the network or memory speed, without being bounded by the performance of slow disks. Our scheme is evaluated through extensive trace-driven simulations and prototype implementation in Linux. Experimental results show that this scheme can significantly improve metadata management scalability and query efficiency in ultra large-scale storage systems.
{"title":"Scalable and Adaptive Metadata Management in Ultra Large-Scale File Systems","authors":"Yu Hua, Yifeng Zhu, Hong Jiang, D. Feng, Lei Tian","doi":"10.1109/ICDCS.2008.32","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.32","url":null,"abstract":"This paper presents a scalable and adaptive decentralized metadata lookup scheme for ultra large-scale file systems (ges Petabytes or even Exabytes). Our scheme logically organizes metadata servers (MDS) into a multi-layered query hierarchy and exploits grouped bloom filters to efficiently route metadata requests to desired MDS through the hierarchy. This metadata lookup scheme can be executed at the network or memory speed, without being bounded by the performance of slow disks. Our scheme is evaluated through extensive trace-driven simulations and prototype implementation in Linux. Experimental results show that this scheme can significantly improve metadata management scalability and query efficiency in ultra large-scale storage systems.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"788 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127562563","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}
Following the huge commercial success of WLAN, multihop wireless networks are expected to lead in the next wave of deployment. Fundamental methods for traffic engineering must be developed to support diverse application requirements in these networks. This paper studies the problem of how to support weighted bandwidth allocation among all end-to-end flows in a multihop wireless network. Our goal is to enable the network to adapt the flow rates such that global maxmin can be achieved. Our approach is to transform the global maxmin objective into four local conditions and design a distributed rate adaptation protocol based on those local conditions. Comparing with the prior art, our protocol has a number of advantages. It is designed for the popular IEEE 802.11 DCF. It replaces per-flow queueing with per-destination queueing. It achieves far better fairness (or weighted fairness) among end-to-end flows.
{"title":"Achieving Global End-to-End Maxmin in Multihop Wireless Networks","authors":"L. Zhang, Shigang Chen, Ying Jian","doi":"10.1109/ICDCS.2008.66","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.66","url":null,"abstract":"Following the huge commercial success of WLAN, multihop wireless networks are expected to lead in the next wave of deployment. Fundamental methods for traffic engineering must be developed to support diverse application requirements in these networks. This paper studies the problem of how to support weighted bandwidth allocation among all end-to-end flows in a multihop wireless network. Our goal is to enable the network to adapt the flow rates such that global maxmin can be achieved. Our approach is to transform the global maxmin objective into four local conditions and design a distributed rate adaptation protocol based on those local conditions. Comparing with the prior art, our protocol has a number of advantages. It is designed for the popular IEEE 802.11 DCF. It replaces per-flow queueing with per-destination queueing. It achieves far better fairness (or weighted fairness) among end-to-end flows.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"os-24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127770213","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}
Internet traffic has a characteristic of strong correlation. This traffic characteristic greatly complicates the problem of server performance modeling and optimization. Conventional time domain analysis has limitations in the study of the impact of complex traffic on server performance, because self-similarity of Internet traffic is often characterized in frequency domain. In this paper, we present a frequency domain filter model to characterize the relationship between server capacity, resource allocation, and service quality for general input traffic. Power spectral density (PSD) shows the strength of variations (power) as a function of frequency. By the model, server scheduler operates as a filter of input traffic that transforms its PSD function into another PSD function of server utilization process. The optimality of the scheduler in second-order statistics is to minimize the power leakage in the transformation. Most Internet traffic has monotonically decreasing PSD functions. For this type of input traffic, we prove that the optimal schedulers have a convex structure. Uniform allocation is an extreme case of the convexity and is proven to be optimal for traffic of independent arrivals. We integrate the convex-structured scheduling principle with GPS discipline and show that the enhanced GPS policy improves the service quality significantly.
{"title":"Frequency Domain Filter Design and Analysis of Request Scheduling in Internet Servers","authors":"Minghua Xu, Chengzhong Xu","doi":"10.1109/ICDCS.2008.92","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.92","url":null,"abstract":"Internet traffic has a characteristic of strong correlation. This traffic characteristic greatly complicates the problem of server performance modeling and optimization. Conventional time domain analysis has limitations in the study of the impact of complex traffic on server performance, because self-similarity of Internet traffic is often characterized in frequency domain. In this paper, we present a frequency domain filter model to characterize the relationship between server capacity, resource allocation, and service quality for general input traffic. Power spectral density (PSD) shows the strength of variations (power) as a function of frequency. By the model, server scheduler operates as a filter of input traffic that transforms its PSD function into another PSD function of server utilization process. The optimality of the scheduler in second-order statistics is to minimize the power leakage in the transformation. Most Internet traffic has monotonically decreasing PSD functions. For this type of input traffic, we prove that the optimal schedulers have a convex structure. Uniform allocation is an extreme case of the convexity and is proven to be optimal for traffic of independent arrivals. We integrate the convex-structured scheduling principle with GPS discipline and show that the enhanced GPS policy improves the service quality significantly.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130599150","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 sensor network applications, sensors often need to retrieve data from each other. Information brokerage is a scheme that stores data (or index files of data) at rendezvous nodes, so that every sensor can efficiently finds the data it needs. A very useful property for information brokerage is locality sensitivity, which means that a sensor close the original source of the data should also be able to retrieve the data with a small communication cost. Given the locality sensitivity requirement, the key is to design an information brokerage scheme that minimizes the storage cost. In this paper, we present a locality sensitive information brokerage scheme. It is designed for general locality-sensitive requirements, which include the linear data-retrieval cost (a frequently studied scenario) as a special case. We also prove that for a large class of networks, in the scenario of linear data-retrieval cost, our scheme achieves the asymptotically optimal storage cost. The result also proves the optimality of a few other schemes in the literature.
{"title":"Locality Sensitive Information Brokerage in Distributed Sensor Networks","authors":"Hong Lu, Andrew Jiang, Steve Liu","doi":"10.1109/ICDCS.2008.36","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.36","url":null,"abstract":"In sensor network applications, sensors often need to retrieve data from each other. Information brokerage is a scheme that stores data (or index files of data) at rendezvous nodes, so that every sensor can efficiently finds the data it needs. A very useful property for information brokerage is locality sensitivity, which means that a sensor close the original source of the data should also be able to retrieve the data with a small communication cost. Given the locality sensitivity requirement, the key is to design an information brokerage scheme that minimizes the storage cost. In this paper, we present a locality sensitive information brokerage scheme. It is designed for general locality-sensitive requirements, which include the linear data-retrieval cost (a frequently studied scenario) as a special case. We also prove that for a large class of networks, in the scenario of linear data-retrieval cost, our scheme achieves the asymptotically optimal storage cost. The result also proves the optimality of a few other schemes in the literature.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126888625","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}
Contour maps, showing topological distribution of extracted features, are crucial for many applications. Building a dynamic contour map in a wireless sensor network is a challenging task due to the constrained network resources. In this paper, we present the design of a contour mapping engine (CME) in wireless sensor networks. Our design incorporates in-network processing based on binary classification to reduce the total number of active nodes. The underlying network architecture is analyzed to derive an optimal configuration. We show, by extensive simulations, the superiority of CME over the state-of-the-art contour mapping techniques.
{"title":"CME: A Contour Mapping Engine in Wireless Sensor Networks","authors":"Yingqi Xu, Wang-Chien Lee, Gail Mitchell","doi":"10.1109/ICDCS.2008.64","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.64","url":null,"abstract":"Contour maps, showing topological distribution of extracted features, are crucial for many applications. Building a dynamic contour map in a wireless sensor network is a challenging task due to the constrained network resources. In this paper, we present the design of a contour mapping engine (CME) in wireless sensor networks. Our design incorporates in-network processing based on binary classification to reduce the total number of active nodes. The underlying network architecture is analyzed to derive an optimal configuration. We show, by extensive simulations, the superiority of CME over the state-of-the-art contour mapping techniques.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125322773","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 today's networked storage environment, it is common to have a hierarchy of caches where the lower levels of the hierarchy are accessed by multiple clients. This sharing can have both positive or negative effects. While data fetched by one client can be used by another client without incurring additional delays, clients competing for cache buffers can evict each other's blocks and interfere with exclusive caching schemes. Our algorithm, MC2, combines local, per client management with a global, system-wide, scheme, to emphasize the positive effects of sharing and reduce the negative ones. The local scheme uses readily available information about the client's future access profile to save the most valuable blocks, and to choose the best replacement policy for them. The global scheme uses the same information to divide the shared cache space between clients, and to manage this space. Exclusive caching is maintained for non-shared data and is disabled when sharing is identified. Our simulation results show that the combined algorithm significantly reduces the overall I/O response times of the system.
{"title":"MC2: Multiple Clients on a Multilevel Cache","authors":"G. Yadgar, M. Factor, Kai Li, A. Schuster","doi":"10.1109/ICDCS.2008.29","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.29","url":null,"abstract":"In today's networked storage environment, it is common to have a hierarchy of caches where the lower levels of the hierarchy are accessed by multiple clients. This sharing can have both positive or negative effects. While data fetched by one client can be used by another client without incurring additional delays, clients competing for cache buffers can evict each other's blocks and interfere with exclusive caching schemes. Our algorithm, MC2, combines local, per client management with a global, system-wide, scheme, to emphasize the positive effects of sharing and reduce the negative ones. The local scheme uses readily available information about the client's future access profile to save the most valuable blocks, and to choose the best replacement policy for them. The global scheme uses the same information to divide the shared cache space between clients, and to manage this space. Exclusive caching is maintained for non-shared data and is disabled when sharing is identified. Our simulation results show that the combined algorithm significantly reduces the overall I/O response times of the system.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"427 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126724020","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}
Lijiang Chen, B. Cui, Hua Lu, Linhao Xu, Quanqing Xu
An interesting problem in peer-based data management is efficient support for skyline queries within a multiattribute space. A skyline query retrieves from a set of multidimensional data points a subset of interesting points, compared to which no other points are better. Skyline queries play an important role in multi-criteria decision making and user preference applications. In this paper, we address the skyline computing problem in a structured P2P network. We exploit the iMinMax(thetas) transformation to map high-dimensional data points to 1-dimensional values. All transformed data points are then distributed on a structured P2P network called BATON, where all peers are virtually organized as a balanced binary search tree. Subsequently, a progressive algorithm is proposed to compute skyline in the distributed P2P network. Further, we propose an adaptive skyline filtering technique to reduce both processing cost and communication cost during distributed skyline computing. Our performance study, with both synthetic and real datasets, shows that the proposed approach can dramatically reduce transferred data volume and gain quick response time.
{"title":"iSky: Efficient and Progressive Skyline Computing in a Structured P2P Network","authors":"Lijiang Chen, B. Cui, Hua Lu, Linhao Xu, Quanqing Xu","doi":"10.1109/ICDCS.2008.40","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.40","url":null,"abstract":"An interesting problem in peer-based data management is efficient support for skyline queries within a multiattribute space. A skyline query retrieves from a set of multidimensional data points a subset of interesting points, compared to which no other points are better. Skyline queries play an important role in multi-criteria decision making and user preference applications. In this paper, we address the skyline computing problem in a structured P2P network. We exploit the iMinMax(thetas) transformation to map high-dimensional data points to 1-dimensional values. All transformed data points are then distributed on a structured P2P network called BATON, where all peers are virtually organized as a balanced binary search tree. Subsequently, a progressive algorithm is proposed to compute skyline in the distributed P2P network. Further, we propose an adaptive skyline filtering technique to reduce both processing cost and communication cost during distributed skyline computing. Our performance study, with both synthetic and real datasets, shows that the proposed approach can dramatically reduce transferred data volume and gain quick response time.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123175056","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}
As RFID tags become more widespread, new approaches for managing larger numbers of RFID tags will be needed. In this paper, we consider the problem of how to accurately and efficiently monitor a set of RFID tags for missing tags. Our approach accurately monitors a set of tags without collecting IDs from them. It differs from traditional research which focuses on faster ways for collecting IDs from every tag. We present two monitoring protocols, one designed for a trusted reader and another for an untrusted reader.
{"title":"How to Monitor for Missing RFID tags","authors":"C. C. Tan, Bo Sheng, Qun A. Li","doi":"10.1109/ICDCS.2008.67","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.67","url":null,"abstract":"As RFID tags become more widespread, new approaches for managing larger numbers of RFID tags will be needed. In this paper, we consider the problem of how to accurately and efficiently monitor a set of RFID tags for missing tags. Our approach accurately monitors a set of tags without collecting IDs from them. It differs from traditional research which focuses on faster ways for collecting IDs from every tag. We present two monitoring protocols, one designed for a trusted reader and another for an untrusted reader.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116950093","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}
Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these studies are at a very high level, leaving many design and implementation issues unanswered. In this paper, we present our design and implementation of cooperative cache in wireless P2P networks. We propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node, but the data replies are only transmitted to the cache layer at the intermediate nodes that need to cache the data. This solution not only reduces the overhead of copying data between the user space and the kernel space, it also allows data pipelines to reduce the end-to-end delay. We also study the effects of different MAC layers such as 802.11 based ad hoc networks and multi-interface multi-channel based mesh networks, on the performance of cooperative cache. Our results show that the asymmetric approach outperforms the symmetric approach in traditional 802.11 based ad hoc networks by removing most of the processing overhead. In mesh networks, the asymmetric approach can significantly reduce the data access delay compared to the symmetric approach due to data pipelines.
{"title":"On Cooperative Caching in Wireless P2P Networks","authors":"J. Zhao, Ping Zhang, G. Cao","doi":"10.1109/ICDCS.2008.48","DOIUrl":"https://doi.org/10.1109/ICDCS.2008.48","url":null,"abstract":"Some recent studies have shown that cooperative cache can improve the system performance in wireless P2P networks such as ad hoc networks and mesh networks. However, all these studies are at a very high level, leaving many design and implementation issues unanswered. In this paper, we present our design and implementation of cooperative cache in wireless P2P networks. We propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node, but the data replies are only transmitted to the cache layer at the intermediate nodes that need to cache the data. This solution not only reduces the overhead of copying data between the user space and the kernel space, it also allows data pipelines to reduce the end-to-end delay. We also study the effects of different MAC layers such as 802.11 based ad hoc networks and multi-interface multi-channel based mesh networks, on the performance of cooperative cache. Our results show that the asymmetric approach outperforms the symmetric approach in traditional 802.11 based ad hoc networks by removing most of the processing overhead. In mesh networks, the asymmetric approach can significantly reduce the data access delay compared to the symmetric approach due to data pipelines.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122861848","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
扫码关注我们
求助内容：
应助结果提醒方式：