Abstract: Systems, methods, and software for performing Over-The-Air (OTA) updates on vehicles. In one embodiment, an OTA update manager stores updated software components for ECUs installed in vehicles, and authorized software configurations for the vehicles that are verified by a manufacturer. When an OTA connection is established with a vehicle, the OTA update manager identifies a software state of the ECUs in the vehicle, selects a set of updated software components for installation in the vehicle based on the software state and the authorized software configuration, generates an update plan for installing the set of updated software components that indicates an order for installing the set of the updated software components, and downloads the update plan to the vehicle via the OTA connection.

Abstract: A system includes a policy enforcement point that is located within a first network. The policy enforcement point is configured to connect the first network to a second network via a secure connection. The policy enforcement point is configured to receive traffic from a first device via the first network or a second device associated with the second network via the secure connection, determine whether to apply a policy to the received traffic, and discard the received traffic when a policy is determined to apply to the received traffic.

Abstract: A system includes a policy enforcement point that is located within a first network. The policy enforcement point is configured to connect the first network to a second network via a secure connection. The policy enforcement point is configured to receive traffic from a first device via the first network or a second device associated with the second network via the secure connection, determine whether to apply a policy to the received traffic, and discard the received traffic when a policy is determined to apply to the received traffic.

Abstract: This invention introduces an intelligent buffering sharing scheme that supports multiple service classes and multiple drop priorities per class. The available buffers are shared between different queues but at the same time every queue will be guaranteed a certain minimum buffer allocation. Other schemes presented in the literature to not address this minimum buffer guarantee in the presence of multiple service classes and drop priorities. In addition, the scheme presented in this innovation is based on a static threshold approach that has certain implementation cost tradeoff with another dynamic threshold approach presented in the literature that deals with buffer management in the presence of multiple service classes and drop priorities per class.

Abstract: The present invention enhances reliable flooding of link state advertisements (LSAs) using retransmission. In accordance with the present invention, a technique is disclosed to make a retransmission timer more responsive to dynamic network conditions. This technique varies the retransmission timer value as network conditions change providing the capability to alleviate the culmination of CPU utilization and memory resource exhaustion that may arise from fast retransmission while still achieving the object of fast flooding whenever possible. The retransmission timers provided by the present invention are assigned on a “per neighbor” basis.

Abstract: The invention defines a TCAM-Memory hybrid scheme that: (1) enables achieving high search rates unattainable with memory-based search alone, and (2) accommodates a large number of policies that cannot be achieved using TCAMs alone. In one exemplary embodiment of the hybrid scheme, an index of the head of an action list based on a fast TCAM search is first determined and then every action in the action list is extracted by memory reference as the actions are organized in the action list. If read latency becomes an issue, every action entry can contain the reference for two or more actions as required to be able to do back-to-back read as opposed to sequential read, reducing the latency problem. Assuming a best match, the TCAM can be configured to return a memory pointer to the head of an action list. Actions are daisy-chained in a strict order in memory and are applied to the packet in the same order. The ability to daisy-chain actions based on one rule saves classification rule entries in expensive TCAMs.

Abstract: A communication system comprising a plurality of sources, a plurality of destinations, and a plurality of switches forming an asynchronous transfer mode (ATM) network connecting the sources to the destinations. Each switch in the plurality of switches includes a plurality of line cards. The ATM network comprises a plurality of connections where, for each respective connection, one of the plurality of sources is linked to one of the plurality of destinations through the network by linking one or more switches, in the plurality of switches, that is associated with the respective connection. The ATM network further comprises operation administration and maintenance (OAM) cell processing circuitry for detecting a failure in a connection in the network. The failure is localized to the exact line card in a switch associated with the connection that is causing the connection to fail.

Abstract: The present invention relates to communications networks, and more particularly to packet switching and routing devices used in communication networks that provide efficient multicast services. The invention provides methods and systems for switching and routing of multicast data packets in two stages. In particular, in the first stage a received multicast data packet is in an internal multicast operation by an ingress line card across a switching fabric to a plurality of egress line cards through which multicast destinations of the packet are reachable. In a second stage each egress line card further replicates the data packet to the actual transmission links across which the multicast group are reachable. This invention also includes system performing this method. The invention reduces the service time for the multicast packets making it the same as for the unicast packets, and provides for better system throughput in comparison to traditional systems.

Abstract: The present invention provides improved work schedulers for computer systems and communication processors. A preferred embodiment of the present invention includes systems with buffer memory for storing one or more communication packets or work requests arranged on a plurality of scheduling queues and information for controlling the scheduling of the queues, with output processors for outputting packets from the buffer memory; and with control processors for performing the scheduling methods of this invention. The scheduling methods repetitively initialize each queue's service credits, repetitively process each queue in a round-robin order by granting each queue with remaining service credits no more than one quantum of service and updating that queue's service credits to reflect the service actually used and the service available for use but not actually used.

Abstract: The present invention provides switches and routers, preferably with fully-connected mesh fabrics, that transmit data through the switch fabric in variable-size data units. Variable-size data units allow switches and routers to provide throughputs close to hardware capabilities, eliminating the need for over-capacity hardware in the switch fabric and other components. Along with variably-size data units, preferred embodiments of this invention include scheduling methods that provide fair allocation of pre-determined bandwidths to different protocols, to different classes of service within protocols, and to different resources within the switch by use of certain weighted, fair scheduling methods. The switches and routers of this invention are particularly directed to multi-protocol, high-throughput communication applications, but may have wide applicability in systems generally where data packets are switched or routed.

Abstract: The present invention provides hierarchical structures of queues and schedulers for switches and routers with, preferably fully-connected, mesh fabrics, for efficiently and properly handling the quality or service requirements of multiple network services, such as ATM and IP, in switch or router. The switches of this invention provide, for example, fair allocation of bandwidths to different network services, to different QoS classes within network services, and to different resources within the switch by use of, preferably, weighted, fair scheduling methods. The switches and routers of this invention are particularly directed to multi-protocol, high-throughput communication application, but may have wide applicability in systems generally where data packets are switched or routed.

Abstract: The present invention provides switching and routing systems and methods useful in packet switching communication networks that efficiently reroute packet traffic through a switch or router upon failure of a line card. According to the invention, every line card on the switch is designated as either primary or protection, and has a redundancy table stored locally that is indexed by the slot ID holding a primary line card, and includes an indicator of whether 1+1 redundancy is configured, an indicator of whether N:1 redundancy is enabled, and a slot ID holding the corresponding protection line card. Each ingress line card consults its locally stored redundancy data in order to correctly forward packets across a switch fabric to proper egress line cards in cases of normal operations and in cases of line card failure.

Abstract: This invention introduces an intelligent buffering sharing scheme that supports multiple service classes and multiple drop priorities per class. The available buffers are shared between different queues but at the same time every queue will be guaranteed a certain minimum buffer allocation. Other schemes presented in the literature to not address this minimum buffer guarantee in the presence of multiple service classes and drop priorities. In addition, the scheme presented in this innovation is based on a static threshold approach that has certain implementation cost tradeoff with another dynamic threshold approach presented in the literature that deals with buffer management in the presence of multiple service classes and drop priorities per class.

Abstract: The present invention enhances reliable flooding of link state advertisements (LSAs) using retransmission. In accordance with the present invention, a technique is disclosed to make the retransmission timer more responsive to dynamic network conditions. This technique varies the retransmission timer value as network conditions change providing the capability to alleviate the culmination of CPU utilization and memory resource exhaustion that may arise from fast retransmissions while still achieving the object of fast flooding whenever possible. In OSPF, a retransmission list is maintained per neighbor, whereas the retransmission timer is a property of the interface. There can be more than one neighbor communicating over the same interface. The present invention maintains a retransmission timer per neighbor that is derived from the interface timer. For each neighbor, the retransmission timer is initialized to that of the interface to which the neighbor belongs.