DYNAMIC NODE CLUSTER DISCOVERY IN AN UNKNOWN TOPOLOGY GRAPH

    公开(公告)号:US20220272021A1

    公开(公告)日:2022-08-25

    申请号:US17184073

    申请日:2021-02-24

    Abstract: Various example embodiments for supporting dynamic node cluster discovery in a communication network are presented. Various example embodiments for supporting dynamic node cluster discovery in a communication network may be configured to support dynamic node cluster discovery based on circulation of discovery messages within the communication network. Various example embodiments for supporting dynamic node cluster discovery based on the circulation of discovery messages within the communication network may be configured to support dynamic node cluster discovery based on probabilistic forwarding of discovery messages within the communication network. Various example embodiments for supporting dynamic node cluster discovery based on the circulation of discovery messages within the communication network may be configured to support dynamic node cluster discovery based on updating and forwarding of discovery messages within the communication network. Various example embodiments for supporting dynamic node cluster discovery in a communication network may be configured to support dynamic, multi-level node cluster discovery.

    PROTOCOL AGNOSTIC COGNITIVE CONGESTION CONTROL

    公开(公告)号:US20240205155A1

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

    申请号:US18083768

    申请日:2022-12-19

    CPC classification number: H04L47/12 H04L47/25 H04L47/50 H04L69/321 H04L69/325

    Abstract: Various example embodiments for supporting congestion control in a communication network are presented. Various example embodiments for supporting congestion control in a communication network may be configured to support protocol agnostic cognitive congestion control in the communication network. Various example embodiments for supporting protocol agnostic cognitive congestion control in a communication network may be configured to support protocol agnostic cognitive congestion control in the communication network by enabling a sending node of a path over which a set of flows is to be communicated to determine the minimum target transmission rate among the links along the path over which the flows are to be communicated and to use the minimum target transmission rate among the links along the path over which flows are to be communicated in order to control transmission of packets over the path at Layer 3 of the Open Systems Interconnection (OSI) model.

    Multi-tier deterministic networking

    公开(公告)号:US11575599B2

    公开(公告)日:2023-02-07

    申请号:US17184108

    申请日:2021-02-24

    Abstract: Various example embodiments for supporting multi-tier deterministic networking are presented. Various example embodiments for supporting multi-tier deterministic networking may be configured to support provisioning of deterministic flows in multi-tier deterministic networking. Various example embodiments for supporting multi-tier deterministic networking may be configured to support adaptive deterministic routing in multi-tier deterministic networks. Various example embodiments for supporting multi-tier deterministic networking may be configured to support score-based deterministic routing in multi-tier deterministic networks. Various example embodiments for supporting multi-tier deterministic networking may be configured to support adaptive deterministic routing and/or score-based deterministic routing in multi-tier deterministic networks based on analysis of a state representation for path and/or sub-path selection in multi-tier deterministic networks. Various example embodiments for supporting multi-tier deterministic networking may be configured to support hierarchical resource allocation and deallocation in multi-tier deterministic networking, optimal route finding in multi-tier deterministic networking, and so forth.

    Cluster Oriented Dynamic Routing
    15.
    发明申请

    公开(公告)号:US20210021512A1

    公开(公告)日:2021-01-21

    申请号:US16515232

    申请日:2019-07-18

    Abstract: A method for routing traffic between a source node and a destination node in a network comprises: identifying a first group level at which a source group vector and a destination group vector differ; obtaining one or more first route segments between a first source group and a first destination group at the first group level; computing an end-to-end route between the source node and the destination node based on at least the one or more first route segments; and routing traffic between the source node and the destination node on the end-to-end route.

Patent Agency Ranking