Abstract: A producer communicates over a network with a user application in an infrastructure-as-a-service (IaaS) and an IaaS node. The producer encrypts content with first encryption using a first key and second encryption using a second key, to produce twice encrypted content. The producer encrypts the second key with attribute-based encryption and symmetric encryption using an IaaS key, to produce a twice encrypted second key. The producer provides to the user application the twice encrypted content, the twice encrypted second key, and key information configured to remove the first encryption from the twice encrypted content. The producer provides to the IaaS node the IaaS key to enable the IaaS node to remove the symmetric encryption from the twice encrypted second key, such that the user application and the IaaS node are constrained to exchange with each other key-related information and intermediate decryption results in order to recover the content.

Abstract: Particular embodiments described herein provide for a system, method, and apparatus that can be configured to determine that a first network element is no longer connected to a second network element, where interests had been sent to the second network element and are still pending. Each of the pending interest can be associated with a pending interval timer and the pending interests can be forwarded to a third network element before the expiration of the pending interval timer associated with each of the pending interests. In an example, the pending interest is part of an information centric networking protocol.

Abstract: A method is provided in one example embodiment and may include determining each station of a plurality of stations connected to a WiFi access point that are to receive downlink video transmissions from the WiFi access point, wherein the WiFi access point is connected to an Information-Centric Networking-based (ICN-based) network; associating each station of the plurality of stations to each of a corresponding ICN face of a plurality of ICN faces maintained by the WiFi access point; and managing a downlink transmission buffer for each station of the plurality of stations based, at least in part, a modulation and coding scheme (MCS) associated with downlink video transmissions for each station of the plurality of stations, wherein each downlink transmission buffer is associated with the corresponding ICN face associated with each station.

Abstract: A method is provided in one example embodiment and may include generating an interest message to be transmitted using each face of a plurality of faces associated with a node, wherein the interest message is to be discarded by each of a neighboring node of a plurality of neighboring nodes that receive the interest message; determining, for each face of the plurality of faces associated with the node, a one-hop propagation delay associated with each face of the plurality of faces; and selecting a particular face through which to transmit another interest message based, at least in part, on the one-hop propagation delay of the particular face and a number of pending interests associated with the particular face.

Abstract: A method is provided in one example embodiment and may include receiving an interest message at a gateway, wherein the gateway provides connectivity to a plurality of radio accesses that interface with an Information-Centric Networking-based (ICN-based) network; identifying a service class associated with the interest message; selecting a particular radio access of the plurality of radio accesses to handle traffic for the interest message based on at least one of: one or more policies associated with the service class, one or more policies associated with the plurality of radio accesses, and network conditions associated with the plurality of radio accesses; and forwarding the interest message to the particular radio access.

Abstract: A method is provided in one example embodiment and may include generating a first interest message for a consumer application of a first node, wherein the first interest message comprises a content name within an Internet Protocol identifying content to be received by the first node; opening an Information-Centric Networking (ICN) socket for the first node, wherein the ICN socket is associated with the content name and the consumer application; and transmitting the first interest message to an IP network, wherein the IP network comprises at least one hybrid ICN-enabled routing node that is capable of performing packet forwarding using both IP networking constructs and ICN constructs.

Abstract: A method is provided in one example embodiment and may include receiving an Internet Protocol (IP) packet at a node; identifying a content semantic for the IP packet; determining whether the IP packet is an IP interest packet or an IP data packet; determining whether content identified in the IP packet is stored at the node based on a determination that the IP packet is an IP interest packet; forwarding the IP packet toward at least one other node based on a determination that the content is not stored at the node; and transmitting an IP data packet containing the content based on a determination that the content is stored at the node.

Abstract: Particular embodiments described herein provide for a system, method, and apparatus that can be configured to determine that a first network element is no longer connected to a second network element, where interests had been sent to the second network element and are still pending. Each of the pending interest can be associated with a pending interval timer and the pending interests can be forwarded to a third network element before the expiration of the pending interval timer associated with each of the pending interests. In an example, the pending interest is part of an information centric networking protocol.

Abstract: A communication method is provided, which is implemented by a routing device in an information-centered communication network. The method includes the following steps to process a request relative to a data segment from a given stream, the request being routed on a link of the routing device: checking that an input bit rate for said link is higher than a threshold, the input bit rate for the link corresponding to that which is necessary for the device to receive, by using the link, a set of data segments corresponding to pending requests; and timing the request to be routed. The threshold may correspond to the bit rate available on this link at the device input, or the input bit rate may be determined for pending requests related to data segments from the given stream, and the threshold may correspond to a fair bit rate, for example.

Abstract: A method and routing device are provided for aggregating of requests relating to a data segment of a stream into another request and for storing data segments belonging to different streams in a queue prior to the device routing them to client entities that have requested them. The method includes: determining a credit associated with a stream, the credit varying based on a number of requests transmitted by client entities and relating to data segments belonging to the stream; and, on receiving a data segment in response to the other request, and when memory space available in the queue does not enable the received data segment to be stored: selecting a stream having at least one data segment stored in the queue and for which the associated credit is the smallest; and deleting from the queue a data segment belonging to the selected stream.

Abstract: Process for managing the storage of a list (L) of N items (I[i]) in a memory cache (M) of C items (I[i]) of said list, said N items being ordered in said list according to a rank i which depends of their last request time by a user, C, N and i being strictly positive integers, said process providing, upon the reception of a request for an item (I[i]), for calculating a popularity probability f(i) for said requested item, f being an acceleration function, and for deciding to move or not said requested item at a higher rank i according to said popularity probability.

Abstract: A method is provided for processing flows in a wireless communications network. Data packets belonging to different flows are received by a device of a communications network and stored in a queue to enable them to be sent by the device over a radio channel to at least one node. Access to the radio channel is time-shared between a plurality of nodes. The method includes: at least one step of determining a duration associated with a flow, the duration corresponding to a virtual duration needed for sending packets of said flow stored in the queue; and in order to send a data packet, a step of selecting one of the flows amongst a plurality of flows, in which step a flow is selected for which the associated duration is the smallest, and a step of sending a packet of the selected flow as extracted from the queue.

Abstract: A communication method is provided, which is implemented by a routing device in an information-centered communication network. The method includes the following steps to process a request relative to a data segment from a given stream, the request being routed on a link of the routing device: checking that an input bit rate for said link is higher than a threshold, the input bit rate for the link corresponding to that which is necessary for the device to receive, by using the link, a set of data segments corresponding to pending requests; and timing the request to be routed. The threshold may correspond to the bit rate available on this link at the device input, or the input bit rate may be determined for pending requests related to data segments from the given stream, and the threshold may correspond to a fair bit rate, for example.

Abstract: A transmission method is used by a node of a communications network, wherein nodes communicate with one another via a carrier-sense multiple-access channel, said method comprising a step of sending a signal at a given transmit power and a given data rate to a receiver node over the channel, and wherein the transmit power of the sent signal assumes successively a first power value during a first time period and then a second power value during a second time period, the two power values being different and one of them being equal to the given power, the first time period representing the given power and the second time period representing the data rate. The invention also relates to a method of receiving a signal sent by the transmission method enabling the transmit power and the data rate used by the sender node to be deduced from the received signal.

Abstract: A method and routing device are provided for aggregating of requests relating to a data segment of a stream into another request and for storing data segments belonging to different streams in a queue prior to the device routing them to client entities that have requested them. The method includes: determining a credit associated with a stream, the credit varying based on a number of requests transmitted by client entities and relating to data segments belonging to the stream; and, on receiving a data segment in response to the other request, and when memory space available in the queue does not enable the received data segment to be stored: selecting a stream having at least one data segment stored in the queue and for which the associated credit is the smallest; and deleting from the queue a data segment belonging to the selected stream.

Abstract: A method is provided for processing flows in a wireless communications network. Data packets belonging to different flows are received by a device of a communications network and stored in a queue to enable them to be sent by the device over a radio channel to at least one node. Access to the radio channel is time-shared between a plurality of nodes. The method includes: at least one step of determining a duration associated with a flow, the duration corresponding to a virtual duration needed for sending packets of said flow stored in the queue; and in order to send a data packet, a step of selecting one of the flows amongst a plurality of flows, in which step a flow is selected for which the associated duration is the smallest, and a step of sending a packet of the selected flow as extracted from the queue.

Abstract: The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (6), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (6), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (5), in the alternative case.

Abstract: A transmission method is used by a node of a communications network, wherein nodes communicate with one another via a carrier-sense multiple-access channel, said method comprising a step of sending a signal at a given transmit power and a given data rate to a receiver node over the channel, and wherein the transmit power of the sent signal assumes successively a first power value during a first time period and then a second power value during a second time period, the two power values being different and one of them being equal to the given power, the first time period representing the given power and the second time period representing the data rate. The invention also relates to a method of receiving a signal sent by the transmission method enabling the transmit power and the data rate used by the sender node to be deduced from the received signal.

Abstract: The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (6), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (6), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (5), in the alternative case.

Abstract: The disclosure relates to an apparatus and associated methodology for processing flows. Data packets belonging to various flows are received by a device of a communications network and stored in a queue so as the device retransmits them. In order to re-transmit a data packet, a flow is selected, to which the least memory space in the queue is allocated. A packet from the selected flow is retransmitted and extracted from the queue, and when the memory space available in the queue does not allow a received packet to be stored. Further a flow is selected to which the most memory space in the queue is allocated and a data packet of the selected flow is eliminated from the queue.