Thomson Licensing

Sprint Communications Comapny L.p.

Sprint Spectrum L.p.

Christophe Diot

Nina Taft

Antonio Nucci

Supratik Bhattacharyya

Matteo Varvello

Henrik Lundgren

Gianluca Iannaccone

Martin May

Konstantina Papagiannaki

Frederic Giroire

Sharad Jaiswal

Fernando Jorge Silveira Filho

Theodoros Salonidis

Sundar Iyer

Sebastien Lasserre

Klaus Gaedke

Mary-Luc Champel

Nicolas Le Scouarnec

Jean C Bolot

Christoph Neumann

Pierre Houeix

Augustin Chaintreau

Laurent Massoulie

Jens Peter Wittenburg

François Baccelli

Ali Boudani

Fabio Picconi

Brian Charles Eriksson

Marianna Carrera

Augustin Soule

Vivek Mhatre

Dan-Cristian Tomozei

Mark Crovella

Bianca Schroeder

Kyoungwon Suh

Abderrahmen Mtibaa

Anmol Nalin Sheth

Daniel Garnier-Moiroux

Meinolf Bilawat

Ernst W Biersack

In one embodiment, it is proposed a method for storing input data on a set of DNA strands, said input data being represented in a numeral system. This method is remarkable in that it comprises: formatting said input data into a set of blocks of data, each block of data having a size inferior to a size of one DNA strand; applying a first encoding with an erasure code on said set of blocks of data, defining a first set of modified blocks of data, each modified block of data having a size inferior to a size of one DNA strand; applying a second encoding using an error correcting code on each modified block of data of said first set, defining a second set of modified blocks of data, each modified block having a size inferior to a size of one DNA strand; encoding each modified block of data of said second set into a nucleotides block sequence; generating a set of DNA strands, each DNA strand comprising a nucleotides block sequence obtained through said encoding.

Methods for storing and reading digital data on a set of DNA strands

This relates to message propagation in an opportunistic communication network. Nodes of the network each have a ranking which is compared when the nodes connect, and message is transferred from one node to the other in dependence on the relative values of their respective rankings. The ranking is dependent on a plurality of parameters. One parameter is a social parameter determined by the social contacts of a user associate with a node, for example determined from the contact directory of that person either locally or from a central database such that located on a Face book servicer. Another parameter is the number of physical connections established by a node. The ranking values of connecting nodes is updated when they connect. By combining both parameters, a more efficient forwarding path for messages is obtained.

Method to manage an opportunistic communication network

The present invention provides a method for computing traffic between a pair of Points of Presence in an IP network by summing link utilization values measured for each link connecting a pair of Points of Presence and dividing the sum by the number of link utilization values included in the sum. The resulting average link utilization is the average link utilization of any link in the aggregate and may be multiplied by the number of active links connecting a pair of Points of Presence to reflect the total amount of traffic between the two Points of Presence. Future link utilization may be forecast by modeling the observed traffic between a pair of Points of Presence using wavelet multiresolution analysis to create an approximation curve that captures the long-term trend of link utilization and at least one detail curve that captures the short term deviation of link utilization around the long-term trend. A time series model of the approximation curve may then be constructed and used for forecasting. In a similar fashion, deviation of link utilization may be forecast.

Forecasting link utilization between points of presence in an IP network

A control device belongs to a network equipment connected to a communication network to which are coupled communication equipments of users capable of storing contents. This control device comprises i) a first analyzing means arranged for determining respective popularities of contents of a collection from at least user information, and for determining a number of replicas for each content of this collection from at least its determined content popularity, and/or ii) a second analyzing means arranged for determining content preference(s) of users from content ratings, and iii) a computation means arranged for determining location(s) for storing the replica(s) of each content, from the determined content replica numbers and/or the determined user's content preferences, in order to optimize the access to these contents by the users.

Device and method for optimizing access to contents by users

A system for tracking usage patterns of electrical appliances is disclosed. The system comprises a central database configured to receive and store information; a plurality of energy sensors each of the plurality of sensors being configured to measure a change in electrical energy use by a corresponding one of a plurality of electrical appliances; at least one presence sensor configured to determine when at least one user is proximate to the plurality of electrical appliances and send presence information to the central database; and a processor configured to extract features from such information and create at least one user profile corresponding to the at least one user and a pattern of electrical energy use associated with the at least one user based on said features.

Tracking electrical appliance usage

A method is intended for verifying storage of contents into communication equipments connected to at least one communication network. This method consists, when a first communication equipment stores a content and wants to verify that this content is still stored into a second communication equipment: i) in transmitting a first request, comprising at least an identifier of this content and first data representative of this content and requiring verification of the storage of this content into the second communication equipment, to an auxiliary communication equipment acting as an interface between the communication network and the second communication equipment, ii) in transmitting a second request, comprising at least the content identifier, to the second communication equipment, to require transmission of second data representative of the content to the auxiliary communication equipment, and in triggering a timeout having a chosen duration, and iii) if the auxiliary communication equipment has received the second data before expiration of this timeout, in comparing these received second data, possibly after having processed them, to the received first data, and in transmitting a message representative of the result of this comparison to the first communication equipment.

System and method for automatically verifying storage of redundant contents into communication equipments, by data comparison

The present invention relates to a method for measuring link cost metrics and evaluating their accuracy with respect to reference measure of link quality in a communication network, said method comprising the steps of: during a given time interval, simultaneously transmitting several types of probe packets and data traffic, and estimating a plurality of link cost metrics (metricA, metricB, . . . , metricN) and a reference measure of link quality for a set of communication links; evaluating the accuracy of the estimated link cost metrics (metricA, metricB, . . . , metricN) by computing their correlation with the reference measure of link quality; and collecting cross-layer information for each probe packet.

Method for evaluating link cost metrics in communication networks

A method and apparatus to manage allocation of data to peers in a peer-to-peer network, where the peers in the peer-to-peer network use distributed hash tables for addressing the peers, the peers associated with bit addresses, including dividing a virtual scene into a plurality of cells, each cell associated with a bit identifier, neighboring cells of the virtual scene associated with bit identifiers which differ from each other by one bit and allocating data in each cell of the virtual scene to peers whose bit address is closest to the bit identifier of the cells.

Method for managing the allocation of data into a peer-to-peer network and peer implementing such method

The invention relates to a method of detecting an anomaly in traffic containing a plurality of flows. Each flow has a plurality of flow features. The method including the steps of: (i) dividing the traffic into a plurality of sets, on the basis a first flow feature, such that the flows in at least one of the sets have a common value for the first flow feature (ii) determining that the anomaly is present in one of the sets and, (iii) dividing the set in which the anomaly is present on the basis of a second flow feature, such that the flows in at least one of the resulting sets have a common value for the second flow feature.

Detecting and classifying anomalies in communication networks

The invention concerns a method of configuring the topology of a communication network comprising a plurality of nodes (i,j, . . . , N), the communication network being organized as a forest structure comprising trees and subtrees, wherein at least one node i maintains a periodic timer and an expiration of the timer of the node i triggers the steps of: searching, by the node i, a parent node; selecting, by the node i, a parent node using at least throughput and subtree size as selection criteria; and migrating the node i to the selected size as selection criteria; and migrating the node i to the selected parent node along with its subtree size. Preferably, the step of selecting a parent node by the node i comprises a sub-step of executing a function having as parameters respective subtree sizes of a node j before and after the migration of the node i to another node k.

Method for routing and load balancing in communication networks

The present invention relates to a method for the distribution of multimedia content, comprising:

Multimedia content delivery method and system

A method and computer-program product are provided for measuring the Round-Trip Time (RTT) of data flowing thorough a communications network using a single measurement point. The method includes timestamping a first packet traveling past the measurement point and timestamping a second packet traveling past said measurement point. These difference of these two values is the RTT. This RTT can be continuously updated during the life of the connection to provide an evermore accurate RTT measurement. Alternatively, two sub RTTs can be computed and then summed to arrive at the connection's RTT.

Method and system for measuring round-trip time of packets in a communications network

Method for computing aggregate traffic between adjacent points of presence in an internet protocol backbone network

A method and system for identifying optimal mapping of logical links to the physical topology of a network is provided. Upon obtaining one or more mapping options for mapping multiple logical links between two or more pairs of network nodes onto physical paths that are as at least relatively disjoint and a priority order of the network node pairs, the mapping options are correlated with the priority order of the network nodes to identify optimal mapping of logical links to the physical topology of a network.

Method and system for identifying optimal mapping in a network

A method and computer-program product are provided for distinguishing packets sent in successive packet groups. The packet groups are related to each other. The method includes providing an identification point to a connection of a communications network; receiving a sequence number associated with a first packet, which is part of a first group of packets; and receiving a packet-group-length parameter that denotes the number of packets in the first group of packets. Other embodiments are described herein.

Related-packet identification

Growing community of inventors

Paris, France

Christophe Diot