Dell Products Inc.

Brocade Communications Systems, Inc.

Brocade Communication Systems LLC

Hewlett-packard Development Company, L.p.

Avago Technologies International Sales Pte. Limited

Anoop Ghanwani

Shivakumar Sundaram

Shunjia Yu

Krishnamurthy Subramanian

Phanidhar Koganti

Mohnish Anumala

Pathangi Narasimhan Janardhanan

Raja Sathianarayan Jayakumar

Rajiv Krishnamurthy

Nagarajan Venkatesan

Phaniraj Vattem

Mukesh Moopath Velayudhan

Suresh Vobbilisetty

Sanjay Sane

Mythilikanth Raman

Avinash Natarajan

John Michael Terry

Dilip Chatwani

Somesh Gupta

Thomas Kelley Chenault

Sam J Lee

Joseph LaSalle White

Swaminathan Sundararaman

John Lewis Hufferd

Paul T Congdon

Ramasubramani Mahadevan

Kannan Karuppiah

Padmanabhan Narayanan

Per Henrik Fremrot

Claudio Desanti

Senthil Kumar Ganesan

Surya Parkash Varanasi

Ezio Valdevit

Surya Prakash Varanasi

Wing Cheung

Joseph Juh-En Cheng

Glenn Wenig

Robert Norman Snively

Vinoth Kumar Arumugam

Ram Krishnan

Venkatesan Mahalingam

Aravind Babu Mahendrababu

Anandaraj Maharajan

Janardhanan Pathangi Narasimhan

Ananda M Chinnaiah Sankaran

Mohan Ayalasomayajula

Boris Zemlyak

Snigs Mukhopadhyay

Pathangi Narasimhan Janadhanan

Mohnish Anamula

Bhavini Gada

Sandra Snively, Legal Representative

Chetput L Venkataraghavan

A headroom-based result determination system includes first and second ports connected via a link, and a buffer for the first port. A headroom-based result determination subsystem monitors data stored in the buffer that was received in data packets each having a worst-case data packet size and transmitted at a maximum packet rate for a link speed of the link, determines that a buffer threshold is reached and, in response, generates a pause instruction. The headroom-based result determination subsystem then transmits the pause instruction to the second port, measures a first amount of data stored in the buffer subsequent to generating the pause instruction, and generates a headroom-based result by adding the first amount of data, a second amount of data equal to a maximum transmission size of the first port, and a third amount of data equal to a maximum transmission size of a class of the data received at the first port.

Buffer headroom-based result determination system

A Layer 2 (L2) domain hierarchical address communication system includes a first computing device that provides a first host, and a second computing device that provides a second host. A first leaf switch device is connected to the first computing device, and a second leaf switch device that is connected to the second computing device and coupled to the first leaf switch device. The first leaf switch device receives a first data communication from the first host that includes a second hierarchical MAC address of the second host. The first leaf switch device identifies a hierarchical MAC prefix in the second hierarchical MAC address, and uses the hierarchical MAC prefix to forward the first data communication to the second leaf switch device.

L2 domain hierarchical address communication system

Embodiments herein provide more efficient, more flexible, and more cost-effective ways to provide additional and/or increased functionality to an information handling system. Presented herein are embodiments of an application acceleration port interface module (which embodiments may be referred to herein for convenience as 'AAPIM') into which pluggable I/O (input/output) modules may be inserted and the other ends inserted into ports of an information handling system to provide the information handling system with increase capabilities (e.g., increased resource, such as added processing, and increased services, such as new applications or accelerated services). AAPIM embodiments are versatile solutions to address application acceleration needs that can be quickly reprogrammed to address specific needs of a user.

Application acceleration port interface module embodiments

Described herein are systems and methods for host multihoming with no state synchronization between top-of-rack (ToR) switches coupled to multiple hosts. ToR switches of a multi-homing system share a virtual MAC address and respond to Address Resolution Protocol (ARP) requests and/or Neighbor Discovery (ND) solicitations for a default gateway IP address from the host with the virtual MAC address. Ports on a ToR switch may be configured either with a static ARP and/or ND entry, or be configured to learn via a discovery protocol. The lightweight host multihoming system may have modified flooding behavior, ARP/ND handling, and data path forwarding. ARP/ND traffic from a host is processed by a ToR switch, while other multicast traffic may be discarded. Embodiments of the host multihoming system provide a lightweight solution for software implementation with minimal changes imposed on the host or network design.

Lightweight host multihoming

Embodiments are directed to a process and system for avoiding temporary traffic loss in a network having first and second computers and provider edge devices, by retaining, in each provider edge device, path information including a MAC address for the first host computer in a control plane as a dynamic address, and maintaining, in each provider edge device, its own routing table listing network addresses of the other provider edge devices as multi-homed peers. A failure recovery process in each provider edge devices advertises all multi-homed peer network addresses as addresses that each respective provider edge device has dynamically learnt in the control plane such that when a provider edge device receives a route with a locally connected host, it re-advertises the host address on its own.

Method and system to avoid temporary traffic loss with BGP ethernet VPN multi-homing with data-plane mac address learning

A hash collision mitigation system includes a source device coupled to a destination device by a networking device. The networking device receives a first packet from the source device, and uses first packet information included in the first packet to perform a hash operation on the first packet and generate a hash value. The networking device then determines that the hash value has caused a hash collision with a first hash value forwarding entry in a hash forwarding table in the networking device and, in response, generates a first Policy Based Routing (PBR) entry for the first packet. The first PBR entry is configured to provide for the forwarding of at least one second packet received from the destination device and directed to the source device, and that first PBR is stored in a Ternary Content Addressable Memory (TCAM) in the networking device.

Hash collision mitigation system

A microburst visibility system includes a switch device coupled to each sender device(s) and receiver device(s). The switch device receives flows transmitted by the sender device(s) to the receiver device(s). For each flow that include data packets that are stored in a first queue, the switch device provides a first queue identifier for the first queue in a flow record associated with that flow and modifies, for each data packet that is transmitted as part of that flow, flow information in data packet counter(s) that are associated with the first queue identifier in the flow record associated with that flow. When the switch device detects a microburst in the first queue, it captures the flow information in each data packet counter that is associated with the first queue identifier in each of the flow records included in the switch device, and provides it for analysis.

Microburst visibility system

Embodiments of the present invention include systems and methods for adjusting RED configuration according to the available buffer space for a queue in a switch. In one or more embodiments, a method comprises the steps of: initializing minimum and maximum thresholds of RED associated with a queue; determining an available free space for the queue, wherein a data packet for the queue is discarded by a dynamic thresholding when a length of the queue reaches the available free space; determining an allowable free space (AFS) for the queue that is a multiplication of the available free space to an allowance factor (AF); and, when the length of the queue reaches the AFS, calculating a ratio of the minimum threshold to the maximum threshold and updating the maximum threshold to the AFS and updating the minimum threshold to a multiplication of the ratio to the AFS.

Systems and methods for handling data congestion for shared buffer switches with dynamic thresholding

Embodiments are directed to a process and system for recovering from data link failure in a network, by retaining, in a first provider edge device, path information for a first host coupled to a second host over the network in a control plane, upon indication of withdrawal of the first host from a second provider edge device, starting a timer controlling a period of re-advertisement and re-routing to the first host, removing, in the first provider edge device, the first host from a data plane, and generating, in the first provider edge device, a new route to advertise the first host address to cause other provider edge devices to receive the new route and adjust their respective control plane routes prior to expiration of the timer.

Method and system to avoid temporary traffic loss with BGP ethernet VPN multi-homing with data-plane MAC address learning

Embodiments are directed to a process and system for optimizing traffic paths for orphaned hosts in a VXLAN system, by configuring virtual link trunking (VLT) peers to advertise MAC addresses learned from all multi-homed hosts in the system using Anycast VXLAN tunnel endpoint-Internet Protocol address (VTEP-IP); configuring the virtual link trunking (VLT) peers to advertise MAC addresses learned from all single-homed hosts in the system using a secondary VTEP-IP; directing unicast traffic destined to the single-homed hosts to directly connected VLT peers using the Secondary VTEP-IP; and directing Broadcast, unknown unicast, and multi-cast (BUM) traffic destined to the single-homed hosts to directly connected VLT peers using the Inclusive Multicast Ethernet Tag route.

Optimizing traffic paths to orphaned hosts in VXLAN networks using virtual link trunking-based multi-homing

The present invention relates generally to an information handling system. Aspects of the present invention include an adaptive credit-based flow control in an information handling system. In embodiments, a request/grant credit system can be eliminated since the receiver can dynamically allocate credits based on demand at the sender. In embodiments, the sender can provide information related to its queue size to the receiver. The receiver can estimate queue size and demand based on the estimated queue size. In embodiments, the receiver allocates credits based on sender demand.

Systems and methods for adaptive credit-based flow

An N-port, shared-memory switch allocates a shared headroom buffer pool (Ps) for a priority group (PG). Ps is smaller than a worst case headroom buffer pool (Pw), where Pw equals the sum of worst case headrooms corresponding to each port-priority tuple (PPT) associated with the PG. Each worst case headroom comprises headroom required to buffer worst case, post-pause, traffic received on that PPT. Subject to a PPT maximum, each PPT may consume Ps as needed. Because rarely will all PPTs simultaneously experience worst case traffic, Ps may be significantly smaller than Pw, e.g., Ps&#x3c;(Pw/A) where M&#x3e;=2. Ps may be size-adjusted based on utilization of Ps, without halting traffic to or from the switch. If Ps utilization exceeds an upper utilization threshold, Ps may be increased, subject to a maximum threshold (Pmax). Conversely, if utilization falls below a lower utilization threshold, Ps may be decreased.

Self tuning buffer allocation in a shared-memory switch

Systems and techniques for processing and/or forwarding packets are described. An ingress switch can use a QoS mapping mechanism to map a first set of Quality of Service (QoS) bits in a packet received from a customer to a second set of QoS bits for use in a Transparent Interconnection of Lots of Links (TRILL) packet which encapsulates the packet. The first set of QoS bits can be different from the second set of QoS bits. The TRILL packet can be processed and/or forwarded in the network based on the second set of QoS bits. At the egress switch, the TRILL packet can be decapsulated and the original packet with the original QoS bits (or QoS bits that are different from the original QoS bits) can be forwarded to the customer's network. In this manner, some embodiments of the present invention can preserve the QoS bits across a TRILL network.

Preserving quality of service across trill networks

A system for managing networked devices comprising a plurality of racks of computing devices, each rack computing device further comprising a plurality of constraints and configured to operate one or more hosted systems, each rack comprising a bit vector stored in a data memory defining the minimum available set of constraints for each of the plurality of rack computing devices. A plurality of enterprises, each comprising one or more enterprise computing device configured to operate a virtual network system that is configured to interactively operate with the one or more hosted systems of one of the rack computing devices. A network function virtualization system configured to receive a service request and to determine that a new hosted system is required to respond to the service request, and to select a rack for instantiation of the new hosted system as a function of the plurality of bit vectors.

System and method for policy-based smart placement for network function virtualization

Aspects of the present invention include increasing the number of hops that can be specifically defined in a multiprotocol label switching stack. In embodiments of the present invention, a label space can be used to represent two or more labels. In embodiments of the present invention, the label space can be used by concatenating two or more labels and redefining the multiprotocol label switching stack operations and outgoing labels.

Systems and methods for increasing the multiprotocol label switching stack

Growing community of inventors

Rocklin, CA, United States of America

Anoop Ghanwani