Abstract: Some embodiments provide a method for performing a multi-point capture of packets in a network. The method identifies multiple nodes for the multi-point capture in the network. The method configures each node of the multiple nodes to capture a set of packets. The method receives multiple captured packet sets from the multiple nodes. The method analyzes the multiple captured packet sets.

Abstract: Some embodiments provide a method for presenting packets captured in a network. The method identifies a first set of packets from a first packet group of multiple captured packet groups. The method identifies a second set of packets, that corresponds to the first set of packets, from a second packet group of the multiple captured packet groups. The method displays representations of the multiple captured packet groups. At least one of the first set of packets and the second set of packets are presented with a different appearance from other packets of their respective packet group.

Abstract: Systems and methods described herein align various types of hypervisor threads with a non-uniform memory access (NUMA) client of a virtual machine (VM) that is driving I/O transactions from an application so that no remote memory access is required and the I/O transactions can be completed with local accesses to CPUs, caches, and the I/O devices of a same NUMA node of a hardware NUMA system. First, hypervisor of the VM detects whether the VM runs on a single or multiple NUMA nodes. If the VM runs on multiple NUMA nodes, a NUMA client on which the application is executing the I/O transactions is identified and knowledge of resource sharing between the NUMA client and its related hypervisor threads is established. Such knowledge is then utilized to schedule the NUMA client and its related hypervisor threads to the same NUMA node of the NUMA system.

Abstract: A method for load balancing IPTV channels is described. In one embodiment of the invention, a first Provider Edge (PE) network element of a label switched network, coupled with a second PE network element over multiple member links of an aggregate link, receives IPTV packets. For each IPTV packet received, the first PE network determines layer 3 information of the IPTV packet, and generates one or more channel load balancing keys based on the layer 3 information. The PE network element generates a hash value from the channel load balancing keys and determines which one of multiple member links to transmit the IPTV packet on based on the hash value, and transmits the IPTV packet to the second PE network element on the determined member link. Other methods and apparatuses are also described.

Abstract: A method for load balancing IPTV channels is described. In one embodiment of the invention, a first Provider Edge (PE) network element of a label switched network, coupled with a second PE network element over multiple member links of an aggregate link, receives IPTV packets. For each IPTV packet received, the first PE network determines layer 3 information of the IPTV packet, and generates one or more channel load balancing keys based on the layer 3 information. The PE network element generates a hash value from the channel load balancing keys and determines which one of multiple member links to transmit the IPTV packet on based on the hash value, and transmits the IPTV packet to the second PE network element on the determined member link. Other methods and apparatuses are also described.

Abstract: Techniques disclosed herein provide an approach for using receive side scaling (RSS) offloads from a physical network interface controller (PNIC) to improve the performance of a virtual network interface controller (VNIC). In one embodiment, the PNIC is configured to write hash values it computes for RSS purposes to packets themselves. The VNIC then reads the hash values from the packets and places the packets into VNIC RSS queues, which are processed by respective CPUs, based on the hash values. CPU overhead is thereby reduced, as RSS processing by the VNIC no longer requires computing hash values. In another embodiment in which the number of PNIC RSS queues and VNIC RSS queues are identical, the VNIC may map packets from PNIC RSS queues to VNIC RSS queues using the PNIC RSS queue ID numbers, which also does not require the computing RSS hash values.

Abstract: Systems and methods for preferentially assigning virtual machines (VMs) on a particular NUMA node with network queues on the same NUMA node are described. A load balancer process on a host assigns multiple VMs to network queues. The assignment of the VMs to a network queues is performed with a bias toward assigning VMs using a particular NUMA node to network queues on the same NUMA node. A scheduler on the host assigns VMs to NUMA nodes. The scheduler is biased toward assigning VMs to the same NUMA node as the PNIC and/or the same NUMA node as a network queue assigned to the VM.

Abstract: Systems and methods for preferentially assigning virtual machines (VMs) on a particular NUMA node with network queues on the same NUMA node are described. A load balancer process on a host assigns multiple VMs to network queues. The assignment of the VMs to a network queues is performed with a bias toward assigning VMs using a particular NUMA node to network queues on the same NUMA node. A scheduler on the host assigns VMs to NUMA nodes. The scheduler is biased toward assigning VMs to the same NUMA node as the PNIC and/or the same NUMA node as a network queue assigned to the VM.

Abstract: Systems and methods for preferentially assigning virtual machines (VMs) on a particular NUMA node with network queues on the same NUMA node are described. A load balancer process on a host assigns multiple VMs to network queues. The assignment of the VMs to a network queues is performed with a bias toward assigning VMs using a particular NUMA node to network queues on the same NUMA node. A scheduler on the host assigns VMs to NUMA nodes. The scheduler is biased toward assigning VMs to the same NUMA node as the PNIC and/or the same NUMA node as a network queue assigned to the VM.

Abstract: Systems and methods for preferentially assigning virtual machines (VMs) on a particular NUMA node with network queues on the same NUMA node are described. A load balancer process on a host assigns multiple VMs to network queues. The assignment of the VMs to a network queues is performed with a bias toward assigning VMs using a particular NUMA node to network queues on the same NUMA node. A scheduler on the host assigns VMs to NUMA nodes. The scheduler is biased toward assigning VMs to the same NUMA node as the PNIC and/or the same NUMA node as a network queue assigned to the VM.

Abstract: In a computer-implemented method for reducing delay of bursty data transmission in a network employing a congestion control protocol, data is accessed that is to be periodically transmitted over a network employing a congestion control protocol. The data is to be periodically transmitted with a high burst rate followed by an idle period. The congestion control protocol progressively increases a data transmission rate during a data transmission rate increase period invoked immediately following a predetermined idle period. Prior to transmitting the data, priming data is transmitted during at least a portion of the idle period until the congestion control protocol progressively increases the data transmission rate to a desired transmission rate. The data is transmitted at the desired transmission rate.

Abstract: A first network element that is to be coupled with a second network element over a first network in the same domain is described. The first network element includes a connectivity check detection module and a connectivity check fault state change module. The connectivity check detection module detects, according to a first protocol, a connectivity status of a local maintenance endpoint on a second network changing between not active and active. The connectivity check fault state change module creates and sends a first fault state change message, according to a second protocol, in response to the connectivity status of the local maintenance endpoint changing from not active to active instead of forwarding connectivity check messages periodically received by the first network element to a remote maintenance endpoint coupled to the second network element over a third network.

Abstract: Techniques for recovering from hierarchical virtual private LAN service (HVPLS) hub connectivity failure with a dynamic spoke pseudowire. According to one embodiment of the invention, a provider edge (PE) network element in the HVPLS hub monitors for a failure of HVPLS hub connectivity failure and reuses an HVPLS spoke connectivity failure recovery mechanism in an MTU by fabricating failure of one or more spoke facing connectivity elements coupling the MTU with the PE network element causing the MTU to transition to a secondary PE network element in the HVPLS hub. In addition, the PE network element establishes a dynamic spoke pseudowire for each virtual instance affected with the MTU to restore HVPLS hub connectivity for that PE network element.

Abstract: A method for load balancing IPTV channels is described. In one embodiment of the invention, a first Provider Edge (PE) network element of a label switched network, coupled with a second PE network element over multiple member links of an aggregate link, receives IPTV packets. For each IPTV packet received, the first PE network determines layer 3 information of the IPTV packet, and generates one or more channel load balancing keys based on the layer 3 information. The PE network element generates a hash value from the channel load balancing keys and determines which one of multiple member links to transmit the IPTV packet on based on the hash value, and transmits the IPTV packet to the second PE network element on the determined member link. Other methods and apparatuses are also described.

Abstract: A method for load balancing IPTV channels is described. In one embodiment of the invention, a first Provider Edge (PE) network element of a label switched network, coupled with a second PE network element over multiple member links of an aggregate link, receives IPTV packets. For each IPTV packet received, the first PE network determines layer 3 information of the IPTV packet, and generates one or more channel load balancing keys based on the layer 3 information. The PE network element generates a hash value from the channel load balancing keys and determines which one of multiple member links to transmit the IPTV packet on based on the hash value, and transmits the IPTV packet to the second PE network element on the determined member link. Other methods and apparatuses are also described.

Abstract: On a first network element in a radio access network (RAN), supporting operations, management and administration (OAM) between network elements that support Ethernet in the first mile (EFM) and network elements that support connectivity fault management (CFM) in the radio access network by receiving an EFM message from a second network element that supports EFM, wherein the second network element is in the RAN and wherein the EFM message includes OAM data; converting the OAM data from the EFM message into a sub-type-length-value (sub-TLV) of a CFM message; and transmitting the CFM message including the OAM data in the sub-TLV to a third network element that supports CFM, wherein the third network element is in the RAN, whereby an end-to-end OAM sublayer is provided in the RAN by conversion of OAM data from EFM to CFM.

Abstract: A first network element that is to be coupled with a second network element over a first network in the same domain is described. The first network element includes a connectivity check detection module and a connectivity check fault state change module. The connectivity check detection module detects, according to a first protocol, a connectivity status of a local maintenance endpoint on a second network changing between not active and active. The connectivity check fault state change module creates and sends a first fault state change message, according to a second protocol, in response to the connectivity status of the local maintenance endpoint changing from not active to active instead of forwarding connectivity check messages periodically received by the first network element to a remote maintenance endpoint coupled to the second network element over a third network.

Abstract: A method and apparatus that proxies connectivity check messages and sends fault state changes messages across an MPLS/VPLS network is described. A network element proxies connectivity check messages for remote maintenance endpoints based on a local database. The network element updates the database based on received fault state change message that identify a fault state change of a remote maintenance endpoint. The network element detects fault state changes of local maintenance endpoints and sends a fault state change message to other network elements that proxy connectivity check message for the local maintenance endpoints.

Abstract: A method and apparatus that proxies connectivity check messages and sends fault state changes messages across an MPLS/VPLS network is described. A network element proxies connectivity check messages for remote maintenance endpoints based on a local database. The network element updates the database based on received fault state change message that identify a fault state change of a remote maintenance endpoint. The network element detects fault state changes of local maintenance endpoints and sends a fault state change message to other network elements that proxy connectivity check message for the local maintenance endpoints.

Abstract: Differentiated services for network traffic using weighted quality of service is provided. Network traffic is queued into separate per flow queues, and traffic is scheduled from the per flow queues into a group queue. Congestion management is performed on traffic in the group queue. Traffic is marked with priority values, and congestion management is performed based on the priority values. For example, traffic can be marked as “in contract” if it is within a contractual limit, and marked as “out of contract” if it is not within the contractual limit. Marking can also include classifying incoming traffic based on Differentiated Service Code Point. Higher priority traffic can be scheduled from the per flow queues in a strict priority over lower priority traffic. The lower priority traffic can be scheduled in a round robin manner.