Abstract: 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.

Abstract: A method is intended for verifying storage of contents into communication equipments connected to at least one communication network.

Abstract: 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.

Abstract: A method is intended for generating confirmations of data transfers between communication equipments connected to a communication network. This method consists, when an application running in a first communication equipment wants to transfer data packets to at least one second communication equipment, i) in transmitting a request, comprising communication identifiers of the first and second communication equipments and requesting a data transfer control, to first and second auxiliary communication equipments acting as interfaces between the communication network and the first and second communication equipments, respectively, and ii) in storing auxiliary data representative of these data packets transferred through the first and second auxiliary communication equipments, these stored auxiliary data constituting proofs of transmission of the data packets by the first communication equipment and of reception of at least some of these data packets by the second communication equipment.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: The present invention concerns a method for characterizing a communication link in a communication network comprising at least two communication nodes and operating using a network protocol comprising a MAC layer and a network layer, said method comprising the steps of: sending unicast packets from a communication node comprising a driver, to another communication node through a link; collecting, by said node at the level of said driver, information concerning transmission characteristics at the level of both MAC layer and network layer; deriving, from said collected information, the following values: delivery ratio of unicast packets; and average time to transmit a unicast packet; and estimating, in said node, the quality of said link at the level of both MAC layer and network layer, by computing the following quantity: mean ? ( P ? ? T ? ? T ) du .

Abstract: The present invention relates to a method for the distribution of multimedia content, comprising: a first step comprising a download in “push” mode of a multimedia content, in a partial way, from a content server to a client device, and a second step comprising a download of the missing elements of said multimedia content in “pull” mode via a “peer to peer” mechanism from a second client device, and in that the multimedia content can be reconstituted with n+p blocks, n and p being non-null natural integers, n blocks being downloaded during said first step and p blocks being downloaded during the second step, the multimedia content being exploitable only after reception of n+p blocks.

Abstract: The invention concerns a method of communication in a communication network, using a communication device comprising means for exchanging data with at least another communication device, comprising the following steps: receiving, at said device: i. information representing interconnections between users of a social networking application; ii. information concerning at least one contact between said device and at least another device, occurring in said communication network; determining, upon occurrence of a new contact between said device and at least another device, based: on said information representing interconnections between users of a social networking application and on predetermined rules related to data forwarding; to transmit data or not to transmit data from said device using said new contact.

Abstract: 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.

Abstract: The invention concerns a method of configuring the topology of a communication network comprising a plurality of nodes (i, j, . . . , N), said 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 said timer of said node i triggers the steps of: searching, by said node i, a parent node; selecting, by said node i, a parent node using at least throughput and subtree size as selection criteria ; and migrating said node i to the selected parent node along with its subtree size. Preferably, said step of selecting a parent node by said 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 said node i to another node k.

Abstract: 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.

Abstract: The present invention relates to a method for the distribution of multimedia content, comprising: a first step comprising a download in “push” mode of a multimedia content, in a partial way, from a content server to a client device, and a second step comprising a download of the missing elements of said multimedia content in “pull” mode via a “peer to peer” mechanism from a second client device, and in that the multimedia content can be reconstituted with n+p blocks, n and p being non-null natural integers, n blocks being downloaded during said first step and p blocks being downloaded during the second step, the multimedia content being exploitable only after reception of n+p blocks.

Abstract: 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.

Abstract: 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.

Abstract: The present invention includes a method and system for determining link weights that when utilized will optimize the performance of a network in the event of a link failure without the need to alter the link weights. The method includes determining two sets of links, one that includes links with a significant amount of loading and one that includes links with a modest amount of loading. A set of permissible solutions is generated utilizing one randomly chosen link from each set. After omitting recent best permissible solutions, the remaining permissible solutions are evaluated by analyzing for the complete network topology and for the topologies corresponding to all single-link failure states and the best permissible solution is found. If the best permissible solution is better than the current optimal solution, then the best permissible solution is made the optimal solution. These steps are repeated until a predetermined number of iterations have been evaluated without a change in the optimal solution.

Abstract: A system and method 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 one or more pairs of network nodes onto physical paths that are at least relatively disjoint and obtaining a maximum time delay allowed between the each pair of network nodes, the mapping options are correlated with the maximum time delay to identify optimal mapping of logical links to the physical topology of a network.