Abstract: Embodiments of the present invention provide systems, articles of manufacture and methods for a telematic parametric speed metering system. In one embodiment, a system may determine a vehicle's location and speed. Once the location has been determined, corresponding geographical zone based speed limits and/or other information may be acquired via internal memory or data transmission. The speed of the vehicle may then be compared against the speed limits for the zone. If the vehicle's speed exceeds those speed limits, one or more of a plurality of actions may be performed including (but not limited to) warning the driver via a visual or audio signal, informing an authority agency via data transmission, logging the excessive speeding condition (e.g., time, date, speed, location, driver name, etc).

Abstract: The present invention relates to a method for managing a plurality of multi-field classification rules. The method includes providing a first table that includes a plurality of entries corresponding to a plurality of rules relating to an ingress context and providing a second table that includes a plurality of entries corresponding to a plurality of rules relating to an egress context. The method also includes utilizing the first table and the second table to identify any rules relating to the ingress context and any rules relating to the egress context that match a search key.

Abstract: Method for compressing search tree structures used in rule classification is provided. The method includes classifying packets based on filter rules, compressing a tree structure comprising multiple levels of single bit test nodes and leaf nodes, storing the compressed tree structure in a first memory structure of a storage such that the multiple levels of single bit test nodes and leaf nodes can be accessed from the first memory structure through a single memory access of the storage, collecting single bit test nodes of the tree structure that are in a lowest level of the tree structure, storing only the collected single bit test nodes within a second memory structure of the storage that is contiguous to the first memory structure, collecting leaf nodes of the tree structure, and storing only the collected leaf nodes within a third memory structure of the storage that is contiguous to second memory structure.

Abstract: Embodiments of the present invention provide systems, articles of manufacture and methods for a telematic parametric speed metering system. In one embodiment, a system may determine a vehicle's location and speed. Once the location has been determined, corresponding geographical zone based speed limits and/or other information may be acquired via internal memory or data transmission. The speed of the vehicle may then be compared against the speed limits for the zone. If the vehicle's speed exceeds those speed limits, one or more of a plurality of actions may be performed including (but not limited to) warning the driver via a visual or audio signal, informing an authority agency via data transmission, logging the excessive speeding condition (e.g., time, date, speed, location, driver name, etc).

Abstract: Embodiments of the present invention provide systems, articles of manufacture and methods for a telematic parametric speed metering system. In one embodiment, a system may determine a vehicle's location and speed. Once the location has been determined, corresponding geographical zone based speed limits and/or other information may be acquired via internal memory or data transmission. The speed of the vehicle may then be compared against the speed limits for the zone. If the vehicle's speed exceeds those speed limits, one or more of a plurality of actions may be performed including (but not limited to) warning the driver via a visual or audio signal, informing an authority agency via data transmission, logging the excessive speeding condition (e.g., time, date, speed, location, driver name, etc).

Abstract: The present invention relates to a method and system for compressing a tree structure. The method of the present invention includes providing a compressed format block for representing a plurality of levels of the tree structure, where the plurality of levels comprises a set of nodes. The method also includes compressing each node in the set of nodes into the compressed format block, such that the plurality of levels is traversed in a single memory access.

Abstract: A flow control method and system including an algorithm for deciding to transmit an arriving packet into a processing queue or to discard it, or, in the case of instructions or packets that must not be discarded, a similar method and system for deciding at a service event to transmit an instruction or packet into a processing queue or to skip the service event. The transmit probability is increased or decreased in consideration of minimum and maximum limits for each flow, aggregate limits for sets of flows, relative priority among flows, queue occupancy, and rate of change of queue occupancy. The effects include protection of flows below their minimum rates, correction of flows above their maximum rates, and, for flows between minimum and maximum rates, reduction of constituent flows of an aggregate that is above its aggregate maximum. Practice of the invention results in low queue occupancy during steady congestion.

Abstract: A process control method and system including partitioning transmit decisions and certain measurements into one logical entity (Data Plane) and partitioning algorithm computation to update transmit probabilities into a second logical entity (Control Plane), the two entities periodically communicating fresh measurements from Data Plane to Control Plane and adjusted transmit probabilities from Control Plane to Data Plane. The transmit probability may be used in transmit/discard decisions of packets or instructions exercised at every arrival of a packet or instruction. In an alternative embodiment, the transmit probability may be used in transmit/delay decisions of awaiting instructions or packets exercised at every service event.

Abstract: A flow control method and system including an algorithm for deciding to transmit an arriving packet into a processing queue or to discard it, or, in the case of instructions or packets that must not be discarded, a similar method and system for deciding at a service event to transmit an instruction or packet into a processing queue or to skip the service event. The transmit probability is increased or decreased in consideration of minimum and maximum limits for each flow, aggregate limits for sets of flows, relative priority among flows, queue occupancy, and rate of change of queue occupancy. The effects include protection of flows below their minimum rates, correction of flows above their maximum rates, and, for flows between minimum and maximum rates, reduction of constituent flows of an aggregate that is above its aggregate maximum. Practice of the invention results in low queue occupancy during steady congestion.