| Description |
1 online resource : illustrations (chiefly color) |
| Series |
Lecture notes in computer science ; 13084 |
|
LNCS sublibrary: SL1 - Theoretical computer science and general issues |
|
Lecture notes in computer science ; 13084.
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues.
|
| Contents |
Intro -- Preface -- Organization -- Cloud-Assisted Peer-to-Peer Systems (Keynote Talk) -- Tutorials -- Self-Adjusting Networks: Enablers, Algorithms, Complexity -- Self-healing Distributed Algorithms -- Gaming the Decentralized Finance -- Contents -- On the Fault-Tolerant Online Bin Packing Problem -- 1 Introduction -- 1.1 Previous Work and Contribution -- 2 Primary-Standby Model for Fault-Tolerant Bin-Packing -- 3 Harmonic-Stretch Algorithm -- 3.1 Item Classification -- 3.2 Maintaining Bin Groups -- 3.3 Packing Strategy -- 3.4 Adjustment Strategy -- 4 Competitiveness of Harmonic-Stretch |
|
5 Concluding Remarks -- References -- R-SWAP: Relay Based Atomic Cross-Chain Swap Protocol -- 1 Introduction -- 2 Model and Definitions -- 2.1 System Model -- 2.2 Distributed Ledger Model -- 2.3 Asset Model -- 3 Time Locked Atomic Cross-Chain Swap -- 3.1 Problem Specification -- 3.2 Abstractions for Implementing R-SWAP -- 4 R-SWAP Protocol -- 4.1 Protocol Overview -- 4.2 Phase 1: Commitment Phase -- 4.3 Phase 2: Contracts Redeem/Refund -- 5 R-SWAP Correctness -- 6 R-SWAP Evaluation -- 7 Conclusions and Discussions -- A Blockchain Relay Smart Contract Class -- B Time Lock Value Determination |
|
C R-SWAP Smart Contract -- D Numerical Analysis of R-SWAP Latency -- E Cost Evaluation -- F Other Related Works -- References -- New Results on Test-Cost Minimization in Database Migration -- 1 Introduction -- 2 Model and Preliminaries -- 3 New Algorithmic Bounds -- 4 Approximation Complexity -- 5 Empirical Analysis -- 5.1 The Hypergraph Partitioning Problem and Heuristics -- 5.2 Instance Generation and Experimental Setup -- 5.3 Performance of the Heuristic Algorithms -- 6 Conclusion -- References |
|
Privately Querying Privacy: Privacy Estimation with Guaranteed Privacy of User and Database Party -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Measuring Privacy and Anonymity -- 2.1 Proxy Measures for k-Anonymity -- 3 Privately Querying Privacy -- 3.1 Cryptographic Primitives -- 3.2 Private Computation of z-Score-Based Privacy -- 3.3 Private Computation of Histogram-Based Privacy -- 3.4 Private Computation of Self-information-Based Privacy -- 4 Performance Evaluation -- 5 Conclusions -- References |
|
Brief Announcement: On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time -- 1 Introduction -- 1.1 Our Contribution -- 2 Materials and Methods -- 3 Results -- 3.1 Polylogarithmic Time Protocols for k-Children Spanning Trees -- 3.2 Time Thresholds for (l, k)-Regular Networks -- References -- Author Index |
| Summary |
This book constitutes the refereed post-conference proceedings of the 6th International Symposium on Algorithmic Aspects of Cloud Computing, ALGOCLOUD 2021, held in Lisbon, Portugal, in September 2021. Due to the COVID-19 pandemic the conference was held online. The 4 revised full papers and 1 short paper were carefully reviewed and selected from 11 submissions. The aim of the symposium is to present research activities and results on topics related to algorithmic, design, and development aspects of modern cloud-based systems |
| Notes |
International conference proceedings |
|
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed December 22, 2021) |
| Subject |
Cloud computing -- Mathematics -- Congresses
|
| Genre/Form |
Electronic books
|
|
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
D'Angelo, Gianlorenzo, editor
|
|
Michail, Othon, editor.
|
| ISBN |
9783030930431 |
|
3030930432 |
|
