We present a secure asynchronous multiparty computation (AMPC) protocol with optimal resilience, involving n = 3t + 1 parties and tolerating a computationally bounded static adversary, capable of corrupting upto t parties. For a security parameter k and for circuits of sufficiently large size, our protocol has an amortized communication complexity of O(cMnk) bits, where cM denotes the number of multiplication gates in the arithmetic circuit, representing the function to be computed. Prior to our work, the most efficient optimally resilient, computationally secure AMPC protocol was due to Hirt et al. (ICALP 2008). The protocol offers an amortized communication complexity of O(cMn2k) bits. Our protocol follows the standard offline-online paradigm. In the offline phase, the parties produce encryptions of random multiplication triples. These are used to securely evaluate the multiplication gates in the online phase, using Beaver's circuit-randomization technique (CRYPTO 1991). The offline protocol of earlier works deploy linearly homomorphic encryption schemes. Our offline phase is much simpler and more efficient than the existing protocols and uses linearly homomorphic encryption scheme with support for one homomorphic multiplication.
{"title":"Optimally Resilient Asynchronous MPC with Linear Communication Complexity","authors":"Ashish Choudhury, A. Patra","doi":"10.1145/2684464.2684470","DOIUrl":"https://doi.org/10.1145/2684464.2684470","url":null,"abstract":"We present a secure asynchronous multiparty computation (AMPC) protocol with optimal resilience, involving n = 3t + 1 parties and tolerating a computationally bounded static adversary, capable of corrupting upto t parties. For a security parameter k and for circuits of sufficiently large size, our protocol has an amortized communication complexity of O(cMnk) bits, where cM denotes the number of multiplication gates in the arithmetic circuit, representing the function to be computed. Prior to our work, the most efficient optimally resilient, computationally secure AMPC protocol was due to Hirt et al. (ICALP 2008). The protocol offers an amortized communication complexity of O(cMn2k) bits. Our protocol follows the standard offline-online paradigm. In the offline phase, the parties produce encryptions of random multiplication triples. These are used to securely evaluate the multiplication gates in the online phase, using Beaver's circuit-randomization technique (CRYPTO 1991). The offline protocol of earlier works deploy linearly homomorphic encryption schemes. Our offline phase is much simpler and more efficient than the existing protocols and uses linearly homomorphic encryption scheme with support for one homomorphic multiplication.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115599337","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}
Distributed Denial of Service (DDoS) attacks are a perpetual threat to today's business. Existing strategies against DDoS are implemented as single-point solutions, or reactive solutions, or focus on differentiating traffic and localizing attackers. Our understanding is that no single network location can cater to the needs of a full-proof defense solution. In this paper we propose a solution based on two principles -- 'distributed defense for distributed attack' and 'need for a preventive solution over a reactive solution'. We present a system architecture for distributed and predictive-preventive defense mechanism. We also propose two algorithms for systematic placement of the defense nodes in the victim's upstream router network. We compare the performance and efficiency of the proposed algorithms through simulation results. We also present an algorithmic approach for prediction of attack to determine the potential attackers as well as the time-to-saturation of victim. We present experimental evaluation to show the effectiveness of the proposed approach.
{"title":"Distributed and Predictive-Preventive Defense Against DDoS Attacks","authors":"Manjiri Jog, M. Natu, S. Shelke","doi":"10.1145/2684464.2684503","DOIUrl":"https://doi.org/10.1145/2684464.2684503","url":null,"abstract":"Distributed Denial of Service (DDoS) attacks are a perpetual threat to today's business. Existing strategies against DDoS are implemented as single-point solutions, or reactive solutions, or focus on differentiating traffic and localizing attackers. Our understanding is that no single network location can cater to the needs of a full-proof defense solution. In this paper we propose a solution based on two principles -- 'distributed defense for distributed attack' and 'need for a preventive solution over a reactive solution'. We present a system architecture for distributed and predictive-preventive defense mechanism. We also propose two algorithms for systematic placement of the defense nodes in the victim's upstream router network. We compare the performance and efficiency of the proposed algorithms through simulation results. We also present an algorithmic approach for prediction of attack to determine the potential attackers as well as the time-to-saturation of victim. We present experimental evaluation to show the effectiveness of the proposed approach.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124952270","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. K. Pujari, S. Mini, Trideba Padhi, Prabhanjan Sahoo
MLTCP (Maximum Lifetime Target Coverage Problem) aims at providing required coverage to a set of targets maximizing the lifetime of wireless sensor network. The problem is known to be computationally hard and it is shown recently that MLTCP exhibits phase-transition phenomenon. The region of occurrences of hard instances is identified in terms of an interval of values of sensing-range. Most of the earlier heuristics report their empirical analyses on instances that are outside this region. There has not been any algorithm proposed so far to handle particularly hard instances. In the present work, we provide a new insight to MLTCP by studying the structure of polyhedral feasible set and propose a heuristic that distinguishes hard instances from solvable cases. The proposed method yields best-ever near-optimal solution and indicates situations when the given problem instance is hard. Considering the linear programming formulation of MLTCP, the algorithm can be viewed as traversal from one BFS (Basic Feasible Solution) to another nonadjacent BFS with non-decreasing value of the objective function. It is shown that high degree of degeneracy of BFS and cycling make the problem hard. When the algorithm encounters a non-trivial cycle, our method uses a novel way of generating an improved feasible solution (not a BFS) by moving away from BFS search. Experimental results confirm that the proposed method achieves the optimal solution for easy instances and gives best-ever near-optimal solution for hard instances.
{"title":"Polyhedral Approach for Lifetime Maximization of Target Coverage Problem","authors":"A. K. Pujari, S. Mini, Trideba Padhi, Prabhanjan Sahoo","doi":"10.1145/2684464.2684495","DOIUrl":"https://doi.org/10.1145/2684464.2684495","url":null,"abstract":"MLTCP (Maximum Lifetime Target Coverage Problem) aims at providing required coverage to a set of targets maximizing the lifetime of wireless sensor network. The problem is known to be computationally hard and it is shown recently that MLTCP exhibits phase-transition phenomenon. The region of occurrences of hard instances is identified in terms of an interval of values of sensing-range. Most of the earlier heuristics report their empirical analyses on instances that are outside this region. There has not been any algorithm proposed so far to handle particularly hard instances. In the present work, we provide a new insight to MLTCP by studying the structure of polyhedral feasible set and propose a heuristic that distinguishes hard instances from solvable cases. The proposed method yields best-ever near-optimal solution and indicates situations when the given problem instance is hard. Considering the linear programming formulation of MLTCP, the algorithm can be viewed as traversal from one BFS (Basic Feasible Solution) to another nonadjacent BFS with non-decreasing value of the objective function. It is shown that high degree of degeneracy of BFS and cycling make the problem hard. When the algorithm encounters a non-trivial cycle, our method uses a novel way of generating an improved feasible solution (not a BFS) by moving away from BFS search. Experimental results confirm that the proposed method achieves the optimal solution for easy instances and gives best-ever near-optimal solution for hard instances.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122913737","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}
Data replication is commonly used for fault tolerance in reliable distributed systems. In this paper, we propose three optimal protocols for causal consistency in distributed shared memory systems. Our proposed optimal protocols are designed for partial replication across the distributed shared memory. Complete replication is a special case of our protocols and we also give the optimal implementation of causal consistency for the complete replication case. Algorithm Full-Track is optimal in the sense that it can update the local copy as soon as possible while respecting causal consistency. Algorithm Opt-Track is further optimal in the sense that the size of the local logs maintained and the amount of control information piggybacked on the update messages is minimal. Algorithm Opt-Track-CRP is a special case of algorithm Opt-Track for the full replication case. It is highly scalable, and significantly more efficient than the Baldoni et al. protocol for the complete replication case.
{"title":"OPCAM: Optimal Algorithms Implementing Causal Memories in Shared Memory Systems","authors":"Min Shen, A. Kshemkalyani, T. Hsu","doi":"10.1145/2684464.2684483","DOIUrl":"https://doi.org/10.1145/2684464.2684483","url":null,"abstract":"Data replication is commonly used for fault tolerance in reliable distributed systems. In this paper, we propose three optimal protocols for causal consistency in distributed shared memory systems. Our proposed optimal protocols are designed for partial replication across the distributed shared memory. Complete replication is a special case of our protocols and we also give the optimal implementation of causal consistency for the complete replication case. Algorithm Full-Track is optimal in the sense that it can update the local copy as soon as possible while respecting causal consistency. Algorithm Opt-Track is further optimal in the sense that the size of the local logs maintained and the amount of control information piggybacked on the update messages is minimal. Algorithm Opt-Track-CRP is a special case of algorithm Opt-Track for the full replication case. It is highly scalable, and significantly more efficient than the Baldoni et al. protocol for the complete replication case.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116598051","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}
S. Choudhury, Vivek Nair, Jaydeep Howlader, B. Choudhury, A. K. Mal
Optical burst switching (OBS) is considered as one of the most potential technology for implementation of transparent optical Internet in near future. In this paper we propose an integrated scheme for loss reduction and efficient resource utilization in OBS. We develop a framework for computation of estimated space-time loss surface in space-time plane for a burst over the network and utilise it to determine the most appropriate route and corresponding offset-time for the burst. The integrated routing and offset-time adaptation scheme proposed here, can simultaneously offer significantly lower burst loss rate and higher network-wide resource utilisation.
{"title":"An integrated routing and offset-time adaptation scheme for OBS network","authors":"S. Choudhury, Vivek Nair, Jaydeep Howlader, B. Choudhury, A. K. Mal","doi":"10.1145/2684464.2684488","DOIUrl":"https://doi.org/10.1145/2684464.2684488","url":null,"abstract":"Optical burst switching (OBS) is considered as one of the most potential technology for implementation of transparent optical Internet in near future. In this paper we propose an integrated scheme for loss reduction and efficient resource utilization in OBS. We develop a framework for computation of estimated space-time loss surface in space-time plane for a burst over the network and utilise it to determine the most appropriate route and corresponding offset-time for the burst. The integrated routing and offset-time adaptation scheme proposed here, can simultaneously offer significantly lower burst loss rate and higher network-wide resource utilisation.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129028805","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}
Existing distributed transactional system execution model based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we propose the distributed dependency-aware (DDA) model, which adopts different conflicting resolution strategies for different transactions. In the DDA model, the concurrency of transactions is enhanced by ensuring that read-only and write-only transactions never abort, through established precedence relations with other transactions. Non-write-only update transactions are handled through a contention management policy. We identify the inherent limitations in establishing precedence relations in distributed transactional systems and propose their solutions. We present a set of algorithms to support the DDA model, then we prove the correctness and permissiveness of the DDA model and show that it supports invisible reads and efficiently garbage collects useless object versions.
{"title":"Reducing Aborts in Distributed Transactional Systems through Dependency Detection","authors":"Bo Zhang, B. Ravindran, R. Palmieri","doi":"10.1145/2684464.2684475","DOIUrl":"https://doi.org/10.1145/2684464.2684475","url":null,"abstract":"Existing distributed transactional system execution model based on globally-consistent contention management policies may abort many transactions that could potentially commit without violating correctness. To reduce unnecessary aborts and increase concurrency, we propose the distributed dependency-aware (DDA) model, which adopts different conflicting resolution strategies for different transactions. In the DDA model, the concurrency of transactions is enhanced by ensuring that read-only and write-only transactions never abort, through established precedence relations with other transactions. Non-write-only update transactions are handled through a contention management policy. We identify the inherent limitations in establishing precedence relations in distributed transactional systems and propose their solutions. We present a set of algorithms to support the DDA model, then we prove the correctness and permissiveness of the DDA model and show that it supports invisible reads and efficiently garbage collects useless object versions.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125252346","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}
Nirnay Ghosh, Ishan Chokshi, Mithun Sarkar, S. Ghosh, A. K. Kaushik, Sajal K. Das
Sophisticated cyber-attacks have become prominent with the growth of the Internet and web technology. Such attacks are multi-stage ones, and correlate vulnerabilities on intermediate hosts to compromise an otherwise well-protected critical resource. Conventional security assessment approaches can leave out some complex scenarios generated by these attacks. In the literature, these correlated attacks have been modeled using attack graphs. Although a few attack graph-based network security assessment tools are available, they are either commercial products or developed using proprietary databases. In this paper, we develop a customized tool, NetSecuritas, which implements a novel heuristic-based attack graph generation algorithm and integrates different phases of network security assessment. NetSecuritas leverages open-source libraries, tools and publicly available databases. A cost-driven mitigation strategy has also been proposed to generate network security recommendations. Experimental results establish the efficacy of both attack graph generation and mitigation approach.
{"title":"NetSecuritas: An Integrated Attack Graph-based Security Assessment Tool for Enterprise Networks","authors":"Nirnay Ghosh, Ishan Chokshi, Mithun Sarkar, S. Ghosh, A. K. Kaushik, Sajal K. Das","doi":"10.1145/2684464.2684494","DOIUrl":"https://doi.org/10.1145/2684464.2684494","url":null,"abstract":"Sophisticated cyber-attacks have become prominent with the growth of the Internet and web technology. Such attacks are multi-stage ones, and correlate vulnerabilities on intermediate hosts to compromise an otherwise well-protected critical resource. Conventional security assessment approaches can leave out some complex scenarios generated by these attacks. In the literature, these correlated attacks have been modeled using attack graphs. Although a few attack graph-based network security assessment tools are available, they are either commercial products or developed using proprietary databases. In this paper, we develop a customized tool, NetSecuritas, which implements a novel heuristic-based attack graph generation algorithm and integrates different phases of network security assessment. NetSecuritas leverages open-source libraries, tools and publicly available databases. A cost-driven mitigation strategy has also been proposed to generate network security recommendations. Experimental results establish the efficacy of both attack graph generation and mitigation approach.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125623180","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}
J. Silva, Tiago M. Vale, Ricardo J. Dias, Hervé Paulino, João M. Lourenço
Distributed transactional memory (DTM) presents itself as a highly expressive and programmer friendly model for concurrency control in distributed programming. Current DTM systems make use of both data distribution and replication as a way of providing scalability and fault tolerance, but both techniques have advantages and drawbacks. As such, each one is suitable for different target applications, and deployment environments. In this paper we address the support of different data replication models in DTM. To that end we propose ReDstm, a modular and non-intrusive framework for DTM, that supports multiple data replication models in a general purpose programming language (Java). We show its application in the implementation of distributed software transactional memories with different replication models, and evaluate the framework via a set of well-known benchmarks, analysing the impact of the different replication models on memory usage and transaction throughput.
{"title":"Supporting Multiple Data Replication Models in Distributed Transactional Memory","authors":"J. Silva, Tiago M. Vale, Ricardo J. Dias, Hervé Paulino, João M. Lourenço","doi":"10.1145/2684464.2684481","DOIUrl":"https://doi.org/10.1145/2684464.2684481","url":null,"abstract":"Distributed transactional memory (DTM) presents itself as a highly expressive and programmer friendly model for concurrency control in distributed programming. Current DTM systems make use of both data distribution and replication as a way of providing scalability and fault tolerance, but both techniques have advantages and drawbacks. As such, each one is suitable for different target applications, and deployment environments. In this paper we address the support of different data replication models in DTM. To that end we propose ReDstm, a modular and non-intrusive framework for DTM, that supports multiple data replication models in a general purpose programming language (Java). We show its application in the implementation of distributed software transactional memories with different replication models, and evaluate the framework via a set of well-known benchmarks, analysing the impact of the different replication models on memory usage and transaction throughput.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134310283","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}
Time Division Multiple Access (TDMA)-based medium access control (MAC) protocols can be used to provide guaranteed quality of service (QoS). Since nodes follow a fixed schedule to transmit data, the schedule plays a major role in determining QoS in terms of delay, throughput etc. In this study, we focus on end-to-end delay and bandwidth utilization as the QoS parameters. We present a TDMA scheduling scheme that minimizes the end-to-end delay of data, while reusing time slots where possible. This is done by ordering the transmissions along a path such that the scheduling delay at intermediate nodes is minimized. The scheme results in end-to-end delay spanning multiple frames. However, because the TDMA frame length is minimized, the end-to-end delay is minimized while increasing the throughput. The proposed scheme uses a heuristic which has a complexity of O(n2), making it suitable for networks with a large number of nodes. We also present a simple distributed version of our heuristic. Simulation results show that our scheme performs better than previous work in literature in terms of end-to-end delay and slot reuse.
{"title":"Delay-aware TDMA Scheduling for Multi-Hop Wireless Networks","authors":"Shanti Chilukuri, A. Sahoo","doi":"10.1145/2684464.2684493","DOIUrl":"https://doi.org/10.1145/2684464.2684493","url":null,"abstract":"Time Division Multiple Access (TDMA)-based medium access control (MAC) protocols can be used to provide guaranteed quality of service (QoS). Since nodes follow a fixed schedule to transmit data, the schedule plays a major role in determining QoS in terms of delay, throughput etc. In this study, we focus on end-to-end delay and bandwidth utilization as the QoS parameters. We present a TDMA scheduling scheme that minimizes the end-to-end delay of data, while reusing time slots where possible. This is done by ordering the transmissions along a path such that the scheduling delay at intermediate nodes is minimized. The scheme results in end-to-end delay spanning multiple frames. However, because the TDMA frame length is minimized, the end-to-end delay is minimized while increasing the throughput. The proposed scheme uses a heuristic which has a complexity of O(n2), making it suitable for networks with a large number of nodes. We also present a simple distributed version of our heuristic. Simulation results show that our scheme performs better than previous work in literature in terms of end-to-end delay and slot reuse.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127585262","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}
M. Aguilera, Joshua B. Leners, R. Kotla, Michael Walfish
Based on a brief history of the storage systems for Web applications, we motivate the need for a new storage system. We then describe the architecture of such a system, called Yesquel. Yesquel supports the sql query language and offers performance similar to nosql storage systems.
{"title":"Yesquel: Scalable SQL storage for Web applications","authors":"M. Aguilera, Joshua B. Leners, R. Kotla, Michael Walfish","doi":"10.1145/2684464.2684504","DOIUrl":"https://doi.org/10.1145/2684464.2684504","url":null,"abstract":"Based on a brief history of the storage systems for Web applications, we motivate the need for a new storage system. We then describe the architecture of such a system, called Yesquel. Yesquel supports the sql query language and offers performance similar to nosql storage systems.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124848864","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
扫码关注我们
求助内容：
应助结果提醒方式：