Abstract: A configuration method, equipment, system and computer readable medium for determining a new configuration of calculation resources associated to a function and to at least one future time slot, the calculation resources being defined as different calculation capacities allocated to the function during a time slot and included within at least one computer, the configuration method comprising a first step of determining an old demand, a second step of determining a plurality of conditional probabilities associated to the old demand and to a plurality of new demands, a third step of determining a plurality of reconfiguration costs associated to a plurality available configurations, a step of selecting the new configuration as being the available configuration associated to the minimal reconfiguration cost.

Abstract: A configuration method, equipment, system and computer readable medium for determining a new configuration of calculation retraffic sources associated to a function and to at least one future time slot, the calculation resources being defined as different calculation capacities allocated to the function during a time slot and included within at least one computer, the configuration method comprising a first step of determining an old demand, a second step of determining a plurality of conditional probabilities associated to the old demand and to a plurality of new demands, a third step of determining a plurality of reconfiguration costs associated to a plurality available configurations, a step of selecting the new configuration as being the available configuration associated to the minimal reconfiguration cost.

Abstract: Various embodiments provide a method and apparatus providing signaling protocol overload control by enhancing hop-by-hop overload control using cooperation between an “upstream server” or Sending Entity (SE) and the server receiving the signaling request messages and replying with signaling reply messages for a session the “downstream server” or Receiving Entity (RE). In particular, an overload control mechanism for a signaling request transmitted between an SE and the RE allows the RE to receive from the SE a predicted load based on the original un-throttled signaling load information at the SE. The RE may then base decisions such as an overload trigger or a resource scaling decision based on the received un-throttled predicted load at the SE.

Abstract: A network may include a plurality of nodes forming a first layer and a sub-set of the plurality of nodes forming a second layer. The first layer may follow a first routing objective in routing traffic, and the second layer may develop constraints based on the first routing objective and follow a second routing objective within the developed constraints in routing traffic. In another network, the second layer may follow a second routing objective in routing traffic, and the first layer may develop constraints based on the second routing objective and follow a first routing objective within the developed constraints in routing traffic.

Abstract: The invention is directed to energy-efficient network processing of delay tolerant data packet traffic. Embodiments of the invention determine if an aggregate of time critical traffic flow rates and minimum rates for meeting QoS requirements of delay tolerant traffic flows exceeds a combined optimal rate of packet processing engines of a network processor. In the affirmative case, embodiments set the processing rate of individual packet processing engines to a minimum rate, such that the cumulative rate of the packet processing engines meets the aggregate rate, and schedule the delay tolerant flows to meet their respective minimum rates. Advantageously, by throttling the processing rate of only delay tolerant traffic, energy consumption of network processors can be reduced while at the same time QoS requirements of the delay tolerant traffic and time critical traffic can be met.

Abstract: The invention is directed to energy-efficient network processing of delay tolerant data packet traffic. Embodiments of the invention determine if an aggregate of time critical traffic flow rates and minimum rates for meeting QoS requirements of delay tolerant traffic flows exceeds a combined optimal rate of packet processing engines of a network processor. In the affirmative case, embodiments set the processing rate of individual packet processing engines to a minimum rate, such that the cumulative rate of the packet processing engines meets the aggregate rate, and schedule the delay tolerant flows to meet their respective minimum rates. Advantageously, by throttling the processing rate of only delay tolerant traffic, energy consumption of network processors can be reduced while at the same time QoS requirements of the delay tolerant traffic and time critical traffic can be met.

Abstract: A method and apparatus for performing template-based prefix caching advantageously identifies common prefixes (i.e., initial video segments) in video titles, stores common prefixes only once in a prefix cache, and uses these common prefixes when serving requests for video content. This advantageously enables a prefix cache to scale to a large number of video titles, since the cache stores each common prefix only once. A new video title that uses an already existing prefix may be advantageously added without requiring additional storage in the prefix cache. Template-based prefix caching also advantageously reduces the bandwidth required to distribute prefixes when new titles are ingested into the system—if the required template is already available in the prefix cache, prefix-caching is enabled instantly for this title and no additional bandwidth is required to distribute the prefix.

Abstract: A peer-to-peer accelerator system is disclosed for reducing reverse link bandwidth bottlenecking of peer-to-peer content transfers. The peer-to-peer accelerator system contains a peer-to-peer proxy which resides in the core of the network. When a peer-to-peer bootstrap message from an asymmetrically connected client occurs, the proxy intercepts the message and instantiates an agent which will perform file transfers on the asymmetrically connected client's behalf thereby eliminating the need for the client to effect file content transfers over the reverse link. The peer-to-peer accelerator system is particularly useful for overcoming the bottlenecking and reverse link contention problems of peer-to-peer file transfer systems known in the art.

Abstract: The invention is directed to energy-efficient network processing of delay tolerant data packet traffic. Embodiments of the invention determine if an aggregate of time critical traffic flow rates and minimum rates for meeting QoS requirements of delay tolerant traffic flows exceeds a combined optimal rate of packet processing engines of a network processor. In the affirmative case, embodiments set the processing rate of individual packet processing engines to a minimum rate, such that the cumulative rate of the packet processing engines meets the aggregate rate, and schedule the delay tolerant flows to meet their respective minimum rates. Advantageously, by throttling the processing rate of only delay tolerant traffic, energy consumption of network processors can be reduced while at the same time QoS requirements of the delay tolerant traffic and time critical traffic can be met.

Abstract: A method and apparatus for performing template-based prefix caching advantageously identifies common prefixes (i.e., initial video segments) in video titles, stores common prefixes only once in a prefix cache, and uses these common prefixes when serving requests for video content. This advantageously enables a prefix cache to scale to a large number of video titles, since the cache stores each common prefix only once. A new video title that uses an already existing prefix may be advantageously added without requiring additional storage in the prefix cache. Template-based prefix caching also advantageously reduces the bandwidth required to distribute prefixes when new titles are ingested into the system—if the required template is already available in the prefix cache, prefix-caching is enabled instantly for this title and no additional bandwidth is required to distribute the prefix.

Abstract: A network may include a plurality of nodes forming a first layer and a sub-set of the plurality of nodes forming a second layer. The first layer may follow a first routing objective in routing traffic, and the second layer may develop constraints based on the first routing objective and follow a second routing objective within the developed constraints in routing traffic. In another network, the second layer may follow a second routing objective in routing traffic, and the first layer may develop constraints based on the second routing objective and follow a first routing objective within the developed constraints in routing traffic.