Patent application number | Description | Published |
20100061269 | Differentiated services for unicast and multicast frames in layer 2 topologies - In one embodiment, a method includes receiving information on layer 2 topologies at a network device in a core network, mapping one or more Virtual Local Area Networks (VLANs) to the layer 2 topologies to provide differentiated services in said layer 2 topologies, defining multiple paths for each of the layer 2 topologies, and forwarding a packet received at the network device on one of the multiple paths. An apparatus for providing differentiated services in layer 2 topologies is also disclosed. | 03-11-2010 |
20110038257 | METHOD AND APPARATUS FOR SEQUENCING OPERATIONS FOR AN INCOMING INTERFACE CHECK IN DATA CENTER ETHERNET - In one embodiment, a method includes obtaining an indication that a state associated with a node is to be changed and preventing data from being received on a first link. The method also includes updating at least one selected from a group including an incoming interface check (IIC) table and an outgoing interface (OIF) table to reflect the state. The state indicates that a second link is to be activated. Finally, the method includes allowing the data to be received on the second link after updating either or both the IIC table and the OIF table and after the timer duration for the NULL value for IIC has expired. | 02-17-2011 |
20120213117 | SYSTEM AND METHOD FOR INTELLIGENTLY MAINTAINING CONNECTIVITY IN A NETWORK ENVIRONMENT - A method is provided in one example embodiment and includes establishing a communication pathway between a first network node and a second network node coupled to a network; forming an adjacency to a new network node coupled to the network, where a designated intermediate system (DIS) election operation is executed after the adjacency is formed in order to determine that the new network node is a newly identified DIS for the network; and communicating a message advertising connectivity to both a previously identified DIS and the newly identified DIS, where the message is communicated during a specified time interval. | 08-23-2012 |
20120275347 | DIFFERENTIATED SERVICES FOR UNICAST AND MULTICAST FRAMES IN LAYER 2 TOPOLOGIES - In one embodiment, a method includes receiving information on layer 2 topologies at a network device in a core network, mapping one or more Virtual Local Area Networks (VLANs) to the layer 2 topologies to provide differentiated services in said layer 2 topologies, defining multiple paths for each of the layer 2 topologies, and forwarding a packet received at the network device on one of the multiple paths. An apparatus and logic for providing differentiated services in layer 2 topologies is also disclosed. | 11-01-2012 |
20130294221 | Optimization for Trill LAN Hellos - Systems and methods may be provided embodying an optimized Trill LAN network hello mode. The optimized hello mode may allow the number of LAN hellos exchanged to be reduced significantly in a steady state mode of operation. No modifications to the current Trill specification are needed and in a converged state (when designated RBridge election and appointed forwarder appointments are complete), only 1 hello PDU per RBridge is originated in every hello interval. | 11-07-2013 |
20130329727 | SYSTEM AND METHOD FOR LAYER-2 MULTICAST MULTIPATHING - An example method is provided and includes a multicast data message from a data source, the message in a first virtual local area network and being associated with a multicast group. The method also includes calculating a hash value based on the virtual local area network, the data source, and the multicast group, determining a port for a designated router in a Layer-2 network based on the hash value, and switching the multicast data message to the port that was determined. | 12-12-2013 |
20140003228 | Optimizations in Multi-Destination Tree Calculations for Layer 2 Link State Protocols | 01-02-2014 |
20140086041 | SYSTEM AND METHOD FOR PROVIDING N-WAY LINK-STATE ROUTING REDUNDANCY WITHOUT PEER LINKS IN A NETWORK ENVIRONMENT - A method is provided in one example and includes broadcasting a switching node identifier associated with a first link-state protocol enabled switching node to a plurality of link-state protocol enabled switching nodes. The plurality of link-state protocol enabled switching nodes are in communication with one another by a link-state protocol cloud. The method further includes broadcasting a priority associated with the first link-state protocol enabled switching node to the plurality of link-state protocol enabled switching nodes. The method further includes broadcasting connectivity information of the first link-state protocol enabled switching node to the plurality of link-state protocol enabled switching nodes using the link-state protocol cloud. The connectivity information includes connectivity of the first link-state protocol enabled switching node with at least one spanning tree protocol enabled switching node. | 03-27-2014 |
20140086043 | System and Method for Maintaining Connectivity in a Single-Hop Network Environment - A method is provided in one example embodiment and includes receiving a first pseudo-node identifier associated with a first network node via a network. The first pseudo-node identifier is generated by the first network node in a first designated intermediate system (DIS) operation. The method further includes detecting a loss of connectivity to the first network node, and receiving a second pseudo-node identifier associated with a second network node via the network. The second pseudo-node identifier is generated by the second network node in a second DIS operation. The method further includes executing a first network path determination operation using the first pseudo-node identifier and the second pseudo-node identifier when an elapsed time between the detecting of the loss of connectivity with the first network node and the executing of the first network path determination operation is within a predetermined threshold. | 03-27-2014 |
20140269330 | OPTIMAL TREE ROOT SELECTION FOR TREES SPANNING MULTIPLE SITES - Embodiments provide a method, network device, and computer program product for optimizing traffic in a link-state network distributed across a plurality of sites. The method, network device, and computer program product include receiving a multi-destination message at a first node within the link-state network. Additionally, the method, network device, and computer program product include identifying a plurality of multi-destination trees within the network, each tree having a respective root node. The method, network device, and computer program product determine a plurality of cost values corresponding to each of the plurality of multi-destination trees, based on one or more links along a shortest path from the first node to the respective root node of each tree. Based on the determined cost values, the method, network device, and computer program product select one or more of the multi-destination trees and transmit the multi-destination message using the selected tree. | 09-18-2014 |
20140269410 | Efficient Flooding of Link State Packets for Layer 2 Link State Protocols - Techniques are provided for generating and updating flooding tree paths in a network. At a particular node device in a network, a first flooding tree is generated by performing a first shortest path first (SPF) operation from a first selected node device in the network to a plurality of other node devices in the network. A second flooding tree is generated by performing a second SPF operation from a second selected node device in the network to the plurality of other node devices in the network. A network topology change event is detected in either the first or second flooding tree, and a packet sequence exchange is initiated between the particular node device and another node device in the network in response to the detected network topology change. The first and second flooding trees are then updated based on information obtained during the packet sequence exchange. | 09-18-2014 |
20150124633 | METHOD FOR INCREASING LAYER-3 LONGEST PREFIX MATCH SCALE - Various embodiments are disclosed for increasing Layer-3 LPM (longest prefix match) routing database in a network platform. In some embodiments, chipsets in fabric modules (FMs) can be partitioned into multiple banks. Network traffic can be directed towards a corresponding bank in the FMs by using a LPM table on a line card (LC). Entries in the LPM table on the LC can be programmed either statically or dynamically based upon LPM routes that are dynamically learned. | 05-07-2015 |
20150124684 | INCREASING MULTICAST SCALE VIA LOCALIZATION OF INDICIES - A plurality of line cards with each line card having a respective network forwarding engine and a respective outgoing interface (OIF) list and at least one fabric module communicatively coupled with each line card with each fabric module can have a respective network forwarding engine. The local OIF list can be asymmetrically programmed. The network forwarding engine of a line card can be configured to receive a multicast packet, compare a multicast address associate with the received multicast packet with entries in the local OIF list of the line card and forward the received multicast packet to at least one interface associated with the multicast address in response to the comparison resulting in a match. | 05-07-2015 |
20150124806 | HIERARCHICAL ROUTING WITH TABLE MANAGEMENT ACROSS HARDWARE MODULES - Systems, methods, and non-transitory computer-readable storage media for performing hierarchical routing are disclosed. The method includes identifying routes in a computer network and arranging those routes in two separate routing tables. The first routing table is stored on a first module and the second routing table is stored on a second module. | 05-07-2015 |
20150295862 | HIERARCHICAL PROGRAMMING OF DUAL-STACK SWITCHES IN A NETWORK ENVIRONMENT - An example method for hierarchical programming of dual-stack switches in a network environment is provided and includes receiving packets from the network at a line card in the modular switch, a first portion of the packets being destined to Internet Protocol version 6 (IPv6) destination IP (DIP) addresses and a second portion of the packets being destined to IPv4 DIP addresses, and performing hierarchical lookups of the IPv6 DIP addresses and the IPv4 DIP addresses. Layer 3 (L3) lookups for the IPv6 DIP addresses are performed at the line card, and L3 lookups for IPv4 DIP addresses are performed at a fabric module in the modular switch. The line card and the fabric module are interconnected inside a chassis of the modular switch. In specific embodiments, the method further comprises inspecting the packets' destination Media Access Control (DMAC) addresses comprising router MAC addresses indicative of IPv6 or IPv4 address families. | 10-15-2015 |
20160065449 | Bandwidth-Weighted Equal Cost Multi-Path Routing - A plurality of equal cost paths through a network from a source node to a destination node are determined. A maximum bandwidth capacity for each link of each of the plurality of equal cost paths is determined, and a smallest capacity link for each of the plurality of equal cost paths is determined from the maximum capacity bandwidths for each link. An aggregated maximum bandwidth from the source node to the destination node is determined by aggregating the smallest capacity links for each of the plurality of equal cost paths. Traffic is sent from the source node along each of the plurality of equal cost paths according to a value of a capacity for the smallest capacity link for each of the plurality of equal cost paths, wherein a total of the sent traffic does not exceed the aggregated maximum bandwidth. | 03-03-2016 |
Patent application number | Description | Published |
20100210029 | DEVICE AND METHODS OF DETECTION OF AIRBORNE AGENTS - Provided are methods, devices and systems that utilize free-surface fluidics and SERS for analyte detection with high sensitivity and specificity. The molecules can be airborne agents, including but not limited to explosives, narcotics, hazardous chemicals, or other chemical species. The free-surface fluidic architecture is created using an open microchannel, and exhibits a large surface to volume ratio. The free-surface fluidic interface can filter interferent molecules, while concentrating airborne analyte molecules. The microchannel flow enables controlled aggregation of SERS-active probe particles in the flow, thereby enhancing the detector's sensitivity. | 08-19-2010 |
20120148451 | DEVICE AND METHODS OF DETECTION OF AIRBORNE AGENTS - Provided are methods, devices and systems that utilize free-surface fluidics and SERS for analyte detection with high sensitivity and specificity. The molecules can be airborne agents, including but not limited to explosives, narcotics, hazardous chemicals, or other chemical species. The free-surface fluidic architecture is created using an open microchannel, and exhibits a large surface to volume ratio. The free-surface fluidic interface can filter interferent molecules, while concentrating airborne analyte molecules. The microchannel flow enables controlled aggregation of SERS-active probe particles in the flow, thereby enhancing the detector's sensitivity. | 06-14-2012 |
20130121884 | DEVICE AND METHODS OF DETECTION OF AIRBORNE AGENTS - Provided are methods, devices and systems that utilize free-surface fluidics and SERS for analyte detection with high sensitivity and specificity. The molecules can be airborne agents, including but not limited to explosives, narcotics, hazardous chemicals, or other chemical species. The free-surface fluidic architecture is created using an open microchannel, and exhibits a large surface to volume ratio. The free-surface fluidic interface can filter interferent molecules, while concentrating airborne analyte molecules. The microchannel flow enables controlled aggregation of SERS-active probe particles in the flow, thereby enhancing the detector's sensitivity. | 05-16-2013 |
20160033415 | DEVICE AND METHODS OF DETECTION OF AIRBORNE AGENTS - Provided are methods, devices and systems that utilize free-surface fluidics and SERS for analyte detection with high sensitivity and specificity. The molecules can be airborne agents, including but not limited to explosives, narcotics, hazardous chemicals, or other chemical species. The free-surface fluidic architecture is created using an open microchannel, and exhibits a large surface to volume ratio. The free-surface fluidic interface can filter interferent molecules, while concentrating airborne analyte molecules. The microchannel flow enables controlled aggregation of SERS-active probe particles in the flow, thereby enhancing the detector's sensitivity. | 02-04-2016 |
Patent application number | Description | Published |
20080222580 | SYSTEM AND METHOD FOR MANAGING THE DESIGN AND CONFIGURATION OF AN
INTEGRATED CIRCUIT SEMICONDUCTOR DESIGN - A system and methods that facilitate the design process and minimize the time and effort required to complete the design and fabrication of an integrated circuits (IC) are described. The system and method utilize a plurality of repositories, rules engines and design and verification tools to analyze the workload and automatically produce a hardened GDSII description or other representation of the device. The system and method securely maintains synthesizable RTL on a server in a data center while providing designers access to portions of the mechanism by way of a network portal. | 09-11-2008 |
20080222581 | Remote Interface for Managing the Design and Configuration of an Integrated Circuit Semiconductor Design - A software system for facilitating the design process and minimizing the time and effort required to complete the design and fabrication of an integrated circuits (IC) is described. The software system utilizes a data center having a plurality of repositories, rules engines and design and verification tools to automatically produce a hardened GDSII description or other representation of the device in response to the formation of a electronic license agreement. Designers select contractual terms for incorporating third party intellectual property and then design and initiate manufacture of the IC by way of a network portal. | 09-11-2008 |
20080222589 | Protecting Trade Secrets During the Design and Configuration of an Integrated Circuit Semiconductor Design - A system and method for facilitating the design process of an integrated circuits (IC) is described. The system and method utilizes a plurality of repositories, rules engines and design and verification tools to analyze the workload and automatically produce a hardened GDSII description or other representation of the IC. Synthesizable RTL is securely maintained on a server in a data center while providing designers graphical access to customizable IP block by way of a network portal. | 09-11-2008 |
20090080651 | SEMICONDUCTOR WITH HARDWARE LOCKED INTELLECTUAL PROPERTY AND RELATED METHODS - A computer readable medium includes executable instructions to describe an intellectual property core with a key check mechanism configured to compare an external key with an internal key in response to a specified event. A pending instruction is executed in response to a match between the external key and the internal key. An unexpected act is performed in response to a mismatch between the external key and the internal key. | 03-26-2009 |
20090113180 | Fetch Director Employing Barrel-Incrementer-Based Round-Robin Apparatus For Use In Multithreading Microprocessor - A fetch director in a multithreaded microprocessor that concurrently executes instructions of N threads is disclosed. The N threads request to fetch instructions from an instruction cache. In a given selection cycle, some of the threads may not be requesting to fetch instructions. The fetch director includes a circuit for selecting one of threads in a round-robin fashion to provide its fetch address to the instruction cache. The circuit 1-bit left rotatively increments a first addend by a second addend to generate a sum that is ANDed with the inverse of the first addend to generate a 1-hot vector indicating which of the threads is selected next. The first addend is an N-bit vector where each bit is false if the corresponding thread is requesting to fetch instructions from the instruction cache. The second addend is a 1-hot vector indicating the last selected thread. In one embodiment threads with an empty instruction buffer are selected at highest priority; a last dispatched but not fetched thread at middle priority; all other threads at lowest priority. The threads are selected round-robin within the highest and lowest priorities. | 04-30-2009 |
20090113365 | Automated digital circuit design tool that reduces or eliminates adverse timing constraints due to an inherent clock signal skew, and applications thereof - The present invention provides an automated digital circuit design tool that reduces or eliminates adverse timing constraints due to an inherent clock signal skew, and applications thereof. In an embodiment, an automated design tool according to the invention generates a clocking system that includes a clock signal generator, control logic, enable logic, and at least one clock gater. The clock signal generator generates a clock signal that is distributed to various logic blocks of the digital circuit using a buffered clock tree. The enable logic receives input values from the control logic and provides a control signal to the clock gater. When enabled, the clock gater allows a clock signal to pass through to multiple registers. An early clock signal is provided to register(s) in the control logic, which allows for an increased clock frequency while still meeting timing constraints. | 04-30-2009 |
20090327649 | Three-Tiered Translation Lookaside Buffer Hierarchy in a Multithreading Microprocessor - A three-tiered TLB architecture in a multithreading processor that concurrently executes multiple instruction threads is provided. A macro-TLB caches address translation information for memory pages for all the threads. A micro-TLB caches the translation information for a subset of the memory pages cached in the macro-TLB. A respective nano-TLB for each of the threads caches translation information only for the respective thread. The nano-TLBs also include replacement information to indicate which entries in the nano-TLB/micro-TLB hold recently used translation information for the respective thread. Based on the replacement information, recently used information is copied to the nano-TLB if evicted from the micro-TLB. | 12-31-2009 |
20110138349 | Automated Digital Circuit Design Tool That Reduces or Eliminates Adverse Timing Constraints Due To An Inherent Clock Signal Skew, and Applications Thereof - The present invention provides an automated digital circuit design tool that reduces or eliminates adverse timing constraints due to an inherent clock signal skew, and applications thereof In an embodiment, an automated design tool according to the invention generates a clocking system that includes a clock signal generator, control logic, enable logic, and at least one clock gater. The clock signal generator generates a clock signal that is distributed to various logic blocks of the digital circuit using a buffered clock tree. The enable logic receives input values from the control logic and provides a control signal to the clock gater. When enabled, the clock gater allows a clock signal to pass through to multiple registers. An early clock signal is provided to register(s) in the control logic, which allows for an increased clock frequency while still meeting timing constraints. | 06-09-2011 |
20120221838 | SOFTWARE PROGRAMMABLE HARDWARE STATE MACHINES - The present invention provides software programmable hardware state machines to detect a cause of an error in a processor and prevent the error from occurring. A processor core is provided that includes an execution unit, a programmable mask register and a buffer that stores values representing instructions dispatched to the execution unit. The processor core also includes control logic to determine whether there is a match between a sequence in the mask register and a sequence in the buffer and, upon detecting a match, to generate control signals to perform a desired action. The desired action prevents an unwanted change from occurring to the architectural state of the processor. The processor core further comprises a programmable fix register. In an embodiment, the control logic generates the control signals based on control bits stored in the fix register. | 08-30-2012 |
20150154677 | COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS - A software system for facilitating the design process and minimizing the time and effort required to complete the design and fabrication of an integrated circuits (IC) is described. The software system utilizes a data center having a plurality of repositories, rules engines and design and verification tools to automatically produce a hardened GDSII description or other representation of the device in response to the formation of a electronic license agreement. Designers select contractual terms for incorporating third party intellectual property and then design and initiate manufacture of the IC by way of a network portal. | 06-04-2015 |
Patent application number | Description | Published |
20090092141 | SWITCH WITH VIRTUAL NETWORK IDENTIFIER RE-WRITE CAPABILITY - A switch includes a processor, an ingress port having ingress port logic, and an egress port. It may also include a virtual network identifier rewrite component for rewriting a virtual network identifier in a data frame received the ingress port with a new virtual network identifier. Also included is a virtual network identifier rewrite rule set, where a rule may have one or more of the following: a received virtual network identifier, a source Fibre Channel identifier (FCID) address, an ingress port identifier, and a new virtual network identifier. The ingress port logic may insert a received virtual network identifier into the data frame received at the ingress port, where the virtual network identifier may correspond to the ingress port. The virtual network identifier rewrite component may assign the new virtual network identifier to the data frame according to a specific virtual network identifier rewrite rule. | 04-09-2009 |
20090141657 | FIBRE CHANNEL SWITCH THAT ENABLES END DEVICES IN DIFFERENT FABRICS TO COMMUNICATE WITH ONE ANOTHER WHILE RETAINING THEIR UNIQUE FIBRE CHANNEL DOMAIN_IDs - A Fibre Channel Switch which enables end devices in different Fabrics to communicate with one another while retaining their unique Fibre Channel Domain_IDs. The Switch is coupled to a first fabric having a first set of end devices and a second fabric having a second set of end devices. The Switch is configured to enable communication by the first set of end devices associated with the first fabric with the second set of end devices associated with the second set of end devices using the unique Domain_IDs of each of the first set and the second set of end devices. In one embodiment of the invention, the first and second fabrics are first and second Virtual Storage Array Networks (VSANs) respectively. In an alternative embodiment, the first fabric and the second fabric are separate physical fabrics. | 06-04-2009 |
20100074137 | ZONE BASED QUALITY OF SERVICE IN A FIBRE CHANNEL FABRIC - Methods and apparatus are provided for improving the configuration, management, and distribution of quality of service information in a fibre channel fabric using zoning mechanisms. Configuration of Quality of Service (QoS) information is made easy by using zones as a classifier for flows. QoS information is included in zone objects, thereby using the existing zone distribution mechanism to distribute QoS information. Devices not part of any zones are placed automatically in the default zone with a default QoS priority level. QoS information for a particular packet is available as soon as the zoning information is obtained. | 03-25-2010 |
20110022691 | OPTIMIZING FIBRE CHANNEL ZONESET CONFIGURATION AND ACTIVATION - In an example embodiment, a new qualifier is added to members in a Fibre Channel zone to specify whether each member is a target or initiator and in another embodiment a time-range attribute is added to a zone in the zoneset. When the zoneset is applied the number of ACL entries that must be programmed is reduced from k×(k−1) entries to 2(k−1) entries for a zone with k members where k−1 members are of one type (e.g. initiators) and one of the members is of a different type (e.g., a tape device). The time-range attribute is enforced by zone server software and enhances security by, for example, limiting access to sensitive data to specified times. In another embodiment, an incremental zoneset activation protocol is implemented where a hash of a zoneset is created by a switch updating the zoneset and the hash and ID of the switch updating the zoneset are sent to all other switches in the fabric when the zoneset is propagated. The hash and switch ID are stored in persistent storage at all switches in the fabric. When a target zoneset is updated by a source switch only the incremental change is propagated to other switches in the fabric along with the hash and switch ID of the target zoneset. Each switch checks a received hash and switch ID against its stored hash and switch ID to assure that the stored local zoneset is the same as the target zoneset before applying the incremental change. | 01-27-2011 |
20110022693 | HARD ZONING ON NPIV PROXY/NPV DEVICES - Techniques are disclosed for zoning information to be shared with an NPIV proxy device or an NPV device such as a blade switch in a blade chassis. Doing so allows the NPV device to enforce zoning locally for the attached server blades and virtualized systems. The NPV device may learn zoning rules using Fibre Channel name server queries and registered state change notifications. Additionally, the NPV device may snoop name server queries to retrieve zoning information (or state change messages) without using the zoning change protocols and without consuming a Fibre Channel domain from the Fibre Channel fabric. | 01-27-2011 |
20110090816 | FIBRE CHANNEL SWITCH THAT ENABLES END DEVICES IN DIFFERENT FABRICS TO COMMUNICATE WITH ONE ANOTHER WHILE RETAINING THEIR UNIQUE FIBRE CHANNEL DOMAIN_IDs - A Fibre Channel Switch which enables end devices in different Fabrics to communicate with one another while retaining their unique Fibre Channel Domain_IDs. The Switch is coupled to a first fabric having a first set of end devices and a second fabric having a second set of end devices. The Switch is configured to enable communication by the first set of end devices associated with the first fabric with the second set of end devices associated with the second set of end devices using the unique Domain_IDs of each of the first set and the second set of end devices. In one embodiment of the invention, the first and second fabrics are first and second Virtual Storage Array Networks (VSANs) respectively. In an alternative embodiment, the first fabric and the second fabric are separate physical fabrics. | 04-21-2011 |
20110317707 | SWITCH WITH VIRTUAL NETWORK IDENTIFIER RE-WRITE CAPABILITY - A switch includes a processor, an ingress port having ingress port logic, and an egress port. It may also include a virtual network identifier rewrite component for rewriting a virtual network identifier in a data frame received the ingress port with a new virtual network identifier. Also included is a virtual network identifier rewrite rule set, where a rule may have one or more of the following: a received virtual network identifier, a source Fibre Channel identifier (FCID) address, an ingress port identifier, and a new virtual network identifier. The ingress port logic may insert a received virtual network identifier into the data frame received at the ingress port, where the virtual network identifier may correspond to the ingress port. The virtual network identifier rewrite component may assign the new virtual network identifier to the data frame according to a specific virtual network identifier rewrite rule. | 12-29-2011 |
20120014253 | MITIGATING THE EFFECTS OF CONGESTED INTERFACES ON A FABRIC - Techniques are provided for mitigating the effects of slow or no drain devices on a fabric. One or more of the described embodiments can be used alone or in combination to address problems associated with inter-switch link blocking and to address the situation where flows which are not associated with slow/no drain devices suffer the negative impacts of slow or no drain devices on a fabric. | 01-19-2012 |
20120110185 | Distributed Hierarchical Rendering and Provisioning of Cloud Services - Techniques are provided herein for distributed and hierarchical rendering and provisioning of cloud services. At a device in a cloud computing system comprising a plurality of hierarchical levels, a cloud service request is received for rendering and provisioning of a virtual data center. A determination is made as to which aspects of the cloud service request are to be satisfied by devices in a first hierarchical level and which aspects of the cloud service request are to be satisfied by devices in a second hierarchical level and in subsequent hierarchical levels. Rendering and provisioning commands are provided to one or more devices in the first hierarchical level that are selected to satisfy aspects of the cloud service request in the first hierarchical level. A subset cloud service request for aspects of the cloud service request that are to be satisfied by devices in the second hierarchical level is sent to a device in the second hierarchical level. | 05-03-2012 |
20120110186 | Disaster Recovery and Automatic Relocation of Cloud Services - Techniques are provided to move the services performed on one device to another device in a cloud computing system for a variety of reasons including failure, maintenance or upgrade of the device. A notification is received that services performed by an impacted device in a domain of a plurality of hierarchical domains need to be moved. A determination is made as to whether there are replacement resources available in the domain to perform the services, and if so, the replacement resources are automatically rendered to perform the services. The process continues to higher level domains that have a view into the capabilities of subordinate domains in order to determine where to move the services within the cloud computing system. | 05-03-2012 |
20120134672 | Fiber Channel Identifier Mobility for Fiber Channel and Fiber Channel Over Ethernet Networks - Techniques are provided for a switch to assign proxy FCIDs to endpoint device so that the endpoint devices may achieve FCID mobility by retaining their originally assigned FCIDs. At a switch in a network, e.g., a Virtual Storage Area Network (VSAN), a fabric login request is received from a first endpoint device that is associated with a first FC identifier (FCID) that was previously assigned to the first endpoint device by another switch in the VSAN. The fabric login request is responded to with the first FCID. The first endpoint device is assigned a second FCID associated with a domain of the switch where the endpoint device is directly attached to, and the second FCID is used as a proxy FCID within the VSAN for the first endpoint device. A frame is received from the first endpoint device with a source FCID comprising the first FCID and a destination FCID comprising an FCID for a second endpoint device. The source FCID in the frame is overwritten with the second FCID. The frame is forwarded to the second endpoint device. | 05-31-2012 |
20120226789 | Hiearchical Advertisement of Data Center Capabilities and Resources - A cloud computing system is provided comprising a plurality of data centers, each data center comprising a plurality of pods each of which comprises network, compute, storage and service node devices. At a designated device of a data center, data center level capabilities summary data is generated that summarizes the capabilities of the data center. Messages advertising the data center level capabilities summary data is sent from a designated device of each data center to a designated device at a provider edge network level of the computing system. At the designated device at the provider edge network level, provider edge network level capabilities summary data is generated that summarizes capabilities of compute, storage and network devices for each data center as a whole and without exposing individual compute, storage and service node devices in each data center. | 09-06-2012 |
20120226790 | Extensible Attribute Summarization - In one embodiment a method includes at first a network device, identifying an attribute of the first network device, selecting a function that defines how the attribute is to be summarized together with a same attribute of a second network device, generating a message that comprises a set of information comprising an identification of the attribute and the function, and sending the message to, e.g., a next higher node in a network hierarchy of which the network device is a part. Multiple such messages may be received at an aggregation node that then summarizes the attributes according to respective functions, and sends or publishes a summarized version of the attributes to a still next higher node in the network hierarchy. | 09-06-2012 |
20120226797 | Active Load Distribution for Control Plane Traffic Using a Messaging and Presence Protocol - Techniques are provided herein for a device in a network to receive information configured to indicate a control plane traffic load level for one or more server devices that are configured to manage traffic for messaging and presence clients communicating via a messaging and presence protocol. The control plane traffic is associated with the messaging and presence protocol. A determination is made as to when the control plane traffic load level has become unbalanced among the two or more server devices and in response to determining that the control plane traffic load level has become unbalanced, sending a transfer message to one or more clients comprising information configured to initiate migration of one or more clients from a server device that is relatively overloaded to a server device that is relatively underloaded in order to balance the control plane traffic load level among the two or more server devices. | 09-06-2012 |
20120226799 | Capabilities Based Routing of Virtual Data Center Service Request - Systems and methods are provided for receiving at a provider edge routing device capabilities data representative of capabilities of computing devices disposed in a data center, the capabilities data having been published by an associated local data center edge device, and advertising, by the provider edge routing device, the capabilities data to other provider edge routing devices in communication with one another in a network of provider edge routing devices. The provider edge routing device also receives respective capabilities data from each of the other provider edge routing devices, wherein each of the other provider edge routing devices is associated with a respective local data center via a corresponding data center edge device, and stores all the capabilities data in a directory of capabilities. Thereafter, a request for computing services is received at the provider edge network and the methodology provides for selecting, based on the directory of capabilities, one of the data centers to fulfill the request for computing services to obtain a selected data center, and for routing the request for computing services to the selected data center. | 09-06-2012 |
20120233333 | Resource Negotiation for Cloud Services Using a Messaging and Presence Protocol - Techniques are provided for sending from a client in a first network device a first session-initiate message to a second network device that is configured to provide network layer, data link layer, or associated convergence layer based service connection information in order for the second network device to accept or reject a network layer, data link layer, or associated convergence layer based service connection with the first network device. The first session-initiate message is based on a messaging and presence protocol. A session-accept message is received at the client in the first network device that is configured to accept the service connection and provide a network layer, data link layer, or associated convergence layer based service connection information in order for the first network device to establish the service connection with the second network device. The session-accept message is based on the messaging and presence protocol. In response to receiving the session-accept message, the service connection is established. | 09-13-2012 |
20120239792 | PLACEMENT OF A CLOUD SERVICE USING NETWORK TOPOLOGY AND INFRASTRUCTURE PERFORMANCE - Techniques are described for selecting an optimal data center for instantiating a first cloud service. Embodiments of the invention receive a request specifying a topology of a first cloud service to be hosted by one of a plurality of data centers which provide computing resources to host a plurality of cloud services. A suitability value is then determined for each of the data centers which measures a fitness of the data center for instantiating the first cloud service. In one embodiment, the suitability value is determined by calculating a plurality of metric values for the data center, normalizing the metric values and calculating a weighted average of the normalized values. One of the data centers is then selected for instantiating the first cloud service, based at least in part on the determined suitability values. | 09-20-2012 |
20120303618 | Clustering-Based Resource Aggregation within a Data Center - Data representing capabilities of devices in a data is aggregated on a cluster-basis. Information representing capability attributes of devices in the data center is received. The information representing the capability attributes is analyzed to generate data that groups devices based on similarity of at least one capability attribute. Aggregation data is stored that represents the grouping of the devices based on similarity of the at least one capability attribute and identifies the devices in corresponding groups. | 11-29-2012 |
20120331147 | HIERARCHICAL DEFRAGMENTATION OF RESOURCES IN DATA CENTERS - Techniques are provided herein for defragmenting resources within a cloud computing system. The cloud computing system includes a plurality of servers deployed in a plurality of respective racks, wherein the respective racks are deployed in a pod of a data center. An element of the cloud computing system determines for each server in a given rack of servers a number of free resource slots available thereon and a number of resource slots in an idle state, and then further determines whether the number of free resource slots on a first server in the plurality of servers is greater than a predetermined threshold. When the number of free resource slots in the first server is greater than the predetermined threshold, a second server in the plurality of servers is identified with sufficient resource slots thereon to accommodate the number of resource slots in the idle state on the first server, and the resource slots in the idle state on the first server are caused to be migrated to the second server. | 12-27-2012 |
20130007261 | VIRTUAL DATA CENTER MONITORING - Techniques are provided for monitoring the state or status of virtual data centers. In one embodiment, a method includes receiving state information representing the state of hardware devices supporting instantiations of virtual data centers operating within a physical data center. The state information is mapped to hardware devices supporting a selected instantiation of a virtual data center to identify state information for the selected instantiation of a virtual data center. An assessment is then made, based on the state information for the selected instantiation of a virtual data center, regarding a degree to which the selected instantiation of a virtual data center is operating in accordance with predetermined policy. A user is then notified of the assessment via, e.g., a color-coded dashboard representation of the selected instantiation of a virtual data center or a color-coded aspect of the selected instantiation of a virtual data center. | 01-03-2013 |
20130018999 | PLACEMENT OF SERVICE DELIVERY LOCATIONS OF A DISTRIBUTED COMPUTING SERVICE BASED ON LOGICAL TOPOLOGYAANM MERRILL; JoshuaAACI ParkerAAST COAACO USAAGP MERRILL; Joshua Parker CO USAANM DAI; HuidaAACI CupertinoAAST CAAACO USAAGP DAI; Huida Cupertino CA USAANM ZHU; JiangAACI SunnyvaleAAST CAAACO USAAGP ZHU; Jiang Sunnyvale CA USAANM KAPUR; SukhdevAACI SaratogaAAST CAAACO USAAGP KAPUR; Sukhdev Saratoga CA USAANM BANERJEE; SubrataAACI Los AltosAAST CAAACO USAAGP BANERJEE; Subrata Los Altos CA USAANM ELDER; DannyAACI San DiegoAAST CAAACO USAAGP ELDER; Danny San Diego CA USAANM GANESAN; AshokAACI San JoseAAST CAAACO USAAGP GANESAN; Ashok San Jose CA USAANM ZHANG; ShujinAACI Palo AltoAAST CAAACO USAAGP ZHANG; Shujin Palo Alto CA USAANM MEDVED; JanAACI PleasantonAAST CAAACO USAAGP MEDVED; Jan Pleasanton CA US - In one embodiment, a method comprises receiving a request for a distributed service, the distributed service offered by a service provider via a data communications network having service delivery locations reachable via a prescribed physical topology; identifying the service delivery locations within a prescribed logical topology overlying the prescribed physical topology, the prescribed logical topology segregating the distributed service from other network traffic on the prescribed physical topology; and identifying one or moreof the service delivery locations optimized for providing the distributed service to at least one service consumption location in the prescribed logical topology according to a prescribed service level agreement with the service provider. | 01-17-2013 |
20130055091 | Graph-Based Virtual Data Center Requests - Graph-based virtual data center requests are described. In some implementations, a method includes displaying a graph having graphical elements representing network resources. A user can select one of the graphical elements and provide input specifying requirements for a network resource corresponding to the selected graphical element. A virtual data center request can be generated based on the graph and the specified requirements. The virtual data center request can be transmitted to a data center device for processing. In some implementations, the virtual data center request can be an extensible markup language (XML) representation of the graph that includes the specified service requirements. In some implementations, a data center server can receive a graph-based virtual data center request and allocate data center resources based on the virtual data center request. | 02-28-2013 |
20130073552 | Data Center Capability Summarization - A method for summarizing capabilities in a hierarchically arranged data center includes receiving capabilities information, wherein the capabilities information is representative of capabilities of respective nodes at a first hierarchical level in the hierarchically arranged data center, clustering nodes based on groups of capabilities information, generating a histogram that represents individual node clusters, and sending the histogram to a next higher level in the hierarchically arranged data center. Relative rankings of capabilities may be used to order a sequence of clustering operations. | 03-21-2013 |
20130212279 | Resource Allocation Mechanism - A first network device determines capabilities of resources in a section of a network that is accessible using the first network device. The first network device groups the resources into a resource cluster. The first network device advertises the resource cluster in the network, wherein each of a plurality of network devices advertise a resource cluster associated with sections of the network. A second network device receives a request for providing a service. The second network device groups the request into a plurality of request clusters. The second network device selects at least one resource cluster for providing the service based on information associated with the request clusters and the advertised resource clusters. The second network device allocates resources included in the at least one resource cluster for providing the service based on selecting the at least one resource cluster. | 08-15-2013 |
20130290536 | GENERALIZED COORDINATE SYSTEM AND METRIC-BASED RESOURCE SELECTION FRAMEWORK - In one embodiment, an n-dimensional resource vector for each of a plurality of resources in a computer network is determined, each n-dimensional resource vector having n property values for a corresponding resource of the plurality of resources. Upon receiving a request for one or more resources of the plurality of resources, where the request indicates one or more desired property values, the techniques convert the desired property values of the request into an n-dimensional request vector, determine a distance between each resource vector and the request vector, and provide a response to the request, the response indicating one or more closest match resources for the request based on the distances. | 10-31-2013 |
20140059178 | CLOUD RESOURCE PLACEMENT USING PLACEMENT PIVOT IN PHYSICAL TOPOLOGY - In one embodiment, a method comprises retrieving a request graph specifying request nodes identifying respective requested cloud computing service operations, and at least one request edge specifying a requested path requirements connecting the request nodes; identifying a placement pivot among feasible cloud elements identified in a physical graph representing a data network having a physical topology, each feasible cloud element an available solution for one of the request nodes, the placement pivot having a maximum depth in the physical topology relative to the feasible cloud elements; ordering the feasible cloud elements, according to increasing distance from the placement pivot to form an ordered list of candidate sets of feasible cloud elements; and determining an optimum candidate set, from at least a portion of the ordered list, based on the optimum candidate set having an optimized fitness function in the physical graph among the other candidate sets in the ordered list. | 02-27-2014 |
20140086054 | MITIGATING THE EFFECTS OF CONGESTED INTERFACES ON A FABRIC - Techniques are provided for mitigating the effects of slow or no drain devices on a fabric. One or more of the described embodiments can be used alone or in combination to address problems associated with inter-switch link blocking and to address the situation where flows which are not associated with slow/no drain devices suffer the negative impacts of slow or no drain devices on a fabric. | 03-27-2014 |
20150278343 | Data Center Capability Summarization - A method for summarizing capabilities in a hierarchically arranged data center includes receiving capabilities information, wherein the capabilities information is representative of capabilities of respective nodes at a first hierarchical level in the hierarchically arranged data center, clustering nodes based on groups of capabilities information, generating a histogram that represents individual node clusters, and sending the histogram to a next higher level in the hierarchically arranged data center. Relative rankings of capabilities may be used to order a sequence of clustering operations. | 10-01-2015 |
Patent application number | Description | Published |
20090192981 | Query Deployment Plan For A Distributed Shared Stream Processing System - A method of providing a deployment plan for a query in a distributed shared stream processing system includes storing a set of feasible deployment plans for a query that is currently deployed in the stream processing system. A query includes a plurality of operators hosted on nodes in the stream processing system providing a data stream responsive to a client request for information. The method also includes determining whether a QoS metric constraint for the query is violated, and selecting a deployment plan from the set of feasible deployment plans to be used for providing the query in response to determining the QoS metric constraint is violated. | 07-30-2009 |
20100278069 | Flow Path Discovery In Network To Guarantee Multiple Metric QoS Constraints - Route discovery for an end-to-end path in a network is performed for a flow. A path is attempted to be discovered that satisfies QoS constraints for multiple metrics for the flow. The route discovery includes determining whether a path request for a path satisfying the QoS constraints is feasible, infeasible or undecideable based on information in a local QoS table. If the path request is determined to be undecideable, route discovery is performed with neighbors. | 11-04-2010 |
20110055611 | SYSTEM FOR CONTROLLING POWER CONSUMPTION OF A NETWORK - A system for controlling power consumption of a network includes at least one terminal to receive a plurality of requests to route data from a plurality of data sources to a plurality of data sinks, where the data sources and the data sinks are connected to each other through a plurality of network nodes forming the network, and a network configuration unit. The network configuration unit includes a selection module configured to select a configuration of the network nodes that allows the network to have a lowest overall power consumption of the network among a plurality of configurations of the network, and an output module configured to output a plurality of instruction signals to the network nodes to perform the network configuration. A network path for transmitting a network flow is selected that does not allow the network flow to be split and flow through another network path. | 03-03-2011 |
20110196964 | MANAGING EVENT TRAFFIC IN A NETWORK SYSTEM - A network system and associated operating methods manage event storms. The network system comprises an event analysis and control engine that detects and manages events occurring on a network. The event analysis and control engine receives events from a plurality of agents, and analyzes the events according to policies specified in a policies templates database. The event analysis and control engine processes raw network packets directly with less than full packet parsing to generate a filtered stream of events based on the analysis. The event analysis and control engine propagates the filtered stream of events to a monitoring system. | 08-11-2011 |
20110261831 | Dynamic Priority Queue Level Assignment for a Network Flow - Forwarding a flow in a network includes receiving the flow at a switch, determining an optimized priority queue level of the flow at the switch, and forwarding the flow via the switch using an optimized priority queue level of the flow at the switch. The flow passes through a plurality of switches, including the switch, in the network, and the optimized priority queue level of the flow at the switch is different from a priority queue level of the flow at a second switch of the plurality of switches. The second switch routes the flow at the second switch using the different priority queue level for the flow. | 10-27-2011 |
20110273988 | Distributing decision making in a centralized flow routing system - Local rules for managing flows devolved from a central controller are received at a switch. The central controller determines a global set of rules for managing flows. The switch receives a packet from a flow from a network and determines whether a metric for the flow satisfies a dynamic condition to trigger a metric report to the central controller. In response to a determination that the metric for the flow at the switch satisfies the dynamic condition to trigger a metric report to the central controller, the switch sends a metric report to the central controller, and the switch then receives an instruction to manage the flow from the central controller. In response to a determination that the metric for the flow at the switch does not satisfy the dynamic condition to trigger the metric report to the central controller, the switch manages the flow using the local rules for managing flows. | 11-10-2011 |
20120120958 | DEEP SLEEP MODE MANAGEMENT FOR A NETWORK SWITCH | 05-17-2012 |
20140153388 | RATE LIMIT MANAGERS TO ASSIGN NETWORK TRAFFIC FLOWS - A rate limit manager is to assign network traffic flows to hardware rate limiters. The network traffic flows are associated with rate limit values. The rate limit manager determines threshold values to assign flow(s) to hardware rate limiters, and the rate limit manager is to assign flow(s) to a last remaining unassigned hardware rate limiter independent of the threshold value. | 06-05-2014 |
20140258498 | Implementing an Energy Proportional Network Architecture from Desired Network Criteria - Systems, methods, and computer-readable executable instructions are provided for implementing an energy proportional network architecture. Implementing an energy proportional network architecture can include determining a number of desired network criteria and a desired number of access ports. A number of switches for the energy proportional network architecture can be calculated from the desired number of access ports and the number of desired network criteria. Implementing an energy proportional network architecture can also include using the number of calculated switches to form the energy proportional network. | 09-11-2014 |
20150019889 | Virtualizing Battery Across a Group of Personal Mobile Devices - A system, method, and non-transitory computer readable medium for virtualizing battery in a personal mobile device or across a group of personal mobile devices controlled by a user are provided. The user specifies a set of power management policies for applications running in the personal mobile device(s). Battery usage per application is monitored and resources for the applications are scheduled based on the monitored battery usage and the power management policies. | 01-15-2015 |
20150095498 | Allocating Bandwidth in a Network - Allocating bandwidth in a network ( | 04-02-2015 |
20150103646 | ALLOCATING NETWORK BANDWITH - As an example, a system and method is provided for allocating network bandwidth. The method includes identifying congested and uncongested links using a tenant demand for each link and a tenant bandwidth cap. A portion of the tenant bandwidth cap may be allocated to each uncongested link based on the tenant demand on the uncongested link and the tenant bandwidth cap. Additionally, the remainder of the tenant bandwidth cap may be allocated to the tenants congested links based on a link capacity. | 04-16-2015 |
20150134830 | Bandwidth Guarantee and Work Conservation - According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees. | 05-14-2015 |
20150334024 | Controlling Data Rates of Data Flows Based on Information Indicating Congestion - A controller receives information from congestion detectors in a network, the information indicating that points in the network are congested due to data flows in the network. The controller controls data rates of the data flows based on the information. | 11-19-2015 |
20160006617 | CLOUD APPLICATION BANDWIDTH MODELING - According to an example, a cloud bandwidth modeling system may determine components for an application, create a vertex for each component in a graph representing a bandwidth model for the application, determine bandwidth requirements between each component, and create directed edges between the components to represent the bandwidth requirements. | 01-07-2016 |