Patent application number | Description | Published |
20110128920 | Channel Assignment For A Wireless Network - Channel assignment for access points (APs) in a wireless network includes determining a bottleneck client in an interference relationship, and determining a channel assignment for the APs that maximizes a normalized throughput of the bottleneck client. The normalized throughput is assigned to the bottleneck client, and the bottleneck client is assigned to a fixed set. | 06-02-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 |
20110261688 | Priority Queue Level Optimization for a Network Flow - Optimizing priority queue levels for a flow in a network includes determining a path for the flow, determining an optimized priority queue level of the flow at each of a plurality of switches based on a Quality of Service (QoS) requirement of the flow and priority queue levels of one or more existing flows in the network. Information of the optimized priority queue level of the flow is sent to at each of the switches. | 10-27-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 |
20110292886 | CHANNEL ASSIGNMENT FOR A WIRELESS NETWORK - Channel assignment for access points (APs) in a wireless network includes determining at least one of a MaxSum and a MaxMin, and determining a channel assignment for the APs based on at least one of the MaxSum and the MaxMin. The MaxSum is a maximization of a system throughput and the system throughput is a sum of throughput of nodes in the network. The MaxMin is a maximization of a minimum throughput of a set of AP-client links in the network. The AP-client link is a link between an AP and a client associated with the AP. | 12-01-2011 |
20120026899 | PATH SWITCHING USING CO-LOCATED RADIOS IN A MULTI-HOP WIRELESS NETWORK - A node in a multi-hop wireless network includes a master radio and a surrogate radio. The master radio performs data communication on a main multi-hop path in the multi-hop wireless network, and the surrogate radio simultaneously scans one or more channels in the multi-hop wireless network. A channel manager determines if a link between two different nodes on the main multi-hop path is disconnected, and, in response to determining a disconnection of the link between two different nodes on the main multi-hop path, the data communication is switched to an alternative multi-hop path in the multi-hop wireless network based on information obtained from the scanning of the one or more channels. | 02-02-2012 |
20120120958 | DEEP SLEEP MODE MANAGEMENT FOR A NETWORK SWITCH | 05-17-2012 |
20120155264 | Dynamic Balancing Priority Queue Assignments for Quality-of-Service Network Flows - A priority queue assignment technique for quality-of-service (“QoS”) network flows in a network is provided. A network path is determined for an incoming flow including a plurality of network switches associated, with a plurality of priority queue levels. A priority queue level is determined for the incoming flow for at least one of the plurality of network switches in the network path based on priority queue levels of existing flows. The priority queue level of the incoming flow is adjusted, to dynamically balance flows over the plurality of priority queue levels for at least one of the plurality of network switches in the network path based on quality-of-service (“QoS”) requirements associated with the incoming flow. | 06-21-2012 |
20130262661 | SOLVING UNDER-DETERMINED PROBLEMS FOR NETWORKS - There is provided a computer-implemented method of solving an under-determined problem. The method includes partitioning the under-determined problem into a plurality of sub-problems of reduced order. The method also includes receiving a plurality of local solutions to the plurality of sub-problems. Additionally, the method includes fusing the local solutions to generate a global solution to the under-determined problem. | 10-03-2013 |
20130287032 | UPDATING VIRTUAL NETWORK MAPS - A switch determines a path, not included in a first set of virtual networks associated with the switch. It is determined if the path can be added to an existing virtual network in the first set of virtual networks. If the path cannot be added, a new virtual network is created to include the path. | 10-31-2013 |
20130287033 | ROUTING DATA PACKETS ON A NETWORK - A plurality of data flows can be routed from a first node of the network to one or more other nodes of the network. A destination of a data packet for each data flow is determined. When the destination node of the data packet of that data flow is not adjacent to the first node, a probabilistic determination is made for a next hop of data packets of that data flow. When the destination node of the data packet of that data flow is adjacent to the first node, a priority designation is made for the next hop of data packets of that data flow as being the destination node. The next hop for data packets of the data flow is determined based on either the probabilistic determination or the priority designation. | 10-31-2013 |
20130287034 | USING PROBABILISTIC VALUES FOR ROUTING DATA PACKETS ON A DATA CENTER NETWORK - A set of virtual local area networks (VLANs) are defined from a set of nodes that comprise a data center network. A set of possible paths are determined for routing data packets from a root node to one or more other nodes of the set of nodes. A set of probabilistic values are identified for determining a path in the set of possible paths that individual data packets are to take as between the root node and a destination node specified by the individual data packet. The data packets are routed to the destination node specified by that data packet, along a path that is determined by use of the set of probabilistic values. The path may be provided by one or more VLANs. | 10-31-2013 |
20140020100 | DETECTING NETWORK ANOMALY - A method for detecting an anomaly in a network can include combining a number of data-created sketch-sets and requesting a finer sketch-set for an identified sketch-set among the combined number of sketch-sets using an aggregator, and creating the finer sketch-set for the identified sketch-set to detect the anomaly in the network using a monitor. | 01-16-2014 |
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 |