Abstract:
A method includes identifying shared content by inspecting a peer-to-peer traffic flow and identifying source peers providing the shared content, and requesting the shared content from the source peers. The method further includes receiving requests for the shared content from requesting peers, identifying requesting peers based on the requests for the shared content, and providing the shared content to a local subset of the requesting peers.
Abstract:
A method and apparatus for providing protection for mail servers in networks such as the packet networks are disclosed. For example, the present method detects a mail server is reaching its processing limit. The method then selectively limits connections to the mail server from a plurality of source nodes based on a spam index associated with each of the source nodes.
Abstract:
A method, a computer readable medium and an apparatus for providing a dynamic inactivity timer are disclosed. For example, the method monitors a timer for a time threshold associated with a burst of a plurality of bursts of packets, and determines if the timer for the time threshold associated with the burst has expired. The method predicts an inter-burst time for the burst, if the timer for the time threshold associated with the burst has expired and sets the dynamic inactivity timer in accordance with the inter-burst time for the burst.
Abstract:
A method, computer readable medium and apparatus for performing a demotion in a cellular communications network are disclosed. For example, the method receives a packet indicating that a batching transfer is completed, determines if a background packet was received after receiving the packet indicating that the batching transfer is completed and demotes a state of a state machine implemented by a radio network controller to a lower state if the background packet was not received.
Abstract:
A method, computer readable medium and system for automatically tracking content in a peer-to-peer environment are disclosed. For example, the method monitors a number of times each content title of a plurality of content titles are downloaded in the peer-to-peer environment, adds one or more content titles of the plurality of content titles that are downloaded above a predetermined threshold to a list, downloads each one of the one or more content titles in the list via the peer-to-peer environment and verifies that each one of the one or more content titles that are downloaded matches at least one content title in the list.
Abstract:
Techniques for increasing power and resource efficiency of a mobile device are presented herein. In the mobile device, with regard to periodic or one-time data transfers, a communication management component can analyze information comprising data transfer parameter information, including jitter information, associated with each application of a subset of applications used by the device and can desirably schedule and/or bundle data transfers associated with the applications to reduce the number of separate data bursts to transfer that data to thereby reduce use of wireless resources and power consumption by the device. A push notification system can receive respective jitter information associated with each application from the mobile device, and the push notification system can desirably schedule and/or bundle push notifications to reduce the number of separate data bursts sent to the device to reduce use of wireless resources and power consumption by the device.
Abstract:
An example method involves for a first virtual private network (VPN) installed on a candidate hub router, selecting a first spoke-to-hub assignment solution having a first least memory utilization cost to assign the candidate hub router a quantity of first virtual private edge (VPE) routers serving the first VPN; for a second VPN installed on the candidate hub router, selecting a second spoke-to-hub assignment solution having a second least memory utilization cost to assign the candidate hub router a quantity of second VPE routers serving the second VPN; determining third least memory utilization costs to assign the candidate hub router to a quantity of the first VPE routers, and fourth least memory utilization costs to assign the candidate hub router to a quantity of the second VPE routers; and selecting the first or second spoke-to-hub assignment solution for the candidate hub router based on the least memory utilization costs.
Abstract:
Methods and apparatus to implement scalable routing in network communication systems are disclosed. A disclosed example method involves selecting a plurality of virtual private networks in a communication network and selecting a candidate hub router from a plurality of routers in the communication network. The example method also involves determining a plurality of least memory utilization costs associated with assigning different quantities of spoke routers to the candidate hub router. Each of the least memory utilization costs and corresponding quantity of spoke routers is associated with a corresponding one of the plurality of virtual private networks. For each of the least memory utilization costs, a bandwidth usage of a corresponding one of the quantities of spoke routers is identified. The candidate hub router is selected to operate as a hub router for one of the quantities of spoke routers associated with a corresponding one of the bandwidth usages that does not exceed a bandwidth capacity of the candidate hub router.
Abstract:
A method, computer readable medium and apparatus for normalizing cellular communications network data are disclosed. For example, the method collects a data packet from the cellular communications network, modifies a time stamp of the data packet in accordance with a promotion delay time from the time stamp of the data packet to create a normalized data packet and processes the normalized data packet to optimize state machine configurations.
Abstract:
Disclosed herein are systems, computer-implemented methods, and computer-readable media for sampling network traffic. The method includes receiving a desired quantity of flow record to sample, receiving a plurality of network flow record each summarizing a network flow of packets, calculating a hash for each flow record of based on one or more invariant part of a respective flow, generating a quasi-random number from the calculated hash for each respective flow record, generating a priority from the calculated hash for each respective flow record, and sampling exactly the desired quantity of flow records, selecting flow records having a highest priority first. In one aspect, the method further partitions the plurality of flow records into groups based on flow origin and destination, generates an individual priority for each partitioned group, and separately samples exactly the desired quantity of flow records from each partitioned group, selecting flows having a highest individual priority first.