Search

Your search keyword '"Meling, Hein"' showing total 182 results
Start Over Author "Meling, Hein"

Refine your results

more »

more »

more »

more »
182 results on '"Meling, Hein"'

1. Iniva: Inclusive and Incentive-compatible Vote Aggregation

Author

Baloochestani, Arian, Gogada, Hanish, Jehl, Leander, and Meling, Hein

Subjects
Computer Science - Cryptography and Security, Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

Many blockchain platforms use committee-based consensus for scalability, finality, and security. In this consensus scheme, a committee decides which blocks get appended to the chain, typically through several voting phases. Platforms typically leverage the committee members' recorded votes to reward, punish, or detect failures. A common approach is to let the block proposer decide which votes to include, opening the door to possible attacks. For example, a malicious proposer can omit votes from targeted committee members, resulting in lost profits and, ultimately, their departure from the system. This paper presents Iniva, an inclusive and incentive-compatible vote aggregation scheme that prevents such vote omission attacks. Iniva relies on a tree overlay with carefully selected fallback paths, making it robust against process failures without needing reconfiguration or additional redundancy. Our analysis shows that Iniva significantly reduces the chance to omit individual votes while ensuring that omitting many votes incurs a significant cost. In addition, our experimental results show that Iniva enjoys robustness, scalability, and reasonable throughput., Comment: Committee-based blockchains, Vote omission attack, Vote inclusion, Signature aggregation, Incentive-compatible

Published
2024

2. SNIPS: Succinct Proof of Storage for Efficient Data Synchronization in Decentralized Storage Systems

Author

Nygaard, Racin and Meling, Hein

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

Data synchronization in decentralized storage systems is essential to guarantee sufficient redundancy to prevent data loss. We present SNIPS, the first succinct proof of storage algorithm for synchronizing storage peers. A peer constructs a proof for its stored chunks and sends it to verifier peers. A verifier queries the proof to identify and subsequently requests missing chunks. The proof is succinct, supports membership queries, and requires only a few bits per chunk. We evaluated our SNIPS algorithm on a cluster of 1000 peers running Ethereum Swarm. Our results show that SNIPS reduces the amount of synchronization data by three orders of magnitude compared to the state-of-the-art. Additionally, creating and verifying a proof is linear with the number of chunks and typically requires only tens of microseconds per chunk. These qualities are vital for our use case, as we envision running SNIPS frequently to maintain sufficient redundancy consistently.

Published
2023

3. A Tree-based Construction for Verifiable Diplomas with Issuer Transparency

Author

Saramago, Rodrigo Q., Jehl, Leander, Meling, Hein, and Estrada-Galiñanes, Vero

Subjects
Computer Science - Cryptography and Security
Abstract

Still to this day, academic credentials are primarily paper-based, and the process to verify the authenticity of such documents is costly, time-consuming, and prone to human error and fraud. Digitally signed documents facilitate a cost-effective verification process. However, vulnerability to fraud remains due to reliance on centralized authorities that lack full transparency. In this paper, we present the mechanisms we designed to create secure and machine-verifiable academic credentials. Our protocol models a diploma as an evolving set of immutable credentials. The credentials are built as a tree-based data structure with linked time-stamping, where portions of credentials are distributed over a set of smart contracts. Our design prevents fraud of diplomas and eases the detection of degree mills, while increasing the transparency and trust in the issuer's procedures. Our evaluation shows that our solution offers a certification system with strong cryptographic security and imposes a high level of transparency of the certification process. We achieve these benefits with acceptable costs compared to existing solutions that lack such transparency.

Published
2021

4. [Invited talk] Building a Disaster-resilient Storage Layer for Next Generation Networks: The Role of Redundancy

Author

Estrada-Galinanes, Vero, Nygaard, Racin, Tron, Viktor, Saramago, Rodrigo, Jehl, Leander, and Meling, Hein

Subjects
Computer Science - Networking and Internet Architecture, Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

Blockchain is the driving force behind a myriad of decentralized applications (dapps) that promise to transform the Internet. The next generation Internet, or web3, introduces a "universal state layer" to store data in p2p networks. Swarm, a native layer of the Ethereum web3 stack, aims at providing redundant storage for dapp code, data, as well as, blockchain and state data. Based on a diploma verification dapp use case, we share insights on the role of redundancy strategies in designing a reliable storage layer. Our proof-of-concept improves Swarm's resilience to failures by balancing repairs and storage, with a slightly added latency., Comment: 6 pages, Invited talk at Technical Committee on Network Systems Workshop 2019-10-10 - 2019-10-11, Nagoya Institute of Technology, Japan

Published
2019

5. Time-aware Test Case Execution Scheduling for Cyber-Physical Systems

Author

Mossige, Morten, Gotlieb, Arnaud, Spieker, Helge, Meling, Hein, and Carlsson, Mats

Subjects
Computer Science - Software Engineering, Computer Science - Artificial Intelligence
Abstract

Testing cyber-physical systems involves the execution of test cases on target-machines equipped with the latest release of a software control system. When testing industrial robots, it is common that the target machines need to share some common resources, e.g., costly hardware devices, and so there is a need to schedule test case execution on the target machines, accounting for these shared resources. With a large number of such tests executed on a regular basis, this scheduling becomes difficult to manage manually. In fact, with manual test execution planning and scheduling, some robots may remain unoccupied for long periods of time and some test cases may not be executed. This paper introduces TC-Sched, a time-aware method for automated test case execution scheduling. TC-Sched uses Constraint Programming to schedule tests to run on multiple machines constrained by the tests' access to shared resources, such as measurement or networking devices. The CP model is written in SICStus Prolog and uses the Cumulatives global constraint. Given a set of test cases, a set of machines, and a set of shared resources, TC-Sched produces an execution schedule where each test is executed once with minimal time between when a source code change is committed and the test results are reported to the developer. Experiments reveal that TC-Sched can schedule 500 test cases over 100 machines in less than 4 minutes for 99.5% of the instances. In addition, TC-Sched largely outperforms simpler methods based on a greedy algorithm and is suitable for deployment on industrial robot testing., Comment: Published in the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017)

Published
2019
Full Text
View/download PDF

6. Rebop: Reputation-Based Incentives in Committee-Based Blockchains

Author

Baloochestani, Arian, Jehl, Leander, Meling, Hein, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Eyers, David, editor, and Voulgaris, Spyros, editor

Published
2022
Full Text
View/download PDF

8. Model-Based Testing of the Gorums Framework for Fault-Tolerant Distributed Systems

Author

Wang, Rui, Kristensen, Lars Michael, Meling, Hein, Stolz, Volker, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Koutny, Maciej, editor, Kristensen, Lars Michael, editor, and Penczek, Wojciech, editor

Published
2018
Full Text
View/download PDF

9. ByzID: Byzantine Fault Tolerance from Intrusion Detection

Author

Duan, Sisi, Levitt, Karl, Meling, Hein, Peisert, Sean, and Zhang, Haibin

Subjects
Byzantine Fault Tolerance, Intrusion Detection, state machine replication, specification-based intrusion detection
Abstract

Building robust network services that can withstand a wide range of failure types is a fundamental problem in distributed systems. The most general approach, called Byzantine fault tolerance, can mask arbitrary failures. Yet it is often considered too costly to deploy in practice, and many solutions are not resilient to performance attacks. To address this concern we leverage two key technologies already widely deployed in cloud computing infrastructures: replicated state machines and intrusiondetection systems.First, we have designed a general framework for constructing Byzantine failure detectors based on an intrusion detection system. Based on such a failure detector, we have designed and built a practical Byzantine fault-tolerant protocol, which has costs comparable to crash-resilient protocols like Paxos. More importantly, our protocol is particularly robust against several key attacks such as flooding attacks, timing attacks, and fairness attacks, that are typically not handled well by Byzantine fault masking procedures.

Published
2014

10. P2S: A Fault-Tolerant Publish/Subscribe Infrastructure

Author

Chang, Tiancheng, Duan, Sisi, Meling, Hein, Peisert, Sean, and Zhang, Haibin

Subjects
Fault tolerance, Paxos, Publish/Subscribe, IPTV Application
Abstract

The popular publish/subscribe communication paradigm, for building large-scale distributed event notification systems, has attracted attention from both academia and industry due to its performance and scalability characteristics. While ordinary "web surfers" typically are not aware of minor packet loss, industrial applications often have tight timing constraints and require rigorous fault tolerance. Some past research has addressed the need to tolerate node crashes and link failures, often relying on distributing the brokers on an overlay network. However, these solutions impose significant complexity both in terms of implementation and deployment.In this paper, we present a crash tolerant Paxos-based pub/sub (P2S) middleware. P2S contributes a practical solution by replicating the broker in a replicated architecture based on Goxos, a Paxosbased fault tolerance library. Goxos can switch between various Paxos variants according to different fault tolerance requirements. P2S directly adapts existing fault tolerance techniques to pub/sub, with the aim of reducing the burden of proving the correctness of the implementation. Furthermore, P2S is a development framework that provides sophisticated generic programming interfaces for building various types of pub/sub applications. The flexibility and versatility of the P2S framework ensures that pub/sub systems with widely varying dependability needs can be developed quickly.We evaluate the performance of our implementation using event logs obtained from a real deployment at an IPTV cable provider. Our evaluation results show that P2S reduces throughput by as little as 1.25% and adds only 0.58 ms latency overhead, compared to its non-replicated counterpart. The performance characteristics of P2S prove the feasibility and utility of our framework.

Published
2014

11. Time-Aware Test Case Execution Scheduling for Cyber-Physical Systems

Author

Mossige, Morten, Gotlieb, Arnaud, Spieker, Helge, Meling, Hein, Carlsson, Mats, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Beck, J. Christopher, editor

Published
2017
Full Text
View/download PDF

13. An Extensible Framework for Implementing and Validating Byzantine Fault-tolerant Protocols

Author

Gogada, Hanish, Jehl, Leander, Meling, Hein, and Olsen, John Ingve

Subjects
Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550::Datateknologi: 551 [VDP]
Abstract

HotStuff is a Byzantine fault-tolerant state machine replication protocol that incurs linear communication costs to achieve consensus. This linear scalability promoted the protocol to be adopted as the consensus mechanism in permissioned blockchains. This paper discusses the architecture, testing, and evaluation of our extensible framework to implement HotStuff and its variants. The framework already contains three HotStuff variants and other interchangeable components for cryptographic operations and leader selection. Inspired by the Twins approach, we also provide a testing framework for validating protocol implementations by inducing Byzantine behaviors. Test generation is protocol-agnostic; new protocols can execute the test suite with little-to-no modifications. We report relevant insights on how we benefited from Twins for validation and test-driven development. Leveraging our deployment tool, we evaluated our implementation in various configurations.

Published
2023

14. SmartMerge: A New Approach to Reconfiguration for Atomic Storage

Author

Jehl, Leander, Vitenberg, Roman, Meling, Hein, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Moses, Yoram, editor

Published
2015
Full Text
View/download PDF

17. A Privacy-Preserving and Transparent Certification System for Digital Credentials

Author

Rodrigo Q. Saramago and Hein Meling and Leander N. Jehl, Saramago, Rodrigo Q., Meling, Hein, Jehl, Leander N., Rodrigo Q. Saramago and Hein Meling and Leander N. Jehl, Saramago, Rodrigo Q., Meling, Hein, and Jehl, Leander N.

Abstract

A certification system is responsible for issuing digital credentials, which attest claims about a subject, e.g., an academic diploma. Such credentials are valuable for individuals and society, and widespread adoption requires a trusted certification system. Trust can be gained by being transparent when issuing and verifying digital credentials. However, there is a fundamental tradeoff between privacy and transparency. For instance, admitting a student to an academic program must preserve the student’s privacy, i.e., the student’s grades must not be revealed to unauthorized parties. At the same time, other applicants may demand transparency to ensure fairness in the admission process. Thus, building a certification system with the right balance between privacy and transparency is challenging. This paper proposes a novel design for a certification system that provides sufficient transparency and preserves privacy through selective disclosure of claims such that authorized parties can verify them. Moreover, unauthorized parties can also verify the correctness of the certification process without compromising privacy. We achieve this using an incremental Merkle tree of cryptographic commitments to users' credentials. The commitments are added to the tree based on verifying zero-knowledge issuance proofs. Users store credentials off-chain and can prove the ownership and authenticity of credentials without revealing their commitments. Further, our approach enables users to prove statements about the credential’s claims in zero-knowledge. Our design offers a cost-efficient solution, reducing the amount of linkable on-chain data by up to 79% per credential compared to prior work, while maintaining transparency.

Published
2023
Full Text
View/download PDF

18. Testing Robotized Paint System Using Constraint Programming: An Industrial Case Study

Author

Mossige, Morten, Gotlieb, Arnaud, Meling, Hein, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Merayo, Mercedes G., editor, and de Oca, Edgardo Montes, editor

Published
2014
Full Text
View/download PDF

19. A Fuzzy-Logic Based Coordinated Scheduling Technique for Inter-grid Architectures

Author

Azab, Abdulrahman, Meling, Hein, Davidrajuh, Reggie, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Magoutis, Kostas, editor, and Pietzuch, Peter, editor

Published
2014
Full Text
View/download PDF

20. Asynchronous Reconfiguration for Paxos State Machines

Author

Jehl, Leander, Meling, Hein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chatterjee, Mainak, editor, Cao, Jian-nong, editor, Kothapalli, Kishore, editor, and Rajsbaum, Sergio, editor

Published
2014
Full Text
View/download PDF

21. BChain: Byzantine Replication with High Throughput and Embedded Reconfiguration

Author

Duan, Sisi, Meling, Hein, Peisert, Sean, Zhang, Haibin, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Aguilera, Marcos K., editor, Querzoni, Leonardo, editor, and Shapiro, Marc, editor

Published
2014
Full Text
View/download PDF

22. Using CP in Automatic Test Generation for ABB Robotics’ Paint Control System

Author

Mossige, Morten, Gotlieb, Arnaud, Meling, Hein, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and O’Sullivan, Barry, editor

Published
2014
Full Text
View/download PDF

25. A Privacy-Preserving and Transparent Certification System for Digital Credentials

Author

Queiroz Saramago, Rodrigo, Meling, Hein, and Jehl, Leander Nikolaus

Subjects
blockchain, Information systems → Extraction, transformation and loading, zero-knowledge, privacy-preserving, Security and privacy → Privacy-preserving protocols, Security and privacy → Pseudonymity, anonymity and untraceability, Teknologi: 500 [VDP], verifiable credentials
Abstract

A certification system is responsible for issuing digital credentials, which attest claims about a subject, e.g., an academic diploma. Such credentials are valuable for individuals and society, and widespread adoption requires a trusted certification system. Trust can be gained by being transparent when issuing and verifying digital credentials. However, there is a fundamental tradeoff between privacy and transparency. For instance, admitting a student to an academic program must preserve the student’s privacy, i.e., the student’s grades must not be revealed to unauthorized parties. At the same time, other applicants may demand transparency to ensure fairness in the admission process. Thus, building a certification system with the right balance between privacy and transparency is challenging. This paper proposes a novel design for a certification system that provides sufficient transparency and preserves privacy through selective disclosure of claims such that authorized parties can verify them. Moreover, unauthorized parties can also verify the correctness of the certification process without compromising privacy. We achieve this using an incremental Merkle tree of cryptographic commitments to users' credentials. The commitments are added to the tree based on verifying zero-knowledge issuance proofs. Users store credentials off-chain and can prove the ownership and authenticity of credentials without revealing their commitments. Further, our approach enables users to prove statements about the credential’s claims in zero-knowledge. Our design offers a cost-efficient solution, reducing the amount of linkable on-chain data by up to 79% per credential compared to prior work, while maintaining transparency., LIPIcs, Vol. 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022), pages 9:1-9:24

Published
2023
Full Text
View/download PDF

26. Cost-effective Data Upkeep in Decentralized Storage Systems

Author

Nygaard, Racin Wilhelm, Meling, Hein, and Olsen, John Ingve

Subjects
datalagring, Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550 [VDP], desentralisert lagring
Abstract

Decentralized storage systems split files into chunks and distribute the chunks across a network of peers. Each peer may only store a few chunks per file. To later reconstruct a file, all its chunks must be downloaded. Chunks can disappear from the network at any time as peers are untrusted and may misbehave, fail or leave the network. Current systems lack a secure and cost-effective mechanism for discovering missing chunks. Hence, a client must periodically re-upload all of the file's chunks to keep it available, even if only a few are missing from the network. Needlessly re-uploading chunks waste significant amounts of the network's bandwidth, takes additional time to complete, and forces the client to pay for unwarranted resources. To address the above problem, we propose SUP, a novel protocol that utilizes proof-of-storage queries to detect missing chunks. We have evaluated SUP on a large cluster of 1000 peers running a recent version of Ethereum Swarm. Our contributions include the design and implementation of SUP and a study of Swarm's redundancy characteristics. Our evaluation shows that SUP significantly improves bandwidth utilization and time spent on data upkeep compared to the existing solution. In common scenarios, SUP can save as much as 94 % bandwidth and reduce the time spent re-uploading by up to 82 %. While dependent on the storage network's bandwidth pricing policy, using SUP may also reduce the overall monetary costs of data upkeep.

Published
2023

27. Tutorial Summary: Paxos Explained from Scratch

Author

Meling, Hein, Jehl, Leander, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Baldoni, Roberto, editor, Nisse, Nicolas, editor, and van Steen, Maarten, editor

Published
2013
Full Text
View/download PDF

28. Reliability Modeling and Analysis of Modern Distributed Interactive Multimedia Applications: A Case Study of a Distributed Opera Performance

Author

Veeraragavan, Narasimha Raghavan, Vitenberg, Roman, Meling, Hein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Göschka, Karl Michael, editor, and Haridi, Seif, editor

Published
2012
Full Text
View/download PDF

29. Stroll: A Universal Filesystem-Based Interface for Seamless Task Deployment in Grid Computing

Author

Azab, Abdulrahman, Meling, Hein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Göschka, Karl Michael, editor, and Haridi, Seif, editor

Published
2012
Full Text
View/download PDF

30. A Virtual File System Interface for Computational Grids

Author

Azab, Abdulrahman, Meling, Hein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Aagesen, Finn Arve, editor, and Knapskog, Svein Johan, editor

Published
2010
Full Text
View/download PDF

31. Laying Pheromone Trails for Balanced and Dependable Component Mappings

Author

Csorba, Máté J., Meling, Hein, Heegaard, Poul E., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Spyropoulos, Thrasyvoulos, editor, and Hummel, Karin Anna, editor

Published
2009
Full Text
View/download PDF

32. Decentralized Service Allocation in a Broker Overlay Based Grid

Author

Azab, Abdulrahman, Meling, Hein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Jaatun, Martin Gilje, editor, Zhao, Gansen, editor, and Rong, Chunming, editor

Published
2009
Full Text
View/download PDF

33. Foraging for Better Deployment of Replicated Service Components

Author

Csorba, Máté J., Meling, Hein, Heegaard, Poul E., Herrmann, Peter, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Senivongse, Twittie, editor, and Oliveira, Rui, editor

Published
2009
Full Text
View/download PDF

34. Annotation Markers for Runtime Replication Protocol Selection

Author

Meling, Hein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Rong, Chunming, editor, Jaatun, Martin Gilje, editor, Sandnes, Frode Eika, editor, Yang, Laurence T., editor, and Ma, Jianhua, editor

Published
2008
Full Text
View/download PDF

35. An Architecture for Self-healing Autonomous Object Groups

Author

Meling, Hein, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Xiao, Bin, editor, Yang, Laurence T., editor, Ma, Jianhua, editor, Muller-Schloer, Christian, editor, and Hua, Yu, editor

Published
2007
Full Text
View/download PDF

36. An Approach to Experimentally Obtain Service Dependability Characteristics of the Jgroup/ARM System

Author

Helvik, Bjarne E., Meling, Hein, Montresor, Alberto, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Dal Cin, Mario, editor, Kaâniche, Mohamed, editor, and Pataricza, András, editor

Published
2005
Full Text
View/download PDF

41. Snarl

Author

Nygaard, Racin, primary, Estrada-Galiñanes, Vero, additional, and Meling, Hein, additional

Published
2021
Full Text
View/download PDF

43. Deploying constraint programming for testing ABB's painting robots

Author

Mossige, Morten, Gotlieb, Arnaud, and Meling, Hein

Subjects
Robotics industry, Robots, Robotics, Robotics industry, Robot, Business
Abstract

This report explores the use of constraint programming for the validation of ABB Robotics' painting robots. Testing software systems is a difficult cognitive task that requires human skills to generate [...]

Published
2017

47. Brief Announcement: When You Don’t Trust Clients: Byzantine Proposer Fast Paxos

Author

Marzullo, Keith, Meling, Hein, Mei, Alessandro, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, and Peleg, David, editor

Published
2011
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results