SYSTEM OF NETWORK SWITCHES
    1.
    发明申请

    公开(公告)号:US20250158938A1

    公开(公告)日:2025-05-15

    申请号:US18823261

    申请日:2024-09-03

    Applicant: NXP B.V.

    Abstract: A system comprising: a first and second network switch each comprising a plurality of ports for coupling to one or more devices; wherein the first and second network switches are communicably coupled; wherein the first network switch, based on receipt of a network frame at its ports, is configured to: process the network frame based on its content and a first rule set to determine network frame forwarding information for the network frame; add metadata to the network frame based on the result of said processing; forward the network frame with the added metadata to the second network switch; wherein the second network switch, based on receipt of the network frame, is configured to: read the metadata and process the network frame based on the network frame forwarding information as determined by the first network switch.

    Extending acceptable sequence range

    公开(公告)号:US11818053B2

    公开(公告)日:2023-11-14

    申请号:US17663867

    申请日:2022-05-18

    Applicant: NXP B.V.

    CPC classification number: H04L47/34 H04L47/32

    Abstract: A sequence recovery method executed by a node in a time-sensitive network, the method comprising receiving a packet having a sequence number, determining whether the sequence number is within a predetermined range of a reference sequence number, wherein the reference sequence number is a current latest sequence number accepted by the node, and wherein the predetermined range comprises a history range and a future range, wherein the history range has a length equal to a history length and includes the reference sequence number and a predetermined number of consecutive sequence numbers that are immediately earlier than the reference sequence number, and the future range has a length equal to a future length and defines a predetermined number of consecutive sequence numbers that are immediately later than the reference sequence number, wherein the future length is greater than the history length.

    Frame scheduling based on an estimated direct memory access (DMA) latency and apparatus for time aware frame scheduling

    公开(公告)号:US12267153B2

    公开(公告)日:2025-04-01

    申请号:US17660222

    申请日:2022-04-22

    Applicant: NXP B.V.

    Abstract: A network station scheduling a frame to be transmitted by a transmitter of the network station at a transmit time. The transmit time is based on a first clock. A request is then issued to a direct memory access (DMA) circuit to retrieve the frame from a system memory. An advance time offset associated with the first clock is determined based on an estimated DMA latency of the DMA circuit. A frame retrieved by the DMA circuit is provided to a staging circuit. When a time of a second clock reaches the transmit time of the frame in the staging circuit, the frame is transmitted at the transmit time. In an example, a time of the first clock is ahead of a time of the second clock by the advance time offset.

    COUNTING PACKET LOSS IN SEQUENCE RECOVERY METHOD

    公开(公告)号:US20220416947A1

    公开(公告)日:2022-12-29

    申请号:US17808189

    申请日:2022-06-22

    Applicant: NXP B.V.

    Abstract: A sequence recovery method is executed by a node in a time-sensitive network configured to transmit and receive packets The method includes providing a state variable, having a first state in which a packet loss counter is disabled, and a second state in which the packet loss counter is enabled. The packet loss counter can only be incremented to count lost packets when the loss state variable is in the second state. This method enhances the IEEE 802.1CB standard.

    EXTENDING ACCEPTABLE SEQUENCE RANGE

    公开(公告)号:US20220385588A1

    公开(公告)日:2022-12-01

    申请号:US17663867

    申请日:2022-05-18

    Applicant: NXP B.V.

    Abstract: A sequence recovery method executed by a node in a time-sensitive network, the method comprising receiving a packet having a sequence number, determining whether the sequence number is within a predetermined range of a reference sequence number, wherein the reference sequence number is a current latest sequence number accepted by the node, and wherein the predetermined range comprises a history range and a future range, wherein the history range has a length equal to a history length and includes the reference sequence number and a predetermined number of consecutive sequence numbers that are immediately earlier than the reference sequence number, and the future range has a length equal to a future length and defines a predetermined number of consecutive sequence numbers that are immediately later than the reference sequence number, wherein the future length is greater than the history length.

Patent Agency Ranking