Fujitsu Corporation

Bijendra Singh

Arun Saha

Vibha Chhatwal Sarin

Calvin Wan

Albert Vinson Smith, Jr

Arindam Paul

Melvin Tan Wee Loon

Mandar S Joshi

Abinder S Dhillon

Maitreya Mukhopadhyay

Swati Mittal

D Michael Colven

Melvin Tan

Abirami Sathyamoorthy

Chandrasekaran Ganesh

Hong Li

Andrew Mao

Ashok K Naik

A method may include receiving, at a network interface of a first network element, an Internet Group Management Protocol (IGMP) message from a second network element. The method may also include updating first multicast group data associated with the network interface based on the received IGMP message, the first multicast group data including one or more entries setting forth a multicast group and one or more other network elements which are members of the multicast group. The method may additionally include determining whether the second network element is the sole member of its multicast group based on the IGMP message and the first multicast group data. The method may further include forwarding the IGMP message to a switching element of the first network element in response to determining that the second network element is the sole member of its multicast group, the switching element communicatively coupled to the network interface.

System and method for distributed internet group management protocol processing

Methods and systems for improved address table flushing in distributed switching systems may be provided. In accordance with embodiments of the disclosure, a switch may include a plurality of line cards and a processor. Each line card may including a table of addresses. The processor may be configured to, in response to receipt of a plurality of simultaneous requests, each request a request to flush addresses associated with a particular flooding domain present on the switch, perform flushing of addresses based on an aggregate number of address entries for each particular flooding domain associated with the requests.

Address table flushing in distributed switching systems

A network element coupled to a communication network is described. The network element includes multiple switching units. The switching units may be configured to independently implement a Spanning Tree Protocol (xSTP) processing in a completely distributed manner including each of the switching units independently calculating an external spanning tree for the network element in the communication network. The network element may act as a single bridge to other network elements in a bridging domain of the communication network.

Distributed spanning tree protocol

A method for networked communications includes determining a group identifier associated with a received request for multicast data, determining an available upstream bandwidth and an available downstream bandwidth, adding an entry for the identified group into a multicast forwarding table, allocating bandwidth from the available upstream bandwidth and available downstream bandwidth, the allocated bandwidth corresponding to bandwidth required by the requested multicast data, and forwarding the received request to an upstream network destination. The method includes, if no response is received in response to the received request within a designated timeout period, removing the entry for the identified group in the multicast forwarding table, and restoring the allocated bandwidth to the available upstream bandwidth and available downstream bandwidth.

Dynamic connection admission control to enforce service level agreements in multicast networks

In accordance with embodiments of the present disclosure, a method is provided for communicating multicast traffic. The method may include in response to receipt of multicast control traffic at a network element to be communicated to a protection switching group, communicating the multicast control traffic to each of a working path and a protection path of the protection switching group. The method may also include in response to receipt of multicast control traffic via either of the working path and the protection path, processing the multicast control traffic as if the multicast control traffic was received via both the working path and the protection path.

Method and system for communicating multicast traffic over protected paths

A switch includes a processor coupled to a memory, one or more forwarding tables residing within the memory, and one or more ports. The ports are associated with a plurality of virtual local area networks and a plurality of bridge domains. Each of the bridge domains is associated with one of the forwarding tables, and each of the forwarding tables is associated with one of the bridge domains. The processor is configured to assign a first tag to a received packet, assign a second tag to the received packet, look up the destination address of the received packet in one of the forwarding tables, and selectively flood the ports of the active bridge domain with a copy of the received packet. The active bridge domain includes one of the plurality of bridge domains. The active bridge domain is associated with the ingress port of the received packet.

Hierarchical isolated learning and flooding for metro ethernet bridging domains

A method may include, by a first network interface: receiving a packet having a flow via a first port of the first network interface; examining the packet to determine an ingress local forwarding identifier (LFID) associated with the flow of the packet; converting the ingress LFID to a global forwarding identifier (GFID) of the network element; and forwarding the packet to a switching element. The method may also include, by the switching element: determining a second network interface for egress of the packet based on the GFID; and forwarding the packet to the second network interface. The method may further include, by the second network interface: converting the GFID to an egress LFID associated with the flow of the packet; and forwarding the packet to a second port of the second network interface and a flow of the second network interface based on the egress LFID.

Systems and methods for minimizing the number of forwarding identifiers in a network element with distributed architecture

A network processing unit includes a first table, a forwarding table, and a processor. The first table includes a first entry for a network, including a network aging, which includes the network processing unit. The forwarding table includes a second entry associated with a network entity which includes an indication of whether network traffic associated with the entity has been encountered in the current or previous network aging period. The processor is configured to receive an indication from a hardware timer that a hardware aging cycle has ended, and then determine whether the network aging period has ended. If so, the processor is configured to determine for a first network entity in the forwarding table whether traffic associated with the entity has been encountered in the current or previous network aging period. If not, then the processor is configured to remove the given first network entity from the forwarding table.

Software-assisted VLAN aging timer scheme for distributed switching systems

In accordance with embodiments of the present disclosure, a switch may include a processor and a plurality of line cards, each line card including a table of addresses. The processor may be configured to: (i) read, from a first line card of the plurality of line cards, addresses relating to all flooding domains present on the first line card; (ii) store the addresses read from the first line card on a memory accessible to the processor; (iii) determine a second line card of the plurality of line cards, the second line card having the presence of at least one flooding domain not present on the first line card; (iv) read, from the second line card, addresses relating to all flooding domains present on the second line card; and (v) store the addresses read from the second line card on the memory.

MAC address table collection in distributed switching systems

A method for reducing memory entries in a ternary content-addressable memory may include determining if a first entry and a second entry are associated with the same data value. The method may also include determining if the first entry can be masked such that searching the memory with the content value of either of the first entry or the second entry returns the same data value. The method may further include, in response to determining that the first entry and a second entry are associated with the same data value and determining that the first entry can be masked such that addressing the memory with the content value of either of the first entry or the second entry returns the same data value: (i) masking the first entry such that addressing the memory with the content value of either of the first entry or the second entry returns the same data value; and (ii) deleting the second entry.

Method and system for reducing entries in a content-addressable memory

In one embodiment, a method for telecommunications includes steps of receiving a first packet through a first port, and determining whether the first packet arrived over a protected path. If the first packet arrived over a protected path, the method also includes the steps of hashing a source address of the first packet, adding a first entry into a forwarding table, and adding a second entry into the forwarding table. The protected path is coupled to at least the first port and a second port. The first entry includes the result of hashing the packet, and an identification of the first port. The second entry includes the result of hashing the packet, and an identification of the second port.

Growing community of inventors

Plano, TX, United States of America

Bijendra Singh