Santanu Sinha - Cupertino CA, US Shahriar I. Rahman - Morgan Hill CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
H04L 12/28
US Classification:
370392, 370389
Abstract:
Embodiments of the present invention include a method, an apparatus, and logic encoded in one or more computer-readable tangible medium to carry out a method. One method includes tagging packets and forwarding packets in a wireless mesh network using stored forwarding information for the tag, wherein the forwarding information is according to a centrally determined routing method and tag distribution method.
Santanu Sinha - Cupertino CA, US David J. Pignatelli - Saratoga CA, US Alan Carr - San Jose CA, US
Assignee:
Cisco Technology, Inc. - San Jose CA
International Classification:
G06F 21/20 G06F 15/16 H04L 29/06
US Classification:
726 1, 726 14, 709228
Abstract:
A method and system for applying access-control policies. In particular implementations, a method includes determining one or more policies, and a prioritization order for the determined policies, based on the one or more parameters; accessing an indirection table to create an entry for the client, wherein the entry indicates the prioritization order of the determined policies; and creating one or more entries in one or more policy data structures for the one or more determined policies.
A dual cryptographic keying system. In particular implementations, a method includes responsive to an initial session key negotiation, storing security association information for a tunnel in a security association memory; responsive to a session key renegotiation, storing security association information for the tunnel in a cache; decrypting received packets associated with the tunnel conditionally using the security association information in the cache or the security association information in the security association memory; and upon an expiration condition, overwriting the security association information, for the tunnel, in the security association memory with the security association information, for the tunnel, copied from the cache.
Priority-Aware Hierarchical Communication Traffic Scheduling
Priority-aware hierarchical communication traffic scheduling methods and apparatus are disclosed. Communication traffic is scheduled by schedulers. Each scheduler supports a multiple priority scheduling function to schedule communication traffic having any of multiple priorities. The communication traffic scheduled by the schedulers is further scheduled based on the priorities of the communication traffic scheduled by each of the schedulers. Traffic shaping may also be integrated into a hierarchical scheduler. The priority-aware further scheduling and the optional shaping may be implemented, for example, using multiple Active lists, one per traffic priority, and a Pending list to which a scheduler can be added if it has communication traffic to schedule but is not allowed to schedule that traffic due to the shaping.
A dual cryptographic keying system. In particular implementations, a method includes responsive to an initial session key negotiation, storing security association information for a tunnel in a security association memory; responsive to a session key renegotiation, storing security association information for the tunnel in a cache; decrypting received packets associated with the tunnel conditionally using the security association information in the cache or the security association information in the security association memory; and upon an expiration condition, overwriting the security association information, for the tunnel, in the security association memory with the security association information, for the tunnel, copied from the cache.
A policy-based multicast tunneling system. In particular implementations, a method includes maintaining a plurality of multicast tunnels with one or more remote network elements, each multicast tunnel being operable to carry one or more multicast streams; forwarding one or more packets of a multicast stream using selected multicast tunnels of the plurality of multicast tunnels; and applying one or more policies operative to control subscriptions to one or more of the plurality of multicast tunnels.
Priority-Aware Hierarchical Communication Traffic Scheduling
Priority-aware hierarchical communication traffic scheduling methods and apparatus are disclosed. Communication traffic is scheduled by schedulers. Each scheduler supports a multiple priority scheduling function to schedule communication traffic having any of multiple priorities. The communication traffic scheduled by the schedulers is further scheduled based on the priorities of the communication traffic scheduled by each of the schedulers. Traffic shaping may also be integrated into a hierarchical scheduler. The priority-aware further scheduling and the optional shaping may be implemented, for example, using multiple Active lists, one per traffic priority, and a Pending list to which a scheduler can be added if it has communication traffic to schedule but is not allowed to schedule that traffic due to the shaping.
John K. Chen - Sunnyvale CA Gregory Lee DeJager - San Jose CA Robert D. Hastings - Fremont CA Gordon MacKay - Santa Clara CA Gopakumar Parameswaran - Santa Clara CA Santanu Sinha - Cupertino CA Robert Gregory Twiss - Portola Valley CA Van Van Nguyen - San Jose CA
A repeater, useable for connecting switches in a data communication network, is provided in a distributed and/or modular fashion. The repeater includes a plurality of separate and distinct components or modules connected to or at least partially housed in, the various switches which the repeater modules couple. The distributed and/or modular repeater facilitates accommodating various switching or repeater needs as a network grows or contracts. A light pipe, preferably integral with a module case, conveys indicator lights to a position visible when viewing a switch front panel. A heat spreader unit receives and/or conveys heat and/or protects against undue EMI. A collision-handling state machine transmits modified collision fragments so as to avoid reduction in interpacket gaps, e. g. by downstream repeater modules.