Philippe Jacquet - Academia.edu (original) (raw)
Papers by Philippe Jacquet
This specification describes version 2 of the Optimized Link State Routing Protocol (OLSRv2) for ... more This specification describes version 2 of the Optimized Link State Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs).
Lecture Notes in Computer Science, 1992
Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended A... more Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract) Mikhail J. Atallah 1, Philippe Jacquet 2, Wojciech Szpankowski 3 1 Dept. ... If ~- --- 0% then for any constant fl we have lifn Pr{c~ : F(r, ~) _< tim exp P - 3P 2 + 2T " (24) ...
Mathematics and Computer Science II, 2002
2013 IEEE International Symposium on Information Theory, 2013
We propose a classification test to discriminate Markov sources based on the joint string complex... more We propose a classification test to discriminate Markov sources based on the joint string complexity. String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define the joint string complexity as the cardinality of the set of words which both strings have in common. In this paper we analyze the average joint complexity when both strings are generated by two Markov sources. We provide fast converging asymptotic expansions and present some experimental results showing usefulness of the joint complexity to text discrimination.
2010 Proceedings IEEE INFOCOM, 2010
We investigate the fundamental capacity limits of space-time journeys of information in mobile an... more We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carryforward routing. We define the capacity of a journey (i.e., a path in space and time, from a source to a destination) as the maximum amount of data that can be transferred from the source to the destination in the given journey. Combining a stochastic model (conveying all possible journeys) and an analysis of the durations of the nodes' encounters, we study the properties of journeys that maximize the space-time information propagation capacity, in bit-meters per second. More specifically, we provide theoretical lower and upper bounds on the information propagation speed, as a function of the journey capacity. In the particular case of random way-point-like models (i.e., when nodes move for a distance of the order of the network domain size before changing direction), we show that, for relatively large journey capacities, the information propagation speed is of the same order as the mobile node speed. This implies that, surprisingly, in sparse but large-scale mobile DTNs, the space-time information propagation capacity in bit-meters per second remains proportional to the mobile node speed and to the size of the transported data bundles, when the bundles are relatively large. We also verify that all our analytical bounds are accurate in several simulation scenarios.
Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07), 2007
In this paper we consider the problem of routing in intermittently connected networks. In such ne... more In this paper we consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There do however exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through such networks. We propose PROPHET, a probabilistic routing protocol for such networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PROPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.
2006 IEEE International Symposium on Information Theory, 2006
A sequence of zeros and ones is called a (d, k)sequence if it does not contain runs of zeros of l... more A sequence of zeros and ones is called a (d, k)sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, but fixed, positive integers and d < k. For a given pattern w, we enumerate exactly and asymptotically (d, k) sequences of length n that do not contain a given word w. We use techniques of analytic algorithms such as generating functions, combinatorial calculus, and complex asymptotics.
Lecture Notes in Computer Science, 1991
2008 IEEE International Symposium on Information Theory, 2008
or Intermittently Connected Mobile Networks (ICNs) are mobile ad hoc networks where end-to-end mu... more or Intermittently Connected Mobile Networks (ICNs) are mobile ad hoc networks where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. While most of the research is dedicated to the design of routing protocols, very few properties of such networks are known. In a recent paper [6], the authors provided analytical upper bounds for the information propagation speed in DTNs when they are modeled as two-dimensional Unit Disk Graphs. In this paper, we extend this study to other models by using analytical tools to derive theoretical upper-bounds of the information propagation speed. Firstly, we will present results for DTNs mapped in a space of dimension D, where D varies from 1 to 3. Secondly, we will depart from the Unit Disk Graph model to consider a more realistic model where a node captures a packet sent at distance r with probability p(r).
2009 IEEE International Symposium on Information Theory, 2009
We analyze the performance of epidemic routing in large-scale intermittently connected networks, ... more We analyze the performance of epidemic routing in large-scale intermittently connected networks, under a random geometric graph model and for different mobility parameters (such as the random-waypoint, random walk and Brownian motion models). We derive a generic scaling law on the delay, which provides us with lower bounds: the average delay from a source to a destination and the average broadcast delay are both Ω Rn √ n v n , where n is the number of nodes in the network, v n the maximum node speed, and R n the radio range.
2011 IEEE International Symposium on Information Theory Proceedings, 2011
We show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless so... more We show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences. Then we present simplified proofs and extend our analysis of LZ'78 algorithm to include new results on the convergence of moments, moderate and large deviations, and redundancy analysis.
[Docs] [txt|pdf] [draft-ietf-ospf-m...] [Diff1] [Diff2] [Errata] EXPERIMENTAL Errata Exist Networ... more [Docs] [txt|pdf] [draft-ietf-ospf-m...] [Diff1] [Diff2] [Errata] EXPERIMENTAL Errata Exist Network Working Group E. Baccelli Request for Comments: 5449 P. Jacquet Category: Experimental INRIA D. Nguyen CRC T. Clausen LIX, Ecole Polytechnique February 2009 OSPF Multipoint ...
... Page 12. How are link metrics reported? HELLO messages in both directions TC messages ... more ... Page 12. How are link metrics reported? HELLO messages in both directions TC messages outgoing only Using TLVs default value - if you don&amp;amp;amp;#x27;t use it, you don&amp;amp;amp;#x27;t pay for it Page 13. MPRs Used for relaying flooded messages reduced topology advertisement ...
Combinatorics, Probability and Computing, 2014
ABSTRACT We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the sa... more ABSTRACT We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth’s recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth’s recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.
2013 IEEE International Symposium on Information Theory, 2013
In this paper, we study the information propagation speed in multi-lane vehicle-tovehicle network... more In this paper, we study the information propagation speed in multi-lane vehicle-tovehicle networks such as multi-lane roads or highways. We focus on the impact of time-varying radio ranges and of multiple lanes of vehicles, varying in speed and in density. We assess the existence of a vehicle density threshold under which information propagates on average at the fastest vehicle speed and above which information propagates dramatically faster. We first prove that no such phase transition occurs if there is only one lane, regardless of the density of vehicles, when one takes into account real-time radio communication range variations at the MAC layer. We then prove that, on the other hand, a phase transition exists as soon as there are multiple lanes with different vehicle speeds and appropriate densities. We characterize conditions under which the phase transition occurs and we derive bounds on the corresponding threshold as a simple relationship between the vehicle density on the fastest lane and the sum of the vehicle densities on the other lanes. Our results intrinsically encompass a wide range of vehicular network scenarios, including one-way and two-way roads, as well as special cases such as road side units and/or parked cars being used as relays. We confirm our analytical results using simulations carried out in several environments (ONE and Maple).
Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century., 2001
This specification describes version 2 of the Optimized Link State Routing Protocol (OLSRv2) for ... more This specification describes version 2 of the Optimized Link State Routing Protocol (OLSRv2) for Mobile Ad Hoc Networks (MANETs).
Lecture Notes in Computer Science, 1992
Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended A... more Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract) Mikhail J. Atallah 1, Philippe Jacquet 2, Wojciech Szpankowski 3 1 Dept. ... If ~- --- 0% then for any constant fl we have lifn Pr{c~ : F(r, ~) _&amp;amp;amp;lt; tim exp P - 3P 2 + 2T &amp;amp;amp;quot; (24) ...
Mathematics and Computer Science II, 2002
2013 IEEE International Symposium on Information Theory, 2013
We propose a classification test to discriminate Markov sources based on the joint string complex... more We propose a classification test to discriminate Markov sources based on the joint string complexity. String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define the joint string complexity as the cardinality of the set of words which both strings have in common. In this paper we analyze the average joint complexity when both strings are generated by two Markov sources. We provide fast converging asymptotic expansions and present some experimental results showing usefulness of the joint complexity to text discrimination.
2010 Proceedings IEEE INFOCOM, 2010
We investigate the fundamental capacity limits of space-time journeys of information in mobile an... more We investigate the fundamental capacity limits of space-time journeys of information in mobile and Delay Tolerant Networks (DTNs), where information is either transmitted or carried by mobile nodes, using store-carryforward routing. We define the capacity of a journey (i.e., a path in space and time, from a source to a destination) as the maximum amount of data that can be transferred from the source to the destination in the given journey. Combining a stochastic model (conveying all possible journeys) and an analysis of the durations of the nodes' encounters, we study the properties of journeys that maximize the space-time information propagation capacity, in bit-meters per second. More specifically, we provide theoretical lower and upper bounds on the information propagation speed, as a function of the journey capacity. In the particular case of random way-point-like models (i.e., when nodes move for a distance of the order of the network domain size before changing direction), we show that, for relatively large journey capacities, the information propagation speed is of the same order as the mobile node speed. This implies that, surprisingly, in sparse but large-scale mobile DTNs, the space-time information propagation capacity in bit-meters per second remains proportional to the mobile node speed and to the size of the transported data bundles, when the bundles are relatively large. We also verify that all our analytical bounds are accurate in several simulation scenarios.
Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07), 2007
In this paper we consider the problem of routing in intermittently connected networks. In such ne... more In this paper we consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There do however exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through such networks. We propose PROPHET, a probabilistic routing protocol for such networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PROPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.
2006 IEEE International Symposium on Information Theory, 2006
A sequence of zeros and ones is called a (d, k)sequence if it does not contain runs of zeros of l... more A sequence of zeros and ones is called a (d, k)sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, but fixed, positive integers and d < k. For a given pattern w, we enumerate exactly and asymptotically (d, k) sequences of length n that do not contain a given word w. We use techniques of analytic algorithms such as generating functions, combinatorial calculus, and complex asymptotics.
Lecture Notes in Computer Science, 1991
2008 IEEE International Symposium on Information Theory, 2008
or Intermittently Connected Mobile Networks (ICNs) are mobile ad hoc networks where end-to-end mu... more or Intermittently Connected Mobile Networks (ICNs) are mobile ad hoc networks where end-to-end multi-hop paths may not exist and communication routes may only be available through time and mobility. While most of the research is dedicated to the design of routing protocols, very few properties of such networks are known. In a recent paper [6], the authors provided analytical upper bounds for the information propagation speed in DTNs when they are modeled as two-dimensional Unit Disk Graphs. In this paper, we extend this study to other models by using analytical tools to derive theoretical upper-bounds of the information propagation speed. Firstly, we will present results for DTNs mapped in a space of dimension D, where D varies from 1 to 3. Secondly, we will depart from the Unit Disk Graph model to consider a more realistic model where a node captures a packet sent at distance r with probability p(r).
2009 IEEE International Symposium on Information Theory, 2009
We analyze the performance of epidemic routing in large-scale intermittently connected networks, ... more We analyze the performance of epidemic routing in large-scale intermittently connected networks, under a random geometric graph model and for different mobility parameters (such as the random-waypoint, random walk and Brownian motion models). We derive a generic scaling law on the delay, which provides us with lower bounds: the average delay from a source to a destination and the average broadcast delay are both Ω Rn √ n v n , where n is the number of nodes in the network, v n the maximum node speed, and R n the radio range.
2011 IEEE International Symposium on Information Theory Proceedings, 2011
We show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless so... more We show that the Lempel Ziv'78 redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper [3]. We present a new simplified proof of the Central Limit Theorem for the number of phrases in the LZ'78 algorithm. As in our 1995 paper, here we first analyze the asymptotic behavior of the total path length in a digital search tree (a DST) built from independent sequences. Then we present simplified proofs and extend our analysis of LZ'78 algorithm to include new results on the convergence of moments, moderate and large deviations, and redundancy analysis.
[Docs] [txt|pdf] [draft-ietf-ospf-m...] [Diff1] [Diff2] [Errata] EXPERIMENTAL Errata Exist Networ... more [Docs] [txt|pdf] [draft-ietf-ospf-m...] [Diff1] [Diff2] [Errata] EXPERIMENTAL Errata Exist Network Working Group E. Baccelli Request for Comments: 5449 P. Jacquet Category: Experimental INRIA D. Nguyen CRC T. Clausen LIX, Ecole Polytechnique February 2009 OSPF Multipoint ...
... Page 12. How are link metrics reported? HELLO messages in both directions TC messages ... more ... Page 12. How are link metrics reported? HELLO messages in both directions TC messages outgoing only Using TLVs default value - if you don&amp;amp;amp;#x27;t use it, you don&amp;amp;amp;#x27;t pay for it Page 13. MPRs Used for relaying flooded messages reduced topology advertisement ...
Combinatorics, Probability and Computing, 2014
ABSTRACT We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the sa... more ABSTRACT We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth’s recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth’s recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.
2013 IEEE International Symposium on Information Theory, 2013
In this paper, we study the information propagation speed in multi-lane vehicle-tovehicle network... more In this paper, we study the information propagation speed in multi-lane vehicle-tovehicle networks such as multi-lane roads or highways. We focus on the impact of time-varying radio ranges and of multiple lanes of vehicles, varying in speed and in density. We assess the existence of a vehicle density threshold under which information propagates on average at the fastest vehicle speed and above which information propagates dramatically faster. We first prove that no such phase transition occurs if there is only one lane, regardless of the density of vehicles, when one takes into account real-time radio communication range variations at the MAC layer. We then prove that, on the other hand, a phase transition exists as soon as there are multiple lanes with different vehicle speeds and appropriate densities. We characterize conditions under which the phase transition occurs and we derive bounds on the corresponding threshold as a simple relationship between the vehicle density on the fastest lane and the sum of the vehicle densities on the other lanes. Our results intrinsically encompass a wide range of vehicular network scenarios, including one-way and two-way roads, as well as special cases such as road side units and/or parked cars being used as relays. We confirm our analytical results using simulations carried out in several environments (ONE and Maple).
Proceedings. IEEE International Multi Topic Conference, 2001. IEEE INMIC 2001. Technology for the 21st Century., 2001