Abstract: Techniques are provided for seamless integration of wired and wireless functionality packet forwarding in network. A plurality of access switches are provided in each of a plurality of mobility sub-domains that are part of a mobility domain of a network. Each access switch serves one or more Internet Protocol (IP) subnets, each comprising a plurality of IP addresses. An access switch obtains an IP address for a wireless device according to the one or more IP subnets that the access switch serves. The access switch sends an association advertisement message to indicate the IP address of the wireless device and to enable other access switches and routers to compute a path to the wireless device. When a wireless device obtains an IP address, it can keep the same IP address as it roams in the mobility domain.

Abstract: Techniques are provided to enable support of roaming wireless devices in a network such that the wireless devices can keep their Internet Protocol (IP) addresses as they roam across mobility sub-domains. Traffic for a wireless device that roams is tunneled back to the access switch that serves the IP subnet which includes an IP address for the wireless device. Traffic is tunneled back to that access switch for the wireless device when the wireless device roams to another access switch which does not serve the IP subnet for the wireless device in the same mobility sub-domain and when the wireless device roams to a different mobility sub-domain, in which case the traffic is tunneled between tunneling endpoints in the respective mobility sub-domains.

Abstract: Techniques are provided to support roaming of wireless devices in a network such that the wireless devices can keep their Internet Protocol (IP) addresses as they roam within and across mobility sub-domains. When a wireless device roams from one access switch to another access switch, a tunneling endpoint apparatus in the wireless device's home mobility sub-domain is configured to serve as the point of presence for the roamed wireless device. Traffic for the roamed wireless device is tunneled from the access switch where the wireless device has roamed (where it is currently attached) to the tunneling endpoint apparatus. When the wireless device roams across mobility sub-domains, then traffic is tunneled from the access switch where the wireless device is currently attached to the tunneling endpoint apparatus in that mobility sub-domain (called a “foreign” mobility sub-domain) to the tunneling endpoint apparatus in the wireless device's home mobility sub-domain.

Abstract: A system and method for a hierarchical distributed control architecture to support roaming wireless client devices. Access switches serve one or more Internet Protocol (IP) subnets that include plural IP addresses. The access switches are arranged in switch peer groups and store information about other access switches in that switch peer group and about locations of wireless client devices that are associated with any access switch in the switch peer group. The access switches are further grouped into a corresponding mobility sub-domain each including plural switch peer groups. Plural controller devices control access switches in a corresponding mobility sub-domain. Each controller device stores information about the access switches and about locations of wireless client devices within its mobility sub-domain. A central controller device communicates with the controller devices for the respective mobility sub-domains.

Abstract: A system for managing bandwidth use in a device. In a specific embodiment, the device is a network device that includes a first data scheduler that is adapted to initially share available device bandwidth among a first type of traffic and a second type of traffic on an as-needed basis. A traffic monitor communicates with the first scheduler and causes the first data scheduler to guarantee predetermined transmission characteristics for the second type of traffic. The first data scheduler includes one or more routines for prioritizing first type of traffic above the second type of traffic when the network device is in a first operational mode, and prioritizing the second type of traffic above the first type of traffic when the network device is in a second operation al mode. The minimum transmission characteristics include a minimum service rate and a minimum latency for the second type of traffic.

Abstract: A system and method are provided for a hierarchical distributed control architecture to support roaming of wireless client devices. A plurality of access switches are provided and configured to serve one or more Internet Protocol (IP) subnets that comprises a plurality of IP addresses. The plurality of access switches are arranged in switch peer groups such that each access switch within a given switch peer group is configured to store information about other access switches in that switch peer group and about locations of wireless client devices that are associated with any wireless access point on any access switch in the switch peer group. The plurality of access switches are further grouped into a corresponding one of a plurality of mobility sub-domains each comprising a plurality of switch peer groups. A plurality of controller devices are provided, each configured to control access switches in a corresponding mobility sub-domain.

Abstract: Techniques are provided to enable support of roaming wireless devices in a network such that the wireless devices can keep their Internet Protocol (IP) addresses as they roam across mobility sub-domains. Traffic for a wireless device that roams is tunneled back to the access switch that serves the IP subnet which includes an IP address for the wireless device. Traffic is tunneled back to that access switch for the wireless device when the wireless device roams to another access switch which does not serve the IP subnet for the wireless device in the same mobility sub-domain and when the wireless device roams to a different mobility sub-domain, in which case the traffic is tunneled between tunneling endpoints in the respective mobility sub-domains.

Abstract: Techniques are provided for seamless integration of wired and wireless functionality packet forwarding in network. A plurality of access switches are provided in each of a plurality of mobility sub-domains that are part of a mobility domain of a network. Each access switch serves one or more Internet Protocol (IP) subnets, each comprising a plurality of IP addresses. An access switch obtains an IP address for a wireless device according to the one or more IP subnets that the access switch serves. The access switch sends an association advertisement message to indicate the IP address of the wireless device and to enable other access switches and routers to compute a path to the wireless device. When a wireless device obtains an IP address, it can keep the same IP address as it roams in the mobility domain.

Abstract: Techniques are provided to support roaming of wireless devices in a network such that the wireless devices can keep their Internet Protocol (IP) addresses as they roam within and across mobility sub-domains. When a wireless device roams from one access switch to another access switch, a tunneling endpoint apparatus in the wireless device's home mobility sub-domain is configured to serve as the point of presence for the roamed wireless device. Traffic for the roamed wireless device is tunneled from the access switch where the wireless device has roamed (where it is currently attached) to the tunneling endpoint apparatus. When the wireless device roams across mobility sub-domains, then traffic is tunneled from the access switch where the wireless device is currently attached to the tunneling endpoint apparatus in that mobility sub-domain (called a “foreign” mobility sub-domain) to the tunneling endpoint apparatus in the wireless device's home mobility sub-domain.

Abstract: In one embodiment, a method for processing a packet is disclosed. The method includes classifying the packet and determining an action to be taken with regard to the packet. Classifying the packet includes using information in the packet to perform the classification. The determination made as to the action to be taken with regard to the packet is based on the classifying that is performed, and is performed using a plurality of rules. At least one of the rules is configurable. The information in the packet is related to time-to-live (TTL) data corresponding to the packet.

Abstract: In one embodiment, a method can include: (i) receiving a packet in a switch, where the packet includes a plurality of fields that forms a binding; (ii) performing a first lookup of a first table using a first lookup key, where the first lookup key includes a first subset of the plurality of fields; (iii) performing a second lookup of a second table using a second lookup key, where the second lookup key includes a result of the first lookup and a second subset of the plurality of fields; and (iv) indicating a check of the binding by using a result of the second lookup. The plurality of fields can include a media access control (MAC) source address, an internet protocol (IP) address, a receive port, and a receive virtual local area network (VLAN), while the result of the first lookup can include a layer-2 source index, for example.

Abstract: Methods and systems for distributing packets across all available output paths within a network is provided. A distribution key is extracted from each packet and is hashed to generate a hash value. An output path for each packet is selected by using all N bits of the hash value to address a distribution table having at least 2N indications of the output paths available for that packet. Thus, the stream of packets is distributed, or split up, across the available output paths, thereby balancing the load. In some embodiments, the order of the output paths is randomized within each distribution table. Other embodiments include a forwarding table used to determine the available output paths for a particular packet. In yet other embodiments, the distribution key includes the packet's source and destination; thus preventing packets within the same stream having varying latencies due to traveling along varying paths.

Abstract: In one embodiment, a method can include: (i) receiving a packet in a switch, where the packet includes a plurality of fields that forms a binding; (ii) performing a first lookup of a first table using a first lookup key, where the first lookup key includes a first subset of the plurality of fields; (iii) performing a second lookup of a second table using a second lookup key, where the second lookup key includes a result of the first lookup and a second subset of the plurality of fields; and (iv) indicating a check of the binding by using a result of the second lookup. The plurality of fields can include a media access control (MAC) source address, an internet protocol (IP) address, a receive port, and a receive virtual local area network (VLAN), while the result of the first lookup can include a layer-2 source index, for example.

Abstract: A system for managing bandwidth use in a device. In a specific embodiment, the device is a network device that includes a first data scheduler that is adapted to initially share available device bandwidth among a first type of traffic and a second type of traffic on an as-needed basis. A traffic monitor communicates with the first scheduler and causes the first data scheduler to guarantee predetermined transmission characteristics for the second type of traffic. The first data scheduler includes one or more routines for prioritizing first type of traffic above the second type of traffic when the network device is in a first operational mode, and prioritizing the second type of traffic above the first type of traffic when the network device is in a second operation al mode. The minimum transmission characteristics include a minimum service rate and a minimum latency for the second type of traffic.

Abstract: Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no-hit condition in response to a highest-priority matching entry including a force no-hit indication, selecting among various sets or banks of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, each block retrieves a modification mapping from a local memory and modifies a received search key based on the mapping and received modification data. In one implementation, each of the associative memory entries includes a field for indicating that a successful match on the entry should or should not force a no-hit result. In one implementation, an indication of which associative memory blocks or sets of entries to use in a particular lookup operation is retrieved from a memory.

Abstract: Methods and systems for distributing packets across all available output paths within a network is provided. A distribution key is extracted from each packet and is hashed to generate a hash value. An output path for each packet is selected by using all N bits of the hash value to address a distribution table having at least 2N indications of the output paths available for that packet. Thus, the stream of packets is distributed, or split up, across the available output paths, thereby balancing the load. In some embodiments, the order of the output paths is randomized within each distribution table. Other embodiments include a forwarding table used to determine the available output paths for a particular packet. In yet other embodiments, the distribution key includes the packet's source and destination; thus preventing packets within the same stream having varying latencies due to traveling along varying paths.

Abstract: Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no-hit condition in response to a highest-priority matching entry including a force no-hit indication, selecting among various sets or banks of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, each block retrieves a modification mapping from a local memory and modifies a received search key based on the mapping and received modification data. In one implementation, each of the associative memory entries includes a field for indicating that a successful match on the entry should or should not force a no-hit result. In one implementation, an indication of which associative memory blocks or sets of entries to use in a particular lookup operation is retrieved from a memory.

Abstract: Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no hit condition in response to a highest priority matching entry including a force no hit indication, selecting among various blocks or sets of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, indications of which associative memory blocks to use and/or enable in a particular lookup operation are retrieved from one or more memories, such as that based on received a profile ID. In one implementation, which may or may not be in a cascaded configuration, one or more identified or received error conditions are propagated in such a manner as to identify a source of each error condition.

Abstract: Methods and apparatus are disclosed for performing lookup operations using associative memories, including, but not limited to modifying search keys within an associative memory based on modification mappings, forcing a no-hit condition in response to a highest-priority matching entry including a force no-hit indication, selecting among various sets or banks of associative memory entries in determining a lookup result, and detecting and propagating error conditions. In one implementation, each block retrieves a modification mapping from a local memory and modifies a received search key based on the mapping and received modification data. In one implementation, each of the associative memory entries includes a field for indicating that a successful match on the entry should or should not force a no-hit result. In one implementation, an indication of which associative memory blocks or sets of entries to use in a particular lookup operation is retrieved from a memory.

Abstract: In one embodiment, a method for processing a packet is disclosed. The method includes classifying the packet and determining an action to be taken with regard to the packet. Classifying the packet includes using information in the packet to perform the classification. The determination made as to the action to be taken with regard to the packet is based on the classifying that is performed, and is performed using a plurality of rules. At least one of the rules is configurable. The information in the packet is related to time-to-live (TTL) data corresponding to the packet.