Abstract: The methods and devices discussed herein provide service clustering within a TRILL network without relying on an additional service insertion framework. A TRILL network can include one or more flow distribution RBridges for distributing flows to service nodes. Each flow distribution RBridge can have a virtual base identifier and one or more virtual cluster identifiers. An example method can include maintaining service cluster load balancing structures and receiving a packet that is encapsulated with an inner header and an outer header. The method can include determining whether the egress RBridge identifier is a virtual cluster identifier, and if so, selecting a service node from one of the service cluster load balancing structures. The method can include forwarding the packet to the selected service node.

Abstract: A system, computer-readable media, and methods for network resource sharing of routing and forwarding information are disclosed. The method may include receiving a first address for a device connected to a network and receiving one or more second addresses for the device. The method may also include identifying a first switch through which the device connects to the network and identifying a second switch for storing the first address and the one or more second addresses. Further, the method may include storing the first address in the first switch and storing the first address and the one or more second addresses in the second switch.

Abstract: A method, system, and computer readable medium is disclosed which utilizes the LISP control plane to increase communications and access to enterprise resources in a network with multiple subnetworks, such as a university setting. As a result, the various embodiments of the present invention provide a routing and services dimension to enterprise discovery protocol traffic, such as Apple Bonjour traffic. A LISP instance ID, which is carried in the LISP header, is used to associate one or more end user devices with specific enterprise resources in a particular subnetwork or a service domain, wherein these resources may be accessed by the end user device even if the end user device migrates to another subnetwork. Another embodiment of the invention limits routing services advertisements from enterprise services to a subset of end user devices associated with particular user EIDs by using L2-LISP multicast techniques.

Abstract: Accelerating network convergence may be provided. Consistent with embodiments of the disclosure, a mapping server may be configured to map an interconnection of various network elements comprising at least the following: a wireless host, at least two access switches, a plurality of distribution switches, a core switch, a mobility controller, and a mapping database. The mapping server may then receive an indication from the mobility controller that the wireless host has roamed from a first access switch to a second access switch. In response to the indication, the mapping server may remap the interconnection of network elements in the mapping database to update network routing information associated with the wireless host.

Abstract: A system, computer-readable media, and methods for network resource sharing of routing and forwarding information are disclosed. The method may include receiving a first address for a device connected to a network and receiving one or more second addresses for the device. The method may also include identifying a first switch through which the device connects to the network and identifying a second switch for storing the first address and the one or more second addresses. Further, the method may include storing the first address in the first switch and storing the first address and the one or more second addresses in the second switch.

Abstract: A method, system, and computer readable medium is disclosed which utilizes the LISP control plane to increase communications and access to enterprise resources in a network with multiple subnetworks, such as a university setting. As a result, the various embodiments of the present invention provide a routing and services dimension to enterprise discovery protocol traffic, such as Apple Bonjour traffic. A LISP instance ID, which is carried in the LISP header, is used to associate one or more end user devices with specific enterprise resources in a particular subnetwork or a service domain, wherein these resources may be accessed by the end user device even if the end user device migrates to another subnetwork. Another embodiment of the invention limits routing services advertisements from enterprise services to a subset of end user devices associated with particular user EIDs by using L2-LISP multicast techniques.

Abstract: A method, system, and computer readable medium is disclosed which utilizes the LISP control plane to increase communications and access to enterprise resources in a network with multiple subnetworks, such as a university setting. As a result, the various embodiments of the present invention provide a routing and services dimension to enterprise discovery protocol traffic, such as Apple Bonjour traffic. A LISP instance ID, which is carried in the LISP header, is used to associate one or more end user devices with specific enterprise resources in a particular subnetwork or a service domain, wherein these resources may be accessed by the end user device even if the end user device migrates to another subnetwork. Another embodiment of the invention limits routing services advertisements from enterprise services to a subset of end user devices associated with particular user EIDs by using L2-LISP multicast techniques.

Abstract: A system, computer-readable media, and methods for network resource sharing of routing and forwarding information are disclosed. The method may include receiving a first address for a device connected to a network and receiving one or more second addresses for the device. The method may also include identifying a first switch through which the device connects to the network and identifying a second switch for storing the first address and the one or more second addresses. Further, the method may include storing the first address in the first switch and storing the first address and the one or more second addresses in the second switch.

Abstract: The methods and devices discussed herein provide service clustering within a TRILL network without relying on an additional service insertion framework. A TRILL network can include one or more flow distribution RBridges for distributing flows to service nodes. Each flow distribution RBridge can have a virtual base identifier and one or more virtual cluster identifiers. An example method can include maintaining service cluster load balancing structures and receiving a packet that is encapsulated with an inner header and an outer header. The method can include determining whether the egress RBridge identifier is a virtual cluster identifier, and if so, selecting a service node from one of the service cluster load balancing structures. The method can include forwarding the packet to the selected service node.

Abstract: The methods and devices discussed herein provide service clustering within a TRILL network without relying on an additional service insertion framework. A TRILL network can include one or more flow distribution RBridges for distributing flows to service nodes. Each flow distribution RBridge can have a virtual base identifier and one or more virtual cluster identifiers. An example method can include maintaining N service cluster load balancing structures and receiving a packet that is encapsulated with an inner header (source/destination addresses) and an outer header (ingress/egress RBridge identifiers). The method can include determining whether the egress RBridge identifier is a virtual cluster identifier, and if so, applying a hash function to a predetermined flow tuple and selecting a service node associated with the hash value from one of the N service cluster load balancing structures. The method can include forwarding the packet to the selected service node.

Abstract: A method, system, and computer readable medium is disclosed which utilizes the LISP control plane to increase communications and access to enterprise resources in a network with multiple subnetworks, such as a university setting. As a result, the various embodiments of the present invention provide a routing and services dimension to enterprise discovery protocol traffic, such as Apple Bonjour traffic. A LISP instance ID, which is carried in the LISP header, is used to associate one or more end user devices with specific enterprise resources in a particular subnetwork or a service domain, wherein these resources may be accessed by the end user device even if the end user device migrates to another subnetwork. Another embodiment of the invention limits routing services advertisements from enterprise services to a subset of end user devices associated with particular user EIDs by using L2-LISP multicast techniques.

Abstract: Accelerating network convergence may be provided. Consistent with embodiments of the disclosure, a mapping server may be configured to map an interconnection of various network elements comprising at least the following: a wireless host, at least two access switches, a plurality of distribution switches, a core switch, a mobility controller, and a mapping database. The mapping server may then receive an indication from the mobility controller that the wireless host has roamed from a first access switch to a second access switch. In response to the indication, the mapping server may remap the interconnection of network elements in the mapping database to update network routing information associated with the wireless host.

Abstract: The methods and devices discussed herein provide service clustering within a TRILL network without relying on an additional service insertion framework. A TRILL network can include one or more flow distribution RBridges for distributing flows to service nodes. Each flow distribution RBridge can have a virtual base identifier and one or more virtual cluster identifiers. An example method can include maintaining N service cluster load balancing structures and receiving a packet that is encapsulated with an inner header (source/destination addresses) and an outer header (ingress/egress RBridge identifiers). The method can include determining whether the egress RBridge identifier is a virtual cluster identifier, and if so, applying a hash function to a predetermined flow tuple and selecting a service node associated with the hash value from one of the N service cluster load balancing structures. The method can include forwarding the packet to the selected service node.

Abstract: A circuit can include address evaluation circuitry coupled to an address bus of a memory and configured to generate a first control signal responsive to determining that an address on the address bus has not changed for a current clock cycle from a previous clock cycle. The circuit can include write enable evaluation circuitry coupled to the memory and configured to generate a second control signal responsive to determining that a write enable signal of the memory is de-asserted for the current clock cycle and for the previous clock cycle. The circuit can include clock enable circuitry coupled to a clock enable port of the memory and configured to generate a clock enable signal to the clock enable port of the memory responsive to the first control signal and the second control signal.

Abstract: A memory structure can include a first memory block including a plurality of memory cells corresponding to a first subset of addresses of a range of addresses and a second memory block including a plurality of memory cells corresponding to a second subset of addresses of the range of addresses. The memory structure can include control circuitry coupled to the first memory block and the second memory block and configured to provide control signals to the first memory block and the second memory block. The first memory block and the second memory block can be configured to implement a reduced power mode independently of one another responsive to the control signals.

Abstract: One embodiment of a method for verifying functional equivalency between a design of an integrated circuit and a corresponding clock-gated design utilizing output-based clock gating includes selecting a first one of a first plurality of internal state elements in the design and a corresponding first one of a second plurality of internal state elements in the clock-gated design, wherein an input to the first one of the first plurality of internal state elements serves as a first comparison point and an input to the corresponding first one of the second plurality of internal state elements serves as a second comparison point, and the design is to be compared against the clock-gated design at the first comparison point and the second comparison point and generating a test bench that identifies the first comparison point and the second comparison point as a set of comparison points.

Abstract: In one embodiment, a method is provided for generating clock gating circuitry for a circuit design model. A Boolean expression of path sensitization is determined for each gate element in the netlist of a circuit design. For each gate element, a conjunction of the Boolean expression of the path sensitization and a Boolean expression of a disjunction of the observability conditions of one or more subsequent gates is determined to produce an intermediate Boolean expression. Intermediate Boolean expressions are backward retimed to produce the respective Boolean expression of the observability conditions of the each gate element. Clock gating circuits that implement the respective Boolean expression of the observability conditions of one or more of the plurality of interconnected gate elements are generated and incorporated into the circuit design model.

Abstract: Embodiments of the present invention provide methods and systems for verifying functional equivalence of a power optimized design and its original, unoptimized design (referred to as the golden design) using combinational equivalency checking. Due to some inherent limitations which make combinational equivalency checkers unable to prove equivalency of the two designs in a single step, a series of intermediate design transformations is introduced. These transformations are dependent on the techniques used in generating the power optimized design from the golden design, and may be generically described in a transformation language that provides the necessary constructs to specify an entire set of valid structural modifications.

Abstract: One aspect of the invention relates to a device including a first storage element and a first clock gating element, wherein a data input of the first storage element is coupled to an output of a combinatorial logic (CL) element, wherein the first storage element is clock-gated with the first clock gating element using a first clock enable signal to generate a clock signal for the first storage element, wherein the first clock enable signal is generated to suppress the clock signal in the first clock gating element when each of the at least one data input of the CL element is in a second quiescence inducing condition with respect to the clock signal at the same time as when each of the at least one control input of the CL element is in the first quiescence inducing condition.

Abstract: A packet transmit queue control system including a first data structure, a second data structure, a packet controller, and a port transmit controller is disclosed. The first data structure can include a plurality of linked-list data structures and can store unicast type packet pointers. The second data structure can include a plurality of first-in first-out (FIFO) structures and can store multicast type packet pointers. The packet controller can receive a first sequence of unicast and/or multicast type packets. The port transmit controller can provide a second sequence of the unicast and/or multicast type packets. Further, each of the plurality of FIFO structures can correspond to an output port of the system.