INRIA

Displaying 1-40 of 553 results

  • White Papers // Jan 2015

    Privacy by Design: On the Conformance Between Protocols and Architectures

    In systems design, the authors generally distinguish the architecture and the protocol levels. In the context of privacy by design, in the first case, they talk about privacy architectures, which define the privacy goals and the main features of the system at high level. In this paper, they consider the...

    Provided By INRIA

  • White Papers // Jul 2014

    A Taxonomy and Survey on eScience as a Service in the Cloud

    Cloud computing has recently evolved as a popular computing infrastructure for many applications. Scientific computing, which was mainly hosted in private clusters and grids, has started to migrate development and deployment to the public cloud environment. eScience as a service becomes an emerging and promising direction for science computing. The...

    Provided By INRIA

  • 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

    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 // 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 // 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 // Dec 2012

    Association Control for Wireless LANs: Pursuing Throughput Maximization and Energy Efficiency

    Because the Access Points (APs) and the STAtions (STAs) of a community access network are deployed at the users' desired places, the APs and STAs tend to concentrate in certain areas. A concentration of STAs often results in the AP(s) and STAs in that particular area suffering from severe congestion....

    Provided By INRIA

  • White Papers // Jun 2010

    Digging Into Anonymous Traffic: A Deep Analysis of the Tor Anonymizing Network

    Users' anonymity and privacy are among the major concerns of today's Internet. Anonymizing networks are then poised to become an important service to support anonymous driven Internet communications and consequently enhance users' privacy protection. Indeed, Tor an example of anonymizing networks based on onion routing concept attracts more and more...

    Provided By INRIA

  • White Papers // Mar 2013

    From Computationally-Proved Protocol Specifications to Implementations and Application to SSH

    This paper presents a novel technique for obtaining implementations of security protocols, proved secure in the computational model. The authors formally specify the protocol to prove, they prove this specification using the computationally-sound protocol verifier CryptoVerif, and they automatically translate it into an implementation in OCaml using a new compiler...

    Provided By INRIA

  • White Papers // Oct 2012

    Differentially Private Histogram Publishing through Lossy Compression

    Differential privacy has emerged as one of the most promising privacy models for private data release. It can be used to release different types of data, and, in particular, histograms, which provide useful summaries of a dataset. Several differentially private histogram releasing schemes have been proposed recently. However, most of...

    Provided By INRIA

  • White Papers // Mar 2009

    Owner-Centric Networking (OCN): Toward A Data Pollution-Free Internet

    In the author's paper, Bruce Schneier famously said "Data is the pollution of the Information Age". Internet contents (documents, emails, chats, images, videos, etc.) that are posted on the Internet are often disseminated and replicated on different peers or servers, generating what they refer to as Data Pollution. As a...

    Provided By INRIA

  • White Papers // Aug 2009

    Cryptographic Protocols to Fight Sinkhole Attacks on Tree-Based Routing in Wireless Sensor Networks

    This work introduces two new cryptographic protocols of different complexity and strength in limiting network degradation caused by sinkhole attacks on tree-based routing topologies in Wireless Sensor Networks (WSNs). The main goal of both protocols is to provide continuous operation by improving resilience against, rather than detection of, these attacks....

    Provided By INRIA

  • White Papers // Jun 2012

    Seamless Distribution of Data Centric Applications Through Declarative Overlays

    The authors present an approach based on peer-to-peer overlays which allows distributing seamlessly data centric applications defined by queries over a centralized database. They consider applications in which the users have access to views, which contain horizontal fragments of the data of interest to them. The peer-to-peer overlays are defined...

    Provided By INRIA

  • White Papers // Jul 2012

    Using Open Standards for Interoperability Issues, Solutions, and Challenges Facing Cloud Computing

    With several commercial cloud providers coming up, each with their own APIs, application description formats, and varying support for SLAs, vendor lock-in has become a serious issue for end users. This paper attempts to describe the problem, issues, possible solutions and challenges in achieving cloud interoperability. These issues will be...

    Provided By INRIA

  • White Papers // Apr 2013

    Verification of a Self-Configuration Protocol for Distributed Applications in the Cloud

    In this paper, the authors focus on a self-configuration protocol, which is able to configure a whole distributed application without requiring any centralized server. The high degree of parallelism involved in this protocol makes its design complicated and error-prone. In order to check that this protocol works as expected, they...

    Provided By INRIA

  • White Papers // Dec 2011

    Efficient Evaluation of SUM Queries over Probabilistic Data

    SUM queries are crucial for many applications that need to deal with uncertain data. In this paper, the authors are interested in the queries, called ALL-SUM, that return all possible sum values and their probabilities. In general, there is no efficient solution for the problem of evaluating ALL-SUM queries. But,...

    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 // 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 // Mar 2013

    Static Analysis of XML Security Views and Query Rewriting

    In this paper, the authors revisit the view based security framework for XML without imposing any of the previously considered restrictions on the class of queries, the class of DTDs, and the type of annotations used to de ne the view. First, they study query rewriting with views when the...

    Provided By INRIA

  • White Papers // Jun 2012

    Characterization and Comparison of Google Cloud Load Versus Grids

    A new era of Cloud Computing has emerged, but the characteristics of Cloud load in data centers are not perfectly clear. Yet this characterization is critical for the design of novel Cloud job and resource management systems. In this paper, the authors comprehensively characterize the job/task load and host load...

    Provided By INRIA

  • White Papers // Jul 2012

    Autonomous and Energy-Aware Management of Large-Scale Cloud Infrastructures

    With the advent of cloud computing and the need for increasing amount of computing power, cloud infrastructure providers are now facilitating the deployment of large-scale data centers. In order to efficiently manage such environments three important properties have to be fulfilled by their resource management frameworks: scalability; autonomy (i.e. self-organization...

    Provided By INRIA

  • White Papers // Oct 2010

    Demystifying Energy Consumption in Grids and Clouds

    Energy efficiency in large-scale distributed systems has recently emerged as a hot topic. This paper addresses some theoretical and experimental aspects of energy efficiency by putting in perspective some assumptions made in this domain and some observations and analyses. Based on some experimental results and measurements, the authors revisit and...

    Provided By INRIA

  • White Papers // Jun 2010

    Emulation Platform for High Accuracy Failure Injection in Grids

    In the process of developing grid applications, people need to often evaluate the robustness of their work. Two common approaches are, simulation where one can evaluates his software and predict behaviors under conditions usually unachievable in a laboratory experiment and experimentation where the actual application is launched on an actual...

    Provided By INRIA

  • White Papers // Nov 2011

    Virtual Wireless Network Urbanization

    Adapting virtualization concepts to satisfy many of today's network telecommunication challenges receives more and more attention. The authors have developed virtual environment design to allow the coexistence of virtual networks and their respective operators. In their approach, virtualized wireless access equipment is deployed to provide users more flexibility to access...

    Provided By INRIA

  • White Papers // Sep 2009

    Efficient Soft QoS Guarantee in Mobile Ad Hoc Networks

    More and more Quality of Service (QoS) sensitive applications, such as streaming media, high bandwidth content distribution and VoIP, will be deployed in Mobile Ad hoc Networks (MANETs) as part of the pervasive computing realization. However, traditional QoS guarantee technologies cannot be used directly in MANETs due to the dynamic...

    Provided By INRIA

  • White Papers // Jan 2010

    XQueC: Pushing Queries to Compressed XML Data

    Initially proposed as a data interchange format, XML aims also at becoming a format for data storage and management. However, XML documents in their textual form are rather verbose and tend to predate disk space, due to the textual and repetitive nature of the XML tags and of several XML...

    Provided By INRIA

  • White Papers // Oct 2009

    Integrating Java Support for Routing Protocols in NS2

    This paper presents a modification of the existing tool AgentJ which allows for running a Java routing protocol within the network simulator NS2. When designing a new routing protocol, an important step in its development is often to implement and experiment with it in a network simulator such as NS2....

    Provided By INRIA

  • White Papers // Sep 2010

    Linked Data From Your Pocket: The Android RDFContentProvider

    Smartphones are becoming main personal information repositories. Unfortunately this information is stored in independent silos managed by applications. The authors have seen that already: in the Palm operating system, application "Databases" were only accessible when the application schemas were known and worked by opening other application databases. The goal is...

    Provided By INRIA

  • White Papers // Oct 2009

    Cloud Computing Resource Management Through a Grid Middleware: A Case Study With DIET and Eucalyptus

    The Cloud phenomenon is quickly growing towards becoming the de facto standard of Internet Computing, storage and hosting both in industry and academia. The large scalability possibilities offered by Cloud platforms can be harnessed not only for services and applications hosting but also as a raw on-demand computing resource. This...

    Provided By INRIA

  • White Papers // May 2009

    Exploring the Virtual Infrastructure Service Concept in Grid'5000

    The convergence of communication and computation portrays a new vision of the services that the Internet can bring to users. There is an emerging need for isolated and protected virtual resource aggregates composed by the sharing in time and space of a set of physical entities. This paper proposes a...

    Provided By INRIA

  • White Papers // Jan 2011

    Euclidean Reconstruction: From Paraperspective to Perspective

    In this paper the authors describe a method to perform Euclidean reconstruction with a perspective camera model. It incrementally performs reconstruction with a paraperspective camera in order to converge towards a perspective model. With respect to other methods that compute shape and motion from a sequence of images with a...

    Provided By INRIA

  • White Papers // Jan 2011

    A Formal Theory of Key Conjuring

    The authors describe a formalism for key conjuring, the process by which an attacker obtains an unknown, encrypted key by repeatedly calling a cryptographic API function with random values in place of keys. This technique has been used to attack the security APIs of several Hardware Security Modules (HSMs), which...

    Provided By INRIA

  • White Papers // Jul 2010

    Modeling the Economic Value of Location and Preference Data of Mobile Users

    The defining characteristic of wireless and mobile networking is user mobility, and related to it is the ability for the network to capture (at least partial) information on where users are located and how users change location over time. Information about location is becoming critical, and therefore valuable, for an...

    Provided By INRIA

  • White Papers // Dec 2011

    The P2P-RPL Routing Protocol for IPv6 Sensor Networks: Testbed Experiments

    An important part of the foreseen Internet of Things consists in wireless sensor networks running adapted IPv6 protocols. Since the way sensors are scattered is generally unplanned and may evolve with time, a routing protocol is needed in order to provide paths across such networks. Efforts towards standardizing RPL, a...

    Provided By INRIA

  • White Papers // Dec 2011

    A Parallel Tiled Solver for Dense Symmetric Indefinite Systems on Multicore Architectures

    The authors describe an efficient and innovative parallel tiled algorithm for solving symmetric indefinite systems on multicore architectures. This solver avoids pivoting by using a multiplicative preconditioning based on symmetric randomization. This randomization prevents the communication overhead due to pivoting, is computationally inexpensive and requires very little storage. Following randomization,...

    Provided By INRIA

  • White Papers // Apr 2012

    Implementing a BGP-Free ISP Core With LISP

    The sustained growth pace of the global routing table is exerting an economical strain on ISPs by requiring untimely router upgrades. Notably, it has been speculated that the growth rate of router FIBs is surpassing that of its supporting technology and that the deployment of IPv6 is only to make...

    Provided By INRIA

  • White Papers // Nov 2012

    IBTrack: An ICMP Black Holes Tracker

    ICMP is a key protocol to exchange control and error messages over the Internet. An appropriate ICMP's processing throughout a path is therefore a key requirement both for troubleshooting operations (e.g. debugging routing problems) and for several functionalities (e.g. Path Maximum Transmission Unit Discovery, PMTUD). Unfortunately it is common to...

    Provided By INRIA

  • White Papers // Jul 2010

    Reducing Costs and Pollution in Cellular Networks

    Cellular wireless networks are expected to provide high quality audio and video services while enabling fast and low cost Internet access to mobile users. The need for green cost efficient networks are twofold: reduce the service price, and preserve the environment. In this paper, the authors discuss the various strategies...

    Provided By INRIA

  • White Papers // Jun 2011

    On the Minimization of Power Consumption in Base Stations Using On/off Power Amplifiers

    Using energy generated with fossil fuel causes global warming due to the greenhouse effect, which threatens the people environment. One of the challenges for New Generation Networks (NGN) is then the reduction of energy consumption, in particular at the BSs (Base Stations) which use about 85% of the total network...

    Provided By INRIA

  • White Papers // May 2011

    Modeling and Tolerating Heterogeneous Failures in Large Parallel Systems

    As supercomputers and clusters increase in size and complexity, system failures are inevitable. Different hardware components (such as memory, disk, or network) of such systems can have different failure rates. Prior works assume failures equally affect an application, whereas the authors' goal is to provide failure models for applications that...

    Provided By INRIA

  • White Papers // Feb 2011

    On the Scheduling of Checkpoints in Desktop Grids

    Frequent resources failures are a major challenge for the rapid completion of batch jobs. Checkpointing and migration is one approach to accelerate job completion avoiding deadlock. The authors study the problem of scheduling checkpoints of sequential jobs in the context of Desktop Grids, consisting of volunteered distributed resources. They craft...

    Provided By INRIA

  • White Papers // Feb 2013

    SRLG-Diverse Routing With the Star Property

    The notion of Shared Risk Link Groups (SRLG) has been introduced to capture survivability issues where some links of a network fail simultaneously. In this context, the diverse routing problem is to find a set of pair-wise SRLG-disjoint paths between a given pair of end nodes of the network. This...

    Provided By INRIA

  • White Papers // Feb 2013

    SINR-Based Coverage Probability in Cellular Networks Under Multiple Connections

    The authors give numerically tractable, explicit integral expressions for the distribution of the Signal-to-Interference-and-Noise-Ratio (SINR) experienced by a typical user in the downlink channel from the k-th strongest bases stations of a cellular network modelled by Poisson point process on the plane. Their model comprises power-low path-loss model with arbitrarily...

    Provided By INRIA

  • White Papers // Feb 2013

    Good Coupling Between LDPC-Staircase and Reed-Solomon for the Design of GLDPC Codes for the Erasure Channel

    In this paper, the authors analyze the design of Generalized LDPC-staircase (GLDPC-staircase) codes, where the base code is an LDPC-Staircase code and component codes are Reed-Solomon codes. More precisely they compare two schemes: scheme A has the property that on each check node of the base code the repair symbol...

    Provided By INRIA

  • White Papers // Jan 2013

    Coloring Based Hierarchical Routing Approach

    Graph coloring was exploited in wireless sensor networks to solve many optimization problems. These problems are related in general to channel assignment. In this paper, the authors propose to jointly use coloring for routing purposes. They introduce CHRA a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences...

    Provided By INRIA

  • White Papers // Feb 2013

    Efficient Caching in Content-Centric Networks Using OpenFlow

    Content distribution and retrieval are dominant Internet applications today. However, the Internet was designed for communication between exactly two machines and this communication model reduces the efficiency of content delivery services. To fit today's trend, Content-Centric Networking (CCN) has been proposed. In CCN, contents are retrieved directly by their names,...

    Provided By INRIA