Accueil

Pietro Michiardi

  1. Content replication and placement in mobile networks.

    Wed, 02/16/2011 - 16:01 — SomNambul
    Authors: Chi-Anh La, Pietro Michiardi, Claudio Casetti, Carla-Fabiana Chiasserini, Marco Fiore
    Subjects: Networking and Internet Architecture
    Abstract

    Performance and reliability of content access in mobile networks is
    conditioned by the number and location of content replicas deployed at the
    network nodes. Location theory has been the traditional, centralized approach
    to study content replication: computing the number and placement of replicas in
    a static network can be cast as a facility location problem. The endeavor of
    this work is to design a practical solution to the above joint optimization
    problem that is suitable for mobile wireless environments.

  2. On Scheduling and Redundancy for P2P Backup.

    Wed, 09/08/2010 - 15:02 — SomNambul
    Authors: Pietro Michiardi, Laszlo Toka, Matteo Dell'Amico
    Subjects: Networking and Internet Architecture
    Abstract

    An online backup system should be quick and reliable in both saving and
    restoring users’ data. To do so in a peer-to-peer implementation, data transfer
    scheduling and the amount of redundancy must be chosen wisely. We formalize the
    problem of exchanging multiple pieces of data with intermittently available
    peers, and we show that random scheduling completes transfers nearly optimally
    in terms of duration as long as the system is sufficiently large.

  3. A Lightweight Distributed Solution to Content Replication in Mobile Networks.

    Fri, 09/11/2009 - 19:13 — SomNambul
    Authors: Chi-Anh La, Pietro Michiardi, Claudio Casetti, Carla-Fabiana Chiasserini, Marco Fiore
    Subjects: Networking and Internet Architecture
    Abstract

    Performance and reliability of content access in mobile networks is
    conditioned by the number and location of content replicas deployed at the
    network nodes. Facility location theory has been the traditional, centralized
    approach to study content replication: computing the number and placement of
    replicas in a network can be cast as an uncapacitated facility location
    problem. The endeavour of this work is to design a distributed, lightweight
    solution to the above joint optimization problem, while taking into account the
    network dynamics.

Math-arch

Syndicate content