scispace - formally typeset
Search or ask a question

Showing papers by "Laurent Viennot published in 2007"


Posted Content
TL;DR: The representation of such preference systems suitable for the Peer-to-Peer paradigm is analyzed and it is shown that any acyclic system can be represented with a symmetric mark matrix, which gives a method to merge acYclic preference systems while retaining the acyClicity property.
Abstract: In this work we study preference systems natural for the Peer-to-Peer paradigm. Most of them fall in three categories: global, symmetric and complementary. All these systems share an acyclicity property. As a consequence, they admit a stable (or Pareto efficient) configuration, where no participant can collaborate with better partners than their current ones. We analyze the representation of the such preference systems and show that any acyclic system can be represented with a symmetric mark matrix. This gives a method to merge acyclic preference systems and retain the acyclicity. We also consider such properties of the corresponding collaboration graph, as clustering coefficient and diameter. In particular, studying the example of preferences based on real latency measurements, we observe that its stable configuration is a small-world graph.

34 citations


Book ChapterDOI
28 Aug 2007
TL;DR: In this paper, the authors analyze the representation of preference systems and show that any acyclic preference system can be represented with a symmetric mark matrix, which gives a method to merge preference systems while retaining the acycyclicity property.
Abstract: In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. All these systems share an acyclicity property. As a consequence, they admit a stable (or Pareto efficient) configuration, where no participant can collaborate with better partners than their current ones. We analyze the representation of such preference systems and show that any acyclic system can be represented with a symmetric mark matrix. This gives a method to merge acyclic preference systems while retaining the acyclicity property. We also consider properties of the corresponding collaboration graph, such as clustering coefficient and diameter. In particular, the study of the example of preferences based on real latency measurements shows that its stable configuration is a small-world graph.

32 citations



Proceedings ArticleDOI
29 Oct 2007
TL;DR: Following a constraint solving method, the paper shows how to maximise the subnet of actors, while satisfying 2-connectivity, reactivity and communication quality constraints, on simulating real world NbO.
Abstract: Future Network based Operations (NbO) will strongly rely on Mobile Ad hoc Networks (MANET), due to urban area, tactical mobility and assymetric operation management. These networks will support multiple collaborative services, such as sensor to shooters, reachback, maintenance of Common Operational Picture (COP). Both networks and services will have to be managed with no or limited operator intervention, still providing reliable behavior in spite of aggressive environments. At routing level, we present how to preserve 2-connectivity by adapting the Optimised Link State Routing Protocol (OLSR). We also introduce the concept of active subnet management to retrieve maximal operational gain from collaborative services. Following a constraint solving method, the paper shows how to maximise the subnet of actors, while satisfying 2-connectivity, reactivity and communication quality constraints. We demonstrate the approach on simulating real world NbO.

4 citations


01 Jan 2007
TL;DR: A generalized version of multipoint relays can be used to construct a sub-topology preserving bi-Connectivity and more generally $k$-connectivity and the multipoint relay structure is intrinsic to any sub- topology with similar properties.
Abstract: Multipoint relays were introduced to optimize flooding in ad hoc networks. They are also used to determine a sub-topology containing shortest paths in the OLSR routing protocol. We show that a generalized version of multipoint relays can be used to construct a sub-topology preserving bi-connectivity and more generally $k$-connectivity. Moreover, we show that the multipoint relay structure is intrinsic to any sub-topology with similar properties.

3 citations


01 Jan 2007
TL;DR: This work presents how to reserve 2-connectivity by adapting theOptimised LinkState Routing Protocol (OLSR), and introduces the concept of active subnet management torieve maximaloperational gain from collaborative services.
Abstract: Future Network basedOperations (NbO)will strongly rely onMobile AdhocNetworks (MANET),duetourban area, tactical mobility andassymetric operation management.Thesenetworks will support multiple collaborative services, suchassensor toshooters, reachback, maintenanceofCommonOperational Picture (COP). Bothnetworksandservices willhavetobemanagedwithnoor limited operator intervention, still providing reliable behavior inspite ofaggressive environments. Atrouting level, wepresent howtopreserve 2-connectivity byadaptingtheOptimised LinkState Routing Protocol (OLSR). We alsointroduce theconcept ofactive subnet managementtoretrieve maximaloperational gainfromcollaborative services. Following aconstraint solving method, thepapershowshowtomaximise thesubnet ofactors, whilesatisfying 2-connectivity, reactivity andcommunication quality constraints. We demonstrate theapproach onsimulating real worldNbO.