Abstract: Systems and methods for enabling Bidirectional Forwarding Detection (BFD) over a selected reverse path are provided. A process, according to one implementation, include sending an echo request in a forward direction from an initiator node to a reflector node. For example, the initiator node and reflector node may be configured to operate in a network having no or different centralized controller that manages both the initiator node and reflector node. The echo request may be sent to the reflector node to discover a reverse path in a reverse direction from the reflector node to the initiator node. Also, the reverse path is discovered for the purpose of initiating a Bidirectional Forwarding Detection (BFD) or Multi-Protocol Label Switching (MPLS) Ping procedure.

Abstract: Systems and methods for monitoring the continuity between endpoints in a network are provided. A process, according to one implementation, includes entering a first list of one or more Segment Identifiers (SIDs) into a Bidirectional Forwarding Detection (BFD) request packet, the first list of one or more SIDs defining a Segment-Routing Traffic-Engineering (SR-TE) forward path from a source node to a destination node. The process also includes entering a second list of one or more SIDs into the BFD request packet, the second list of one or more SIDs defining an SR-TE reverse path back from the destination node that eliminates involvement of a BFD reflector of the destination node. Also, the process includes entering a revised-BFD request into the BFD request packet, the revised-BFD request having a Your Discriminator field set to a discriminator value associated with the source node.

Abstract: Systems and methods for performing connectivity checks, such as Seamless Bidirectional Forwarding Detection (S-BFD), are provided. A method, according to one implementation, includes receiving, at a responding node, an entry configured to call for a modification of an identification element (from an old identifier value to a new identifier value) used for identifying the responding node with respect to other nodes of a network. The old and new identifier values are cached in a memory device. Also, the method includes providing a reply packet back to an initiating node in response to receipt of a request packet from the initiating node. The request packet is related to a connectivity check for testing the connectivity between the initiating node and the responding node. In addition, the request packet is able to identify the responding node by either the old identifier value or the new identifier value.

Abstract: Systems and methods for enabling Bidirectional Forwarding Detection (BFD) over a selected reverse path are provided. A process, according to one implementation, include sending an echo request in a forward direction from an initiator node to a reflector node. For example, the initiator node and reflector node may be configured to operate in a network having no or different centralized controller that manages both the initiator node and reflector node. The echo request may be sent to the reflector node to discover a reverse path in a reverse direction from the reflector node to the initiator node. Also, the reverse path is discovered for the purpose of initiating a Bidirectional Forwarding Detection (BFD) or Multi-Protocol Label Switching (MPLS) Ping procedure.

Abstract: Systems and methods for incorporating a new channel-type value in the header of a Generic Associated Channel (G-ACh) for Connectivity Fault Management (CFM) Layer-2 packets over Multi-Protocol Label Switching (MPLS) networks are provided. The channel-type value of the G-ACh header may be used for identification of the network-generated CFM Layer-2 packets. In one implementation, a system may include a processing device and a memory device, where the memory device may be configured to store instructions that, when executed, cause the processing device to obtain a Connectivity Fault Management (CFM) packet, encapsulate the CFM packet with Pseudo-Wire (PW) and Label-Switched Path (LSP) labels to create an expanded packet, and incorporate a specific channel-type value in a G-ACh header of the expanded packet to uniquely identify the CFM packet.

Abstract: Systems and methods for incorporating a new channel-type value in the header of a Generic Associated Channel (G-ACh) for Connectivity Fault Management (CFM) Layer-2 packets over Multi-Protocol Label Switching (MPLS) networks are provided. The channel-type value of the G-ACh header may be used for identification of the network-generated CFM Layer-2 packets. In one implementation, a system may include a processing device and a memory device, where the memory device may be configured to store instructions that, when executed, cause the processing device to obtain a Connectivity Fault Management (CFM) packet, encapsulate the CFM packet with Pseudo-Wire (PW) and Label-Switched Path (LSP) labels to create an expanded packet, and incorporate a specific channel-type value in a G-ACh header of the expanded packet to uniquely identify the CFM packet.

Abstract: Service availability determination systems and methods include determining availability of a packet service in a Maintenance Interval (MI) based on frame loss measurements in short intervals ?t and marking each ?t as available or unavailable based on the frame loss measurements and an associated Frame Loss Ratio (FLR) threshold, wherein each ?t is a High Loss interval (HLI) when exceeding the FLR threshold; utilizing a sliding window of size n, n being an integer, to determine whether the packet service is available or unavailable; and utilizing an extension period after an end of the MI with the sliding window to ensure all ?t's in the MI are marked as available or unavailable.

Abstract: Service availability determination systems and methods include determining availability of a packet service in a Maintenance Interval (MI) based on frame loss measurements in short intervals ?t and marking each ?t as available or unavailable based on the frame loss measurements and an associated Frame Loss Ratio (FLR) threshold, wherein each ?t is a High Loss interval (HLI) when exceeding the FLR threshold; utilizing a sliding window of size n, n being an integer, to determine whether the packet service is available or unavailable; and utilizing an extension period after an end of the MI with the sliding window to ensure all ?t' s in the MI are marked as available or unavailable.

Abstract: An aftertreatment system comprises a first bank to receive a first portion of an exhaust gas and a second bank to receive a second portion of the exhaust gas. A first reductant insertion assembly is fluidly coupled to the first bank and a parent controller is communicatively coupled thereto. A second reductant insertion assembly is fluidly coupled to the second bank and a first child controller is communicatively coupled thereto. A third reductant insertion assembly is fluidly coupled to the first bank and a second child controller is communicatively coupled thereto. The parent controller instructs the first reductant insertion assembly to insert reductant into the first bank. The parent controller also instructs the first child controller to command the second reductant insertion assembly to insert reductant into the second bank, and instructs the second child controller to command the third reductant insertion assembly to insert reductant into the first bank.

Abstract: Text output of speech recognition engines tend to be erroneous when spoken data has domain specific terms. The present disclosure facilitates automatic correction of errors in speech to text conversion using abstractions of evolutionary development and artificial development. The words in a speech recognition engine text output are treated as a set of injured genes in a biological cell that need repair which are then repaired and form genotypes that are then repaired to phenotypes through a series of repair steps based on a matching, mapping and linguistic repair through a fitness criteria. A basic genetic level repair involves phonetic MATCHING function together with a FITNESS function to select the best among the matching genes. A second genetic level repair involves a contextual MAPPING function for repairing remaining ‘injured’ genes of the speech recognition engine output. Finally, a genotype to phenotype repair involves using linguistic rules and semantic rules of the domain.

Abstract: An embodiment herein a method for fast reading of a signal database is provided. The method includes the steps of: (i) obtaining changes in the control signal value corresponds to the one or more signals from the signal database; (ii) grouping each of the one or more signals into the signal group based on the interface that the one or more signals belongs to; (iii) analyzing the control signal value to determine the one or more active cycles and the one or more dead cycles associated with the signal group; (vi) obtaining the one or more clock edge samples from any of (a) the positive edges of the clock signal or (b) the negative edges of the clock signal or (c) both the positive edges and the negative edges of the clock signal; and (v) processing each of the one or more active cycles corresponding to the signal group in parallel to optimize the reading of the signal database.

Abstract: Text output of speech recognition engines tend to be erroneous when spoken data has domain specific terms. The present disclosure facilitates automatic correction of errors in speech to text conversion using abstractions of evolutionary development and artificial development. The words in a speech recognition engine text output are treated as a set of injured genes in a biological cell that need repair which are then repaired and form genotypes that are then repaired to phenotypes through a series of repair steps based on a matching, mapping and linguistic repair through a fitness criteria. A basic genetic level repair involves phonetic MATCHING function together with a FITNESS function to select the best among the matching genes. A second genetic level repair involves a contextual MAPPING function for repairing remaining ‘injured’ genes of the speech recognition engine output. Finally, a genotype to phenotype repair involves using linguistic rules and semantic rules of the domain.

Abstract: A method of analyzing behavior of a device under test includes obtaining event traces that include a current sequence trace and a reference sequence trace. The event traces include one or more transactions that include one or more properties. A list of relevant properties of one or more transactions is obtained. A first set of n-tuples including values of the relevant properties for the current sequence trace is extracted. A second set of n-tuples including values of the relevant properties for the reference sequence trace is extracted. The first set of n-tuples is compared with the second set of n-tuples to indicate one or more transaction indices corresponding to differences in transactions between the current sequence trace and the reference sequence trace. Transactions corresponding to the transaction indices are annotated to obtain annotated transactions. The current sequence trace and/or the reference sequence trace are displayed with the annotated transactions.

Abstract: An aftertreatment system comprises a first bank to receive a first portion of an exhaust gas and a second bank to receive a second portion of the exhaust gas. A first reductant insertion assembly is fluidly coupled to the first bank and a parent controller is communicatively coupled thereto. A second reductant insertion assembly is fluidly coupled to the second bank and a first child controller is communicatively coupled thereto. A third reductant insertion assembly is fluidly coupled to the first bank and a second child controller is communicatively coupled thereto. The parent controller instructs the first reductant insertion assembly to insert reductant into the first bank. The parent controller also instructs the first child controller to command the second reductant insertion assembly to insert reductant into the second bank, and instructs the second child controller to command the third reductant insertion assembly to insert reductant into the first bank.

Abstract: A system and method for extracting protocol information from a simulated or emulated design to analyze system behavior is disclosed. The system includes a database, a signal extraction module, a signal processing module, a protocol parsing module, a multi-level protocol parsing module, a protocol rule description table, a display module, an extracted protocol information table, and a debug automation module. The signal extraction module extracts signal level information to generate stream of bits. The protocol parsing module applies BNF grammar rules on stream of bits to generate lower level protocol information. The multi-level parsing module constructs a multiple hierarchy levels of protocol information by creating a tree structure based on a lower level protocol. The higher level protocol information determines operations. The higher level protocol information and the operations are associated with a protocol pattern which is being parsed.

Abstract: A method of analyzing behavior of a device under test includes obtaining event traces that include a current sequence trace and a reference sequence trace. The event traces include one or more transactions that include one or more properties. A list of relevant properties of one or more transactions is obtained. A first set of n-tuples including values of the relevant properties for the current sequence trace is extracted. A second set of n-tuples including values of the relevant properties for the reference sequence trace is extracted. The first set of n-tuples is compared with the second set of n-tuples to indicate one or more transaction indices corresponding to differences in transactions between the current sequence trace and the reference sequence trace. Transactions corresponding to the transaction indices are annotated to obtain annotated transactions. The current sequence trace and/or the reference sequence trace are displayed with the annotated transactions.

Abstract: A scheduler provided according to an aspect of the present invention provides higher priority for data units in a low priority queue upon occurrence of a starvation condition, and to packets in a high priority queue otherwise. The scheduler permits retransmission of a data unit in the lower priority queue when in the starvation condition, but clears the starvation condition when the data unit is retransmitted a pre-specified number of times. As a result, the data units in the higher priority queue would continue to be processed, thereby avoiding a deadlock at least in certain situations.

Abstract: A digital processing system employing multiple arbiters, all designed to allocate a resource to a same entity in response to a same condition. In an embodiment, the entities needing the resource may send a request to all the arbiters, and the specific entity to which the resource is allocated, receives indication of the allocation from a closest one of the arbiters. As a result, the latency in receipt of indication of allocation may be reduced. The features are described in the context of a bus as a resource.

Abstract: A scheduler provided according to an aspect of the present invention provides higher priority for data units in a low priority queue upon occurrence of a starvation condition, and to packets in a high priority queue otherwise. The scheduler permits retransmission of a data unit in the lower priority queue when in the starvation condition, but clears the starvation condition when the data unit is retransmitted a pre-specified number of times. As a result, the data units in the higher priority queue would continue to be processed, thereby avoiding a deadlock at least in certain situations.

Abstract: A digital processing system employing multiple arbiters, all designed to allocate a resource to a same entity in response to a same condition. In an embodiment, the entities needing the resource may send a request to all the arbiters, and the specific entity to which the resource is allocated, receives indication of the allocation from a closest one of the arbiters. As a result, the latency in receipt of indication of allocation may be reduced. The features are described in the context of a bus as a resource.