ETH Zurich

Displaying 1-40 of 318 results

  • White Papers // May 2014

    Distributed Storage for Data Security

    The authors study the secrecy of a distributed storage system for passwords. The encoder, Alice, observes a length-n password and describes it using two hints, which she then stores in different locations. The legitimate receiver, Bob, observes both hints. The eavesdropper, Eve, sees only one of the hints; Alice cannot...

    Provided By ETH Zurich

  • White Papers // Feb 2014

    Isolated Execution in Many-core Architectures

    The authors explore how many-core platforms can be used to enhance the security of future systems and to support important security properties such as runtime isolation using a small Trusted Computing Base (TCB). They focus on the Intel Single-chip Cloud Computer (SCC) to show that such properties can be implemented...

    Provided By ETH Zurich

  • White Papers // Dec 2013

    Time Criticality Challenge in the Presence of Parallelised Execution

    The recent technological advancements and market trends are causing an interesting phenomenon towards the convergence of High-Performance Computing (HPC) and Embedded Computing (EC) domains. On one side, new kinds of HPC applications are being required by markets needing huge amounts of information to be processed within a bounded amount of...

    Provided By ETH Zurich

  • White Papers // Sep 2013

    Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited

    In this paper, the authors experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-)hash join. The relative performance of these two join approaches have been a topic of discussion for a long time. With the advent of modern multi-core architectures, it has been argued...

    Provided By ETH Zurich

  • White Papers // Sep 2013

    A Constructive Approach to Functional Encryption

    Functional encryption is an important generalization of several types of encryption such as public-key, identity-based, and attribute-based encryption. Numerous different security definitions for functional encryption have been proposed, most of them being rather complex and involving several algorithms. Many of these definitions differ in details such as which algorithm has...

    Provided By ETH Zurich

  • White Papers // Sep 2013

    Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design

    Key exchange with unilateral authentication (short: unilateral key exchange) is an important primitive in practical security protocols; a prime example is the widely deployed TLS protocol, which is usually run in this mode. Unilateral key-exchange protocols are employed in a client-server setting where only the server has a certified public...

    Provided By ETH Zurich

  • White Papers // Aug 2013

    A Dynamic Trade-off Between Active and Passive Corruptions in Secure Multi-Party Computation

    Multi-Party Computation (MPC) allows a set of n parties to securely compute a (probabilistic) function f in a distributed manner, where security means that secrecy of the inputs and correctness of the output are maintained even when some of the parties are dishonest. The dishonesty of parties is modeled with...

    Provided By ETH Zurich

  • White Papers // Jul 2013

    Optimising Conceptual Data Models through Profiling in Object Databases

    Agile methods promote iterative development with short cycles, where user feedback from the previous iteration is used to refactor and improve the current version. For information systems development, the authors propose to extend this feedback loop by using database pro ling information to propose adaptations to the conceptual model to...

    Provided By ETH Zurich

  • White Papers // May 2013

    Tailing RFID Tags for Clone Detection

    RFID (Radio-Frequency IDentification) is a key emerging technology for supply-chain monitoring and detection of counterfeit and grey-market goods. The most prevalent RFID tags are, however, simply \"Wireless barcodes,\" themselves vulnerable to cloning and counterfeiting. While continuous monitoring can, in principle, detect cloning attacks, real-world supply chains often contain significant blind...

    Provided By ETH Zurich

  • White Papers // Mar 2013

    VM-MAD: A Cloud/cluster Software for Service-Oriented Academic Environments

    The availability of powerful computing hardware in IaaS clouds makes cloud computing attractive also for computational workloads that were up to now almost exclusively run on HPC clusters. In this paper, the authors present the VM-MAD Orchestrator software: an open source framework for cloudbursting Linux-based HPC clusters into IaaS clouds...

    Provided By ETH Zurich

  • White Papers // Mar 2013

    On Limitations of Friendly Jamming for Confidentiality

    Wireless communication provides unique security challenges, but also enables novel ways to defend against attacks. In the past few years, a number of works discussed the use of friendly jamming to protect the confidentiality of the communicated data as well as to enable message authentication and access control. In this...

    Provided By ETH Zurich

  • White Papers // Mar 2013

    SoK: Secure Data Deletion

    Secure data deletion is the task of deleting data irrecoverably from a physical medium. In the digital world, data is not securely deleted by default; instead, many approaches add secure deletion to existing physical medium interfaces. Interfaces to the physical medium exist at different layers, such as user-level applications, the...

    Provided By ETH Zurich

  • White Papers // Jan 2013

    Pricing in Information-Centric Network Interconnection

    The authors propose a pricing model to study the economic incentives for caching and sharing content in the interconnection of Information-Centric Networks (ICNs). While collaborative caching in ICNs is a key feature to success in improving network performance and reducing delivery costs in content distribution, the current pricing strategies in...

    Provided By ETH Zurich

  • White Papers // Dec 2012

    Main-Memory Hash Joins on Multi-Core CPUs: Tuning to the Underlying Hardware

    The architectural changes introduced with multi-core CPUs have triggered a redesign of main-memory join algorithms. In the last few years, two diverging views have appeared. One approach advocates careful tailoring of the algorithm to the architectural parameters (cache sizes, TLB, and memory bandwidth). The other approach argues that modern hardware...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    A Generic Database Benchmarking Service

    Benchmarks are widely applied for the development and optimization of database systems. Standard benchmarks such as TPC-C and TPC-H provide a way of comparing the performance of different systems. In addition, micro benchmarks can be exploited to test a specific behavior of a system. Yet, despite all the benefits that...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    Relaying and Base Station Cooperation: A Comparative Survey for Future Cellular Networks

    The authors develop a unified framework to investigate the performance of future cellular networks with relays and/or Coordinated MultiPoint (CoMP) transmission. Based on this framework, they study the benefits of CoMP and relaying in a realistic setup. They consider imperfect channel knowledge, different power levels, and simple (thus practically relevant)...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    Universal Computation With Low-Complexity Wireless Relay Networks

    The authors propose a method for enabling complex computations in a network of low-complexity wireless devices. By utilizing multi-hop relaying, such devices can form the wireless equivalent of an Artificial Neural Network (ANN). They provide a method for programming the network functionality in a decentralized fashion and demonstrate the robustness...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    Discovering Structure in Unstructured I/O

    Checkpointing is the predominant storage driver in today's petascale supercomputers and is expected to remain as such in tomorrow's exascale supercomputers. Users typically prefer to checkpoint into a shared file yet parallel file systems often perform poorly for shared file writing. A powerful technique to address this problem is to...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    DTN-Meteo: Forecasting the Performance of DTN Protocols Under Heterogeneous Mobility

    Opportunistic or Delay Tolerant Networks (DTNs) may be used to enable communication in case of failure or lack of infrastructure (disaster, censorship, remote areas) and to complement existing wireless technologies (cellular, WiFi). Wireless peers communicate when in contact, forming an impromptu network, whose connectivity graph is highly dynamic and only...

    Provided By ETH Zurich

  • White Papers // Oct 2012

    Evaluating User Privacy in Bitcoin

    Bitcoin is quickly emerging as a popular digital payment system. However, in spite of its reliance on pseudonyms, Bitcoin raises a number of privacy concerns due to the fact that all of the transactions that take place are publicly announced in the system. In this paper, the authors investigate the...

    Provided By ETH Zurich

  • White Papers // Sep 2012

    Distributed Medium Access Control With Dynamic Altruism

    In this paper, the authors consider medium access control of Local Area Networks (LANs) under limited-information conditions as benefits a distributed system. Rather than assuming "By rule" conformance to a protocol designed to regulate packet-flow rates (as in, e.g., CSMA windowing), they begin with a non-cooperative game framework and build...

    Provided By ETH Zurich

  • White Papers // Sep 2012

    ADMM for Consensus on Colored Networks

    The authors propose a novel distributed algorithm for one of the most fundamental problems in networks: the average consensus. They view the average consensus as an optimization problem, which allows one to use recent techniques and results from the optimization area. Based on the assumption that a coloring scheme of...

    Provided By ETH Zurich

  • White Papers // Aug 2012

    A Cognitive-Inspired Model for Self-Organizing Networks

    In this paper, the authors propose a computational scheme inspired by the workings of human cognition. They embed some fundamental aspects of the human cognitive system into this scheme in order to obtain a minimization of computational resources and the evolution of a dynamic knowledge network over time, and apply...

    Provided By ETH Zurich

  • White Papers // Aug 2012

    Evaluating the Trade-Off Between Energy Efficiency and QoE in Wireless Mesh Networks

    The increasing usage of wireless networks creates new challenges for wireless access providers. On the one hand, providers want to satisfy the user demands but on the other hand, they try to reduce the operational costs by decreasing the energy consumption. In this paper, the authors evaluate the tradeoff between...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    VF2x: Fast, Efficient Virtual Network Mapping for Real Testbed Workloads

    Distributed network testbeds like GENI aim to support a potentially large number of experiments simultaneously on a complex, widely distributed physical network by mapping each requested network onto a share or "Slice" of physical hosts, switches and links. A significant challenge is network mapping: how to allocate virtual nodes, switches...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    Boosting Market Liquidity of Peer-to-Peer Systems Through Cyclic Trading

    Tit-for-tat trading lies at the heart of many incentive mechanisms for distributed systems where participants are anonymous. However, since the standard tit-for-tat approach is restricted to bilateral exchanges, data is transferred only between peers with direct and mutual interests. Generalizing tit-for-tat to multi-lateral trades where contributions can occur along cycles...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    Scheduling Wireless Links With Successive Interference Cancellation

    In this paper, the authors study the problem of scheduling wireless links in a model where successive interference cancellation is combined with the physical interference model and uniform power assignment. Successive interference cancellation is based on the observation that interfering signals should not be treated as random noise, but as...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Data Node Encrypted File System: Efficient Secure Deletion for Flash Memory

    The authors propose the Data Node Encrypted File System (DNEFS), which uses on-the-y encryption and decryption of le system data nodes to efficiently and securely delete data on ash memory systems. DNEFS is a generic modification of existing ash le systems or controllers that enables secure data deletion while preserving...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Performance Analysis of SCOOP Programs

    To support developers in writing reliable and efficient concurrent programs, novel concurrent programming abstractions have been proposed in recent years. Programming with such abstractions requires new analysis tools because the execution semantics often differs considerably from established models. The authors present a performance analyzer that is based on new metrics...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Can Asynchronous Exceptions Expire?

    A multitude of asynchronous exception mechanisms have been proposed. They specify where and when an asynchronous exception propagates. The authors highlight another aspect that has largely been overlooked: can an asynchronous exception expire? They discuss scenarios where it is meaningful for an asynchronous exception to expire. They further elaborate on...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Exploring the Physical-Layer Identification of GSM Devices

    In this paper, the authors study the physical-layer identification of GSM devices. For their exploration, they build an ad-hoc acquisition setup that collects GSM signals during voice calls. They collect signals from a population of 18 mobile devices and build fingerprints by considering both the transient and the data parts...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Counting Stream Registers: An Efficient and Effective Snoop Filter Architecture

    The authors introduce a counting stream register snoop filter, which improves the performance of existing snoop filters based on stream registers. Over time, this class of snoop filters loses the ability to filter memory addresses that have been loaded, and then evicted, from the caches that are filtered; they include...

    Provided By ETH Zurich

  • White Papers // May 2012

    Classifying Internet One-Way Traffic

    Internet Background Radiation (IBR) is a very interesting piece of Internet traffic as it is the result of attacks and mis-configurations. Previous work has primarily analyzed IBR traffic to large unused IP address blocks called network telescopes. In this paper, the authors build new techniques for monitoring one-way traffic in...

    Provided By ETH Zurich

  • White Papers // May 2012

    On the Efficiency of Classical and Quantum Secure Function Evaluation

    The authors provide bounds on the efficiency of secure one sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results they derive bounds on the efficiency of protocols that use different variants of OT as a black-box. When applied to implementations...

    Provided By ETH Zurich

  • White Papers // May 2012

    Passive Corruption in Statistical Multi-Party Computation

    The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way. For this purpose, a fixed set of n parties runs a protocol that tolerates an adversary corrupting a subset of the parties, preserving certain security guarantees like correctness, secrecy, robustness, and...

    Provided By ETH Zurich

  • White Papers // May 2012

    Collection and Analysis of Multi-Dimensional Network Data for Opportunistic Networking Research

    Opportunistic networks use human mobility and consequent wireless contacts between mobile devices to disseminate data in a peer-to-peer manner. Designing appropriate algorithms and protocols for such networks is challenging as it requires understanding patterns of mobility (who meets whom), social relations (who knows whom) and communication (who communicates with whom)....

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Shedding Light on Log Correlation in Network Forensics Analysis

    Presently, forensics analyses of security incidents rely largely on manual, ad-hoc, and very time-consuming processes. A security analyst needs to manually correlate evidence from diverse security logs with expertise on suspected malware and background on the configuration of an infrastructure to diagnose if, when, and how an incident happened. To...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Forecasting DTN Performance Under Heterogeneous Mobility: The Case of Limited Replication

    Opportunistic or Delay Tolerant Networks (DTNs) may be used to enable communication in case of failure or lack of infrastructure (disaster, censorship, remote areas) and to complement existing wireless technologies (cellular, WiFi).Wireless peers communicate when in contact, forming an impromptu network, whose connectivity graph is highly dynamic and only partly...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties

    The authors present a general approach for the symbolic analysis of security protocols that use Diffie-Hellman exponentiation to achieve advanced security properties. They model protocols as multi-set rewriting systems and security properties as first-order formulas. They analyze them using a novel constraint-solving algorithm that supports both falsification and verification, even...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    An Algorithm for Online Reconfiguration of Resource Reservations for Hard Real-Time Systems

    Now-a-days, real-time applications expect the supporting computing system to be reconfigured at run-time. Even during such reconfiguration, timing requirements of the applications must be met. By extension, such requirements are relevant in the design of resource reservations techniques. In this paper, the authors consider such a reconfiguration of the reservation...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Counting Stream Registers: An Efficient and Effective Snoop Filter Architecture

    The authors introduce a counting stream register snoop filter, which improves the performance of existing snoop filters based on stream registers. Over time, this class of snoop filters loses the ability to filter memory addresses that have been loaded, and then evicted, from the caches that are filtered; they include...

    Provided By ETH Zurich

  • White Papers // May 2012

    On the Efficiency of Classical and Quantum Secure Function Evaluation

    The authors provide bounds on the efficiency of secure one sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results they derive bounds on the efficiency of protocols that use different variants of OT as a black-box. When applied to implementations...

    Provided By ETH Zurich

  • White Papers // Dec 2011

    PcapIndex: An Index for Network Packet Traces With Legacy Compatibility

    Long-term historical analysis of captured network traffic is a topic of great interest in network monitoring and network security. A critical requirement is the support for fast discovery of packets that satisfy certain criteria within large-scale packet repositories. This paper presents the first indexing scheme for network packet traces based...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Shedding Light on Log Correlation in Network Forensics Analysis

    Presently, forensics analyses of security incidents rely largely on manual, ad-hoc, and very time-consuming processes. A security analyst needs to manually correlate evidence from diverse security logs with expertise on suspected malware and background on the configuration of an infrastructure to diagnose if, when, and how an incident happened. To...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    A Comprehensive Operational Semantics of the SCOOP Programming Model

    Operational semantics is a flexible, but rigorous means to describe the meaning of programming languages. Small semantics are often preferred, for example to facilitate model checking. However, omitting too many details in a semantics limits results to a core language only, leaving a wide gap towards real implementations. In this...

    Provided By ETH Zurich

  • White Papers // May 2011

    How Do Distribution and Time Zones Affect Software Development? a Case Study on Communication

    Software projects have crossed seas and continents looking for talented developers, moving from local developments to geographically distributed projects. This paper presents a case study analyzing the effect of distribution and time zones on communication in distributed projects. The study was performed in a university course during two semesters, where...

    Provided By ETH Zurich

  • White Papers // Jul 2011

    Evotec: Evolving the Best Testing Strategy for Contract-Equipped Programs

    Automated random testing is effective at detecting faults but it is certainly not an optimal testing strategy for every given program. For example, an automated random testing tool ignores that some routines have stronger preconditions, they use certain literal values, or they are more error-prone. Taking into account such characteristics...

    Provided By ETH Zurich

  • White Papers // Aug 2010

    A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model

    Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races and deadlocks still persist for programmers since available detection and prevention tools are unsound or have otherwise not been well adopted. In an alternative approach, programming...

    Provided By ETH Zurich

  • White Papers // Mar 2010

    Reasoning About Multiple Related Abstractions With MultiStar

    Encapsulated abstractions are fundamental in object-oriented programming. A single class may employ multiple abstractions to achieve its purpose. Such abstractions are often related and combined in disciplined ways. This paper explores ways to express, verify and rely on logical relationships between abstractions. It introduces two general specification mechanisms: export clauses...

    Provided By ETH Zurich

  • White Papers // Oct 2009

    Satisfying Test Preconditions Through Guided Object Selection

    A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditions. This limitation is particularly frustrating if the object pool does contain some precondition-satisfying objects but the strategy, which selects objects at...

    Provided By ETH Zurich

  • White Papers // Apr 2011

    Characterization of Random Linear Network Coding With Application to Broadcast Optimization in Intermittently Connected Networks

    The authors address the problem of optimizing the throughput of network coded traffic in mobile networks operating in challenging environments where connectivity is intermittent and locally available memory space is limited. Random Linear Network Coding (RLNC) is shown to be equivalent (across all possible initial conditions) to a random message...

    Provided By ETH Zurich

  • White Papers // Apr 2011

    Group Distance Bounding Protocols

    Distance Bounding (DB) protocols allow one entity, the verifier, to securely obtain an upper-bound on the distance to another entity, the prover. Thus far, DB was considered mostly in the context of a single prover and a single verifier. There has been no substantial prior work on secure DB in...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties

    The authors present a general approach for the symbolic analysis of security protocols that use Diffie-Hellman exponentiation to achieve advanced security properties. They model protocols as multi-set rewriting systems and security properties as first-order formulas. They analyze them using a novel constraint-solving algorithm that supports both falsification and verification, even...

    Provided By ETH Zurich

  • White Papers // Jan 2012

    Provably Repairing the ISO/IEC 9798 Standard for Entity Authentication

    The authors formally analyze the family of entity authentication proto-cols defined by the ISO/IEC 9798 standard and find numerous weaknesses, both old and new, including some that violate even the most basic authentication guarantees. They analyze the cause of these weaknesses, propose repaired versions of the protocols, and provide automated,...

    Provided By ETH Zurich

  • White Papers // Jun 2010

    Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries

    The authors present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic protocols. The framework's rules can be combined in different ways to specify different adversary capabilities, capturing different practically-relevant notions of key and state compromise. They have...

    Provided By ETH Zurich

  • White Papers // Mar 2009

    Session-State Reveal Is Stronger Than Ephemeral Key Reveal: Attacking the NAXOS Authenticated Key Exchange Protocol

    In the paper "Stronger Security of Authenticated Key Exchange", a new security model for authenticated key exchange protocols (eCK) is proposed. The new model is suggested to be at least as strong as previous models for key exchange protocols. The model includes a new notion of an Ephemeral Key Reveal...

    Provided By ETH Zurich

  • White Papers // Feb 2009

    Comparing State Spaces in Automatic Security Protocol Analysis

    There are several automatic tools available for the symbolic analysis of security protocols. The models underlying these tools differ in many aspects. Some of the differences have already been formally related to each other in the literature, such as difference in protocol execution models or definitions of security properties. However,...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Exploring the Physical-Layer Identification of GSM Devices

    In this paper, the authors study the physical-layer identification of GSM devices. For their exploration, they build an ad-hoc acquisition setup that collects GSM signals during voice calls. They collect signals from a population of 18 mobile devices and build fingerprints by considering both the transient and the data parts...

    Provided By ETH Zurich

  • White Papers // Aug 2009

    Specification Languages for Stutter-Invariant Regular Properties

    Stutter-invariant specifications do not distinguish between system behaviors that differ from each other only by the number of consecutive repetitions of the observed system states. Stutter invariance is crucial for refining specifications and for modular reasoning. Apart from these conceptual reasons for restricting oneself to stutter-invariant specifications, there is also...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Performance Analysis of SCOOP Programs

    To support developers in writing reliable and efficient concurrent programs, novel concurrent programming abstractions have been proposed in recent years. Programming with such abstractions requires new analysis tools because the execution semantics often differs considerably from established models. The authors present a performance analyzer that is based on new metrics...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Can Asynchronous Exceptions Expire?

    A multitude of asynchronous exception mechanisms have been proposed. They specify where and when an asynchronous exception propagates. The authors highlight another aspect that has largely been overlooked: can an asynchronous exception expire? They discuss scenarios where it is meaningful for an asynchronous exception to expire. They further elaborate on...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    Scheduling Wireless Links With Successive Interference Cancellation

    In this paper, the authors study the problem of scheduling wireless links in a model where successive interference cancellation is combined with the physical interference model and uniform power assignment. Successive interference cancellation is based on the observation that interfering signals should not be treated as random noise, but as...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Data Node Encrypted File System: Efficient Secure Deletion for Flash Memory

    The authors propose the Data Node Encrypted File System (DNEFS), which uses on-the-y encryption and decryption of le system data nodes to efficiently and securely delete data on ash memory systems. DNEFS is a generic modification of existing ash le systems or controllers that enables secure data deletion while preserving...

    Provided By ETH Zurich

  • White Papers // Oct 2012

    Evaluating User Privacy in Bitcoin

    Bitcoin is quickly emerging as a popular digital payment system. However, in spite of its reliance on pseudonyms, Bitcoin raises a number of privacy concerns due to the fact that all of the transactions that take place are publicly announced in the system. In this paper, the authors investigate the...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    Discovering Structure in Unstructured I/O

    Checkpointing is the predominant storage driver in today's petascale supercomputers and is expected to remain as such in tomorrow's exascale supercomputers. Users typically prefer to checkpoint into a shared file yet parallel file systems often perform poorly for shared file writing. A powerful technique to address this problem is to...

    Provided By ETH Zurich

  • White Papers // Nov 2011

    Parallel I/O and The Metadata Wall

    Large HPC installations typically make use of parallel file systems that adhere to POSIX I/O conventions, and that implement a separation of data and metadata in order to maintain high performance. File systems such as GPFS and Lustre have evolved to enable an increase in data bandwidth that is primarily...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    DTN-Meteo: Forecasting the Performance of DTN Protocols Under Heterogeneous Mobility

    Opportunistic or Delay Tolerant Networks (DTNs) may be used to enable communication in case of failure or lack of infrastructure (disaster, censorship, remote areas) and to complement existing wireless technologies (cellular, WiFi). Wireless peers communicate when in contact, forming an impromptu network, whose connectivity graph is highly dynamic and only...

    Provided By ETH Zurich

  • White Papers // Sep 2012

    Distributed Medium Access Control With Dynamic Altruism

    In this paper, the authors consider medium access control of Local Area Networks (LANs) under limited-information conditions as benefits a distributed system. Rather than assuming "By rule" conformance to a protocol designed to regulate packet-flow rates (as in, e.g., CSMA windowing), they begin with a non-cooperative game framework and build...

    Provided By ETH Zurich

  • White Papers // Aug 2012

    A Cognitive-Inspired Model for Self-Organizing Networks

    In this paper, the authors propose a computational scheme inspired by the workings of human cognition. They embed some fundamental aspects of the human cognitive system into this scheme in order to obtain a minimization of computational resources and the evolution of a dynamic knowledge network over time, and apply...

    Provided By ETH Zurich

  • White Papers // Aug 2012

    Evaluating the Trade-Off Between Energy Efficiency and QoE in Wireless Mesh Networks

    The increasing usage of wireless networks creates new challenges for wireless access providers. On the one hand, providers want to satisfy the user demands but on the other hand, they try to reduce the operational costs by decreasing the energy consumption. In this paper, the authors evaluate the tradeoff between...

    Provided By ETH Zurich

  • White Papers // May 2012

    Collection and Analysis of Multi-Dimensional Network Data for Opportunistic Networking Research

    Opportunistic networks use human mobility and consequent wireless contacts between mobile devices to disseminate data in a peer-to-peer manner. Designing appropriate algorithms and protocols for such networks is challenging as it requires understanding patterns of mobility (who meets whom), social relations (who knows whom) and communication (who communicates with whom)....

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Forecasting DTN Performance Under Heterogeneous Mobility: The Case of Limited Replication

    Opportunistic or Delay Tolerant Networks (DTNs) may be used to enable communication in case of failure or lack of infrastructure (disaster, censorship, remote areas) and to complement existing wireless technologies (cellular, WiFi).Wireless peers communicate when in contact, forming an impromptu network, whose connectivity graph is highly dynamic and only partly...

    Provided By ETH Zurich

  • White Papers // May 2012

    Classifying Internet One-Way Traffic

    Internet Background Radiation (IBR) is a very interesting piece of Internet traffic as it is the result of attacks and mis-configurations. Previous work has primarily analyzed IBR traffic to large unused IP address blocks called network telescopes. In this paper, the authors build new techniques for monitoring one-way traffic in...

    Provided By ETH Zurich

  • White Papers // May 2012

    Passive Corruption in Statistical Multi-Party Computation

    The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way. For this purpose, a fixed set of n parties runs a protocol that tolerates an adversary corrupting a subset of the parties, preserving certain security guarantees like correctness, secrecy, robustness, and...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    An Algorithm for Online Reconfiguration of Resource Reservations for Hard Real-Time Systems

    Now-a-days, real-time applications expect the supporting computing system to be reconfigured at run-time. Even during such reconfiguration, timing requirements of the applications must be met. By extension, such requirements are relevant in the design of resource reservations techniques. In this paper, the authors consider such a reconfiguration of the reservation...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    Boosting Market Liquidity of Peer-to-Peer Systems Through Cyclic Trading

    Tit-for-tat trading lies at the heart of many incentive mechanisms for distributed systems where participants are anonymous. However, since the standard tit-for-tat approach is restricted to bilateral exchanges, data is transferred only between peers with direct and mutual interests. Generalizing tit-for-tat to multi-lateral trades where contributions can occur along cycles...

    Provided By ETH Zurich

  • White Papers // Apr 2011

    Stumbl: Using Facebook to Collect Rich Datasets for Opportunistic Networking Research

    Opportunistic networks use human mobility and consequent wireless contacts between mobile devices to disseminate data in a peer-to-peer manner. Designing appropriate algorithms and protocols for such networks is challenging as it requires understanding patterns of mobility (who meets whom), social relations (who knows whom) and communication (who communicates with whom)....

    Provided By ETH Zurich

  • White Papers // Jan 2013

    Pricing in Information-Centric Network Interconnection

    The authors propose a pricing model to study the economic incentives for caching and sharing content in the interconnection of Information-Centric Networks (ICNs). While collaborative caching in ICNs is a key feature to success in improving network performance and reducing delivery costs in content distribution, the current pricing strategies in...

    Provided By ETH Zurich

  • White Papers // Jun 2009

    Robust Time-of-Arrival Estimation With an Energy Detection Receiver

    In this paper, the authors derive and analyze a novel time-of-arrival estimation rule, which is robust to channel length uncertainty and requires a-priori knowledge of noise variance and signal-to-noise ratio only. This estimator can easily be implemented using the output of a standard energy detection receiver. Moreover, they show by...

    Provided By ETH Zurich

  • White Papers // Jun 2009

    ML Timing Estimation for Generalized UWB-IR Energy Detection Receivers

    Timing estimation of the receive pulse is a crucial component for communication systems as well as localization with ultra wideband impulse radio. Standard timing estimation algorithms might not be applicable due to stringent requirements on complexity and power consumption of the receiver. Therefore, the authors consider maximum likelihood timing estimation...

    Provided By ETH Zurich