<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE raweb PUBLIC "-//INRIA//DTD " "raweb2.dtd">
<raweb xml:lang="en" year="2007">
  <identification id="planete" isproject="true">
    <shortname>
      <span class="smallcap" align="left">PLANETE</span>
    </shortname>
    <projectName>Protocoles et Applications pour l'Internet</projectName>
    <theme>COM</theme>
    <team id="uid1">
      <participants category="Team_Leader">
        <person key="planete-2006-idm256654413824">
          <firstname>Walid</firstname>
          <lastname>Dabbous</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Chercheur</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>DR, Inria</moreinfo>
        </person>
      </participants>
      <participants category="Vice-head_of_project-team_in_Grenoble">
        <person key="planete-2006-idm256654410512">
          <firstname>Claude</firstname>
          <lastname>Castelluccia</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Chercheur</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>DR, Inria</moreinfo>
        </person>
      </participants>
      <participants category="Vice-head_of_project-team_in_Sophia">
        <person key="planete-2006-idm256654407232">
          <firstname>Thierry</firstname>
          <lastname>Turletti</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Chercheur</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>CR, Inria</moreinfo>
          <hdr>oui</hdr>
        </person>
      </participants>
      <participants category="Research_scientists">
        <person key="planete-2006-idm256654403536">
          <firstname>Chadi</firstname>
          <lastname>Barakat</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Chercheur</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>CR, Inria</moreinfo>
        </person>
        <person key="planete-2006-idm256654400896">
          <firstname>Arnaud</firstname>
          <lastname>Legout</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Chercheur</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>CR, Inria</moreinfo>
        </person>
        <person key="planete-2006-idm256654398256">
          <firstname>Vincent</firstname>
          <lastname>Roca</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Chercheur</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>CR, Inria</moreinfo>
        </person>
      </participants>
      <participants category="Administrative_assistants">
        <person key="galaad-2006-idm187297392256">
          <firstname>Aurélie</firstname>
          <lastname>Richard</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Assistant</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Sophia, until September 2007</moreinfo>
        </person>
        <person key="mascotte-2007-idm304855341584">
          <firstname>Dominique</firstname>
          <lastname>Guédon</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Assistant</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Sophia, since October 2007</moreinfo>
        </person>
        <person key="necs-2007-idm452326031792">
          <firstname>Françoise</firstname>
          <lastname>De Coninck</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Assistant</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>Grenoble, until October 2007</moreinfo>
        </person>
        <person key="e-motion-2007-idm388322002080">
          <firstname>Helen</firstname>
          <lastname>Pouchot</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Assistant</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>Grenoble, since October 2007</moreinfo>
        </person>
      </participants>
      <participants category="Technical_staff">
        <person key="planete-2007-idm511533845472">
          <firstname>Bilel</firstname>
          <lastname>Ben Romdhane</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Associate Engineer, since November 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256654380448">
          <firstname>Jahanzeb</firstname>
          <lastname>Farooq</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Associate Engineer</moreinfo>
        </person>
        <person key="planete-2007-idm511533839344">
          <firstname>Mohamed Amine</firstname>
          <lastname>Chaoui</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Expert Engineer, since April 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533836272">
          <firstname>Lionel</firstname>
          <lastname>Giraud</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>Associate Engineer, since June 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256655367712">
          <firstname>Mathieu</firstname>
          <lastname>Cunche</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>Expert Engineer, until March 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256655405872">
          <firstname>Mathieu</firstname>
          <lastname>Lacage</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Dream Engineer</moreinfo>
        </person>
        <person key="planete-2006-idm256654385776">
          <firstname>Thierry</firstname>
          <lastname>Parmentelat</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Senior Engineer</moreinfo>
        </person>
      </participants>
      <participants category="Invited_Professor">
        <person key="planete-2006-idm256654377136">
          <firstname>Katia</firstname>
          <lastname>Obraczka</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>AutreCategorie</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Associate Professor at University of California, Santa Cruz, until July 2007</moreinfo>
        </person>
      </participants>
      <participants category="Post_doc">
        <person key="planete-2006-idm256654373808">
          <firstname>Anwar</firstname>
          <lastname>Al-Hamra</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PostDoc</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>until August 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256654371152">
          <firstname>Chun-Fai-Aldar</firstname>
          <lastname>Chan</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PostDoc</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>until February 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256654365840">
          <firstname>Thrasyvoulos</firstname>
          <lastname>Spyropoulos</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PostDoc</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>until August 2007</moreinfo>
        </person>
      </participants>
      <participants category="PhD_students">
        <person key="planete-2006-idm256654362560">
          <firstname>Diego</firstname>
          <lastname>Dujovne</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Funding Argentinian Scholarship</moreinfo>
        </person>
        <person key="planete-2006-idm256654357248">
          <firstname>Aurélien</firstname>
          <lastname>Francillon</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>Funding Ubisec&amp;Sens project, since January 2006</moreinfo>
        </person>
        <person key="planete-2006-idm256654354448">
          <firstname>Mohamed Ali</firstname>
          <lastname>Kaafar</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Funding RNRT Oscar, until September 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256655405872">
          <firstname>Mathieu</firstname>
          <lastname>Lacage</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>INRIA DREAM Engineer</moreinfo>
        </person>
        <person key="planete-2006-idm256655400688">
          <firstname>Mate</firstname>
          <lastname>Soos</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>Funding INRIA grant</moreinfo>
        </person>
        <person key="planete-2007-idm511533794560">
          <firstname>Naveed Bin</firstname>
          <lastname>Rais</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Funding Pakistanian Scholarship, since October 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256655367712">
          <firstname>Mathieu</firstname>
          <lastname>Cunche</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>Funding ANR contract, since February 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533788432">
          <firstname>Amine</firstname>
          <lastname>Ismail</lastname>
          <affiliation>UnivFr</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Funding CIFRE Scholarship with UDcast, since March 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533785360">
          <firstname>Mohamad</firstname>
          <lastname>Jaber</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Funding MESR Scholarship, since October 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533782304">
          <firstname>Stevens</firstname>
          <lastname>Le Blond</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Funding INRIA CORDIS Scholarship, since September 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256655389376">
          <firstname>Mohamed Karim</firstname>
          <lastname>Sbai</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>PhD</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Funding ExpeShare project, since June 2007</moreinfo>
        </person>
      </participants>
      <participants category="Trainees_and_Visiting_PhD_students">
        <person key="planete-2006-idm256655389376">
          <firstname>Mohamed Karim</firstname>
          <lastname>Sbai</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Stagiaire</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>ENSI, Tunis, until February 2007</moreinfo>
        </person>
        <person key="planete-2006-idm256655386656">
          <firstname>Medhi</firstname>
          <lastname>Msakni</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Stagiaire</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>ENSI, Tunis, until March 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533769392">
          <firstname>Amir</firstname>
          <lastname>Krifa</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Stagiaire</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>ENSI, Tunis, from February to June 2007 and since September 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533766288">
          <firstname>Ahmed</firstname>
          <lastname>Ayadi</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Stagiaire</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>ENSI, Tunis, from February to June 2007 and since September 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533763184">
          <firstname>Mounir</firstname>
          <lastname>Chadid</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Stagiaire</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Ecole Polytechnique, France, from April to July 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533760096">
          <firstname>Pawel</firstname>
          <lastname>Marciniak</lastname>
          <affiliation>INRIA</affiliation>
          <categoryPro>Stagiaire</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Poznan University of Technology, Poland, from March to June 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533756992">
          <firstname>Federico</firstname>
          <lastname>Maguolo</lastname>
          <affiliation>UnivEtrangere</affiliation>
          <categoryPro>Visiteur</categoryPro>
          <research-centre>Sophia</research-centre>
          <moreinfo>Univ Padova, Italy, Visiting PhD Student, since November 2007</moreinfo>
        </person>
        <person key="planete-2007-idm511533753904">
          <firstname>Ersin</firstname>
          <lastname>Uzun</lastname>
          <affiliation>UnivEtrangere</affiliation>
          <categoryPro>Visiteur</categoryPro>
          <research-centre>RhoneAlpes</research-centre>
          <moreinfo>University of California, Irvine, Visiting PhD Student, from September to December 2007</moreinfo>
        </person>
      </participants>
    </team>
    <UR name="Sophia"/>
    <UR name="RhoneAlpes"/>
  </identification>
  <presentation id="uid3">
    <bodyTitle>Overall Objectives</bodyTitle>
    <subsection level="1" id="uid4">
      <bodyTitle>Overall Objectives</bodyTitle>
      <keyword><KW controle="HETEROGENEOUS NETWORK"/>Heterogeneous networks</keyword>
      <keyword><KW controle="DATA-CENTRIC NETWORKING"/>data-centric networking</keyword>
      <keyword><KW controle="COMMUNICATION PROTOCOLS"/>communication protocols</keyword>
      <keyword><KW controle="SECURITY PROTOCOLS"/>security protocols</keyword>
      <keyword><KW controle="MULTIMEDIA"/>multimedia applications</keyword>
      <keyword><KW controle="GROUP COMMUNICATION"/>group communication</keyword>
      <keyword><KW controle="TRANSMISSION CONTROL"/>transmission control</keyword>
      <keyword><KW controle="PEER-TO-PEER PROTOCOLS"/>peer-to-peer protocols</keyword>
      <keyword><KW controle="TRAFFIC MEASUREMENT"/>traffic measurement</keyword>
      <keyword><KW controle="RESOURCE LOCALIZATION"/>resource localization</keyword>
      <p>The Planète group, located both at INRIA Sophia Antipolis - Méditerranée and INRIA Grenoble - Rhône-Alpes research centers, conducts research in the domain of networking, with an emphasis on
      designing, implementing, and evaluating Internet protocols and applications. The main objective of the group is to propose and study new architectures, services and protocols that will enable
      group and secured communication through the Internet.</p>
      <p>The Internet is a huge success: its scale has increased by several orders of magnitude. In order to cope with such growth, the simple, original Internet architecture has accreted several
      hundred additional protocols and extensions. Networks based upon this significantly more complex architecture are increasingly difficult to manage in a way that enables the qualities of service
      delivered to meet the needs of the over 1 billion users.</p>
      <p>The increasing, and implicit, reliance on the Internet has stimulated a major debate amongst experts as to whether the current architecture and protocol can continue to be patched, or
      whether it will collapse under the demands of future applications. There are signs that the current suite of protocols and solutions are becoming inadequate to cope with some common Internet
      trends: mobility of users and devices, unusual but legitimate traffic load (e.g. flash crowds), large heterogeneity in terms of devices capabilities and service features, delivery of real-time
      high-bandwidth video services, requirements for episodic connectivity, scalability in terms of number of nodes and users, complexity related to network, service and security management.</p>
      <p>Additionally, the original Internet was designed and built in an era of mutual trust, probably due to the small size of the "ARPANet" research community. Many of the protocol
      additions/extensions have been to retrofit protection mechanisms that are required in the current Internet environment, which does not merit mutual trust. The volume and types of attempts to
      subvert the Internet will continue to increase, further stressing the current architecture. Current solutions for security are added a posteriori as a patch to overcome the limitations
      encountered, instead of being embedded in the system functionality.</p>
      <p>Furthermore, mobile network hosts are rapidly becoming the norm for the devices with which users access the Internet. An increasing number of the protocol additions/extensions have been
      needed to retrofit support for mobility into the (initially wireline-focussed) Internet architecture. The growing use of mobile sensors will continue to drive the need for solid mobility
      support in the architecture (and the efficient transfer of small data units).</p>
      <p>The Planète project-team addresses some of these problems related to both (global) architectural and (specific) protocol aspects of the Internet. Our research directions span several areas
      such as data-centric architectures; network security; network monitoring and network evaluation platforms.</p>
      <p>Our research activities are realized in the context of French, European and international collaborations : in particular with several academic (UCI, UCLA, UCSC, U. Arizona, U. Lancaster,
      Princeton U., U. Washington, U. Berne, EPFL, U. Pisa, RPI, LIP6, Eurecom, etc.) and industrial (Ericsson, Nokia, SUN, Docomo, Expway, Hitachi, Alcatel, FT R&amp;D, LGE, STMicroelectronics,
      Motorola, Intel, Netcelo, NEC, Boeing, etc.) partners.</p>
    </subsection>
  </presentation>
  <fondements id="uid5">
    <bodyTitle>Scientific Foundations</bodyTitle>
    <subsection level="1" id="uid6">
      <bodyTitle>Scientific foundations</bodyTitle>
      <p>Based on a practical view, the Planète approach to address the above research topics is to design new communication protocols or mechanisms, to implement and to evaluate them either by
      simulation or by experimentation on real network platforms (such as PlanetLab and OneLab). Our work includes a substantial technological component since we implement our mechanisms in
      pre-operational systems and we also develop applications that integrate the designed mechanisms as experimentation and demonstration tools. We also work on the design and development of
      networking experimentation tools such as network simulators and experimental platforms. We work in close collaboration with research and development industrial teams.</p>
      <p>In addition to our experimentation and deployment specificities, we closely work with researchers from various domains to broaden the range of techniques we can apply to networks. In
      particular, we apply techniques of the information and queuing theories to evaluate the performance of protocols and systems. The collaboration with physicists and mathematicians is, from our
      point of view, a promising approach to find solutions that will build the future of the Internet.</p>
      <p>In order to carry out our approach as well as possible, it is important to attend and contribute the IETF (Internet Engineering Task Force) and other standardization bodies meetings on a
      regular basis, in order to propose and discuss our ideas in the working groups related to our topics of interests.</p>
    </subsection>
  </fondements>
  <domaine id="uid7">
    <bodyTitle>Application Domains</bodyTitle>
    <subsection level="1" id="uid8">
      <bodyTitle>Applications domains</bodyTitle>
      <p>The next-generation network must overcome the limitations of existing networks and allow adding new capabilities and services. Future networks should be available anytime and anywhere, be
      accessible from any communication device, require little or no management overhead, be resilient to failures, malicious attacks and natural disasters, and be trustworthy for all types of
      communication traffic. Studies should therefore address a balance of theoretical and experimental research that expand the understanding of large, complex, heterogeneous networks, design of
      access and core networks based on emerging wireless and optical technologies, and continue the evolution of Internet. On the other hand, it is also highly important to design a next-generation
      Internet which we will call the "Future Internet" from core functionalities in order to ensure security and robustness, manageability, utility and social need, new computing paradigms,
      integration of new network technologies and higher-level service architectures.</p>
      <p>To meet emerging requirements for the Internet's technical architecture, the protocols and structures that guide its operation require coordinated, coherent redesign. A new approach will
      require rethinking of the network functions and addressing a range of challenges. These challenges include, but are not limited to, the following examples:</p>
      <simplelist>
        <li id="uid9">
          <p noindent="true">New models for efficient data dissemination;</p>
        </li>
        <li id="uid10">
          <p noindent="true">Coping with intermittent connectivity;</p>
        </li>
        <li id="uid11">
          <p noindent="true">The design of secured, privacy protecting, and robust networked systems;</p>
        </li>
        <li id="uid12">
          <p noindent="true">Understanding the Internet behavior;</p>
        </li>
        <li id="uid13">
          <p noindent="true">Building network evaluation platforms.</p>
        </li>
      </simplelist>
      <p>The following research directions are essential building blocks we contribut to the future internet architecture.</p>
      <p>
        <b>Data centric Networking</b>
      </p>
      <p>From the Internet design, back to 1970, the resources to be addressed and localized are computers. Indeed, at that time there were few machines interconnected, and nobody believed this
      number the ever be larger that a few tens of thousand of machines. Moreover, those machines where static machines with well identified resources (e.g., a given hierarchy of files) that were
      explicitly requested by the users. Today, the legacy of this architecture is the notion of URLs that explicitly address specific resources on a specific machine. Even if modern architectures
      use caches to replicate contents with DNS redirection to make those caches transparent to the end-users, this solution is only an hack that do not solve the today real problem: Users are only
      interested in data and do not want anymore to explicitly address where those data are. Finding data should be a service offered by the network. In this context of data-centric network, which
      means that the network architecture is explicitly built to transparently support the notion of content, a data can be much more than a simple content. In such a network you can, of course,
      request a specific file without specifying explicitly its location, the network will transparently return with closest instance of the content. You can also request a specific service to a
      person without knowing its explicit network location. This is in particular the case of a VoIP or an instant messaging conversation. A data-centric architecture is much more than a simple
      modification in the naming scheme currently used in the Internet. It requires a major rethinking a many fundamental building blocks of the current Internet. Such networking architecture will
      however allow seamless handling of the tricky problematic of 
      <i>episodic connectivity</i>. It also shifts the focus from transmitting data by geographic location, to 
      <i>disseminating</i>it via named content. In the Planète project-team, we start to work on such data centric architectures as a follow-up and federating axe for three of our current activities
      (adaptive multimedia transmission protocols for heterogeneous networks, data dissemination paradigms and peer-to-peer systems).</p>
      <p>Today's Internet is characterized by high node and link heterogeneity. Nodes may vary substantially in terms of their processing, storage, communication, and energy capabilities. They may
      also exhibit very different mobility characteristics, from static nodes to nodes that are considerably mobile (e.g., vehicles). Links may be wired or wireless and thus operate at widely varying
      rates and exhibit quite different reliability characteristics. One of the challenges of data-centric architecture is to provide access to data anytime anywhere in the presence of high degree of
      heterogeneity. This means that due to a number of factors such as node mobility, link instability, power-aware protocols that, for example, turn nodes off periodically, etc., the network will
      not be connected all the time. Additionally, disconnections may last longer than what “traditional” routing protocols (e.g., MANET routing) can handle. These types of network, a.k.a,
      intermittently connected networks, or even episodically connected networks have recently received considerable attention from the networking research community. Several new routing paradigms
      have been proposed to handle possibly frequent, long-lived disconnections. However, a number of challenges remain, including: (1) The support of scalable and transparent integration with
      “traditional” routing mechanisms including wired infrastructure, infrastructure-based wireless and MANET routing. (2) The study of heuristics for selecting forwarding nodes (e.g., based on
      node's characteristics such as node's speed, node's resources, sociability level, node's historic, etc. (3) The design of unicast and multicast transmission algorithms with congestion and error
      control algorithms tailored for episodically connected networks and taking into account the intrinsic characteristics of flows. (4) The design of incentive-based mechanisms to ensure that nodes
      forward packets while preventing or limiting impact of possible misbehaving nodes. The solutions proposed, which are likely to extensively use cross-layer mechanisms, will be evaluated using
      the methodology and the tools elaborated in our new 
      <i>Experimental Platform</i>research direction.</p>
      <p>On the other hand, multicast/broadcast content delivery systems are playing an increasingly important role in data-centric networking. Indeed, this is an optimal dissemination technology,
      that enables the creation of new commercial services, like IPTV over the Internet, satellite-based digital radio and multimedia transmission to vehicles, electronic service guide (ESG) and
      multimedia content distribution on DVB-H/SH networks. This is also an efficient way to share information in WiFi, WiMax, sensor networks, or mobile ad hoc infrastructures. Our goal here is to
      take advantage of our strong background in the domain to design an 
      <i>efficient, robust (in particular in case of tough environments) and secure (since we believe that security considerations will play an increasing importance) broadcasting system</i>. We
      address this problem focusing on the following activities: (1) The protocols and applications that enable the high level control of broadcasting sessions (like the FLUTE/ALC sessions) are
      currently missing. The goal is to enable the content provider to securely control the underlying broadcasting sessions, to be able to launch new sessions if need be, or prematurely stop an
      existing session and to have feedback and statistics on the past/current deliveries. (2) The AL-FEC building block remains the cornerstone on which the whole broadcasting system relies. The
      goal is to design and evaluate new codes, capable of producing a large amount of redundancy (thereby approaching rateless codes), over very large objects, while requiring a small amount of
      memory/processing in order to be used on lightweight embedded systems and terminals. (3) The security building blocks and protocols that aim at providing content level security, protocol level
      security, and network level security must be natively and seamlessly integrated. This is also true of the associated protocols that enable the initialization of the elementary building blocks
      (e.g. in order to exchange security parameters and keys). Many components already exist. The goal here is to identify them, know how to optimally use them, and to design/adapt the missing
      components, if any. (4) It is important that these broadcasting systems be seamlessly integrated to the Internet, so that users be able to benefit from the service, no matter where and how he
      is attached to the network. More precisely we will study the potential impacts of a merge of the broadcasting networks and the Internet, and how to address them. For instance there is a major
      discrepancy when considering flow control aspects, since broadcasting network are using a constant bit rate approach while the Internet is congestion controlled.</p>
      <p>When a native broadcasting service is not enabled by the network, data should still be able to be disseminated to a large population in a scalable way. A peer-to-peer architecture support
      such an efficient data dissemination. We have gained a fundamental understanding of the key algorithms of BitTorrent on the Internet. We plan to continue this work in two directions. First, we
      want to study how a peer-to-peer architecture can be natively supported by the network. Indeed, the client-server architecture is not robust to increase in load. The consequence is that when a
      site becomes suddenly popular, it usually becomes unreachable. The peer-to-peer architecture is robust to increase in load. However, a native support in the network of this architecture is a
      hard problem as it has implications on many components of the network (naming, addressing, transport, localization, etc.). Second, we want to evaluate the impact of wireless and mobile
      infrastructures on peer-to-peer protocols. This work has recently started with the COLOR PURPURA project (in collaboration with University of Avignon) and with the European project Expeshare.
      The wireless medium and the mobility of nodes completely change the properties of peer-to-peer protocols. The dynamics becomes even more complex as it is a function of the environment and of
      the relative position of peers.</p>
      <p>
        <b>Network security</b>
      </p>
      <p>The Internet was not designed to operate in an completely open and hostile environment. It was designed by researchers that trust each other and security was not an issue. The situation is
      quite different today and the Internet community has drastically expanded. The Internet is now composed of more than 300 millions computers worldwide and the trust relationship has disappeared.
      One of the reason of the Internet success is that it provides ubiquitous inter-connectivity. This is also one of the its main weakness since it allows to launch attacks and to exploit
      vulnerabilities in a large-scale basis. The Internet is vulnerable to many different attacks, for example, distributed Denial-of Service (DDoS) attacks, epidemic attacks (Virus/Worm),
      spam/phishing and intrusions attacks. The Internet is not only insecure but it also infringes users' privacy. Those breaches are due to the Internet protocols but also to new applications that
      are being deployed (VoIP, RFID,...). A lot of research is required to improve the Internet security and privacy. For example, more research work is required to understand, model, quantify and
      hopefully eliminate (or at least mitigate) existing attacks. Furthermore, more and more small devices (RFIDs or sensors) are being connected to the Internet. Current security/cryptographic
      solutions are too expensive and current trust models are not appropriate. New protocols and solutions are required : security and privacy must be considered in the Internet architecture as an
      essential component. The whole Internet architecture must be reconsidered with security and privacy in mind. Our current activities in this domain on security in wireless, ad hoc and sensor
      networks, mainly the design of new key exchange protocols and of secured routing protocols. We work also on location privacy techniques and authentication cryptographic protocols and
      opportunistic encryption. We plan to continue our research on wireless security, and more specifically on WSN and RFID security focusing on the design of real and deployable systems. We started
      a new research topic on the security of the Next-Generation Internet. The important goal of this new task is to rethink about the architecture of the Internet with security as a major design
      requirement, instead of an after-thought.</p>
      <p>A lot of work has been done in the area of WSN security in the last years, but we believe that this is still the beginning and a lot of research challenges need to be solved. On the one hand
      it is widely believed that the sensor networks carry a great promise: Ubiquitous sensor networks will allow us to interface the physical environment with communication networks and the
      information infrastructure, and the potential benefits of such interfaces to society are enormous, possibly comparable in scale to the benefits created by the Internet. On the other hand, as
      with the advent of the Internet, there is an important associated risk and concern: How to make sensor network applications resilient and survivable under hostile attacks? We believe that the
      unique technical constraints and application scenarios of sensor networks call for new security techniques and protocols that operate above the link level and provide security for the sensor
      network application as a whole. Although this represents a huge challenge, addressing it successfully will result in a very high pay-off, since targeted security mechanisms can make sensor
      network operation far more reliable and thus more useful. This is the crux of our work. Our goal here is to design new security protocols and algorithms for constrained devices and to
      theoretically prove their soundness and security. Furthermore, to complement the fundamental exploration of cryptographic and security mechanisms, we will simulate and evaluate these mechanisms
      experimentally.</p>
      <p>As already mentioned, the ubiquitous use of RFID tags and the development of what has become termed "the Internet of things" will lead to a variety of security threats, many of which are
      quite unique to RFID deployment. Already industry, government, and citizens are aware of some of the successes and some of the limitations or threats of RFID tags, and there is a great need for
      researchers and technology developers to take up some of daunting challenges that threaten to undermine the commercial viability of RFID tags on the one hand, or to the rights and expectations
      of users on the other. We will focus here on two important issues in the use of RFID tags: (1) 
      <i>Device Authentication</i>: allows us to answer several questions such as: Is the tag legitimate? Is the reader a tag interacts with legitimate? (2) 
      <i>Privacy</i>: is the feature through which information pertaining to a tag's identity and behavior is protected from disclosure by unauthorized parties or by unauthorized means by legitimate
      parties such as readers. In a public library, for example, the information openly communicated by a tagged book could include its title or author. This may be unacceptable to some readers.
      Alternatively, RFID- protected pharmaceutical products might reveal a person's pathology. Turning to authenticity, if the RFID tag on a batch of medicines is not legitimate, then the drugs
      could be counterfeit and dangerous. Authentication and privacy are concepts that are relevant to both suppliers and consumers. Indeed, it is arguable that an RFID deployment can only be
      successful if all parties are satisfied that the integrity between seller and buyer respects the twin demands of authentication and privacy. Our main goal here, therefore, is to propose and to
      prototype the design of cryptographic algorithms and secure protocols for RFID deployment. These algorithms and protocols may be used individually or in combination, and we anticipate that they
      will aid in providing authentication or privacy. One particular feature of the research in the RFID-AP project is that the work must be practical. Many academic proposals can be deeply flawed
      in practice since too little attention has been paid to the realities of implementation and deployment. This activity will therefore be notable for the way theoretical work will be closely
      intertwined with the task of development and deployment. The challenges to be addressed in the project are considerable. In particular there are demanding physical limits that apply to the
      algorithms and protocols that can be implemented on the cheapest RFID tags. While there often exist contemporary security solutions to issues such as authentication and privacy, in an
      RFID-based deployment they are not technically viable. And while one could consider increasing the technical capability of an RFID-tag to achieve a better range of solutions, the solution is
      not economically viable.</p>
      <p>The current Internet has reached its limits; a number of research groups around the world are already working on future Internet architectures. The new Internet should have built-in security
      measures and support for wireless communication devices, among other things. A new network design is needed to overcome unwanted traffic, malware, viruses, identity theft and other threats
      plaguing today's Internet infrastructure and end hosts. This new design should also enforce a good balance between privacy and accountability. Several proposals in the area have been made so
      far, and we expect many more to appear in the near future. Some mechanisms to mitigate the effects of security attacks exist today. However, they are far from perfect and it is a very open
      question how they will behave on the future Internet. Cyber criminals are very creative and new attacks (e.g. VoIP spam, SPIT) appear regularly. Furthermore, the expectation is that cyber
      criminals will move into new technologies as they appear, since they offer new attack opportunities, where existing countermeasures may be rendered useless. The ultimate goal of this research
      activity is to contribute to the work on new Internet architecture that is more resistant to today's and future security attacks. This goal is very challenging, since some of future attacks are
      unpredictable. We are analyzing some of the established and some of the new architectural proposals, attempting to identify architectural elements and patterns that repeat from one
      architectural approach to another, leading to understanding how they impact the unwanted traffic issue and other security issues. Some of the more prominent elements are rather easy to identify
      and understand, such as routing, forwarding, end-to-end security, etc. Others may well be much harder to identify, such as those related to data-oriented networking, e.g., caching. The
      motivation for this work is that the clean slate architectures provide a unique opportunity to provide built in security capabilities that would enable the prevention of phenomenon like
      unwanted traffic. New architectures will most likely introduce additional name-spaces for the different fundamental objects in the network and in particular for routing objects. These names
      will be the fundamental elements that will be used by the new routing architectures and security must be a key consideration when evaluating the features offered by these new name-spaces.</p>
      <p>
        <b>Network Monitoring</b>
      </p>
      <p>The Planète project-team contributes to the area of network monitoring. In addition to the work on extensions for what we have already proposed, our focus is now on the monitoring of the
      Internet for the purpose of problem detection and troubleshooting. Indeed, in the absence of an advanced management and control plan in the Internet, and given the simplicity of the service
      provided by the core of the network and the increase in its heterogeneity, it is nowadays common that users experience a service degradation. This can be in the form of a pure disconnectivity
      or a decrease in the bandwidth or an increase in the delay or loss rate of packets. Service degradation can be caused by protocol anomalies, an attack, an increase in the load, or simply a
      problem at the source or destination machines. Actually, it is not easy to diagnose the reasons for service degradation. Basic tools exist as ping and trace-route, but they are unable to
      provide detailed answers on the source of the problem nor on its location. From operator point of view, the situation is not better since an operator has only access to its own network and can
      hardly translate local information into end-to-end measurements. The increase in the complexity of networks as is the case of wireless mesh networks will not ease the life of users and
      operators. The purpose of our work in this direction will be to study to which extent one can troubleshoot the current Internet either with end-to-end solutions or core network solutions. Our
      aim is to propose an architecture that allows end-users by collaborating together to infer the reasons for service degradation. This architecture can be purely end-to-end or can rely on some
      information from the core of the network as BGP routing information. We will build on this study to understand the limitations in the current Internet architecture and propose modifications
      that will ease the troubleshooting and make it more efficient in future network architectures. We are investigating a solution based on a two-layer signaling protocol a la ICMP in which edge
      routers are probed on end-to-end basis to collect local information on what is going on inside each network along the path. The proposed architecture will be the subject of validation over
      large scale experimental platforms as PlanetLab and OneLab.</p>
      <p>
        <b>Network Evaluation Platforms</b>
      </p>
      <p>It is important to have an experimental environment that increase the quality and quantity of experimental research outcomes in networking, and to accelerate the transition of these outcomes
      into products and services. These experimental platforms should be designed to support both research and deployment, effectively filling the gap between small-scale experiments in the lab, and
      mature technology that is ready for commercial deployment. In terms of experimental platforms, the well-known PlanetLab testbed is gaining ground as a secure, highly manageable, cost-effective
      world-wide platform, especially well fitted for experiments around New Generation Internet paradigms like overlay networks. The current trends in this field, as illustrated by the germinal
      successor known as GENI, are to address the following new challenges. Firstly, a more modular design will allow to achieve federation, i.e. a model where reasonably independent Management
      Authorities can handle their respective subpart of the platform, while preserving the integrity of the whole. Secondly, there is a consensus on the necessity to support various access and
      physical technologies, such as the whole range of wireless or optical links. It is also important to develop realistic simulators taking into account the tremendous growth in wireless
      networking, so to include the many variants of IEEE 802.11 networking, emerging IEEE standards such as WiMax (802.16), and cellular data services (GPRS, CDMA). While simulation is not the only
      tool used for data networking research, it is extremely useful because it often allows research questions and prototypes to be explored at many orders-of-magnitude less cost and time than that
      required to experiment with real implementations and networks.</p>
      <p>This year, in the context of the OneLab project, and in close collaboration with Princeton University, we have contributed to bring the following enhancements to both the software and the
      PlanetLab Europe platform:</p>
      <simplelist>
        <li id="uid14">
          <p noindent="true">Scalability: The PlanetLab public platform has grown up to 800+ nodes and 400+ sites over a four-year period, which is quite a success story. However the current
          centralized management structure is not likely to scale up to a much more important scale; this is the reason why we have started to run the PlanetLab Europe platform in a 
          <b>federation</b>with PlanetLab Central at Princeton. The model, that is totally transparent to users/experimenters, basically allows to aggregate several experimental platforms into a
          unified one, offering the user the ability to use the whole platform.</p>
          <p>We have been active in designing and implementing this federation paradigm, and plan to go on improving it so as to support a much wider cooperation framework, by breaking the barriers
          between various experimental testbeds.</p>
        </li>
        <li id="uid15">
          <p noindent="true">Heterogeneity: On a parallel track, we are planning on studying the impact that a reservation model could have on the current PlanetLab resource allocation scheme. The
          objectives here are to provide a platform that would be appropriate for both continuous services – and there are quite a few of those that run on PlanetLab on a daily basis – and with
          experiments that need only a finite amount of time but that, on the other hand, need for various reasons to gain full access to the hardware. This would open the door to much more
          controlled experimental environments, that are for instance required in the wireless arena.</p>
          <p>This leads at last to the aspects related to virtualization. Although we do not have specific skills in the virtualization techniques per se, we are in a position to take good advantage
          of the many paradigms and implementation that have become increasingly fashionable recently. We believe that supporting a wider spectrum of these techniques to build the underlying
          experiment abstraction is likely to widely improve the capabilities of the experimental platform as a whole.</p>
        </li>
      </simplelist>
      <p>Recall that the evaluation of new network protocols and architectures is at the core of networking research. This evaluation is usually performed using simulations (e.g., NS2), emulations
      (e.g., Emulab), or in the wild experimental platforms (e.g., PlanetLab). Simulations allow a fast evaluation process, fully controlled scenarios, and reproducibility. However, they lack realism
      and the accuracy of the models implemented in the simulators is hard to assess. Emulation allows controlled environment and reproducibility, but it also suffers from a lack of realism.
      Experiments allow more realistic environment and implementations, but they lack reproducibility and ease of use. Therefore, each evaluation technique has strengths and weaknesses. However,
      there is currently no way to combine them in a scientific experimental workflow. Typical evaluation workflows are split into four steps: topology description and construction, traffic pattern
      description and injection, trace instrumentation description and configuration, and, analysis based on the result of the trace events and the status of the environment during the
      experimentation. To achieve the integration of experimental workflows among the various evaluation platforms, the two following requirements must be verified:</p>
      <simplelist>
        <li id="uid16">
          <p noindent="true">Reproducibility: A common interface for each platform must be defined so that a same script can be run transparently on different platforms. This also implies a standard
          way to describe scenarios, which includes the research objective of the scenario, topology description and construction, the description of the traffic pattern and how it is injected into
          the scenario, the description and configuration of the instrumentation, and the evolution of the environment during the experimentation</p>
        </li>
        <li id="uid17">
          <p noindent="true">Comparability: As each platform has different limitations, a way to compare the conclusions extracted from experiments run on different platforms, or on the same platform
          but with different conditions (this is in particular the case for in the wild experimental platforms) must be provided.</p>
        </li>
      </simplelist>
      <p>Benchmarking is the function that provides a method of comparing the performance of various subsystems across different environments. Both reproducibility and comparability are essential to
      benchmarking. In order to facilitate the design of a general benchmarking methodology, we plan to integrate and automate a networking experiments workflow within the OneLab platform. This
      requires that we:</p>
      <simplelist>
        <li id="uid18">
          <p noindent="true">Automate the definition of proper scenario definition taking in consideration available infra-structure to the experiment.</p>
        </li>
        <li id="uid19">
          <p noindent="true">automate the task of mapping the experimentation topology on top of the available OneLab topology. We propose to first focus on a simple one-to-one node and link mapping
          the beginning.</p>
        </li>
        <li id="uid20">
          <p noindent="true">define and provide extensive instrumentation sources within the OneLab system to allow users to gather all interesting trace events for offline analysis</p>
        </li>
        <li id="uid21">
          <p noindent="true">measure and provide access to "environment variables" which measure the state of the OneLab system during an experimentation</p>
        </li>
        <li id="uid22">
          <p noindent="true">define an offline analysis library which can infer experimentation results and comparisons based on traces and "environment variables".</p>
        </li>
      </simplelist>
      <p>To make the use of these components transparent, we plan to implement them within a simulation-like system which should allow experiments to be conducted within a simulator and within the
      OneLab testbed through the same programming interface. The initial version will be based on the NS3 programming interface.</p>
    </subsection>
  </domaine>
  <logiciels id="uid23">
    <bodyTitle>Software</bodyTitle>
    <subsection level="1" id="uid24">
      <bodyTitle>NS-3 Simulator</bodyTitle>
      <p>NS3 is the followup to the wildly successful NS2 project. NS2 was, for many years, the reference network simulator for IP networks to the point that more than 50% or all papers published in
      many conferences and journals used NS2 to validate their research. Despite (or because of) this success, NS2 is showing its age: its architecture suffers from a number of important problems
      which could not be solved with a thorough redesign. This lead a number of US-based researchers to start the development of NS3 from scratch with NSF funding. Through our involvement in the NS3
      project from its very early stages (we were invited to its kickoff meeting), we contributed to the architecture and the implementation of its core facilities. Most notably, we implemented the
      event scheduler, the packet data structure, the tracing subsystem, important aspects of the object model, and the default network node programming interface. We also worked on the first version
      of the UDP/IPv4 stack. This work was based on YANS ("Yet Another Network Simulator") which we developed just prior to starting work on NS3.</p>
    </subsection>
    <subsection level="1" id="uid25">
      <bodyTitle>MultiCast Library Version 3</bodyTitle>
      <p>MultiCast Library Version 3 is an implementation of the ALC (Asynchronous Layered Coding) and NORM (NACK-Oriented Reliable Multicast Protocol) content delivery Protocols, and of the
      FLUTE/ALC file transfer application. This software is an implementation of the large scale content distribution protocols standardized by the RMT (Reliable Multicast Transport) IETF working
      group and adopted by several standardization organizations, in particular 3GPP for the MBMS (Multimedia Broadcast/Multicast Service), and DVB for the CBMS (Convergence of Broadcast and Mobile
      Services). Our software is used in operational, commercial environments, essentially in the satellite broadcasting area and for file delivery over the DVB-H system where FLUTE/ALC has become a
      key component. See 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://planete-bcast.inrialpes.fr/" location="extern" xyref="69395327020">http:// 
      <allowbreak/>planete-bcast. 
      <allowbreak/>inrialpes. 
      <allowbreak/>fr/ 
      <allowbreak/></ref>for more information.</p>
    </subsection>
    <subsection level="1" id="uid26">
      <bodyTitle>LDPC large block FEC codec</bodyTitle>
      <p>We developed a large block LDPC (low-density parity-check) codec. Our codec is the only Open-Source, patent free, large block FEC (Forward Error Correction) codec for the Packet Erasure
      Channel (e.g. Internet) available today. It is both integrated in our MCLv3 library and distributed independently in order to be used by third parties in their own applications or libraries.
      This software, which is unique in the world, has experienced a lot of interest in both academic and industrial environments. In particular, this work has been largely supported by
      STmicroelectronics and the LDPC FEC codes are currently being considered for possible standardization in the IETF and DVB-H/SH organizations. See 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://planete-bcast.inrialpes.fr/" location="extern" xyref="69395327020">http:// 
      <allowbreak/>planete-bcast. 
      <allowbreak/>inrialpes. 
      <allowbreak/>fr/ 
      <allowbreak/></ref>for more information.</p>
    </subsection>
    <subsection level="1" id="uid27">
      <bodyTitle>OneLab build of PlanetLab</bodyTitle>
      <p>In the context of the OneLab project, our project-team is in charge of the codebase management for the PlanetLab Europe platform. This codebase was initially created from an import of the
      standard PlanetLab software, on top of which we have implemented a variety of improvements. A major contribution has been to write the first implementation of the federation mechanism that
      allows PlanetLab Central and PlanetLab Europe to run as peer systems, offering any user a consolidated view of all federating resources regardless of the user's affiliation. We have also
      contributed various improvement to handle more heterogeneous types of hardware, like e.g. wireless or multi-homed connectivity. Until 2007, the collaboration scheme with Princeton University
      has been upstream-downstream: we were free to make any change to the Princeton code provided that we adhered some standard interfaces, and Princeton was free to import any of our changes if
      they seemed interesting. We are now moving towards a co-development model, where we would share the same codebase as Princeton, so as to ease cross-importations that, over time, have become
      more and more frequent, but time-consuming. The software built out of our codebase is known as 'the OneLab build' of the PlanetLab software. We know of at least two institutions, HUJI and
      University of Tokyo, who use this release rather than the Princeton one. See 
      <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://one-lab.org" location="extern" xyref="3625394748020">http:// 
      <allowbreak/>one-lab. 
      <allowbreak/>org</ref>for more details.</p>
    </subsection>
    <subsection level="1" id="uid28">
      <bodyTitle>Prototype Software</bodyTitle>
      <descriptionlist>
        <label>
          <b>WisMon</b>
        </label>
        <li id="uid29">
          <p noindent="true"> </p>
          <p noindent="true">WisMon is a Wireless Statistical Monitoring tool that generates real-time statistics from a unified list of packets, which come from possible different probes. This tool
          fulfills a gap on the wireless experimental field: it provides physical parameters on realtime for evaluation during the experiment, records the data for further processing and builds a
          single view of the whole wireless communication channel environment. WisMon is available as open source under the Cecill license, via 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://planete.inria.fr/software/WisMon/" location="extern" xyref="1486733986008">http:// 
          <allowbreak/>planete. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>software/ 
          <allowbreak/>WisMon/ 
          <allowbreak/></ref>. WisMon will be integrated to OneLab software as a building block toward a global experimental environment.</p>
        </li>
        <label>
          <b>LCC</b>
        </label>
        <li id="uid30">
          <p noindent="true"> </p>
          <p noindent="true">LCC (Locate, Cluster and Conquer) is a Two-level clustered overlay multicast architecture that provides scalable, efficient and robust multicast distribution service to
          end-users. LCC provides a library to handle different useful application-layer functions. However, it is first designed to address topology-aware construction, so focus is set on two major
          processes : Locating and Clustering. Wrappers for several common MBone conferencing applications have been designed: vic rat, and vlc. LCC is available as open source under the Cecill
          license, see 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://planete.inria.fr/software/LCC/" location="extern" xyref="1235020095023">http:// 
          <allowbreak/>planete. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>software/ 
          <allowbreak/>LCC/ 
          <allowbreak/></ref>.</p>
        </li>
        <label>
          <b>TICP</b>
        </label>
        <li id="uid31">
          <p noindent="true"> </p>
          <p noindent="true">TICP (Transport Information collection Protocol) is a TCP-friendly reliable transport protocol that collects information from a large number of network entities. TICP is
          a stand-alone protocol that can be used in any application requiring the collection of information: availability of network entities, statistics on hosts and routers, quality of reception
          in a multicast session, numbering of population, weather monitoring, votes, etc. The source code will be soon released under the Cecill license; for further information see 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://planete.inria.fr/chadi/ticp/" location="extern" xyref="3823882140024">http:// 
          <allowbreak/>planete. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>chadi/ 
          <allowbreak/>ticp/ 
          <allowbreak/></ref>.</p>
        </li>
        <label>
          <b>Intrumentation of BitTorrent</b>
        </label>
        <li id="uid32">
          <p noindent="true"> </p>
          <p noindent="true">We have instrumented one of the most popular BitTorrent client in order to perform an experimental evaluation of the protocol. This instrumentation allows to log each
          message sent or received, and internal state of the protocol. This is the first (and only one to the date of this report) complete instrumentation of a BitTorrent client. This is a
          fundamental step toward the understanding of the dynamics of BitTorrent in reality. The first results obtained with this client were published in IMC'2006, the best international conference
          on measurements. This instrumented client was publicly released in September 2006 and is available at: 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www-sop.inria.fr/planete/Arnaud.Legout/Projects/p2p_cd.html" location="extern" xyref="3796658231028">http:// 
          <allowbreak/>www-sop. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>planete/ 
          <allowbreak/>Arnaud. 
          <allowbreak/>Legout/ 
          <allowbreak/>Projects/ 
          <allowbreak/>p2p_cd. 
          <allowbreak/>html</ref>. To the date of this report this client was downloaded by the community 66 times. This instrumentation was done by Arnaud Legout.</p>
        </li>
      </descriptionlist>
    </subsection>
    <p> </p>
  </logiciels>
  <resultats id="uid33">
    <bodyTitle>New Results</bodyTitle>
    <subsection level="1" id="uid34">
      <bodyTitle>Data Centric Networking</bodyTitle>
      <participants>
        <person key="PASUSERID">
          <firstname>Anwar</firstname>
          <lastname>Al-Hamra</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Chadi</firstname>
          <lastname>Barakat</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Walid</firstname>
          <lastname>Dabbous</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Diego</firstname>
          <lastname>Dujovne</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Aurelien</firstname>
          <lastname>Francillon</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Mohamed Ali</firstname>
          <lastname>Kaafar</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Arnaud</firstname>
          <lastname>Legout</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Katia</firstname>
          <lastname>Obraczka</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Vincent</firstname>
          <lastname>Roca</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Karim</firstname>
          <lastname>Sbai</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Thierry</firstname>
          <lastname>Turletti</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Thrasyvoulos</firstname>
          <lastname>Spyropoulos</lastname>
        </person>
      </participants>
      <p>The work on data centric architectures is a follow-up and federation of three of our previous activities (adaptive multimedia transmission protocols for heterogeneous networks, data
      dissemination paradigms and peer-to-peer systems). We present hereafter the results obtained in 2007 in this area.</p>
      <simplelist>
        <li id="uid35">
          <p noindent="true">
            <b>Adding Integrity Verification Capabilities to the LDPC-Staircase Erasure Correction Codes</b>
          </p>
          <p>With the advent of broadcast/multicast systems, like DVB-H, large scale content broadcasting is becoming a key technology. This type of data distribution scheme largely relies on the use
          of Application Level Forward Error Correction codes (AL-FEC), not only to recover from erasures but also to improve the content broadcasting scheme itself (e.g. FLUTE/ALC). This work
          focuses on the LDPC-staircase large block FEC codes. We believe that sooner or later these broadcasting systems will require security services. Therefore, the current work focuses on the
          content integrity service, which is one of the key security building blocks. More and more often (and in particular in the context of DVB-H), the client terminal will be a handheld
          autonomous device with limited battery capacity. In order to save the client terminal resources, we have focused on a hybrid system that merges the FEC decoding and content integrity
          verification services. This hybrid system takes advantage of a corruption propagation phenomenon during the FEC decoding process in order to perform integrity verification. Thanks to this
          approach, we have been able to design a high performance hybrid codec that keeps the same erasure recovery capabilities of the LDPC-staircase codes while providing a Content Integrity
          Verification service almost for free. More precisely this system can detect an object corruption triggered by deliberate but random attacks or by transmission errors (not detected by lower
          layer protocols) with a very high probability (close to 100%) with a processing overhead that is only a minimal fraction (around 6%) of the overhead of a hash calculation over the whole
          object. Finally, we explain how to extend this system in order to provide a 100% detection guarantee, or how this system can help to mitigate a Denial of Service attack.</p>
        </li>
        <li id="uid36">
          <p noindent="true">
            <b>Standardization of FEC Codes for the Erasure Channel within the IETF RMT Working Group</b>
          </p>
          <p>We are actively participating to the RMT (Reliable Multicast Transport) Working Group of the IETF. In that context, we have continued our efforts on standardizing (presumably IPR-free)
          FEC codes for the erasure channel, that can be easily plugged within the ALC and NORM transport protocols. More specifically, this activity, initiated in 2005, is now close to the end and
          the LDPC-staircase/triangle FEC codes proposal as well as the Reed-Solomon FEC codes proposal have both passed working group last call, have been approved by the IESG and entered the RFC
          Editor waiting queue (Reed-Solomon), or will soon be approved by the IESG (LDPC-*). Note that both documents are meant to be published as "Proposed Standard".</p>
        </li>
        <li id="uid37">
          <p noindent="true">
            <b>Understanding peer-to-peer dynamics</b>
          </p>
          <p>This activity focuses on the understanding and improvement of peer-to-peer content delivery. Indeed, we believe that the value of peer-to-peer comes from its ability to distribute
          contents to a large number of peers without any specific infrastructure, and within a delay that is logarithmic with the number of peers.</p>
          <p>We have performed an experimental evaluation of BitTorrent, which is the only one popular peer-to-peer protocol to focus on efficient content delivery. We evaluated its two core
          mechanisms: its piece selection mechanism called rarest first, and its peer selection algorithm called choke algorithm. We show that the rarest first algorithm guarantees a diversity of the
          pieces among peers close to the ideal one. In particular, on our experiments, a replacement of the rarest first algorithm with a source or network coding solution cannot be justified. We
          also show that the choke algorithm in its latest version fosters reciprocation and is robust to free riders. In particular, the choke algorithm is fair and its replacement with a bit level
          tit-for-tat solution is not appropriate.</p>
          <p>Focusing on the properties of the choke algorithm 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid0" location="biblio" xyref="4101821902010"/>, we showed that it enables clustering of similar-bandwidth peers, ensures effective sharing incentives by
          rewarding peers who contribute with high download rates, and achieves high upload utilization for the majority of the download duration. We also examined the properties of the new choke
          algorithm in seed state and the impact of initial seed capacity on the overall BitTorrent system performance. In particular, we showed that an underprovisioned initial seed does not enable
          clustering of peers and does not guarantee effective sharing incentives. However, we showed that even in such a case, the choke algorithm guarantees an efficient utilization of the
          available resources by enforcing fast peers to help other peers with their download. Based on our observations, we offered guidelines for content providers regarding seed provisioning, and
          discussed a tracker protocol extension that addresses an identified limitation of the protocol. This work is the result of a collaboration with Nikitas Liogkas, Eddie Kohler, and Lixia
          Zhang from UCLA, USA.</p>
        </li>
        <li id="uid38">
          <p noindent="true">
            <b>Disruption Tolerant Networking</b>
          </p>
          <p>We start an activity on problems related to efficient routing and buffer management in Disruption (or Delay) Tolerant Networks (DTN). DTNs are networks where a number of traditional
          assumptions break, and novel communication techniques need to be applied. Two of these techniques that have found considerable success are that of "mobility-assisted routing" and
          "controlled message replication". We have already identified a family of protocols, called Spray routing, who successfully combine these techniques and achieve close-to-optimal performance
          in idealized scenarios, where for example all nodes are homogeneous or all nodes are co-operating in forwarding traffic.</p>
          <p>We're currently investigating the performance of these protocols under non-ideal conditions including: losses of message replicas (e.g. queue drops, non-cooperating nodes, etc.),
          heterogeneous environments, correlated mobility in both time and space. We focus on both evaluating/modeling the performance degradation of these protocols compared with the ideal
          situation, as well as designing new mechanisms (including history-based algorithms, learning, adaptability) that can overcome these problems and deliver superior performance in diverse
          conditions.</p>
          <p>In 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid1" location="biblio" xyref="4101821902010"/>, we propose efficient buffer management policies for DTNs. We show that traditional buffer management drop
          policies like drop-tail or drop-front fail to consider all relevant information in this context and are, thus, sub-optimal. Using the theory of encounter-based message dissemination, we
          propose an optimal buffer management policy based on global knowledge about the network. Our policy can be tuned either to minimize the average delivery delay or to maximize the average
          delivery rate. Finally, we introduce a distributed algorithm that uses statistical learning to approximate the required global knowledge of the optimal algorithm, in practice.</p>
          <p>Also related to networking in environments subject to episodic connectivity, we have been working on the following activities: (1) Developing a taxonomy for existing mechanisms and
          protocols, (2) exploring different heuristics for opportunistic message forwarding, and (3) investigating the effects of traffic differentiation on the performance of different routing
          mechanisms.</p>
        </li>
        <li id="uid39">
          <p noindent="true">
            <b>File sharing in wireless ad hoc networks</b>
          </p>
          <p>This activity started with the PURPURA COLOR projet in conjunction with the LIA laboratory at the University of Avignon and the ExpeShare ITEA European project. Within this activity, we
          focus on file sharing over wireless ad hoc networks. File sharing protocols, typically BitTorrent, are known to perform very well over the wired Internet where end-to-end performances are
          almost guaranteed. However, in wireless ad-hoc networks the situation is different due to topology constraints and the fact that nodes are at the same time peers and routers. For example,
          in a wireless ad-hoc network running standard BitTorrent, sending pieces to distant peers incurs lot of overhead due to resources consumed in intermediate nodes. Moreover, TCP performance
          is known to drop seriously with the number of hops. It is clear that running file sharing with its default configuration no longer guarantees the best performances. For instance, the
          neighbor and piece selection algorithms in BitTorrent need to be studied in the wireless ad-hoc scenarios, since it is no longer efficient to choose and treat with peers independently of
          their location. A potential solution could be to limit the scope of the neighborhood. In this case, TCP connections are fast but pieces will be very likely propagate in a unique direction
          from the seed to distant peers. This could prohibit peers from reciprocating data and might lead to low sharing ratios and suboptimal utilization of network resources. There is a need for a
          solution that minimizes the average download finish time per peer while encouraging peers to collaborate by enforcing a fair sharing of data. Preliminary results on our research in this
          direction can be found in 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid2" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid40">
          <p noindent="true">
            <b>Securing Network Coordinate Systems</b>
          </p>
          <p>We also worked on securing distributing protocols that aim at calculating machines' coordinates 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid3" location="biblio" xyref="4101821902010"/>. Those protocols are an efficient solution to infer network topology in a distributed way. Their major
          problem is that they are very sensitive to attacks and malicious behavior. For example, a protocol like Vivaldi and NPS leverages communication and delay measurements between machines to
          calculate coordinates. If a machine lies on its coordinates or delays packets so that the delay measurement is wrong, this will cause a shift in the coordinates of the other machines.
          Clearly, the damage is proportional to the number of machines participating to the attack. A shift in the coordinates of the attacked machines results in a degradation in the performance of
          any application using these coordinates like file sharing and content distribution. At the same time, the attacking machines can profit from this shift to improve their performances. To
          solve the problem, we came up in 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid3" location="biblio" xyref="4101821902010"/>with an elegant solution in which delay prediction with reliable machines is tracked by a Kalman filter. By
          doing like this, when a malicious machine lies on its coordinates or delay measurement, there will be a deviation in the prediction from the expected value calculated by the Kalman filter,
          which allows its detection. To calibrate the Kalman filter on reliable machines, we proposed the deployment of a surveyor infrastructure composed of reliable machines, then we use the
          Kalman filter calibrated at one surveyor at neighboring non surveyor machines. We proved by the means of simulations and real experiments that by using our solution, coordinate systems can
          resist to attacks and eliminate them. Our work continues in this direction with the proposition of a time validity period every time the surveyor gives its Kalman filter parameters to
          neighboring machines. Indeed, due to changes in network conditions, these parameters can change with time and so it is very important that nodes that use them stop doing it and seek for new
          parameters.</p>
        </li>
      </simplelist>
    </subsection>
    <subsection level="1" id="uid41">
      <bodyTitle>Security in infrastructure-less and constrained networks</bodyTitle>
      <participants>
        <person key="PASUSERID">
          <firstname>Claude</firstname>
          <lastname>Castelluccia</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Chun-Fai-Aldar</firstname>
          <lastname>Chan</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Aurelien</firstname>
          <lastname>Francillon</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Mate</firstname>
          <lastname>Soos</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Erzin</firstname>
          <lastname>Uzun</lastname>
        </person>
      </participants>
      <simplelist>
        <li id="uid42">
          <p noindent="true">
            <b>TinyRNG</b>
          </p>
          <p>WSN security is a major concern and many new protocols are being designed. Most of these protocols rely on cryptography, and therefore require a cryptographic pseudo-random number
          generator (CPRNG). However designing an efficient and secure CPRNG for wireless sensor networks is not trivial since most of the current source of randomness used by standard CPRNG are not
          present on a wireless sensor node. We have developped TinyRNG, a CPRNG for wireless sensor nodes. Our generator uses the received bit errors as one of the sources of randomness. We showed
          that transmission bit errors on a wireless sensor network are a very good source of randomness. We demonstrated that these errors are randomly distributed and uncorrelated from one sensor
          to another. Furthermore we showed that these errors are difficult to observe and manipulate by an attacker. This work was presented at the WiOpt'07 conference 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid4" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid43">
          <p noindent="true">
            <b>Private Aggregation and Group Communication in Wireless Sensor Networks</b>
          </p>
          <p>Wireless sensor networks (WSNs) are ad-hoc networks composed of tiny devices with limited computation and energy capacities. For such devices, data transmission is a very
          energy-consuming operation. It thus becomes essential to the lifetime of a WSN to minimize the number of bits sent by each device. One well-known approach is to aggregate sensor data (e.g.,
          by adding) along the path from sensors to the sink. Aggregation becomes especially challenging if end-to-end privacy between sensors and the sink is required.</p>
          <p>We developped in the last years a simple additively homomorphic stream cipher that allows efficient aggregation of encrypted data. The new cipher only uses modular additions (with very
          small moduli) and is therefore very well suited for CPU-constrained devices.</p>
          <p>In 2007, we have worked on a formal treatment to the privacy of concealed data aggregation (CDA). While there exist a handful of constructions, rigorous security models and analyses for
          CDA are still lacking. We have refine standard security notions for public key encryption schemes, including semantic security and indistinguishability against chosen ciphertext attacks, to
          cover the multi-sender nature and aggregation functionality of CDA in the security model. We have also proposed a generic CDA construction based on public key homomorphic encryption, along
          with a proof of its security in the proposed model. The security of two existing schemes was analyzed in the proposed model. This work was presented at Esorics 2007 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid5" location="biblio" xyref="4101821902010"/>.</p>
          <p>We have also developped, this year, a new encryption mode of operation of our previously defined homomorphic stream cipher that allows nodes of a network to exchange messages securely
          (i.e. encrypted and authenticated) without sharing a common key or using public key cryptography. Our scheme is well adapted to networks, such as ad hoc, overlay or sensor networks, where
          nodes have limited capabilities and can share only a small number of symmetric keys. It provides privacy and integrity protection. We show that our proposal can be used in wireless sensor
          networks to send encrypted packets to very dynamic sets of nodes without having to establish and maintain group keys. These sets of nodes can be explicitly specified by the source or can be
          specified by the network according to some criteria, such as their location, proximity to an object, temperature range. As a result, a node can, for example, send encrypted data to all the
          nodes within a given geographical area, without having to identify the destination nodes in advance. Finally we show that our proposal can be used to implement a secure and scalable
          aggregation scheme for wireless sensor networks This work was presented at the IEEE MASS conference 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid6" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid44">
          <p noindent="true">
            <b>Key Pre-distribution Protocol for Multi-Phase Wireless Sensor Networks</b>
          </p>
          <p>Wireless sensor networks are usually deployed to operate for a long period of time. Because nodes are battery-operated, they eventually run out of power and new nodes need to be
          periodically deployed to assure network connectivity. This type of networks is referred to as Multi-phase WSN. Existing schemes are not adapted to multi-stage WSN. With these schemes, the
          security of the WSN degrades with time, since the proportion of corrupted links gradually increases. We proposed a new pre-distribution scheme adapted to multi-phase WSN. In the proposed
          scheme, the pre-distributed keys have limited lifetimes and are refreshed periodically. As a result, a network that is temporarily attacked (i.e. the attacker is active only during a
          limited amount of time) automatically self-heals, i.e. recovers its initial state when the attack stops. In contrast, with existing schemes, an attacker that corrupts a certain amount of
          nodes compromises a given fraction of the total number of secure channels. This ratio remains constant until the end of the network, even if the attacker stops its action. Furthermore, with
          our scheme, a network that is constantly attacked (i.e. the attacker regularly corrupts nodes of the network, without stopping) is much less impacted than a network that uses existing key
          pre-distribution protocols. With these schemes, the number of compromised links constantly increases until all the links are compromised. With our proposal, the proportion of compromised
          links is limited and constant. This work was presented at the SecureComm07 conference 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid7" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid45">
          <p noindent="true"><b>RFID Security/Secret Shuffling</b>In this project, we consider the problem of private identification of very small and inexpensive tags that cannot perform any cryptographic operations.
          We have developped a new scheme (ProbIP) that does not require any computation from the tag. Our scheme resembles Juels' pseudonym-rotation scheme, but increases its security significantly.
          The presented scheme is an identification scheme. As such, it does not address authentication, and so can not be used to authenticate a tag. It serves to correctly identify a tag if no
          active attacker is present. Privacy of the tag is preserved to some extent even if an active attacker is present. The proposed scheme relies on an NP-complete problem and as such is proven
          to be difficult to breach. This work was presented at the RFIDSEC'07 conference 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid8" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid46">
          <p noindent="true"><b>Spam detection</b>We worked on the problem of botnets and spams detections in collaboration with Ersin Uzun, UCI Phd candidate, invited in the context of the UbiSec associated team with
          UC Irvine. We've developped the concept of "proof of presence" that authorized the emission of emails only if the sender server is convinced that the user is sitting behind its
          computer.</p>
        </li>
      </simplelist>
    </subsection>
    <subsection level="1" id="uid47">
      <bodyTitle>Network monitoring</bodyTitle>
      <participants>
        <person key="PASUSERID">
          <firstname>Chadi</firstname>
          <lastname>Barakat</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Arnaud</firstname>
          <lastname>Legout</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Karim</firstname>
          <lastname>Sbai</lastname>
        </person>
      </participants>
      <p>The main objective of our work in this domain is a better monitoring of the Internet and a better control of its resources. In the monitoring part, we work on new measurement techniques that
      scale with the fast increase in Internet traffic and growth of its size. In the network control part, we focus on new solutions that improve the quality of service to users by a better
      management of network resources. In particular, we propose efficient drop and routing mechanisms for Disruption Tolerant Networks, as well as analytical models that allow a better understanding
      of the performances of network protocols.</p>
      <p>Next, is a sketch of our main contributions in this area.</p>
      <simplelist>
        <li id="uid48">
          <p noindent="true"><b>A Multilevel Approach for the Modelling of Large TCP/IP Networks</b>We worked on an analytical model for the calculation of network load and drop probabilities in a TCP/IP network with
          general topology. Our model does not require the predefinition of bottleneck links. The model is based on analytical expressions for TCP throughput, which allows it to take into account
          diverse TCP features as the receiver congestion window limitation. It can be used for TCP/IP networks with drop tail routers as well as for TCP/IP networks with active queue management
          routers. First, we formulate our model as a Non- Linear Complementarity problem (NCP). Then, we transform the model into two equivalent formulations: fixed point formulation and nonlinear
          programming formulation. Thereupon, using asymptotic analysis, we prove existence of a unique solution to the NCP by casting it into the well known utility optimization framework. In
          addition to uniqueness of rates and end-to-end drop probabilities, the NCP shows the ability to provide unique solutions in terms of link drop probabilities. We explain the relationship
          between the utility optimization, fixed-point approach and our complementarity approach. Specifically, we show how these models can be derived from each other. Finally, we illustrate the
          utility of our proposed approach by solving some benchmark examples and showing how the distribution of load varies with network parameters. The distribution of load is sometimes
          counter-intuitive which cannot be detected by other models making prior assumptions on the locations of bottlenecks. This work was presented at the final meeting of the COST 285 project and
          appeared as a Chapter in 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid9" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid49">
          <p noindent="true">
            <b>Inter-protocol fairness between TCP New Reno and TCP Westwood+</b>
          </p>
          <p>This work started with the visit of Niels Moller (PhD student at KTH) to Planète and was done in collaboration with the Maestro group. In this work, we investigate the effect of
          introducing TCP Westwood+ on regular TCP New Reno. By means of analytical modeling and ns-2 simulations, we demonstrate that the two protocols get different shares of the available
          bandwidth in the network. Our main result is that the bandwidth sharing between the two protocols depends on one crucial parameter: the ratio between the bottleneck router buffer size and
          the bandwidth delay product. If the ratio is smaller than one, TCP Westwood+ takes more bandwidth. On the contrary, if the ratio is greater than one, it is TCP New Reno which gets the
          larger part. Inspired by our results, we propose a simple modification to the window decrease algorithm in TCP Westwood+ that solves the unfairness problem for large buffer sizes. For small
          buffers, the unfairness problem is still open. Our results were published in 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid10" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid50">
          <p noindent="true">
            <b>TICP: Transport Information Collection Protocol</b>
          </p>
          <p>We keep improving and validating TICP, our TCP-friendly reliable transport protocol to collect information from a large number of Internet entities. A collector machine sends probes to a
          set of information sources that reply by sending back their reports. TICP adapts the sending rate of probes in a way similar to TCP for the purpose of avoiding network congestion and
          implosion at the collector. Lost reports are requested again by TICP until they are correctly received by the collector. In a first part of this work, we add to TICP a mechanism to cluster
          information sources in order to probe sources behind the same bottleneck together. This ensures a smooth variation of network conditions during the collection session and hence, an
          efficient handling of congestion at network bottlenecks. We run simulations in ns-2 over realistic topologies to compare TICP before and after clustering. We also implement the protocol in
          C++ and test it over the PlanetLab platform. All experiments prove the outperformance of TICP over non adaptive solutions and the interest of the clustering mechanism in shortening the
          duration of the collection session and in decreasing the ratio of lost packets. In a second part, we adapt TICP to collect large amounts of information from each data source. By the means
          of simulations, we compare the performance obtained by TICP to that obtained when the information maintained by the different sources is collected by parallel TCP connections. Again, the
          simulations show that TICP yields shorter collection sessions due to its inherent multiplexing capability. Finally, in a last part, we study the impact of delegating collection to some
          proxy sources that collect from other sources on behalf of the collector and that the collector probes later to get their collected data. We explain our method to choose the proxy
          collectors and we show by simulations that for a judicious choice of proxy collectors, one can decrease considerably the collection session duration. All details can be found in 
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid11" location="biblio" xyref="4101821902010"/>.</p>
        </li>
        <li id="uid51">
          <p noindent="true">
            <b>Chaotic behavior in computer networks</b>
          </p>
          <p>Chaos is a prominent feature of complex systems and dynamical systems theory provides methods for analyzing this kind of behavior. Computer networks are complex systems, but it is not
          yet known whether Internet protocols exhibit chaotic behaviors though some preliminary investigations suggest it. Understanding the meaning and effect of such behaviors is a scientific
          challenge, with the potential of a significant impact, especially concerning applications based, e.g., on chaos control, or resonances in chaotic systems. For this, on the one hand, one
          needs to design models describing properly the dynamic evolution of a computer network using an Internet protocol, and to make the mathematical analysis of these models. On the other hand,
          one must perform careful investigations on real protocol traces, to analyze them with the tools developed in chaos theory, and to compare them to the predictions of the models. We have
          performed extensive simulations of TCP on deterministic scenarios and have observed a complex dynamics even in simple scenarios. We are analyzing our results to understand the reason of
          this dynamics. This work is in collaboration with Bruno Cessac from the INLN, Sophia Antipolis, France.</p>
        </li>
        <li id="uid52">
          <p noindent="true">
            <b>Network Measurments Processing Tool</b>
          </p>
          <p>WisMon is a complete network (wireless+wired) experimentation package which consists in the implementation of a measurement, processing and analysis methodology. Current development is
          oriented towards the definition of an experiment-description protocol, an experiment scheduling engine, and the definition of the data structure for database storage. Further work includes
          the capture log preprocessing module, the data post-processing and analysis module to generate results based in queries on the preexistant database.</p>
        </li>
      </simplelist>
    </subsection>
    <subsection level="1" id="uid53">
      <bodyTitle>Network Evaluation Platforms</bodyTitle>
      <participants>
        <person key="PASUSERID">
          <firstname>Walid</firstname>
          <lastname>Dabbous</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Jahanzeb</firstname>
          <lastname>Farooq</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Mathieu</firstname>
          <lastname>Lacage</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Thierry</firstname>
          <lastname>Parmentelat</lastname>
        </person>
        <person key="PASUSERID">
          <firstname>Thierry</firstname>
          <lastname>Turletti</lastname>
        </person>
      </participants>
      <p>The Internet is relatively resistant to fundamental change (differentiated services, IP multicast, and secure routing protocols have not seen wide-scale deployment).</p>
      <p>A major impediment to deploying these services is the need for coordination: an Internet service provider (ISP) that deploys the service garners little benefit until other domains follow
      suit. Researchers are also under pressure to justify their work in the context of a federated network by explaining how new protocols could be deployed one network at a time, but emphasizing
      incremental deployability does not necessarily lead to the best architecture. In fact, focusing on incremental deployment may lead to solutions where each step along the path makes sense, but
      the end state is wrong. The substantive improvements to the Internet architecture may require fundamental change that is not incrementally deployable.</p>
      <p>Network virtualisation has been proposed to support realistic large scale shared experimental facilities such as PlanetLab and GENI. We are working on this topic in the context of the
      European OneLab project.</p>
      <p>Testing on PlanetLab has become a nearly obligatory step for an empirical research paper on a new network application or protocol to be accepted into a major networking conference or by the
      most prestigious networking journals. If one wishes to test a new video streaming application, or a new peer-to-peer routing overlay, or a new active measurement system for geo-location of
      internet hosts, hundreds of PlanetLab nodes are available for this purpose. PlanetLab gives the researcher login access to systems scattered throughout the world, with a Linux environment that
      is consistent across all of them.</p>
      <p>However, network environments are becoming ever more heterogeneous. Third generation telephony is bringing large numbers of handheld wireless devices into the Internet. Wireless mesh and
      ad-hoc networks may soon make it common for data to cross multiple wireless hops while being routed in unconventional ways. For these new environments, new networking applications will arise.
      For their development and evaluation, researchers and developers will need the ability to launch applications on endhosts located in these different environments.</p>
      <p>It is sometimes unrealistic to implement new network technology, for reasons that can be either technological - the technology is not yet available -, economical - the technology is too
      expensive -, or simply pragmatical - e.g. when actual mobility is key. For these kinds of situations, we believe it can be very convenient and powerful to resort to emulation techniques, in
      which real packets can be managed as if they had crossed, e.g., an ad hoc network.</p>
      <p>In the OneLab project, we work to provide a unified environment for the next generation of network experiments. Such a large scale, open, heterogeneous testbed should be beneficial to the
      whole networking academic and industrial community.</p>
      <simplelist>
        <li id="uid54">
          <p noindent="true">
            <b>Federating Research Testbeds</b>
          </p>
          <p>In cooperation with Princeton University who run the PlanetLab research platform, we have developped the first prototype of a federation paradigm, that provides a fully symetric model,
          where resources are locally managed and globally visible.</p>
          <p>This mechanism was designed with operational objectives in mind, as it was a requirement for the OneLab project to operate the new PlanetLab Europe platform, that has been running since
          June 2007. There are thus some limitations in this first prototype, that are related to policy management and scalability.</p>
          <p>This federation model basically relies on database caching; essentially the API that each testbed infrastructure (peer) provides has been kept unchanged except for convenience and
          efficiency, and it was shown to be sufficient to this particular need.</p>
          <p>We plan on keeping improving this functionality. Scalability is not an immediate concern yet as there are at this time no deployed testbed with more than 3 peers. However there are clear
          indications that this could very well become a heavy trend in the future, as it is for instance the paradigm behind the GENI initiative. Our next challenges will be to define a hierarchical
          namespace for all involved objects in the system - a la DNS - and to take advantage of that tree structure to break the currently n-square peering model into an essentially linear one.
          Policy management will also be improved once PlnetLab Europe has gained sufficient feedback on the actual needs in this area.</p>
        </li>
        <li id="uid55">
          <p noindent="true">
            <b>Adding more heterogeneity to the PlanetLab testbed</b>
          </p>
          <p>As part of the OneLab project, we have created our own 'distribution' of the PlanetLab software, and have used the flexibility in order to add support for more heterogeneous experimental
          nodes, like wireless (WiFi, UMTS) or multi-homed nodes.</p>
          <p>Over time, the software development cooperation with Princeton University has moved from an upstream/downstream model to codevelopment. As a result, most of our contribution is expected
          to be natively integrated in the 4.2 release of the PlanetLab software, that is about to be issued.</p>
        </li>
        <li id="uid56">
          <p noindent="true">
            <b>Enhancing network simulations</b>
          </p>
          <p>Our main problem with existing simulation tools is the lack of accuracy of the application, network, and MAC/PHY layers which makes comparisons with real-world experimentations very
          hard, if not impossible. The core of the issue is that none of the existing network simulators allow easy re-use of existing real-world network components such as the TCP/IP stacks of an
          operating system together with a real-world routing protocol and a full 802.11 MAC layer.</p>
          <p>Our approach focuses on two solutions:</p>
          <simplelist>
            <li id="uid57">
              <p noindent="true">allow users to run unmodified (or very lightly modified) real-world code in the network simulator at the application and networks layers</p>
            </li>
            <li id="uid58">
              <p noindent="true">implement detailed MAC and PHY models of common wireless technologies such as 802.11 and Wimax.</p>
            </li>
          </simplelist>
          <p>To evaluate this line of research, we have developed a simulator, named YANS. This initial prototype showed the feasability of the approach and we have merged our effort with the ns-3
          project, contributing therefore to the development of the ns-3 architecture. Since then, we have been associated to the development of the core infrastructure of the ns-3 simulator: we
          contributed the event scheduler and the packet data structure used in ns-3. We also contributed to the specification and refinement of the core ns-3 Node data structure. In the future, we
          plan to keep contributing to architectural discussions and we hope to influence the associated decisions to allow us to realize our vision of a simulator used as a more controllable
          real-world testbed.</p>
          <p>As for the development of MAC/PHY models, we started two years ago: we developed a 802.11a/e MAC and PHY model in ns-2. This model implementation was subsequently ported to the YANS
          simulator to validate its architecture and has been ported and integrated to ns-3 in december 2007. We also worked on rate control algorithms support. Federico Maguolo is focusing on
          improving the validation methodology of these algorithms. His objective is to use a set of well-defined reference simulation scenarios to perform a comprehensive study of existing rate
          control algorithms with an eye towards the design and implementation of a rate control algorithm which can work efficiently in a wide variety of use-cases.</p>
          <p>Last year, we started developing a Wimax MAC model for ns-3. This effort is continuing this year currently focused on the identification of the components required in our model. i.e., we
          cannot afford to implement all of the specification given our manpower so, we need to identify the relevant components required to perform the type of application-level simulation we are
          interested in. We have started the development work by realizing a simplified PHY layer. This PHY simply transmitted bursts received by the MAC layer, ignoring the underlying PHY layer
          details. Next the work started on the development of the MAC layer. Some of the primary functionalities of the WiMAX MAC layer, both for the SS (Subscriber Station) and the BS (Base
          Station) side, were implemented. The functionality of generating downlink/uplink subframes and transmitting MAC control messages (DL-MAP, UL-MAP, DCD, UCD, etc) was implemented at the BS.
          MAC control messages are an essential part of the MAC layer since they are used to allocate the stations the access to the downlink and uplink channels. Furthermore it included the
          functionality of allocating bursts in UL/DL subframes and the construction and transmission of PDUs in these bursts. At the SS side the functionality to read the subframes and the MAC
          control messages was implemented. The MAC implementation also includes the network entry and initialization functionality, the process which a SS follows while entering into a WiMAX
          network. It includes scanning of the frequency channels, exchange of handshake messages (Ranging messages) containing the necessary parameters defining the network, and adjustment of these
          parameters etc. Meanwhile a new, complete WiMAX OFDM PHY implementation developed at UP6 was made available to be integrated with the MAC layer. Since this PHY layer operated on bits
          streams, a complete interface API was written to integrate it with the MAC layer. With this interface the bursts transmitted at the MAC layer are splitted into smaller blocks, converted
          into bit streams and then transmitted on the wireless medium. With this new OFDM PHY layer implemented, the MAC layer can now be used with either of the two PHY layers.</p>
        </li>
      </simplelist>
    </subsection>
  </resultats>
  <international id="uid59">
    <bodyTitle>Other Grants and Activities</bodyTitle>
    <subsection level="1" id="uid60">
      <bodyTitle>National projects</bodyTitle>
      <descriptionlist>
        <li id="uid61">
          <p noindent="true">RNRT Oscar (2006-2007): The Planète project-team is involved in the OSCAR RNRT project which aims at studying the attacks against P2P overlays and their impact on the
          underlying network infrastructure. This work is going in three parts: (1) in the first part, we perform an extensive study of the state-of-the-art on attacks in P2P networks and more
          precisely in BitTorrent; (2) In the second part, we are studying a new attack, namely the Sybil attack, which was already proposed in the context of improving the performances of cheaters
          and not in the context of attacking the overlay. The basic idea of such an attack is to breakdown the torrent by introducing free riders. First of all, free riders will occupy partially the
          available upload capacity at the seeds. Moreover, when having many free riders as neighbors, a node will have fewer sources for the pieces it needs and consequently, it will spend more time
          to download the file; (3) In the third part, we are showing the danger that BitTorrent can present on the network infrastructure. We want to evaluate how the BitTorrent traffic can be
          redirected in such a way to increase significantly the load on some specific links and by how much this can harm the underling network.</p>
          <p>The project involves teams from both academy and industry, such as LAAS, LIP6, France Telecom, Mitsubishi, ENS Lyon and ENST Bretagne.</p>
        </li>
        <li id="uid62">
          <p noindent="true">The Sesur RFID-AP project is a ANR project that has started end of 2007 for 3 years. The project partners are CEA-LETI, France Télécom R&amp;D, Eurecom and INRIA.</p>
          <p>The widespread deployment of RFID tags is gathering pace around the world. These tags reply to the electronic prompts of a reader and can be used to store unique product identifiers such
          as the make and style of a piece of clothing or a unique identifier for a bottle of pharmaceutical. At the same time, however, it is well-known that such tags and their applications are not
          without risk. There are many security issues associated with the use of such devices ranging from the prevention of tag-cloning through to issues such as respecting the privacy rights of
          individuals.</p>
          <p>The purpose of the RFID-AP project is to consider the range of security threats to applications based on the deployment of RFID-tags and to concentrate on two particular issues; those of
          authentication and privacy. While these are often presented as two different issues, many of the precautions we might take to protect our privacy are based on taking appropriate steps for
          authentication, for instance in ensuring that we only reveal tag information to a legitimate, i.e. authenticated, reader.</p>
          <p>The goal of RFID-AP, therefore, is to design and to prototype cryptographic algorithms and secure protocols for RFID deployment. Such algorithms and protocols could be used individually,
          or in combination, and our hope is that these will provide a practical and useful framework within which to apply innovative but practical techniques for device authentication and user
          privacy.</p>
        </li>
        <li id="uid63">
          <p noindent="true">RNRT CAPRI-FEC (2007-2009): this project focuses on a building block that is critical to many networking applications: FEC for the packet erasure channel. These codes,
          that usually operate at the transport or Application Layer (hence their name, AL-FEC), are complementary to FEC working at the physical layer. One benefit is that AL-FEC are easily
          implemented in software codecs, which provides a lot of flexibility: they can operate on very large blocks, whereas physical layer codes are often limited by the available chipset memory,
          they can integrate the application constraints by dynamically varying the size of the encoded blocks, the amount of redundancy added, or even by providing several levels of protection. This
          project aims at analyzing and comparing various AL-FEC, both from a theoretical point of view and in practical applications, to derive the conditions for their optimal use.</p>
          <p>Partners: INRIA Planète project-team (leader), ENSICA, CEA-LETI, STMicroelectronics, and a company that wants to remain anonymous.</p>
        </li>
        <li id="uid64">
          <p noindent="true">ANR CIS Hipcal (2007-2009): this project studies a new paradigm based on confined virtual cluster concept for resource control in grids. In particular, we study and
          implement new approaches for bandwidth sharing and end to end network quality of service guarantees. The global infrastructure (computers, disks, networks) partitioned in virtual
          infrastructures (aggregation of virtual machines coupled with virtual channels) is dynamically composed. These virtual clusters are multiplexed in time and space, isolated and
          protected.</p>
          <p>Partners: INRIA Reso (leader), INRIA Grand Large, INRIA Planète, I3S Nice University, IBCP.</p>
        </li>
        <li id="uid65">
          <p noindent="true">ANR Divine project (2006-2008): The DIVINE ANR project proposes the study and the development of a simple yet realistic system of video and image transmission towards
          heterogeneous mobile terminals (for instance PDA or digital TV receiver) through heterogeneous wireless and wired IP links. The application aimed by the DIVINE project is the interactive
          access to multimedia data in a museum. This is a typical environment where various techniques of wireless (WLAN, WiMAX) and wired transmission can be jointly exploited. The DIVINE project
          aims to study innovative solutions (scalable video and still image coding, unequal error protection, multicast links, multiple description coding) allowing to perform an end-to-end
          optimization, based on the detection, optimal management and adaptive processing of this heterogeneity. The project has started in July 2006 and involves teams from both industry and
          academy as Thales, France Télécom R&amp;D, ETIS, ENST Paris, L2S, LIP6 and the research center of French Museums C2RMF-UMR171. At Planète, we focus in particular on the design and the
          evaluation of multicast multimedia transmission mechanism for IEEE 802.11 WLANs.</p>
        </li>
        <li id="uid66">
          <p noindent="true">CPER Plexus: This project (2007-2010) aims to build an experimental wireless networking platform in several sites in Sophia Antipolis. This platform will be
          interconnected with the European OneLab platform through INRIA and will integrate Eurecom's radio platform. The goal is to study the performance in terms of bandwidth and radio resources
          utilization in a heterogeneous radio environment.</p>
        </li>
      </descriptionlist>
    </subsection>
    <subsection level="1" id="uid67">
      <bodyTitle>European projects</bodyTitle>
      <descriptionlist>
        <li id="uid68">
          <p noindent="true">OneLab: The OneLab project (2006-2008) has two overarching objectives: (1) To extend the current PlanetLab infrastructure. OneLab widens PlanetLab by adding testbed nodes
          behind links that are not typical research network links. OneLab will also deepen PlanetLab by enhancing the ability of applications that are running on PlanetLab to perceive the underlying
          network environment: viewing the packets that pass through certain points in the network, and viewing the topology of the network. (2) To create an autonomous PlanetLab Europe. OneLab takes
          over the administration of PlanetLab nodes across Europe, and enters into a peering relationship with PlanetLab in the United States.</p>
          <p>OneLab introduces several new components to the PlanetLab testbed: Wireless (WiMAX, UMTS, and ad hoc wireless), Wired (multihomed), An emulation component and Monitoring (passive
          monitoring, and topology information components).</p>
          <p>The project partners are UPMC, INRIA, Intel (until December 06), UC3M, UCL, CINI, FT, UniPi, Alcatel Italia and TP. INRIA is strongly invlolved in the project and has the role of
          technical leader.</p>
        </li>
        <li id="uid69">
          <p noindent="true">Expeshare (2007-2009) is an ITEA project to enable virtual communities to share media experiences in their personal devices legally and securely. The final aim is to
          develop and implement an architecture for a wireless peer-to-peer network that links personal devices and realizes DRM and mobile payment functionality and allows for legal and secure
          sharing of multimedia content and experiences. Over 25 European partners are involved mainly Philips, Nokia, Telefonica, VTT, the GET-INT and the university of Evry. The role of INRIA in
          this project will be to participate to the design and evaluation of protocols for the network and Peer-to-Peer layer in order to support the sharing of media in a wireless network. We will
          study the feasibility of running actual Peer-to-Peer solutions over wireless networks and try to understand their limitations and based on that, propose new solutions to efficiently
          localize resources in a wireless network and share it with other interested users. The propositions made by INRIA will be the subject of integration to modules proposed by other partners
          and evaluation over by simulation and real experimentations.</p>
          <p>Planète works in this project jointly with the Hipercom project-team known by its expertise in the domain of routing in ad hoc networks. Namely, one of the key questions in Expeshare is
          how to make an ad hoc routing protocol like OLSR, the routing protocol developed by HIPERCOM, interacts with a P2P architecture for data sharing. The expertise of Hipercom in the routing
          domain and of Planète in the P2P domain are of major importance to INRIA's contribution in the project. The project started in April 2007 and will last until June 2009.</p>
        </li>
        <li id="uid70">
          <p noindent="true">The UbiSec&amp;Sens project is an European funded project under the FP6 "Trust and Security" program. It has started in 2006 for a period of 3 years. Its partners are
          EURESCOM , RWTH Aachen, INRIA, IHP Microelectronics, INESC/INOV, Budapest University of Technology and Economics, Ruhr University Bochum and NEC Europe Ltd.</p>
          <p>The overall objective of UbiSec&amp;Sens is to develop a comprehensive architecture for medium and large scale wireless sensor networks with the full level of security that will make
          them trusted and secure for wide-scale applications. The project focuses its work on the intersection of security, routing and in-network processing to design and develop efficient and
          effective security solutions and to offer effective means for persistent and encrypted data storage for distributed (and tiny) data base approaches. It will provides a complete toolbox of
          security aware components for sensor network application development. The UbiSec&amp;Sens solutions will be prototyped and validated in the representative wireless sensor application
          scenarios of agriculture, road services and homeland security.</p>
        </li>
      </descriptionlist>
    </subsection>
    <subsection level="1" id="uid71">
      <bodyTitle>INRIA supported Activities</bodyTitle>
      <descriptionlist>
        <label>Ubisec:</label>
        <li id="uid72">
          <p noindent="true">(2004-2010) is an associated team between UC Irvine (Prof. G.Tsudik) and INRIA Planète project-team.</p>
          <p>Rapid advances in microelectronics are making it possible to mass-produce tiny inexpensive devices, such as processors, RF-IDs, sensors, and actuators. These devices are already, or soon
          will be, deployed in many different settings for a variety of purposes, which typically involve tracking (e.g., of hospital patients, military/rescue personnel, wildlife/livestock and
          inventory in stores/warehouses) or monitoring (e.g., of seismic activity, border/perimeter control, atmospheric or oceanic conditions). In fact, it is widely believed that, in the future,
          sensors will permeate the environment and will be truly ubiquitous in clothing, cars, tickets, food packaging and other goods.</p>
          <p>These new highly networked environments create many new exciting security and privacy challenges. The objectives of the UbiSec associated team is to understand and tackle some of them.
          More specifically, the proposed project will consider the following three topics: infrastructure-less security, nano-security and anonymous association/routing. The team was prolongated for
          3 years in November 2007.</p>
        </li>
        <label>Genesim:</label>
        <li id="uid73">
          <p noindent="true">(2007-2010) is an associated team between University of Washington (Prof. S. Roy) and INRIA Planète project-team. Evaluation of new network protocols and architectures is
          at the core of networking research. This evaluation is usually performed using simulations, emulations, or experimental platforms. Each of these evaluation techniques has strengths and
          weaknesses and therefore they complement one another. However, there is currently no way to combine them in a scientific experimental workflow. On the other hand, wireless network protocols
          are challenging to evaluate mainly due to the high variability of the channel characteristics and their sensitivity to interference. Indeed, as the wireless environment is very difficult to
          control, repeatable experiments are complex to perform. In addition, a large number of parameters impact the results of an experiment. It is therefore difficult to find the subset of key
          parameters to be taken into account to characterise a wireless experiment. The objective of this Associated Team is to contribute toward this area by providing a prototype evaluation
          environment for wireless experiments.</p>
          <p>This evaluation environment is based on a common programming interface between ns-3, Orbit and OneLab. This prototype will allow running basic wireless networking scenarios on these
          three environments and to compare the simulations and experiments' results. Based on University of Washington competence on Orbit and ns-3 and on INRIA's competence on OneLab and ns-3 we
          expect this common project to have a high impact on both European and International consortiums.</p>
        </li>
        <label>Color PURPURA (2007):</label>
        <li id="uid74">
          <p noindent="true">This project addresses the problem of peer-to-peer data exchange in an ad hoc network in an efficient way. We will focus in particular on the content replication taking
          into account the network constraints (resources scarcity, interference, mobility, medium sharing, etc.) The partners are: Planète and LIA (Laboratoire d'Informatique d'Avignon).</p>
        </li>
        <label>Wireless Networks (STIC Tunisia):</label>
        <li id="uid75">
          <p noindent="true">This project (2007-2008) aims to address the problems of security and quality of service routing in Wireless Mesh Networks and of reliability in Delay Tolerant Networks.
          The project partners are ENSI (Tunisia), Eurecom. Several visits have taken place in the context of this project in 2007: Sonia Mettali Gammar and Lamia Ben Azzouz from ENSI visited the
          Planète project-team for one week in July 2007. Mohamed El-Hdhili from ENSI visited Planète from November 28th to December 19th 2007. Amine Elabibi from ENSI visited Planète from December
          12th to December 21st 2007.</p>
        </li>
        <label>Roseate (STIC AmSud):</label>
        <li id="uid76">
          <p noindent="true">This project (2008-2009) aims to design realistic models of the physical layer in order to be used in both simulations and experimentation of wireless protocols. In
          addition to the Planète Project-Team, the partners are Universidad de Valparaiso, Chile, Universidad de Córdoba, Argentina and Universidad Diego Portales, Chile.</p>
        </li>
      </descriptionlist>
    </subsection>
  </international>
  <diffusion id="uid77">
    <bodyTitle>Dissemination</bodyTitle>
    <subsection level="1" id="uid78">
      <bodyTitle>Promotion of the Scientific Community</bodyTitle>
      <descriptionlist>
        <label>Walid Dabbous</label>
        <li id="uid79">
          <p noindent="true">has served in the following conferences as PC member : Med-hoc-net' 2003, NGC'(99-2003), SAINT'2001, Networking'2000, ISCC'2000, AFRICOM'98, ICCC'97, PC co-chair of
          PfHSN'96, tutorial chair for Sigcomm'97, WOSBIS (97-99), CFIP (97-05), CoNext'05, INFOCOM'06, GC'08 CCNS. He gave several presentations and tutorials at RHDM summer school, CFIP, HPN, FORTE
          and ECMAST. He is member of the scientific council of the INRIA Bell-Labs laboratory on Self Organizing Networks. He is an affiliate professor at Ecole Polytechnique, Palaiseau and
          responsible of the University of Nice Sophia Antipolis Master program on Networking and Distributed Systems. He was co-chair of the udlr working group at the IETF between 1997 and 2000. He
          has served several times as an expert to the European Commission to evaluate and review EC funded projects. He has also served as an expert in RNRT commission on network protocols and
          architecture. He gave a presentation at the“Université de tous les savoirs” in September 2000. He also gives seminars at the technical and scientific high military education society.</p>
        </li>
        <label>Claude Castelluccia</label>
        <li id="uid80">
          <p noindent="true">is the editor of the area“Protocols for Mobility” of the ACM SIGMOBILE Mobile Computing and Communications Review (MC2R). He has served in the following conferences as PC
          member : IPCN2000 (Paris), ACM WoWMoW 2000 (Boston), Globecom2000 Service Portability Workshop (San Francisco), IPCN2001 (Paris), IEEE Services &amp; Applications in the Wireless
          Public Infrastructure (Paris), MS3G2001 (Lyon), IEEE LCN2001 (Orlando), MobileADHOC networks (Paris), IFIP Networking 2002 (Pisa), IEEE LCN2002 (Orlando), Algotel2002, ACM/Usenix Mobisys
          2003 (San Francisco), IEEE LCN2003 (Munich), IEEE Workshop on Applications and Services in Wireless Networks 2003 (Berne). Claude Castelluccia is co-organizer of ESAS (European Workshop on
          Security and Privacy in Ad-Hoc and Sensor Networks) and is in the PC of several security conferences such as SecureComm'05, Madness'05, TSPUC'05. He has served several times as an expert to
          the European Commission to evaluate and review EC funded projects.</p>
        </li>
        <label>Thierry Turletti</label>
        <li id="uid81">
          <p noindent="true">is in the Program Committee of the following conferences/workshops: BroadWiM'04, Packet Video'99-07, Saint'00, Networked Group Communication (NGC)'02, Modeling and
          Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt)'03-05, Next Generation Networks (NGN)'04, the 2nd International Workshop on Wireless Network Measurement (WinMee'06) and the
          IEEE International Symposiums on a World of Wireless, Mobile and Multimedia Networks (WoWMoM'05-07). He was chair of the ACM Multimedia Doctoral Symposium in December 2002. He coedited two
          special issues on software radios in IEEE JSAC and IEEE Communication Magazine in 1999. Since 2001, he is associated editor of the 
          <i>Wireless Communications, Mobile Computing</i>Weslay Journal published by John Wiley &amp; Sons. He is also part of the Editorial Board of the 
          <i>Journal of Mobile Communication, Computation and Information (WINET)</i>published by Springer Science and of the 
          <i>Advances in Multimedia</i>Journal published by Hindawi Publishing Corporation. Thierry Turletti has served several times as an expert to the European Commission to evaluate and review EC
          funded projects and also to review French ANR funded projects.</p>
        </li>
        <label>Chadi Barakat</label>
        <li id="uid82">
          <p noindent="true">was guest editor for a JSAC special issue on Sampling the Internet: Techniques and Applications, PC co-chair for the ResCom 2007 summer school on the future Internet and
          Autonomous Networks, PC co-chair for the SAMPLING 2005 workshop, general chair for WiOpt 2005 workshops, and general chair for PAM 2004. Currently he is area editor for ACM Computer
          Communication Review (2005 - ) and steering committee member for PAM conference (Passive and Active Measurement). He served (is serving) on the technical Program Committee for WinMee 2008,
          PFLDnet 2008, BroadNets 2008, NSTools 2007, SECON 2007, WWIC 2007, IWQoS 2006, WWIC 2006, WONS 2006, WiNMee 2006, IMC 2005, ICNP 2005, PAM 2005, WONS 2005, INFOCOM 2005, ASWN 2004, GI&amp;
          NGN symposium at Globecom 2004, PAM 2004, INFOCOM 2004, ASIAN 2002, ICNP 2002. Chadi Barakat was invited to give talks at COST 285 final symposium (Surrey, UK) – 2007, Asian school
          (Bangkok) - 2005, E-next school (Louvain) - 2005, KTH (Stockholm) - 2005, ENSI (Tunis) – 2003 ...2007, MIT (Boston) - 2004, UMASS (Amherst) - 2004, Boston University (Boston) - 2004, Intel
          Research Cambridge - 2004, Asian school (Bangkok) - 2003, Ecole Normale Supérieure (Paris) - 2003, Ecole d'été Internet Nouvelle Génération (Porquerolles) - 2003, EPFL Summer Research
          Institute (Lausanne) - 2002, IBM (Zurich) - 2001. Chadi Barakat is member of the recruitment committee at the computer science department of the University of Nice-Sophia Antipolis, member
          of the directorial board for the Master RSD of the University of Nice, and responsible of the internship program at the latter Master.</p>
        </li>
        <label>Vincent Roca</label>
        <li id="uid83">
          <p noindent="true">was the main technical organizer of the RHDM'02 summer school, in May 2002. He organized the next International Workshop on Multimedia Interactive Protocols and Systems
          (MIPS) in Grenoble in 2004. He gave several tutorials in the RHDM summer schools, at ICT'03 and at MIPS'03. He is part of the Program Committee of RHDM'02, ING'03, ING'04, ING'05. He also
          serves as an expert in RNRT commission on network protocols and architecture in 2004, 2005 and 2006.</p>
        </li>
        <label>Arnaud Legout</label>
        <li id="uid84">
          <p noindent="true">has served as a PC member of SIGCOMM'2007 (PC heavy), SIGCOMM'2006 (PC light), SIGCOMM'2005 (Shadow PC). He was also reviewer of journals (IEEE/ACM Transactions on
          Networking, IEEE/ACM Transactions on Computers, IEEE Network, Computer Communications, ACM SIGCOMM CCR), and conferences (IEEE Infocom, ACM Sigmetrics). Finally he is the organizer of the
          Planète Ph.D. students seminar (2005).</p>
        </li>
      </descriptionlist>
    </subsection>
    <subsection level="1" id="uid85">
      <bodyTitle>University Teaching</bodyTitle>
      <descriptionlist>
        <label>Networks and protocols:</label>
        <li id="uid86">
          <p noindent="true">Undergraduate course at Ecole Polytechnique, by W. Dabbous (36h).</p>
        </li>
        <label>Networks:</label>
        <li id="uid87">
          <p noindent="true">Course at Networks and Distributed Systems graduate studies program at University of Nice-Sophia Antipolis, by W. Dabbous (24h).</p>
        </li>
        <label>Internet Measurements:</label>
        <li id="uid88">
          <p noindent="true">Optional course at Networks and Distributed Systems graduate studies program at University of Nice-Sophia Antipolis, by C. Barakat (18h).</p>
        </li>
        <label>Internet Measurements:</label>
        <li id="uid89">
          <p noindent="true">Same course given for the students of the Computer Sciences Master at ENSI, the Tunisian National School on Computer Sciences, Tunisia, by C. Barakat (18h).</p>
        </li>
        <label>Introduction to Networking:</label>
        <li id="uid90">
          <p noindent="true">Undergraduate course at IUT Nice - LPSIL class, by C. Barakat (15h).</p>
        </li>
        <label>Local Area Networks</label>
        <li id="uid91">
          <p noindent="true">: Undergraduate course + practical work at IUT Sophia-Antipolis, by C. Barakat (25h).</p>
        </li>
        <label>Internet Topolgy inference:</label>
        <li id="uid92">
          <p noindent="true">Graduate Course at Master RTM of the IUP Avignon, by C. Barakat (7h).</p>
        </li>
        <label>Wireless Communications:</label>
        <li id="uid93">
          <p noindent="true">Undergraduate course at Polytech' Grenoble, on Wireless Communications, by V. Roca (6h).</p>
        </li>
        <label>Wireless Communications:</label>
        <li id="uid94">
          <p noindent="true">Same course given to the students of Master 2, GI, University Joseph Fourier, Grenoble, by V. Roca (6h).</p>
        </li>
        <label>Mobile Networks:</label>
        <li id="uid95">
          <p noindent="true">Course at graduate studies program at Ensimag, by C. Castelluccia (36h).</p>
        </li>
        <label>Networks:</label>
        <li id="uid96">
          <p noindent="true">Undergraduate course at University of Nice-Sophia Antipolis, by C. Barakat (6h).</p>
        </li>
        <label>Programming:</label>
        <li id="uid97">
          <p noindent="true">Course IUT GTR 2005 (36h), by Arnaud Legout</p>
        </li>
        <label>Programming:</label>
        <li id="uid98">
          <p noindent="true">Course IUT GTR 2006 (30h), by Arnaud Legout</p>
        </li>
        <label>Networks:</label>
        <li id="uid99">
          <p noindent="true">Course IUT GTR 2006 (30h), by Arnaud Legout</p>
        </li>
        <label>Peer-to-peer networks:</label>
        <li id="uid100">
          <p noindent="true">Course master RSD at University of Nice-Sophia Antipolis 2006 (15h), by Arnaud Legout</p>
        </li>
        <label>Programming:</label>
        <li id="uid101">
          <p noindent="true">Course IUT GTR 2007 (30h), by Arnaud Legout</p>
        </li>
        <label>Peer-to-peer networks:</label>
        <li id="uid102">
          <p noindent="true">Course master RSD at University of Nice-Sophia Antipolis 2007 (15h), by Arnaud Legout</p>
        </li>
      </descriptionlist>
    </subsection>
    <subsection level="1" id="uid103">
      <bodyTitle>PhD Theses and Internships</bodyTitle>
      <subsection level="2" id="uid104">
        <bodyTitle>PhD defended in 2007</bodyTitle>
        <orderedlist>
          <li id="uid105">
            <p noindent="true">Mohamed Ali Kaafar has defended his PhD in September 2007. He studied the security of Internet coordinate systems  
            <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="#planete-2007-bid12" location="biblio" xyref="4101821902010"/>.</p>
          </li>
        </orderedlist>
      </subsection>
      <subsection level="2" id="uid106">
        <bodyTitle>Ongoing PhDs</bodyTitle>
        <orderedlist>
          <li id="uid107">
            <p noindent="true">Diego Dujovne works on “Wireless Experimental Test-beds”.</p>
          </li>
          <li id="uid108">
            <p noindent="true">Mathieu Lacage works on “An IP-level network topology and link characteristic measurement tool”.</p>
          </li>
          <li id="uid109">
            <p noindent="true">Aurélien Francillon works on “WSN security”.</p>
          </li>
          <li id="uid110">
            <p noindent="true">Mate Soos works on“RFID Security”.</p>
          </li>
          <li id="uid111">
            <p noindent="true">Naveed Bin Rais works on “Adaptive Communication Mechanisms for Networks with Episodic Connectivity”.</p>
          </li>
          <li id="uid112">
            <p noindent="true">Mathieu Cunche works on “Forward Error correction codes for the erasure channel ”.</p>
          </li>
          <li id="uid113">
            <p noindent="true">Amine Ismail works on “Optimisation of IP Protocols and Applications over Broadcast Links”.</p>
          </li>
          <li id="uid114">
            <p noindent="true">Mohamad Jaber works on “Detection and Troubleshooting of Internet Anomalies”.</p>
          </li>
          <li id="uid115">
            <p noindent="true">Stevens Le Blond works on “Next Generation Peer-to-Peer Infrastructures”.</p>
          </li>
          <li id="uid116">
            <p noindent="true">Mohamed Karim Sbai works on “Architecture for data sharing in wireless network"”.</p>
          </li>
        </orderedlist>
      </subsection>
      <subsection level="2" id="uid117">
        <bodyTitle>Training activities</bodyTitle>
        <orderedlist>
          <li id="uid118">
            <p noindent="true">Mohamed Karim Sbai,</p>
            <p noindent="true">Subject: Large Scale Data Collection,</p>
            <p noindent="true">Supervisor: Chadi Barakat,</p>
            <p noindent="true">Duration of the stay: 6 months,</p>
            <p noindent="true">Prepared degree: Master in Computer Sciences,</p>
            <p noindent="true">Affiliation: ENSI Tunisia.</p>
          </li>
          <li id="uid119">
            <p noindent="true">Medhi Msakni,</p>
            <p noindent="true">Subject: Multicast Support in 802.11 Networks,</p>
            <p noindent="true">Supervisor: Thierry Turletti,</p>
            <p noindent="true">Duration of the stay: 7 months,</p>
            <p noindent="true">Prepared degree: Master in Computer Sciences,</p>
            <p noindent="true">Affiliation: ENSI Tunisia.</p>
          </li>
          <li id="uid120">
            <p noindent="true">Amir Krifa,</p>
            <p noindent="true">Subject: Buffer Management in DTNs,</p>
            <p noindent="true">Supervisors: Thierry Turletti and Chadi Barakat</p>
            <p noindent="true">Duration of the stay: 9 months,</p>
            <p noindent="true">Prepared degree: Master in Computer Sciences,</p>
            <p noindent="true">Affiliation: ENSI Tunisia.</p>
          </li>
          <li id="uid121">
            <p noindent="true">Ahmed Ayadi,</p>
            <p noindent="true">Subject: Scalable video transmission in heterogeneous environments,</p>
            <p noindent="true">Supervisor: Thierry Turletti,</p>
            <p noindent="true">Duration of the stay: 9 months,</p>
            <p noindent="true">Prepared degree: Master in Computer Sciences,</p>
            <p noindent="true">Affiliation: ENSI Tunisia.</p>
          </li>
          <li id="uid122">
            <p noindent="true">Mounir Chadid,</p>
            <p noindent="true">Subject: Implementation of a BitTorrent tracker extension,</p>
            <p noindent="true">Supervisor: Arnaud Legout,</p>
            <p noindent="true">Duration of the stay: 3 months,</p>
            <p noindent="true">Prepared degree: Engineering Degree in Computer Sciences,</p>
            <p noindent="true">Affiliation: Ecole Polytechnique.</p>
          </li>
          <li id="uid123">
            <p noindent="true">Pawel Marciniak,</p>
            <p noindent="true">Subject: Impact of piece size on peer to peer replication,</p>
            <p noindent="true">Supervisor: Arnaud Legout,</p>
            <p noindent="true">Duration of the stay: 4 months,</p>
            <p noindent="true">Prepared degree: Master in Computer Sciences,</p>
            <p noindent="true">Affiliation: Poznan University of Technology.</p>
          </li>
        </orderedlist>
      </subsection>
    </subsection>
  </diffusion>
  <biblio id="bibliography" html="bibliography" numero="10" titre="Bibliography">
    <biblStruct rend="year" n="cite:DaliPhD" type="phdthesis" id="planete-2007-bid12">
      <monogr>
        <title level="m">Securing Internet Coordinates Systems</title>
        <author>
          <persName key="planete-2006-idm256654354448">
            <foreName>Mohamed Ali</foreName>
            <surname>Kaafar</surname>
            <initial>M. A.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">PhD thesis</note>
        <imprint>
          <publisher>
            <orgName type="school">Université de Nice Sophia Antipolis</orgName>
          </publisher>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:AABCbook" type="inbook" id="planete-2007-bid9">
      <analytic>
        <author>
          <persName key="maestro-2006-idm413957587360">
            <foreName>Eitan</foreName>
            <surname>Altman</surname>
            <initial>E.</initial>
          </persName>
          <persName key="maestro-2006-idm413957574400">
            <foreName>Konstantin</foreName>
            <surname>Avrachenkov</surname>
            <initial>K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Kartikeya</foreName>
            <surname>Chandrayana</surname>
            <initial>K.</initial>
          </persName>
        </author>
        <title level="a">A Multilevel Approach for the Modelling of Large TCP/IP Networks</title>
      </analytic>
      <monogr>
        <title level="m">Recent Advances in Modeling and Simulation Tools for Communication Networks and Services</title>
        <editor role="editor">
          <persName>
            <foreName>A. Nejat</foreName>
            <surname>Ince</surname>
            <initial>A. N.</initial>
          </persName>
          <persName>
            <foreName>Arnold</foreName>
            <surname>Bragg</surname>
            <initial>A.</initial>
          </persName>
        </editor>
        <imprint>
          <publisher>
            <orgName>Springer US</orgName>
          </publisher>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:CN07" type="article" id="planete-2007-bid13">
      <analytic>
        <title level="a">Robust Self-Keying Mobile Ad Hoc Networks</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Nitesh</foreName>
            <surname>Saxena</surname>
            <initial>N.</initial>
          </persName>
          <persName>
            <foreName>Jeong</foreName>
            <surname>Yi</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr id="rid00444">
        <idno type="issn">1389-1286</idno>
        <title level="j">Computer Networks</title>
        <imprint>
          <biblScope type="volume">51</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:iste07" type="inbook" id="planete-2007-bid16">
      <analytic>
        <author>
          <persName key="planete-2006-idm256654413824">
            <foreName>W.</foreName>
            <surname>Dabbous</surname>
            <initial>W.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <title level="a">Scalable Virtual Environments</title>
      </analytic>
      <monogr>
        <title level="m">Multimedia Multicast on the Internet</title>
        <editor role="editor">
          <persName>
            <foreName>A.</foreName>
            <surname>Benslimane</surname>
            <initial>A.</initial>
          </persName>
        </editor>
        <imprint>
          <publisher>
            <orgName>ISTE</orgName>
          </publisher>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:Roca.cdp2_book07" type="inbook" id="planete-2007-bid18">
      <analytic>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <title level="a">End to end approaches for reliable communications</title>
      </analytic>
      <monogr>
        <title level="m">Multimedia Multicast on the Internet</title>
        <imprint>
          <publisher>
            <orgName>ISTE</orgName>
          </publisher>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:Roca.cdp1_book07" type="inbook" id="planete-2007-bid17">
      <analytic>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <title level="a">Reliability in group communications: an introduction</title>
      </analytic>
      <monogr>
        <title level="m">Multimedia Multicast on the Internet</title>
        <imprint>
          <publisher>
            <orgName>ISTE</orgName>
          </publisher>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:iet07" type="article" id="planete-2007-bid14">
      <analytic>
        <title level="a">ARSM: A Cross-Layer Auto Rate Selection Multicast Mechanism for Multi-Rate Wireless LANs</title>
        <author>
          <persName key="planete-2006-idm256655359680">
            <foreName>J.</foreName>
            <surname>Villalón</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Orozco-Barbosa</surname>
            <initial>L.</initial>
          </persName>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr id="rid00863">
        <idno type="issn">1751-8628</idno>
        <title level="j">IET Communications, Special Issue on Wireless Mobile Networks: Cross-layer Communication</title>
        <imprint>
          <dateStruct>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:jsac07" type="article" id="planete-2007-bid15">
      <analytic>
        <title level="a">Cross-Layer Architecture for Adaptive Video Multicast Streaming over Multi-Rate Wireless LANs</title>
        <author>
          <persName key="planete-2006-idm256655359680">
            <foreName>J.</foreName>
            <surname>Villalón</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Orozco-Barbosa</surname>
            <initial>L.</initial>
          </persName>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr id="rid00773">
        <idno type="issn">0733-8716</idno>
        <title level="j">IEEE JSAC Special Issue on Cross-Layer Optimized Wireless Multimedia Communications</title>
        <imprint>
          <biblScope type="volume">25</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
          <biblScope type="pages">699-711</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:MASS07" type="inproceedings" id="planete-2007-bid6">
      <analytic>
        <title level="a">Securing Very Dynamic Groups and Data Aggregation in Wireless Sensor Networks</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">IEEE International Conference on Mobile Ad-hoc and Sensor Networks (MASS 2007), Pisa, Italy</title>
        <imprint>
          <dateStruct>
            <month>October</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid84429">
          <title>IEEE International Conference on Mobile Ad hoc and Sensor Systems</title>
          <num>2007</num>
          <abbr type="sigle">MASS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:RFIDSec07" type="inproceedings" id="planete-2007-bid8">
      <analytic>
        <title level="a">Secret Shuffling: A Novel Approach to RFID Private Identification</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256655400688">
            <foreName>Mate</foreName>
            <surname>Soos</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Conference on RFID Security (RFIDSec07), Malaga, Spain</title>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid383037">
          <title>Workshop on RFID Security</title>
          <num>3</num>
          <abbr type="sigle">RFID-SEC</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:Securecom07" type="inproceedings" id="planete-2007-bid7">
      <analytic>
        <title level="a">RoK: A Robust Key Pre-distribution Protocol for Multi-Stage Wireless Sensor Networks</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256655351568">
            <foreName>Angelo</foreName>
            <surname>Spognardi</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">IEEE Securecomm, Nice, France</title>
        <imprint>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid78737">
          <title>IEEE Conference on Security and Privacy in Communication Networks</title>
          <num>2007</num>
          <abbr type="sigle">SECURECOMM</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:Esorics07" type="inproceedings" id="planete-2007-bid5">
      <analytic>
        <title level="a">On the Security of Concealed Data Aggregation</title>
        <author>
          <persName>
            <foreName>Aldar</foreName>
            <surname>Chan</surname>
            <initial>A.</initial>
          </persName>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">European Symposium On Research in Computer Security (ESORICS 2007), Dresden, Germany</title>
        <imprint>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid71323">
          <title>European Symposium on Research in Computer Security</title>
          <num>12</num>
          <abbr type="sigle">ESORICS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:roads07" type="inproceedings" id="planete-2007-bid30">
      <analytic>
        <title level="a">Experimental Methodology for Real Overlays</title>
        <author>
          <persName key="planete-2006-idm256654362560">
            <foreName>Diego</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>Thierry</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654413824">
            <foreName>Walid</foreName>
            <surname>Dabbous</surname>
            <initial>W.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">2nd International Workshop on Real Overlays And Distributed Systems (ROADS), Warsaw, Poland</title>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid333875">
          <title>International Workshop on Real Overlays And Distributed Systems</title>
          <num>2</num>
          <abbr type="sigle">ROADS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:WiOpt07" type="inproceedings" id="planete-2007-bid4">
      <analytic>
        <title level="a">TinyRNG, A Cryptographic Random Number Generator for Wireless Sensor Network Nodes</title>
        <author>
          <persName key="planete-2006-idm256654357248">
            <foreName>Aurélien</foreName>
            <surname>Francillon</surname>
            <initial>A.</initial>
          </persName>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">5th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, IEEE WiOpt'07, Cyprus</title>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid316658">
          <title>International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks</title>
          <num>5</num>
          <abbr type="sigle">WIOPT</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:sigcomm07" type="inproceedings" id="planete-2007-bid3">
      <analytic>
        <title level="a">Securing Internet Coordinate Embedding Systems</title>
        <author>
          <persName key="planete-2006-idm256654354448">
            <foreName>Mohamed Ali</foreName>
            <surname>Kaafar</surname>
            <initial>M. A.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Mathy</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>K.</foreName>
            <surname>Salamatian</surname>
            <initial>K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>C.</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654413824">
            <foreName>W.</foreName>
            <surname>Dabbous</surname>
            <initial>W.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">ACM SIGCOMM, Kyoto, Japan</title>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid23772">
          <title>ACM Sigcomm Conference</title>
          <num>2007</num>
          <abbr type="sigle">SIGCOMM</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:legoutSIGME07" type="inproceedings" id="planete-2007-bid0">
      <analytic>
        <title level="a">Clustering and Sharing Incentives in BitTorrent Systems</title>
        <author>
          <persName key="planete-2006-idm256654400896">
            <foreName>Arnaud</foreName>
            <surname>Legout</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Nikitas</foreName>
            <surname>Liogkas</surname>
            <initial>N.</initial>
          </persName>
          <persName>
            <foreName>Eddie</foreName>
            <surname>Kohler</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>Lixia</foreName>
            <surname>Zhang</surname>
            <initial>L.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of ACM SIGMETRICS'07, San Diego, CA, USA</title>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid291156">
          <title>International Conference on Measurement and Modeling of Computer Systems</title>
          <num>9</num>
          <abbr type="sigle">SIGMETRICS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:MBAA07" type="inproceedings" id="planete-2007-bid10">
      <analytic>
        <title level="a">Inter-protocol fairness between TCP New Reno and TCP Westwood+</title>
        <author>
          <persName key="planete-2006-idm256655356976">
            <foreName>Niels</foreName>
            <surname>Moller</surname>
            <initial>N.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName key="maestro-2006-idm413957574400">
            <foreName>Konstantin</foreName>
            <surname>Avrachenkov</surname>
            <initial>K.</initial>
          </persName>
          <persName key="maestro-2006-idm413957587360">
            <foreName>Eitan</foreName>
            <surname>Altman</surname>
            <initial>E.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">NGI 2007 (Conference on Next Generation Internet Networks), Trondheim, Norway</title>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid63504">
          <title>EuroNGI Conference on Next Generation Internet Networks</title>
          <num>3</num>
          <abbr type="sigle">EuroNGI</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:NTMS07" type="inproceedings" id="planete-2007-bid29">
      <analytic>
        <title level="a">Transport Information Collection Protocol with clustering of information sources</title>
        <author>
          <persName>
            <foreName>Karim</foreName>
            <surname>Sbai</surname>
            <initial>K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">NTMS 2007 (Conference on New Technologies, Mobility and Security), Paris</title>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid293639">
          <title>International Conference on New Technologies, Mobility and Security</title>
          <num>1</num>
          <abbr type="sigle">NTMS</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:aoc07" type="inproceedings" id="planete-2007-bid31">
      <analytic>
        <title level="a">Utility-based Message Replication for Intermittently Connected Heterogeneous Networks</title>
        <author>
          <persName key="planete-2006-idm256654365840">
            <foreName>T.</foreName>
            <surname>Spyropoulos</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654377136">
            <foreName>K</foreName>
            <surname>Obraczka</surname>
            <initial>K.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">1st IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC), Helsinki, Finland</title>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
        <meeting id="cid369693">
          <title>WoWMoM Workshop on Autonomic and Opportunistic Communications</title>
          <num>1</num>
          <abbr type="sigle">AOC</abbr>
        </meeting>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft.rmt-sec-discussion" type="manual" id="planete-2007-bid19">
      <monogr>
        <title level="m">Security and Reliable Multicast Transport Protocols: Discussions and Guidelines</title>
        <author>
          <persName>
            <foreName>B.</foreName>
            <surname>Adamson</surname>
            <initial>B.</initial>
          </persName>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress</note>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://planete.inrialpes.fr/~roca/doc/draft-ietf-rmt-sec-discussion-00.html" location="extern" xyref="3473515648015">http:// 
          <allowbreak/>planete. 
          <allowbreak/>inrialpes. 
          <allowbreak/>fr/ 
          <allowbreak/>~roca/ 
          <allowbreak/>doc/ 
          <allowbreak/>draft-ietf-rmt-sec-discussion-00. 
          <allowbreak/>html</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:cunche.rr07_verifec" type="techreport" id="planete-2007-bid32">
      <monogr>
        <title level="m">Adding Integrity Verification Capabilities to the LDPC-Staircase Erasure Correction Codes</title>
        <author>
          <persName key="planete-2006-idm256655367712">
            <foreName>M.</foreName>
            <surname>Cunche</surname>
            <initial>M.</initial>
          </persName>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Research Report</note>
        <imprint>
          <biblScope type="number">6125</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>February</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00131002" location="extern" xyref="1661624838003">http:// 
          <allowbreak/>hal. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>inria-00131002</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:KBS07" type="techreport" id="planete-2007-bid1">
      <monogr>
        <title level="m">Optimal Buffer Management Policies for Delay Tolerant Networks</title>
        <author>
          <persName key="planete-2007-idm511533769392">
            <foreName>Amir</foreName>
            <surname>Krifa</surname>
            <initial>A.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256654365840">
            <foreName>Thrasyvoulos</foreName>
            <surname>Spyropoulos</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Technical Report</note>
        <imprint>
          <biblScope type="number">inria-00196306</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>December 2007</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00196306" location="extern" xyref="823870339027">http:// 
          <allowbreak/>hal. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>inria-00196306</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft.reed-solomon03" type="manual" id="planete-2007-bid22">
      <monogr>
        <title level="m">Reed Solomon Error Correction Scheme</title>
        <author>
          <persName>
            <foreName>J.</foreName>
            <surname>Lacan</surname>
            <initial>J.</initial>
          </persName>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
          <persName>
            <foreName>J.</foreName>
            <surname>Peltotalo</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>S.</foreName>
            <surname>Peltotalo</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress</note>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.tools.ietf.org/tools/rfcmarkup/rfcmarkup.cgi?draft=draft-lacan-rmt-fec-bb-rs-00.txt" location="extern" xyref="3899161632007">http:// 
          <allowbreak/>www. 
          <allowbreak/>tools. 
          <allowbreak/>ietf. 
          <allowbreak/>org/ 
          <allowbreak/>tools/ 
          <allowbreak/>rfcmarkup/ 
          <allowbreak/>rfcmarkup. 
          <allowbreak/>cgi?draft=draft-lacan-rmt-fec-bb-rs-00. 
          <allowbreak/>txt</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft.tesla_alc_norm" type="manual" id="planete-2007-bid24">
      <monogr>
        <title level="m">TESLA source authentication in the ALC and NORM protocols</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
          <persName key="planete-2006-idm256654357248">
            <foreName>A.</foreName>
            <surname>Francillon</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>S.</foreName>
            <surname>Faurite</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-msec-tesla-for-alc-norm-02.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft.ldpc06" type="manual" id="planete-2007-bid21">
      <monogr>
        <title level="m">Low Density Parity Check (LDPC) Staircase and Triangle Forward Error Correction (FEC) Schemes</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
          <persName>
            <foreName>C.</foreName>
            <surname>Neumann</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>D.</foreName>
            <surname>Furodet</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-ietf-rmt-fec-bb-ldpc-06.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft.new-fcast" type="manual" id="planete-2007-bid23">
      <monogr>
        <title level="m">FCAST: Scalable Object Delivery on top of the ALC Protocol</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-roca-rmt-newfcast-00.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>February</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft.simple-auth" type="manual" id="planete-2007-bid20">
      <monogr>
        <title level="m">Simple Authentication Schemes for the ALC and NORM Protocols</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-roca-rmt-simple-auth-for-alc-norm-00.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:SBCHT07" type="techreport" id="planete-2007-bid2">
      <monogr>
        <title level="m">BitHoc: BitTorrent for Wireless Ad Hoc networks</title>
        <author>
          <persName key="planete-2006-idm256655389376">
            <foreName>Mohamed Karim</foreName>
            <surname>Sbai</surname>
            <initial>M. K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Jaeyoung</foreName>
            <surname>Choi</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Anwar Al</foreName>
            <surname>Hamra</surname>
            <initial>A. A.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>Thierry</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Technical Report</note>
        <imprint>
          <biblScope type="number">inria-00196313</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>December 2007</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00196313" location="extern" xyref="751782968021">http:// 
          <allowbreak/>hal. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>inria-00196313</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:TICP.report" type="techreport" id="planete-2007-bid11">
      <monogr>
        <title level="m">Experiences on enhancing data collection in large networks</title>
        <author>
          <persName>
            <foreName>Karim</foreName>
            <surname>SBAI</surname>
            <initial>K.</initial>
          </persName>
          <persName>
            <foreName>Chadi</foreName>
            <surname>BARAKAT</surname>
            <initial>C.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Technical Report</note>
        <imprint>
          <biblScope type="number">inria-00140937</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>April</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00140937" location="extern" xyref="3563457822021">http:// 
          <allowbreak/>hal. 
          <allowbreak/>inria. 
          <allowbreak/>fr/ 
          <allowbreak/>inria-00140937</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft802.11b" type="misc" id="planete-2007-bid26">
      <monogr>
        <title level="m">"Leader based Multicast"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654362560">
            <foreName>D.</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/0115r1</note>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft802.11c" type="misc" id="planete-2007-bid27">
      <monogr>
        <title level="m">"Leader based Multicast"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654362560">
            <foreName>D.</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>E.</foreName>
            <surname>Qi</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>A. Stephens M.</foreName>
            <surname>Wentink</surname>
            <initial>A. S. M.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/0115r3</note>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft802.11d" type="misc" id="planete-2007-bid28">
      <monogr>
        <title level="m">"Leader based Multicast"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654362560">
            <foreName>D.</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>E.</foreName>
            <surname>Qi</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>M.</foreName>
            <surname>Wentink</surname>
            <initial>M.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/2128r0</note>
    </biblStruct>
    <biblStruct rend="year" n="cite:draft802.11a" type="misc" id="planete-2007-bid25">
      <monogr>
        <title level="m">"Audio Video Multicast Protocol"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
          <persName key="planete-2006-idm256655359680">
            <foreName>J.</foreName>
            <surname>Villalón</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>D.</foreName>
            <surname>Shim</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/0034r1</note>
    </biblStruct>
    <biblStruct dedoublkey="1244" id="planete-2007-c-bid16" PRJ="planete" n="cite:AABCbook" rend="consolide" type="inbook">
      <analytic>
        <author>
          <persName key="maestro-2006-idm413957587360">
            <foreName>Eitan</foreName>
            <surname>Altman</surname>
            <initial>E.</initial>
          </persName>
          <persName key="maestro-2006-idm413957574400">
            <foreName>Konstantin</foreName>
            <surname>Avrachenkov</surname>
            <initial>K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Kartikeya</foreName>
            <surname>Chandrayana</surname>
            <initial>K.</initial>
          </persName>
        </author>
        <title level="a">A Multilevel Approach for the Modelling of Large TCP/IP Networks</title>
      </analytic>
      <monogr>
        <title level="m">Recent Advances in Modeling and Simulation Tools for Communication Networks and Services</title>
        <editor role="editor">
          <persName>
            <foreName>A. Nejat</foreName>
            <surname>Ince</surname>
            <initial>A. N.</initial>
          </persName>
          <persName>
            <foreName>Arnold</foreName>
            <surname>Bragg</surname>
            <initial>A.</initial>
          </persName>
        </editor>
        <imprint>
          <publisher>
            <orgName>Springer US</orgName>
          </publisher>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3820" id="planete-2007-c-bid6" PRJ="planete" n="cite:draft.rmt-sec-discussion" rend="consolide" type="manual">
      <monogr>
        <title level="m">Security and Reliable Multicast Transport Protocols: Discussions and Guidelines</title>
        <author>
          <persName>
            <foreName>B.</foreName>
            <surname>Adamson</surname>
            <initial>B.</initial>
          </persName>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress</note>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://planete.inrialpes.fr/~roca/doc/draft-ietf-rmt-sec-discussion-00.html" location="extern">
          http://planete.inrialpes.fr/~roca/doc/draft-ietf-rmt-sec-discussion-00.html</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3309" id="planete-2007-c-bid23" PRJ="planete" n="cite:MASS07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Securing Very Dynamic Groups and Data Aggregation in Wireless Sensor Networks</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">IEEE International Conference on Mobile Ad-hoc and Sensor Networks (MASS 2007), Pisa, Italy</title>
        <imprint>
          <dateStruct>
            <month>October</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="2983" id="planete-2007-c-bid22" PRJ="planete" n="cite:Esorics07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">On the Security of Concealed Data Aggregation</title>
        <author>
          <persName>
            <foreName>Aldar</foreName>
            <surname>Chan</surname>
            <initial>A.</initial>
          </persName>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">European Symposium On Research in Computer Security (ESORICS 2007), Dresden, Germany</title>
        <imprint>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="4331" id="planete-2007-c-bid30" PRJ="planete" n="cite:cunche.rr07_verifec" rend="consolide" type="techreport">
      <monogr>
        <title level="m">Adding Integrity Verification Capabilities to the LDPC-Staircase Erasure Correction Codes</title>
        <author>
          <persName key="planete-2006-idm256655367712">
            <foreName>M.</foreName>
            <surname>Cunche</surname>
            <initial>M.</initial>
          </persName>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Research Report</note>
        <imprint>
          <biblScope type="number">6125</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>February</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00131002" location="extern">http://hal.inria.fr/inria-00131002</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3266" id="planete-2007-c-bid24" PRJ="planete" n="cite:Securecom07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">RoK: A Robust Key Pre-distribution Protocol for Multi-Stage Wireless Sensor Networks</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256655351568">
            <foreName>Angelo</foreName>
            <surname>Spognardi</surname>
            <initial>A.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">IEEE Securecomm, Nice, France</title>
        <imprint>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3305" id="planete-2007-c-bid25" PRJ="planete" n="cite:RFIDSec07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Secret Shuffling: A Novel Approach to RFID Private Identification</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256655400688">
            <foreName>Mate</foreName>
            <surname>Soos</surname>
            <initial>M.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Conference on RFID Security (RFIDSec07), Malaga, Spain</title>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="0848" id="planete-2007-c-bid0" PRJ="planete" n="cite:CN07" rend="consolide" type="article">
      <analytic>
        <title level="a">Robust Self-Keying Mobile Ad Hoc Networks</title>
        <author>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Nitesh</foreName>
            <surname>Saxena</surname>
            <initial>N.</initial>
          </persName>
          <persName>
            <foreName>Jeong</foreName>
            <surname>Yi</surname>
            <initial>J.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">Computer Networks</title>
        <imprint>
          <biblScope type="volume">51</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="1288" id="planete-2007-c-bid3" PRJ="planete" n="cite:iste07" rend="consolide" type="inbook">
      <analytic>
        <author>
          <persName key="planete-2006-idm256654413824">
            <foreName>W.</foreName>
            <surname>Dabbous</surname>
            <initial>W.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <title level="a">Scalable Virtual Environments</title>
      </analytic>
      <monogr>
        <title level="m">Multimedia Multicast on the Internet</title>
        <editor role="editor">
          <persName>
            <foreName>A.</foreName>
            <surname>Benslimane</surname>
            <initial>A.</initial>
          </persName>
        </editor>
        <imprint>
          <publisher>
            <orgName>ISTE</orgName>
          </publisher>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="2348" id="planete-2007-c-bid28" PRJ="planete" n="cite:roads07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Experimental Methodology for Real Overlays</title>
        <author>
          <persName key="planete-2006-idm256654362560">
            <foreName>Diego</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>Thierry</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654413824">
            <foreName>Walid</foreName>
            <surname>Dabbous</surname>
            <initial>W.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">2nd International Workshop on Real Overlays And Distributed Systems (ROADS), Warsaw, Poland</title>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3559" id="planete-2007-c-bid26" PRJ="planete" n="cite:WiOpt07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">TinyRNG, A Cryptographic Random Number Generator for Wireless Sensor Network Nodes</title>
        <author>
          <persName key="planete-2006-idm256654357248">
            <foreName>Aurélien</foreName>
            <surname>Francillon</surname>
            <initial>A.</initial>
          </persName>
          <persName key="planete-2006-idm256654410512">
            <foreName>Claude</foreName>
            <surname>Castelluccia</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">5th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, IEEE WiOpt'07, Cyprus</title>
        <imprint>
          <dateStruct>
            <month>April</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="4216" id="planete-2007-c-bid32" PRJ="planete" n="cite:DaliPhD" rend="consolide" type="phdthesis">
      <monogr>
        <title level="m">Securing Internet Coordinates Systems</title>
        <author>
          <persName key="planete-2006-idm256654354448">
            <foreName>Mohamed Ali</foreName>
            <surname>Kaafar</surname>
            <initial>M. A.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">PhD thesis</note>
        <imprint>
          <publisher>
            <orgName type="school">Université de Nice Sophia Antipolis</orgName>
          </publisher>
          <dateStruct>
            <month>September</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="4677" id="planete-2007-c-bid18" PRJ="planete" n="cite:KBS07" rend="consolide" type="techreport">
      <monogr>
        <title level="m">Optimal Buffer Management Policies for Delay Tolerant Networks</title>
        <author>
          <persName key="planete-2007-idm511533769392">
            <foreName>Amir</foreName>
            <surname>Krifa</surname>
            <initial>A.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256654365840">
            <foreName>Thrasyvoulos</foreName>
            <surname>Spyropoulos</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Technical Report</note>
        <imprint>
          <biblScope type="number">inria-00196306</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>December 2007</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00196306" location="extern">http://hal.inria.fr/inria-00196306</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3308" id="planete-2007-c-bid19" PRJ="planete" n="cite:sigcomm07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Securing Internet Coordinate Embedding Systems</title>
        <author>
          <persName key="planete-2006-idm256654354448">
            <foreName>Mohamed Ali</foreName>
            <surname>Kaafar</surname>
            <initial>M. A.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Mathy</surname>
            <initial>L.</initial>
          </persName>
          <persName>
            <foreName>K.</foreName>
            <surname>Salamatian</surname>
            <initial>K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>C.</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654413824">
            <foreName>W.</foreName>
            <surname>Dabbous</surname>
            <initial>W.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">ACM SIGCOMM, Kyoto, Japan</title>
        <imprint>
          <dateStruct>
            <month>August</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="1965" id="planete-2007-c-bid27" PRJ="planete" n="cite:legoutSIGME07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Clustering and Sharing Incentives in BitTorrent Systems</title>
        <author>
          <persName key="planete-2006-idm256654400896">
            <foreName>Arnaud</foreName>
            <surname>Legout</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>Nikitas</foreName>
            <surname>Liogkas</surname>
            <initial>N.</initial>
          </persName>
          <persName>
            <foreName>Eddie</foreName>
            <surname>Kohler</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>Lixia</foreName>
            <surname>Zhang</surname>
            <initial>L.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">Proc. of ACM SIGMETRICS'07, San Diego, CA, USA</title>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3819" id="planete-2007-c-bid9" PRJ="planete" n="cite:draft.reed-solomon03" rend="consolide" type="manual">
      <monogr>
        <title level="m">Reed Solomon Error Correction Scheme</title>
        <author>
          <persName>
            <foreName>J.</foreName>
            <surname>Lacan</surname>
            <initial>J.</initial>
          </persName>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
          <persName>
            <foreName>J.</foreName>
            <surname>Peltotalo</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>S.</foreName>
            <surname>Peltotalo</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress</note>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.tools.ietf.org/tools/rfcmarkup/rfcmarkup.cgi?draft=draft-lacan-rmt-fec-bb-rs-00.txt" location="extern">
          http://www.tools.ietf.org/tools/rfcmarkup/rfcmarkup.cgi?draft=draft-lacan-rmt-fec-bb-rs-00.txt</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="2653" id="planete-2007-c-bid21" PRJ="planete" n="cite:MBAA07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Inter-protocol fairness between TCP New Reno and TCP Westwood+</title>
        <author>
          <persName key="planete-2006-idm256655356976">
            <foreName>Niels</foreName>
            <surname>Moller</surname>
            <initial>N.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName key="maestro-2006-idm413957574400">
            <foreName>Konstantin</foreName>
            <surname>Avrachenkov</surname>
            <initial>K.</initial>
          </persName>
          <persName key="maestro-2006-idm413957587360">
            <foreName>Eitan</foreName>
            <surname>Altman</surname>
            <initial>E.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">NGI 2007 (Conference on Next Generation Internet Networks), Trondheim, Norway</title>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3822" id="planete-2007-c-bid11" PRJ="planete" n="cite:draft.tesla_alc_norm" rend="consolide" type="manual">
      <monogr>
        <title level="m">TESLA source authentication in the ALC and NORM protocols</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
          <persName key="planete-2006-idm256654357248">
            <foreName>A.</foreName>
            <surname>Francillon</surname>
            <initial>A.</initial>
          </persName>
          <persName>
            <foreName>S.</foreName>
            <surname>Faurite</surname>
            <initial>S.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-msec-tesla-for-alc-norm-02.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3817" id="planete-2007-c-bid8" PRJ="planete" n="cite:draft.ldpc06" rend="consolide" type="manual">
      <monogr>
        <title level="m">Low Density Parity Check (LDPC) Staircase and Triangle Forward Error Correction (FEC) Schemes</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
          <persName>
            <foreName>C.</foreName>
            <surname>Neumann</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>D.</foreName>
            <surname>Furodet</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-ietf-rmt-fec-bb-ldpc-06.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3815" id="planete-2007-c-bid10" PRJ="planete" n="cite:draft.new-fcast" rend="consolide" type="manual">
      <monogr>
        <title level="m">FCAST: Scalable Object Delivery on top of the ALC Protocol</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-roca-rmt-newfcast-00.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>February</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="1261" id="planete-2007-c-bid5" PRJ="planete" n="cite:Roca.cdp2_book07" rend="consolide" type="inbook">
      <analytic>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <title level="a">End to end approaches for reliable communications</title>
      </analytic>
      <monogr>
        <title level="m">Multimedia Multicast on the Internet</title>
        <imprint>
          <publisher>
            <orgName>ISTE</orgName>
          </publisher>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="1284" id="planete-2007-c-bid4" PRJ="planete" n="cite:Roca.cdp1_book07" rend="consolide" type="inbook">
      <analytic>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <title level="a">Reliability in group communications: an introduction</title>
      </analytic>
      <monogr>
        <title level="m">Multimedia Multicast on the Internet</title>
        <imprint>
          <publisher>
            <orgName>ISTE</orgName>
          </publisher>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3821" id="planete-2007-c-bid7" PRJ="planete" n="cite:draft.simple-auth" rend="consolide" type="manual">
      <monogr>
        <title level="m">Simple Authentication Schemes for the ALC and NORM Protocols</title>
        <author>
          <persName key="planete-2006-idm256654398256">
            <foreName>V.</foreName>
            <surname>Roca</surname>
            <initial>V.</initial>
          </persName>
        </author>
        <note type="bnote" place="unspecified" anchored="yes">IETF RMT Working Group, Work in Progress: &lt;draft-roca-rmt-simple-auth-for-alc-norm-00.txt&gt;</note>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="4526" id="planete-2007-c-bid31" PRJ="planete" n="cite:TICP.report" rend="consolide" type="techreport">
      <monogr>
        <title level="m">Experiences on enhancing data collection in large networks</title>
        <author>
          <persName>
            <foreName>Karim</foreName>
            <surname>SBAI</surname>
            <initial>K.</initial>
          </persName>
          <persName>
            <foreName>Chadi</foreName>
            <surname>BARAKAT</surname>
            <initial>C.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Technical Report</note>
        <imprint>
          <biblScope type="number">inria-00140937</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>April</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00140937" location="extern">http://hal.inria.fr/inria-00140937</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3629" id="planete-2007-c-bid20" PRJ="planete" n="cite:NTMS07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Transport Information Collection Protocol with clustering of information sources</title>
        <author>
          <persName>
            <foreName>Karim</foreName>
            <surname>Sbai</surname>
            <initial>K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">NTMS 2007 (Conference on New Technologies, Mobility and Security), Paris</title>
        <imprint>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="4409" id="planete-2007-c-bid17" PRJ="planete" n="cite:SBCHT07" rend="consolide" type="techreport">
      <monogr>
        <title level="m">BitHoc: BitTorrent for Wireless Ad Hoc networks</title>
        <author>
          <persName key="planete-2006-idm256655389376">
            <foreName>Mohamed Karim</foreName>
            <surname>Sbai</surname>
            <initial>M. K.</initial>
          </persName>
          <persName key="planete-2006-idm256654403536">
            <foreName>Chadi</foreName>
            <surname>Barakat</surname>
            <initial>C.</initial>
          </persName>
          <persName>
            <foreName>Jaeyoung</foreName>
            <surname>Choi</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>Anwar Al</foreName>
            <surname>Hamra</surname>
            <initial>A. A.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>Thierry</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
        <note type="typdoc" place="unspecified" anchored="yes">Technical Report</note>
        <imprint>
          <biblScope type="number">inria-00196313</biblScope>
          <publisher>
            <orgName type="institution">INRIA</orgName>
          </publisher>
          <dateStruct>
            <month>December 2007</month>
            <year>2007</year>
          </dateStruct>
          <ref xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://hal.inria.fr/inria-00196313" location="extern">http://hal.inria.fr/inria-00196313</ref>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="3967" id="planete-2007-c-bid14" PRJ="planete" n="cite:draft802.11c" rend="consolide" type="misc">
      <monogr>
        <title level="m">"Leader based Multicast"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654362560">
            <foreName>D.</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>E.</foreName>
            <surname>Qi</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>A. Stephens M.</foreName>
            <surname>Wentink</surname>
            <initial>A. S. M.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>March</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/0115r3</note>
    </biblStruct>
    <biblStruct dedoublkey="3967" id="planete-2007-c-bid15" PRJ="planete" n="cite:draft802.11d" rend="consolide" type="misc">
      <monogr>
        <title level="m">"Leader based Multicast"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654362560">
            <foreName>D.</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>E.</foreName>
            <surname>Qi</surname>
            <initial>E.</initial>
          </persName>
          <persName>
            <foreName>M.</foreName>
            <surname>Wentink</surname>
            <initial>M.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>July</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/2128r0</note>
    </biblStruct>
    <biblStruct dedoublkey="3967" id="planete-2007-c-bid13" PRJ="planete" n="cite:draft802.11b" rend="consolide" type="misc">
      <monogr>
        <title level="m">"Leader based Multicast"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654362560">
            <foreName>D.</foreName>
            <surname>Dujovne</surname>
            <initial>D.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/0115r1</note>
    </biblStruct>
    <biblStruct dedoublkey="3887" id="planete-2007-c-bid12" PRJ="planete" n="cite:draft802.11a" rend="consolide" type="misc">
      <monogr>
        <title level="m">"Audio Video Multicast Protocol"</title>
        <author>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
          <persName key="planete-2006-idm256655359680">
            <foreName>J.</foreName>
            <surname>Villalón</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>D.</foreName>
            <surname>Shim</surname>
            <initial>D.</initial>
          </persName>
        </author>
        <imprint>
          <dateStruct>
            <month>January</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
      <note type="howpublished" place="unspecified" anchored="yes">IEEE 802.11-07/0034r1</note>
    </biblStruct>
    <biblStruct dedoublkey="3721" id="planete-2007-c-bid29" PRJ="planete" n="cite:aoc07" rend="consolide" type="inproceedings">
      <analytic>
        <title level="a">Utility-based Message Replication for Intermittently Connected Heterogeneous Networks</title>
        <author>
          <persName key="planete-2006-idm256654365840">
            <foreName>T.</foreName>
            <surname>Spyropoulos</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
          <persName key="planete-2006-idm256654377136">
            <foreName>K</foreName>
            <surname>Obraczka</surname>
            <initial>K.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="m">1st IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC), Helsinki, Finland</title>
        <imprint>
          <dateStruct>
            <month>June</month>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="0148" id="planete-2007-c-bid1" PRJ="planete" n="cite:iet07" rend="consolide" type="article">
      <analytic>
        <title level="a">ARSM: A Cross-Layer Auto Rate Selection Multicast Mechanism for Multi-Rate Wireless LANs</title>
        <author>
          <persName key="planete-2006-idm256655359680">
            <foreName>J.</foreName>
            <surname>Villalón</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Orozco-Barbosa</surname>
            <initial>L.</initial>
          </persName>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">IET Communications, Special Issue on Wireless Mobile Networks: Cross-layer Communication</title>
        <imprint>
          <dateStruct>
            <year>2007</year>
          </dateStruct>
        </imprint>
      </monogr>
    </biblStruct>
    <biblStruct dedoublkey="0291" id="planete-2007-c-bid2" PRJ="planete" n="cite:jsac07" rend="consolide" type="article">
      <analytic>
        <title level="a">Cross-Layer Architecture for Adaptive Video Multicast Streaming over Multi-Rate Wireless LANs</title>
        <author>
          <persName key="planete-2006-idm256655359680">
            <foreName>J.</foreName>
            <surname>Villalón</surname>
            <initial>J.</initial>
          </persName>
          <persName>
            <foreName>P.</foreName>
            <surname>Cuenca</surname>
            <initial>P.</initial>
          </persName>
          <persName>
            <foreName>L.</foreName>
            <surname>Orozco-Barbosa</surname>
            <initial>L.</initial>
          </persName>
          <persName key="planete-2006-idm256654368496">
            <foreName>Y.</foreName>
            <surname>Seok</surname>
            <initial>Y.</initial>
          </persName>
          <persName key="planete-2006-idm256654407232">
            <foreName>T.</foreName>
            <surname>Turletti</surname>
            <initial>T.</initial>
          </persName>
        </author>
      </analytic>
      <monogr>
        <title level="j">IEEE JSAC Special Issue on Cross-Layer Optimized Wireless Multimedia Communications</title>
        <imprint>
          <biblScope type="volume">25</biblScope>
          <biblScope type="number">4</biblScope>
          <dateStruct>
            <month>May</month>
            <year>2007</year>
          </dateStruct>
          <biblScope type="pages">699-711</biblScope>
        </imprint>
      </monogr>
    </biblStruct>
  </biblio>
</raweb>
