| Patent application number | Description | Published |
|---|
| 20090161673 | Method and System For Computing Multicast Traffic Matrices - A system and method for receiving, from one or more ingress routers, a first set of records including data corresponding to network traffic, receiving, from one or more egress routers, a second set of records including data corresponding to network traffic and creating a multicast traffic matrix using at least a portion of the data included in the first and second sets of records. | 06-25-2009 |
| 20090185486 | Method for controlling traffic balance between peering networks - A method that measures ratio, relative to a peering network, of traffic burden of incoming traffic to traffic burden of outgoing traffic, where traffic burden takes into account traffic volume and distance that the traffic traverses through the network. A determination is made from this ratio as to whether an imbalance exists with the peering network. With the assistance of a simulation of changes in routing policy and their effects, an existing or impending imbalance is remedied by changing the routing policy relative to particular customers, for example from a “hot potato” routing policy to a “best exit” routing policy. | 07-23-2009 |
| 20090198569 | METHOD AND APPARATUS FOR PRESENTING ADVERTISEMENTS - A system that incorporates teachings of the present disclosure may include, for example, a controller to determine a behavioral profile of an end user from packet traffic generated by activities of the end user, and share the behavioral profile with a network element for distributing targeted advertisements to the end user according to the behavioral profile. Additional embodiments are disclosed. | 08-06-2009 |
| 20090254638 | Topology Aware Content Delivery Network - A method of assigning a server to a client system includes determining an ingress point of the client system and identifying possible egress points for the client system. The method further includes selecting the server from a plurality of servers to reduce network cost and delivery time. | 10-08-2009 |
| 20090296714 | SCALABLE MULTIPROTOCOL LABEL SWITCHING BASED VIRTUAL PRIVATE NETWORKS AND METHODS TO IMPLEMENT THE SAME - Example scalable multi-protocol label switching (MPLS) based virtual private networks (VPNs) and methods to implement the same are disclosed. A disclosed example spoke provider edge (PE) router for an MPLS-based VPN includes a truncated virtual routing and forwarding (VRF) table containing a first value referencing a hub PE router and a second value referencing a first customer edge (CE) router coupled to the VPN via the PE router, and a forwarding module to forward a packet received from the first CE router to the hub PE router when the packet contains an address referencing a second CE router coupled to the VPN via a second spoke PE router. | 12-03-2009 |
| 20090316590 | Sampling and Analyzing Packets in a Network - The preferred embodiments of the present invention can include sampling packets transmitted over a network based on the content of the packets. If a packet is sampled, the sampling unit can add one or more fields to the sampled packet that can include a field for a number of bytes contained in the packet, a packet count, a flow count, a sampling type, and the like. The sampled packets can be analyzed to discern desired information from the packets. The additional fields that are added to the sampled packets can be used during the analysis. | 12-24-2009 |
| 20100034084 | Reliability as an Interdomain Service - A system and techniques are disclosed that increase the redundancy (i.e., physical diversity and bandwidth) available to an IP network, thereby increasing the failure processing capability of IP networks. The techniques include pooling the resources of multiple networks together for mutual backup purposes to improve network reliability and employing methods to efficiently utilize both the intradomain and the interdomain redundancies provided by networks at low cost. | 02-11-2010 |
| 20100061370 | Systems and Methods for Optimized Route Caching - A method for optimized route caching includes comparing a destination address of a network packet to a first set of prefixes in a routing cache, and comparing the destination address to a second set of prefixes in a full routing table when a longest matching prefix for the destination address is not found in the routing cache. The method further includes copying the longest matching prefix and a set of sub-prefixes of the longest matching prefix from the full routing table to the routing cache, and forwarding the network packet. | 03-11-2010 |
| 20100115604 | METHODS AND APPARATUS TO DYNAMICALLY CONTROL ACCESS FROM VIRTUAL PRIVATE NETWORKS TO NETWORK-BASED SHARED RESOURCES - Methods and apparatus to dynamically control access from VPNs to shared resources are disclosed. A disclosed example route reflector comprises a memory to implement a database, a user interface module to receive a request to permit access for a VPN to a shared resource, a BGP engine to process BGP advertisements, a network interface to receive a first BGP advertisement from a PE router associated with the VPN that includes a first RT associated with the VPN, and a shared resource access controller to update the database based on the request, to query the database to determine whether the VPN has access to the shared resource in response to the first BGP advertisement, and to direct the BGP engine to form a second BGP advertisement based on the first BGP advertisement that includes a second RT associated with the shared resource when the VPN has access to the shared resource. | 05-06-2010 |
| 20100121945 | Hybrid Unicast/Anycast Content Distribution Network System - A method includes receiving a request for an edge cache address, and comparing a requester address to an anycast group. The method can further include providing an anycast edge cache address when the requestor address is in the anycast group. Alternatively, the method can further include determining an optimal cache server, and providing a unicast address of the optimal cache server when the requester address is not in the anycast group. | 05-13-2010 |
| 20100125643 | Interdomain Network Aware Peer-to-Peer Protocol - A method includes receiving network distance information, receiving a request from a client for an identity of a peer providing content, and identifying a first peer and a second peer providing the content. The network distance information includes a compilation of network distance information provided by a plurality of service providers. The method further includes determining that a network distance between the first peer and the client is less than a network distance between the second peer and the client based on the network distance information, and providing the identity of the first peer to the client. | 05-20-2010 |
| 20100138543 | Real-time content detection in ISP transmissions - A method and system for detecting the transmission of preidentified content, such as copyrighted material, over an Internet Service Provider (ISP) network. A set of rules is provided to identify one or more traffic flow profiles of data streams transmitting preidentified content. Preferably the rules are adaptively created through analysis of actual ISP data in conjunction with data suggesting an initial set of profile characteristics. The rules are applied to data streams being transmitted in the ISP network, so that data streams fitting one or more of the profiles are identified. A database contains, e.g., as digital signatures or fingerprints, one or more items of content whose transmission is sought to be detected. Data streams identified as matching a profile are analyzed to determine if their content matches an item of content in the database, and if so, an action is taken which may include interrupting the transmission, suspending an ISP account, or reporting the transmission. An ISP with a system performing this method may offer services to content providers, and a plurality of ISPs may jointly use a single database of preidentified content to be compared to each ISP's identified data streams. | 06-03-2010 |
| 20100138555 | System and Method to Guide Active Participation in Peer-to-Peer Systems with Passive Monitoring Environment - 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. | 06-03-2010 |
| 20100146100 | Flexible Application Classification - A system includes an information storage module and an inspection module. The information storage module is configured to store a plurality of tags. Each tag is associated with a known set of traffic types of a plurality of known sets of traffic types. The inspection module is configured to compare a traffic flow to a set of traffic types to determine a matching set of traffic types, request a tag from the information storage module, and mark the traffic flow with the tag. The tag corresponds to the matching set of traffic types. | 06-10-2010 |
| 20100150005 | SYSTEM AND METHOD FOR DETERMINATION OF ROUTING INFORMATION IN A NETWORK - A system and method to use network flow records to generate information about changes in network routing and to understand the impact of these changes on network traffic. The inferences made can be determinative, if sufficient information is available. If sufficient information is not available to make determinative inferences, inferences may be made that narrow the range of possible changes that may have occurred to network traffic and the underlying network. | 06-17-2010 |
| 20100157809 | SYSTEM AND METHOD FOR SPATIALLY CONSISTENT SAMPLING OF FLOW RECORDS AT CONSTRAINED, CONTENT-DEPENDENT RATES - 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. | 06-24-2010 |
| 20100159931 | System and Method for Inferring Wireless Trajectories in a Cellular Telephone Network - A device includes a processor configured to determine a number of users in each of a plurality of wireless telephone cells of a trajectory in a wireless telephone network. The processor is also configured to determine handoff data between each adjacent pair of the wireless telephone cells, and to determine a first number of users traveling along the trajectory in the wireless telephone network while on a telephone call. The processor also calculates a total number of users associated with the trajectory in the wireless telephone network based on the handoff data between each adjacent pair of the wireless telephone cells, and based on the first number of users traveling along the trajectory while on the telephone call. | 06-24-2010 |
| 20100161535 | METHOD AND APPARATUS FOR INFERRING THE PRESENCE OF STATIC INTERNET PROTOCOL ADDRESS ALLOCATIONS - A method and apparatus for inferring if an IP address allocation in a remote network is static or dynamic are disclosed. For example, the method contacts at least one remote peer to peer endpoint using a peer to peer application to obtain an IP address of the at least one remote peer to peer endpoint. The method then analyzes characteristics of the at least one remote peer to peer endpoint over a predefined period of time to infer whether the presence of static IP address allocation exists for the at least one remote peer to peer endpoint. | 06-24-2010 |
| 20100161791 | SYSTEM AND METHOD FOR SAMPLING NETWORK TRAFFIC - Disclosed herein are systems, computer-implemented methods, and computer-readable media for sampling network traffic. The method includes receiving a plurality of flow records, calculating a hash for each flow record 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, and sampling flow records having a quasi-random number below a probability P. Invariant parts of flow records include destination IP address, source IP address, TCP/UDP port numbers, TCP flags, and network protocol. A plurality of routers can uniformly calculate hashes for flow records. Each router in a plurality of routers can generate a same quasi-random number for each respective flow record and uses different values for probability P. The probability P can depend on a flow size. The method can divide the quasi-random number by a maximum possible hash value. | 06-24-2010 |
| 20100262683 | Network Aware Forward Caching - An Internet service provider includes a cache server and a network aware server. The network aware server is operable to determine an optimization between a cost of retrieving content from a network and a cost of caching content from the network at the first cache server and then send a content identifier to the cache server. The cache server is operable to receive the content identifier, and determine the source of a content item. If the source is the same as the content identifier, then the cache server caches the content item. | 10-14-2010 |
| 20100296430 | Method and System for Computing Multicast Traffic Matrices - A system and method for receiving, from one or more ingress routers, a first set of records including data corresponding to network traffic, receiving, from one or more egress routers, a second set of records including data corresponding to network traffic and creating a multicast traffic matrix using at least a portion of the data included in the first and second sets of records. | 11-25-2010 |
| 20110013525 | Indirect measurement methodology to infer routing changes using statistics of flow arrival processes - Statistical methods are used to observe packet flow arrival processes and to infer routing changes from those observations. Packet flow arrivals are monitored using NetFlow or another packet flow monitoring arrangement. Packet flow arrivals are quantified by counting arrivals per unit time, or by measuring an inter-arrival time between flows. When a change in packet flow arrivals is determined to be statistically significant, a change in network routing protocol is reported. | 01-20-2011 |
| 20110069634 | METHODS AND APPARATUS TO IMPLEMENT SCALABLE ROUTING IN NETWORK COMMUNICATION SYSTEMS - 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. | 03-24-2011 |
| 20110072127 | Network Aware Application Management - A method of managing a network application includes identifying a network path for the network application, obtaining network performance measurements along the network path, obtaining application performance information for the network application, and extracting infrastructure specific information for the infrastructure supporting the network application. The method further includes correlating the application performance information, network performance measurements, and the infrastructure specific information to identify a performance issue affecting the network application, and modifying the application behavior, the network behavior, or any combination thereof in response to the performance issue. | 03-24-2011 |
| 20110085630 | TCP FLOW CLOCK EXTRACTION - A packet trace is received. The packet trace is transformed into a sequence of pulse signals in a temporal domain. The sequence of pulse signals in the temporal domain is transformed into a sequence of pulse signals in a frequency domain. Peaks are detected within relevant frequency bands in the sequence of pulse signals in the frequency domain. A fundamental frequency is identified within the peaks. The fundamental frequency, which represents the TCP flow clock, is returned. | 04-14-2011 |
| 20110096662 | Inferring TCP Initial Congestion Window - A packet trace is received. Inter-arrival times between the multiple packets in the packet trace are determined. An inter-arrival time in the inter-arrival times that is greater than a threshold is identified. An order number of the inter-arrival time is identified. A determination is made as to whether a size of each of at least a portion of the multiple packets is equal to a maximum segment size. When a determination is made that the size of each of at least a portion of the multiple packets is equal to the maximum segment size a size of the ICW as a product of the order number and the maximum segment size is returned. | 04-28-2011 |
| 20110103256 | Detecting Irregular Retransmissions - A packet trace is received. Transmitted bytes and retransmitted bytes are identified in the packet trace. Upon identifying the transmitted bytes and the retransmitted bytes in the packet trace, one or more time-rate pairs are determined from the packet trace. The time-rate pairs are plotted on a rate tracking graph. | 05-05-2011 |
| 20110142053 | METHODS AND APPARATUS TO COMMUNICATIVELY COUPLE VIRTUAL PRIVATE NETWORKS TO VIRTUAL MACHINES WITHIN DISTRIBUTIVE COMPUTING NETWORKS - Methods and apparatus to communicatively couple virtual private networks to virtual machines within distributive computing networks are disclosed. A disclosed example method includes receiving a request to provision a virtual machine from a virtual private network, determining a host for the virtual machine within a distributive computing network, creating the virtual machine within the host, communicatively coupling the virtual machine to a virtual local area network switch within the distributive computing network, configuring a portion of a router to be communicatively coupled to the virtual machine via the virtual local area network switch by specifying an address space within the router associated with at least one of the virtual machine or the virtual private network communicatively coupled to the router, and communicatively coupling the portion of the router to the virtual private network. | 06-16-2011 |
| 20110145211 | Network Based Audience Measurement - Methods, systems, and computer-readable media for providing network-based audience measurement are provided. Data packets are intercepted between a client computer and a content server. Unique subscribers and content names are identified based on the data packets. One or more audience measurement metrics are computed based on the unique subscribers and the content names. | 06-16-2011 |
| 20110161313 | METHOD AND APPARATUS FOR AUTOMATED END TO END CONTENT TRACKING IN PEER TO PEER ENVIRONMENTS - 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. | 06-30-2011 |
