Systems and Methods for Reverse Affinity Link Exclusion for Ultra-Reliable Low Latency Communication

    公开(公告)号:US20240064547A1

    公开(公告)日:2024-02-22

    申请号:US17820125

    申请日:2022-08-16

    CPC classification number: H04W24/10 H04W28/0236 H04W28/0247

    Abstract: A system of one embodiment provides reverse affinity link exclusion for a computer network. The system includes a memory and a processor. The memory is operable to store logical transmission links, logical receiving links, and metrics for data packets of nodes. The system determines a threshold value for node link reliability. The system determines the node link reliability of a receiving node link by evaluating data loss associated with one or more incoming data packets. The system compares the node link reliability to the threshold value. The system identifies the receiving node link when the node link reliability exceeds the threshold value. The system communicates the identified receiving node link to one or more nodes.

    VIRTUAL NETWORK FOR VIRTUAL PHONE APPLICATIONS
    503.
    发明公开

    公开(公告)号:US20240064101A1

    公开(公告)日:2024-02-22

    申请号:US17820448

    申请日:2022-08-17

    CPC classification number: H04L45/745 H04L45/44 H04L41/12

    Abstract: A device for a virtual phone in a virtual network may be provided. A data packet may be received by the device, the device being in a personal-area-network (PAN) with a peer, the data packet containing information defining a characteristic of a software application. The data packet may be profiled, the data packet comprising information about the software application. An SLA table stored on the device may be seeded with the information in the data packet. A routing table may be populated with an address for forwarding the information to the peer.

    Optimizing segment routing paths using segment identifiers

    公开(公告)号:US11909654B2

    公开(公告)日:2024-02-20

    申请号:US17859664

    申请日:2022-07-07

    Abstract: Techniques for optimizing segment routing (SR) paths using segment identifiers (SIDs) are disclosed, including determining a packet is to be sent from a first node to a second node of a network using an SR method. The techniques may also include determining a segment quantization factor that is representative of a first number of SIDs that are included in a segment quantization interval. Based at least in part on the segment quantization factor and a cost constraint, an SR path defined by a second number of SIDs to send the packet may be determined. The second number of SIDs may be associated with maximizing the SIDs included in individual ones of segment quantization intervals. The techniques further include modifying the packet to include at least the second number of SIDs and causing the packet to flow from the first node to the second node via the SR path.

    Multicast-only thin DODAG in low power and lossy network

    公开(公告)号:US11909543B2

    公开(公告)日:2024-02-20

    申请号:US17727348

    申请日:2022-04-22

    CPC classification number: H04L12/18 H04L45/16 H04L49/201 H04L65/611

    Abstract: In one embodiment, a method comprises: generating, by a constrained low power and lossy network (LLN) device that is localized within a subregion of an LLN, a thin destination oriented directed acyclic graph (DODAG) having up to a prescribed limit of attached LLN devices at each hop of the thin DODAG based on generating a DODAG information object (DIO) message specifying an instruction for limiting attachment at each hop of the thin DODAG to the prescribed limit; and causing, by the constrained LLN device, multicast-only transmissions via the thin DODAG based on inserting into the DIO message a multicast-only transmission mode via the thin DODAG and outputting the DIO message, the DIO message causing each neighboring LLN device to selectively attach to the constrained LLN device as an attached child LLN device based on the instruction and execute the multicast-only transmissions via the thin DODAG.

    Safely overwriting decided slots
    510.
    发明授权

    公开(公告)号:US11909528B2

    公开(公告)日:2024-02-20

    申请号:US17249535

    申请日:2021-03-04

    Abstract: Techniques are described for safely overwriting decided slots and in-order fault tolerant consensus logs for replicated services. Using techniques described herein, a broad class of already-existing consensus log protocols may be enhanced/extended to safely overwrite decided slots and provide in-order fault tolerant consensus logs. When changing to a different epoch of a consensus log, slots determined to be unreachable may be changed/deleted even if slots after the gap were decided. A sequencer protocol establishes distributed consensus among a group of services. The sequencer protocol provides in-order execution of messages from multiple clients, and flow control from within the sequencer protocol, without offloading de-duplicate and reorder (DDRO) logic to the application layer. Fault tolerance is provided by egress cursors and ingress cursors, which provide awareness of which specific messages from each client sender should be executed next, even if those messages are not presently in the consensus log.

Patent Agency Ranking