International Business Machines Corporation

Cisco Technology, Inc.

Avaya Inc.

Meenakshi R Kaushik

Chandramouli Radhakrishnan

Daljeet Singh

Yi Yang

Venkatesan Selvaraj

Sanjay Agrawal

David Iles

Ruchir Gupta

Syed Basheeruddin Ahmed

David M Bond

Francois Audet

Samir Srivastava

Systems, methods, and non-transitory computer-readable storage media for visualizing current and historical access policy of a group based policy. A first group based policy and a second group based policy are received at a computing device, where each group based policy includes policy rules defining a range of destination internet protocol addresses, a range of source internet protocol addresses and a range of access ports. The computing device renders a three dimensional representation of the first group based policy, based on the policy rules of the first group based policy. The computing device renders a three dimensional representation of the second group based policy, based on the policy rules of the second group based policy. The computing device displays the representations of the first group based policy and second group based policy on a graphical interface.

Approach to visualize current and historical access policy of a group based policy

A method includes determining, by a congestion point (CP) unit, traffic flow congestion in an Open Flow environment network. The CP unit comprises an Open Flow switch including a device including logic where an action is associated with each flow entry in the device. A congestion point (CP) unit sends a first congestion notification message (CNM) directly to at least one controller and sends a second CNM directly to at least one reaction point (RP) unit. The CP unit communicates with the at least one controller through a secure channel via Open Flow protocol.

Quantized congestion notification for computing environments

Contact information in SIP signaling messages is modified at each in-path network device during the signaling process (along with storage of mapping information) to allow the in-path network devices (and proxy server) to identify the next (or previous) hop device in the path, and thus, maintain the path taken by signaling messages early on during the signaling process. Subsequent request and response signaling messages transmitted during the session follow this path, which ensures that the in-path network devices remain in the SIP signaling path.

Method and apparatus for modifying address information in signaling messages to ensure in-path devices remain in signaling path between endpoints

Embodiments of the invention relate to providing quantized congestion notification (QCN) in networks. One embodiment includes a method that includes determining a traffic flow congestion by a particular congestion point (CP) unit of multiple CP units that communicate with at least one end unit, at least one reaction point (RP) unit and at least one controller in a network. A first congestion notification message (CNM) and a second CNM are generated by the particular CP unit. The particular CP unit sends the first CNM directly to the controller and the second CNM directly to the RP unit. Traffic flow is managed among the multiple CP units by the controller based on the first CNM.

A method for maintaining a bridging network communication path table is presented and includes determining a failed communication link between a first bridge computer and a second bridge computer in the bridging network; identifying, in the communication path table, a first path that includes the failed communication link; and indicating that the first path is not active.

Computing forwarding tables for link failures

In one embodiment, a method for providing virtual link aggregation (vLAG) in a transparent interconnection of lots of links (TRILL)-enabled network, includes creating a virtual routing bridge logically connected to a first physical routing bridge and a second physical routing bridge to form a vLAG group at an edge of the TRILL-enabled network; determining a first distribution tree linking the first physical routing bridge to every other routing bridge in the TRILL-enabled network in a non-repeating fashion, ending with the second physical routing bridge; determining a second distribution tree linking the second physical routing bridge to every other routing bridge in the TRILL-enabled network in a non-repeating fashion, ending with the first physical routing bridge; receiving a multicast packet at the virtual routing bridge from one of the physical routing bridges; and distributing the multicast packet according to either the first or the second distribution tree thereby preventing looping.

Virtual link aggregation extension (vLAG+) enabled in a trill-based fabric network

In one embodiment, a system includes a TRILL-enabled network that includes a first physical routing bridge (RB) and a second physical RB, logic adapted for creating a virtual RB logically connected to the first and second physical RBs to form a vLAG group at an edge of the network, logic adapted for determining a first distribution tree linking the first physical RB to every other RB in the network in a non-repeating fashion, ending with the second physical RB, and logic adapted for determining a second distribution tree linking the second physical RB to every other RB in the network in a non-repeating fashion, ending with the first physical RB, wherein when a multicast packet is received by the virtual RB from one of the physical RBs, the multicast packet is distributed according to either the first or the second distribution tree thereby preventing looping.

Virtual link aggregation extension (VLAG+) enabled in a TRILL-based fabric network

A shortest path first (SPF) computation in a distributed network may be performed efficiently by performing the SPF computation in stages. Rather than perform a new SPF computation every time a change occurs affecting a link state within the distributed network, a routing protocol may identify the change and determine if the impact to the link state necessarily needs the new SPF computation. For example, a predetermined list of events may identify changes that may not necessarily impact the SPF value(s) currently associated with the distributed network. Embodiments disclosed may avoid computation of the new SPF for changes to the link state thus managing network system resources more efficiently.

Growing community of inventors

Sunnyvale, CA, United States of America

Meenakshi R Kaushik