INRIA

Displaying 1-40 of 578 results

  • White Papers // Apr 2014

    Bridging Data in the Clouds: An Environment-Aware System for Geographically Distributed Data Transfers

    Today's continuously growing cloud infrastructures provide support for processing ever increasing amounts of scientific data. Cloud resources for computation and storage are spread among globally distributed datacenters. Thus, to leverage the full computation power of the clouds, global data processing across multiple sites has to be fully enabled. However, managing...

    Provided By INRIA

  • White Papers // Mar 2014

    Evaluating Streaming Strategies for Event Processing across Infrastructure Clouds

    Infrastructure clouds revolutionized the way in which the authors approach resource procurement by providing an easy way to lease compute and storage resources on short notice, for a short amount of time, and on a pay-as-you-go basis. This new opportunity, however, introduces new performance trade-offs. Making the right choices in...

    Provided By INRIA

  • White Papers // Mar 2014

    Optimizing Buffer Sizes for Pipeline Workflow Scheduling with Setup Times

    Mapping linear workflow applications onto a set of homogeneous processors can be optimally solved in polynomial time for the throughput objective with fewer processors than stages. This result even holds true, when setup times occur in the execution and homogeneous buffers are available for the storage of intermediate results. In...

    Provided By INRIA

  • White Papers // Mar 2014

    Sum-of-Product Architectures Computing Just Right

    Many digital filters and signal-processing transforms can be expressed as a Sum of Products with Constants (SPC). This paper addresses the automatic construction of low-precision, but high accuracy SPC architectures: these architectures are specified as last-bit accurate with respect to a mathematical definition. In other words, they behave as if...

    Provided By INRIA

  • White Papers // Feb 2014

    Efficient Workstealing for Multicore Event-Driven Systems

    Many high-performance communicating systems are designed using the event-driven paradigm. As multi-core platforms are now pervasive, it becomes crucial for such systems to take advantage of the available hardware parallelism. Event coloring is a promising approach in this regard. First, it allows programmers to simply and progressively inject support for...

    Provided By INRIA

  • White Papers // Feb 2014

    BlobSeer: Bringing High Throughput under Heavy Concurrency to Hadoop Map-Reduce Applications

    Hadoop is a software framework supporting the Map-Reduce programming model. It relies on the Hadoop Distributed File System (HDFS) as its primary storage system. The efficiency of HDFS is crucial for the performance of Map-Reduce applications. The authors substitute the original HDFS layer of Hadoop with a new, concurrency-optimized data...

    Provided By INRIA

  • White Papers // Jan 2014

    Interactive Inference of Join Queries

    The authors investigate the problem of inferring join queries from user interactions. The user is presented with a set of candidate tuples and is asked to label them as positive or negative depending on whether or not she would like the tuples as part of the join result. The goal...

    Provided By INRIA

  • White Papers // Jan 2014

    Context-Aware Top-k Processing using Views

    Search applications where queries are dependent on their context are becoming increasingly relevant in today's online applications. For example, the context may be the location of the user in location-aware search or the social network of the query initiator in social-aware search. Processing such queries efficiently is inherently difficult, and...

    Provided By INRIA

  • White Papers // Jan 2014

    Deduction with Contradictions in Datalog

    The authors study deduction in the presence of inconsistencies. Following previous works, they capture deduction via datalog programs and in-consistencies through violations of Functional Dependencies (FDs). They study and compare two semantics for datalog with FDs: the first, of a logical nature, is based on inferring facts one at a...

    Provided By INRIA

  • White Papers // Dec 2013

    A Fine-grained Approach for Power Consumption Analysis and Prediction

    Power consumption has become a critical concern in modern computing systems for various reasons including financial savings and environmental protection. With battery powered devices, the authors need to care about the available amount of energy since it is limited. For the case of supercomputers, as they imply a large aggregation...

    Provided By INRIA

  • White Papers // Dec 2013

    Toward Better Simulation of MPI Applications on Ethernet/TCP Networks

    In the High Performance Computing (HPC) field, accurately predicting the execution time of parallel applications is of utmost importance to assess their scalability, and this is particularly true for applications slated for deployment on next-generation exascale systems. While much effort has been put towards understanding the high-level behavior of these...

    Provided By INRIA

  • White Papers // Nov 2013

    Extracting UML/OCL Integrity Constraints and Derived Types from Relational Databases

    Relational databases usually enforce relevant organizational business rules. This aspect is ignored by current database reverse engineering approaches which only focus on the extraction of the structural part of the conceptual schema. Other database elements like triggers, views, column constraints, etc. are not considered by those methods. As a result,...

    Provided By INRIA

  • White Papers // Nov 2013

    Reasoning About Pattern-Based XML Queries

    The authors survey results about static analysis of pattern-based queries over XML documents. These queries are analogs of conjunctive queries, their unions and Boolean combinations, in which tree patterns play the role of atomic formulae. As in the relational case, they can be viewed as both queries and incomplete documents,...

    Provided By INRIA

  • White Papers // Nov 2013

    Dynamic Workload-Based Partitioning Algorithms for Continuously Growing Databases

    Applications with very large databases, where data items are continuously appended, are becoming more and more common. Thus, the development of efficient data partitioning is one of the main requirements to yield good performance. In the case of applications that have complex access patterns, e.g. scientific applications, workload-based partitioning could...

    Provided By INRIA

  • White Papers // Nov 2013

    Mapping Applications on Volatile Resources

    In this paper, the authors study the execution of iterative applications on volatile processors such as those found on desktop grids. They envision two models, one where all tasks are assumed to be independent, and another where all tasks are tightly coupled and keep exchanging information throughout the iteration. These...

    Provided By INRIA

  • White Papers // Oct 2013

    On the Performance and Energy Efficiency of Hadoop Deployment Models

    The exponential growth of scientific and business data has resulted in the evolution of the cloud computing and the MapReduce parallel programming model. Cloud computing emphasizes increased utilization and power savings through consolidation while MapReduce enables large scale data analysis. The Hadoop framework has recently evolved to the standard framework...

    Provided By INRIA

  • White Papers // Oct 2013

    WaRG: Warehousing RDF Graphs

    Databases of facts, each characterized by multiple dimensions, whose values are recorded in measures, are at the core of multidimensional Data Warehouses (DWs in short). The facts can then be analyzed by means of aggregating the measures. Data warehouses are typically built to analyze (some aspects of) an enterprise's business...

    Provided By INRIA

  • White Papers // Sep 2013

    Response Time Analysis for Fixed-Priority Tasks with Multiple Probabilistic Parameters

    In this paper, the authors consider a probabilistic model for real-time task systems with probabilistic worst-case execution times, probabilistic minimum inter-arrival times and probabilistic deadlines. They propose an analysis computing response time distributions of the tasks scheduled on one processor under a task-level fixed-priority preemptive scheduling policy. The complexity of...

    Provided By INRIA

  • White Papers // Aug 2013

    Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints

    The authors consider allocation problems that arise in the context of service allocation in clouds. More specifically, they assume on the one part that each computing resource is associated with a capacity, that can be chosen using the Dynamic Voltage and Frequency Scaling (DVFS) method, and with a probability of...

    Provided By INRIA

  • White Papers // Aug 2013

    Folklore Confirmed: Compiling for Speed = Compiling for Energy

    The main motivations behind the arrival of multi-core processors were power and energy considerations. Increasing power density coupled with heat problems rendered untenable the premise that steadily increased performance could be achieved merely by steadily increasing processor clock speed. Multi-core processors were introduced based on the observation that multiple processors...

    Provided By INRIA

  • White Papers // Aug 2013

    GeCoS: A Framework for Prototyping Custom Hardware Design Flows

    GeCoS is an open source framework that provides a highly productive environment for hardware design. GeCoS primarily targets custom hardware design using High Level Synthesis, distinguishing itself from classical compiler infrastructures. Compiling for custom hardware makes use of domain specific semantics that are not considered by general purpose compilers. Finding...

    Provided By INRIA

  • White Papers // Aug 2013

    Proved Generation of Implementations from Computationally Secure Protocol Specifications

    In order to obtain implementations of security protocols proved secure in the computational model, the authors previously proposed the following approach: they write a specification of the protocol in the input language of the computational protocol verifier CryptoVerif, prove it secure using CryptoVerif, then generate an OCaml implementation of the...

    Provided By INRIA

  • White Papers // Aug 2013

    Collective Mind: Cleaning Up the Research and Experimentation Mess in Computer Engineering Using Crowdsourcing, Big Data and Machine Learning

    Software and hardware co-design and optimization of HPC systems has become intolerably complex, ad-hoc, time consuming and error prone due to enormous number of available design and optimization choices, complex interactions between all software and hardware components, and multiple strict requirements placed on performance, power consumption, size, reliability and cost....

    Provided By INRIA

  • White Papers // Aug 2013

    On the Impact of Network Topology on Wireless Sensor Networks Performances

    Wireless Sensor Networks (WSN) are composed of constrained devices and deployed in unattended and hostile environments. Most papers presenting solutions for WSN evaluate their work over random topologies to highlight some of their \"Good\" performances. They rarely study these behaviors over more than one topology. Yet, the topology used can...

    Provided By INRIA

  • White Papers // Aug 2013

    Reliable Service Allocation in Clouds with Memory and Capacity Constraints

    The authors consider allocation problems that arise in the context of service allocation in clouds. More specifically, on the one part they assume that each Physical Machine (denoted as PM) is offering resources (memory, CPU, disk, network). On the other part, they assume that each application in the IaaS cloud...

    Provided By INRIA

  • White Papers // Jul 2013

    Practical Cryptanalysis of a Public-Key Encryption Scheme Based on New Multivariate Quadratic Assumptions

    In this paper, the authors investigate the security of a public-key encryption scheme introduced by Huang, Liu and Yang (HLY) at PKC'12. This new scheme can be provably reduced to the hardness of solving a set of quadratic equations whose coefficients of highest degree are chosen according to a discrete...

    Provided By INRIA

  • White Papers // Jul 2013

    CrystalGPU: Transparent and Efficient Utilization of GPU Power

    The explosion of the amount of data stored in cloud systems calls for more efficient paradigms for redundancy. While replication is widely used to ensure data availability, erasure correcting codes provide a much better trade-off between storage and availability. Regenerating codes are good candidates for they also offer low repair...

    Provided By INRIA

  • White Papers // Jul 2013

    Towards a Framework for Semantic Exploration of Frequent Patterns

    Mining frequent patterns is an essential task in discovering hidden correlations in datasets. Although frequent patterns unveil valuable information, there are some challenges which limit their usability. The number of possible patterns is often very large which hinders their effective exploration. Patterns with many items are hard to read and...

    Provided By INRIA

  • White Papers // Jul 2013

    Probabilistic Real-Time Systems

    Proposed originally as stochastic scheduling, the probabilistic real-time scheduling concerns real-time systems with at least one parameter described by a random variable. Any parameter of the task may have such description, but the existing work concentrates on the probabilistic worst-case execution times. This paper will provide the main results for...

    Provided By INRIA

  • White Papers // Jul 2013

    Towards QoS-Oriented SLA Guarantees for Online Cloud Services

    Cloud computing provides a convenient means of remote on-demand and pay-per-use access to computing resources. However, its ad hoc management of quality-of-service and SLA poses significant challenges to the performance, dependability and costs of online cloud services. The paper precisely addresses this issue and makes a threefold contribution. It introduces...

    Provided By INRIA

  • White Papers // Jul 2013

    Privacy in Content-Oriented Networking: Threats and Countermeasures

    As the Internet struggles to cope with scalability, mobility, and security issues, new network architectures are being proposed to better accommodate the needs of modern systems and applications. In particular, Content-Oriented Networking (CON) has emerged as promising next-generation Internet architecture: it sets to decouple content from hosts, at the network...

    Provided By INRIA

  • White Papers // Jun 2013

    Model-driven Extraction and Analysis of Network Security Policies

    Firewalls are a key element in network security. They are in charge of filtering the traffic of the network in compliance with a number of access-control rules that enforce a given security policy. In an always-evolving context, where security policies must often be updated to respond to new security requirements,...

    Provided By INRIA

  • White Papers // Jun 2013

    A Prioritized Distributed Mutual Exclusion Algorithm Balancing Priority Inversions and Response Time

    Distributed priority-based mutual exclusion algorithms may present starvation for low priority requests if the shared resource is continuously asked by high priority requests. To address this problem, several existing algorithms dynamically increment the priority of pending low-priority requests. The drawback of this approach is that it may lead to a...

    Provided By INRIA

  • White Papers // Jun 2013

    DB2SNA: An All-in-One Tool for Extraction and Aggregation of Underlying Social Networks From Relational Databases

    In the enterprise context, people need to visualize different types of interactions between heterogeneous objects (e.g. product and site, customers and product, people interaction (social network)...). The existing approaches focus on social networks extraction using web document. However a considerable amount of information is stored in relational databases. Therefore, relational...

    Provided By INRIA

  • White Papers // May 2013

    Adapting Workflows Using Generic Schemas: Application to the Security of Business Processes

    Existing approaches to the adaptation of workflows over web services fall short in two respects. First, they only provide, if ever, limited means for taking into account the execution history of a workflow. Second, they do not support adaptations that require modifications not only at the service composition level but...

    Provided By INRIA

  • White Papers // May 2013

    Advanced Validation of the DVMS Approach to Fully Distributed VM Scheduling

    The holy grail for Infrastructure as a Service (IaaS) providers is to maximize the utilization of their infrastructure while ensuring the Quality of Service (QoS) for the virtual machines they host. Although the frameworks in charge of managing Virtual Machines (VM) on pools of physical ones (PM) have been significantly...

    Provided By INRIA

  • White Papers // May 2013

    Dynamic Scalability of a Consolidation Service

    In the coming years, cloud environments will increasingly face energy saving issues. While consolidating the virtual machines running in a cloud is a well-accepted solution to reduce the energy consumption, ensuring the scalability of the consolidation service remains a challenging issue. In this paper, the authors propose an elastic consolidation...

    Provided By INRIA

  • White Papers // May 2013

    Performance Modeling for Power Consumption Reduction on SCC

    As power is becoming one of the biggest challenge in high performance computing, the authors are proposing a performance model on the Single-chip Cloud Computer in order to predict both power consumption and runtime of regular codes. This model takes into account the frequency at which the cores of the...

    Provided By INRIA

  • White Papers // Apr 2013

    Towards an Access-Control Metamodel for Web Content Management Systems

    Out-of-the-box Web Content Management Systems (WCMSs) are the tool of choice for the development of millions of enterprise web sites but also the basis of many web applications that reuse WCMS for important tasks like user registration and authentication. This widespread use highlights the importance of their security, as WCMSs...

    Provided By INRIA

  • White Papers // Apr 2013

    Supporting Data Privacy in P2P Systems

    Peer-To-Peer (P2P) systems have been very successful for large-scale data sharing. However, sharing sensitive data, like in online social networks, without appropriate access control, can have undesirable impact on data privacy. Data can be accessed by everyone (by potentially untrusted peers) and used for everything (e.g., for marketing or activities...

    Provided By INRIA

  • White Papers // Apr 2010

    Combining Static Analysis and Test Generation for C Program Debugging

    This paper presents the authors' ongoing work on a tool prototype called SANTE (StaticANalysis and TEsting), implementing a combination of static analysis and structural program testing for detection of run-time errors in C programs. First, a static analysis tool (Frama-C) is called to generate alarms when it cannot ensure the...

    Provided By INRIA

  • White Papers // Mar 2012

    Joint Pricing and Cognitive Radio Network Selection: A Game Theoretical Approach

    This paper addresses the joint pricing and network selection problem in cognitive radio networks, considering both the point of view of network users and the Primary Operator. The problem is formulated as a Stackelberg (leader-follower) game where first the PO sets the network subscription price to maximize its revenue. Then,...

    Provided By INRIA

  • White Papers // Jan 2012

    Characterizing Result Errors in Internet Desktop Grids

    Desktop grids use the free resources in Intranet and Internet environments for large-scale computation and storage. While desktop grids offer a high return on investment, one critical issue is the validation of results returned by participating hosts. Several mechanisms for result validation have been previously proposed. However, the characterization of...

    Provided By INRIA

  • White Papers // Dec 2011

    SMART: Secure and Minimal Architecture for (Establishing a Dynamic) Root of Trust

    Remote attestation is the process of securely verifying internal state of a remote hardware platform. It can be achieved either statically (at boot time) or dynamically, at run-time in order to establish a dynamic root of trust. The latter allows full isolation of a code region from preexisting software (including...

    Provided By INRIA

  • White Papers // Jul 2010

    Traffic Grooming in Bidirectional WDM Ring Networks

    The authors study the minimization of ADMs (Add-Drop Multiplexers) in optical WDM bidirectional rings considering symmetric shortest path routing and all-to-all unitary requests. They precisely formulate the problem in terms of graph decompositions, and state a general lower bound for all the values of the grooming factor C and N,...

    Provided By INRIA

  • White Papers // Feb 2009

    Designing Hypergraph Layouts to GMPLS Routing Strategies

    All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, the authors study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the...

    Provided By INRIA

  • White Papers // Jan 2012

    Verification of Security Protocols With Lists: From Length One to Unbounded Length

    The authors present a novel, simple technique for proving secrecy properties for security protocols that manipulate lists of unbounded length, for an unbounded number of sessions. More specifically, their technique relies on the Horn clause approach used in the automatic verifier ProVerif: they show that if a protocol is proven...

    Provided By INRIA

  • White Papers // Sep 2011

    Mechanizing Game-Based Proofs of Security Protocols

    After a short introduction to the field of security protocol verification, the authors present the automatic protocol verifier CryptoVerif. In contrast to most previous protocol verifiers, CryptoVerif does not rely on the Dolev-Yao model, but on the computational model. It produces proofs presented as sequences of games, like those manually...

    Provided By INRIA

  • White Papers // Jan 2012

    Security Protocol Verification: Symbolic and Computational Models

    Security protocol verification has been a very active research area since the 1990s. This paper surveys various approaches in this area, considering the verification in the symbolic model, as well as the more recent approaches that rely on the computational model or that verify protocol implementations rather than specifications. Additionally,...

    Provided By INRIA

  • White Papers // Apr 2012

    Automatically Verified Mechanized Proof of One-Encryption Key Exchange

    The authors present a mechanized proof of the password-based protocol One-Encryption Key Exchange (OEKE) using the computationally-sound protocol prover CryptoVerif. OEKE is a non-trivial protocol, and thus mechanizing its proof provides additional confidence that it is correct. This paper was also an opportunity to implement several important extensions of CryptoVerif,...

    Provided By INRIA

  • White Papers // Apr 2011

    Formal Analysis of Protocols Based on TPM State Registers

    The authors present a Horn-clause-based framework for analyzing security protocols that use Platform Configuration Registers (PCRs), which are registers for maintaining state inside the Trusted Platform Module (TPM). In their model, the PCR state space is unbounded, and their experience shows that a naive analysis using ProVerif or SPASS does...

    Provided By INRIA

  • White Papers // Feb 2011

    Formal Analysis of Privacy for Anonymous Location Based Services

    The authors propose a framework for formal analysis of privacy in location based services such as anonymous electronic toll collection. They give a formal definition of privacy, and apply it to the VPriv scheme for vehicular services. They analyze the resulting model using the ProVerif tool, concluding that their privacy...

    Provided By INRIA

  • White Papers // May 2010

    Using Horn Clauses for Analyzing Security Protocols

    This paper presents a method for verifying security protocols based on an abstract representation of protocols by Horn clauses. This method is the foundation of the protocol verifier ProVerif. It is fully automatic, efficient, and can handle an unbounded number of sessions and an unbounded message space. It supports various...

    Provided By INRIA

  • White Papers // Aug 2010

    A Formal Analysis of Authentication in the TPM

    The Trusted Platform Module (TPM) is a hardware chip designed to enable computers to achieve a greater level of security than is possible in software alone. To this end, the TPM provides a way to store cryptographic keys and other sensitive data in its shielded memory. Through its API, one...

    Provided By INRIA

  • White Papers // Jun 2011

    Why3: Shepherd Your Herd of Provers

    Why3 is the next generation of the Why software verification platform. Why3 clearly separates the purely logical specification part from generation of verification conditions for programs. This paper focuses on the former part. Why3 comes with a new enhanced language of logical specification. It features a rich library of proof...

    Provided By INRIA

  • White Papers // Jul 2009

    Cooperative Download in Urban Vehicular Networks

    The authors target urban scenarios where vehicular users can download large files from road-side Access Points (APs), and define a framework to exploit opportunistic encounters between mobile nodes to increase their transfer rate. They first devise a technique for APs deployment, based on vehicular traffic flows analysis, which fosters cooperative...

    Provided By INRIA

  • White Papers // Feb 2011

    MobSampling: V2V Communications for Traffic Density Estimation

    The authors propose a fully-distributed approach to the online estimation of vehicle traffic density. Their approach envisions vehicles communicating within a VANET and cooperating to collect density measurements through a uniform sampling of the road sections of interest. The proposed scheme does not require the presence of any network infrastructure,...

    Provided By INRIA

  • White Papers // Feb 2012

    A Harmony-Seeking Firefly Swarm to the Periodic Replacement of Damaged Sensors by a Team of Mobile Robots

    Mobile robots nowadays can assist Wireless Sensor Networks (WSNs) in many jeopardizing scenarios that unexpectedly arise during their operational lifetime. The authors focus on an emerging kind of cooperative networking system in which a small team of robotic agents lies at a base station. Their mission is to service an...

    Provided By INRIA

  • White Papers // Feb 2011

    Mobility Prediction Based Neighborhood Discovery in Mobile Ad Hoc Networks

    Hello protocol is the basic technique for neighborhood discovery in wireless ad hoc networks. It requires nodes to claim their existence/aliveness by periodic 'Hello' messages. Central to a hello protocol is the determination of 'Hello' message transmission rate. No fixed optimal rate exists in the presence of node mobility. The...

    Provided By INRIA

  • White Papers // Apr 2011

    Promoting Quality of Service in Substitution Networks With Controlled Mobility

    A substitution network is a rapidly deployable backup wire-less solution to quickly react to network topology changes due to failures or to flash crowd effects on the base network. Unlike other ad hoc and mesh solutions, a substitution network does not attempt to provide new services to customers but rather...

    Provided By INRIA

  • White Papers // Mar 2011

    A New Tool for Generating Realistic Internet Traffic in NS-3

    This paper provides a contribution for NS-3 consisting of a new tool for generating Internet traffic. This tool is based on the Poisson Pareto Burst Process (PPBP), a Long-Range Dependent (LRD) model for network traffic. The PPBP model provides a simple and accurate network traffic generator that matches statistical properties...

    Provided By INRIA

  • White Papers // Jul 2009

    Implementation of Gradient Routing in Wireless Sensor Networks

    IETF ROLL has recently proposed gradient routing as a fundamental building block for routing in wireless sensor networks. This paper seconds this choice by presenting an implementation of gradient routing on current hardware, and by showing experimentally that gradient routing is robust against topological changes. To stress its self-healing quality,...

    Provided By INRIA

  • White Papers // Oct 2008

    Centroid Virtual Coordinates - A Novel Near-Shortest Path Routing Paradigm

    Geographic routing has received an increasing attention in the context of Wireless Sensor Networks since it frees the network from the energy-demanding task of building and maintaining a structure. It requires however each node to know its position, which may be a prohibitive assumption for many applications. To this end,...

    Provided By INRIA

  • White Papers // Oct 2009

    Using Virtual Coordinates for Wireless Sensor Networks: Proof-of-Concept Experimentation

    Routing in a multi-hop wireless network with low-cost nodes is still a challenging task, and specific ultra-low power solutions need to be investigated for WSNs. Geographic routing protocols have been designed, analyzed and simulated. Yet, early experimental trials show that they fail dramatically when faced with real-world constraints such as...

    Provided By INRIA

  • White Papers // Apr 2012

    Optimization Driven Multi-Hop Network Design and Experimentation: The Approach of the FP7 Project OPNEX

    The OPNEX project exemplifies system and optimization theory as the foundations for algorithms that provably maximize capacity of wireless networks. The algorithms termed in abstract network models have been converted to protocols and architectures practically applicable to wireless systems. A validation methodology through experimental protocol evaluation in real network testbeds...

    Provided By INRIA

  • White Papers // Mar 2012

    Cross-Testbed Experimentation Using the Planetlab-NITOS Federation

    Federation of network testbeds has been identified as a key goal in the experimental testbeds community, leading to a recent activity burst in this research field. In this paper, the authors describe a federated experiment between the NITOS wireless testbed and the Planetlab Europe (PLE) testbed. The federation scheme supporting...

    Provided By INRIA

  • White Papers // Apr 2012

    Adaptive CCA Broadcast Encryption With Constant-Size Secret Keys and Ciphertexts

    The authors consider designing broadcast encryption schemes with constant-size secret keys and ciphertexts, achieving chosen-ciphertext security. They first argue that known CPA-to-CCA transforms currently do not yield such schemes. They then propose a scheme, modifying a previous selective CPA secure proposal by Boneh, Gentry, and Waters. Their proposed scheme has...

    Provided By INRIA

  • White Papers // Jul 2012

    Using Poisson Processes to Model Lattice Cellular Networks

    An almost ubiquitous assumption made in the stochastic-analytic approach to study of the quality of user-service in cellular networks is Poisson distribution of base stations, often completed by some specific assumption regarding the distribution of the fading (e.g. Rayleigh). The former (Poisson) assumption is usually (vaguely) justified in the context...

    Provided By INRIA

  • White Papers // Apr 2012

    Nonneutral Network and the Role of Bargaining Power in Side Payments

    Representatives of several Internet access providers have expressed their wish to see a substantial change in the pricing policies of the Internet. In particular, they would like to see content providers pay for use of the network, given the large amount of resources they use. This would be in clear...

    Provided By INRIA

  • White Papers // Nov 2009

    The Failure Trace Archive: Enabling Comparative Analysis of Failures in Diverse Distributed Systems

    With the increasing functionality and complexity of distributed systems, resource failures are inevitable. While numerous models and algorithms for dealing with failures exist, the lack of public trace data sets and tools have prevented meaningful comparisons. To facilitate the design, validation, and comparison of fault-tolerant models and algorithms, the authors...

    Provided By INRIA

  • White Papers // May 2012

    A Trust-Based Strategy for Addressing Residual Attacks in the RELOAD Architecture

    Telephony over IP has undergone a large-scale deployment thanks to the development of high-speed broadband access and the standardization of signalling protocols. A particular attention is currently given to P2PSIP networks which are exposed to many security threats. The RELOAD protocol defines a peer-to-peer signalling overlay designed to support these...

    Provided By INRIA

  • White Papers // May 2012

    Memory Consumption Analysis for the GOE and PET Unequal Erasure Protection Schemes

    Unequal Erasure Protection (UEP) is an attractive approach to protect data flows that contain information of different priority levels. The various solutions that have been proposed can be classified into three families. The first one consists of specific, UEP-aware FEC codes, that map the information dependency within the code structure....

    Provided By INRIA

  • White Papers // May 2012

    Internet Routing Diversity for Stub Networks With a Map-and-Encap Scheme

    Routing diversity has been identified as essential for network robustness and traffic engineering. The Internet possesses by its very nature large path diversity. However this diversity cannot be fully exploited due to BGP limitations, which only keeps one single route for each available prefix. Despite some previous works in the...

    Provided By INRIA

  • White Papers // Mar 2012

    Model Predictive Control for Smooth Distributed Power Adaptation

    This paper addresses the Distributed Power Adaptation (DPA) problem on the downlink for wireless cellular networks. As a consequence of uncoordinated local scheduling decisions in classical networks, the base stations produce mutual uncontrolled interference on their co-channel users. This interference is of a variable nature, and is hardly predictable, which...

    Provided By INRIA

  • White Papers // Aug 2009

    jYang : A YANG Parser in Java

    The NETCONF configuration protocol of the IETF Network Working Group provides mechanisms to manipulate the configuration of network devices. YANG is the language currently under consideration within the IETF to specify the data models to be used in NETCONF. This paper describes the design and development of a syntax and...

    Provided By INRIA

  • White Papers // Oct 2011

    Getting Routers Out of the Core: Building an Optical Wide Area Network With "Multipaths"

    The authors propose an all-optical networking solution for a Wide Area Network (WAN) based on the notion of multipoint-to-multipoint light-paths that, for short, they call "Multipaths". A multipath concentrates the traffic of a group of source nodes on a wavelength channel using an adapted MAC protocol and multicasts this traffic...

    Provided By INRIA

  • White Papers // Jun 2011

    CADEAU: Supporting Autonomic and User-Controlled Application Composition in Ubiquitous Environments

    Networked devices, such as consumer electronics, digital media appliances and mobile devices are rapidly filling the everyday environments and changing them into ubiquitous spaces. Composing an application from resources and services available in these environments is a complex task which requires solving a number of equally important engineering challenges as...

    Provided By INRIA

  • White Papers // Mar 2011

    A Distinguisher-Based Attack of a Homomorphic Encryption Scheme Relying on Reed-Solomon Codes

    Bogdanov and Lee suggested a homomorphic public-key encryption scheme based on error correcting codes. The underlying public code is a modified Reed-Solomon code obtained from inserting a zero submatrix in the Vandermonde generating matrix defining it. The columns that define this submatrix are kept secret and form a set L....

    Provided By INRIA

  • White Papers // Mar 2012

    CFS Software Implementation

    CFS is the first practical code-based signature scheme. In the present paper, the authors present the initial scheme and its evolutions, the attacks it had to face and the countermeasures applied. They will show that all things considered the system remains practical and they present a software implementation of the...

    Provided By INRIA

  • White Papers // Feb 2012

    Automatic Search of Attacks on Round-Reduced AES and Applications

    In this paper, the authors describe versatile and powerful algorithms for searching guess-and-determine and meet-in-the-middle attacks on some byte-oriented symmetric primitives. To demonstrate the strength of these tools, they show that they allow to automatically discovering new attacks on round-reduced AES with very low data complexity, and to find improved...

    Provided By INRIA