SCALABLE DETERMINISTIC SERVICES IN PACKET NETWORKS

    公开(公告)号:US20210250301A1

    公开(公告)日:2021-08-12

    申请号:US16788765

    申请日:2020-02-12

    Abstract: Various example embodiments for supporting scalable deterministic services in packet networks are presented. Various example embodiments for supporting scalable deterministic services in packet networks may be configured to support delay guarantees (e.g., finite end-to-end delay bounds) for a class of traffic flows referred to as guaranteed-delay (GD) traffic flows. Various example embodiments for supporting scalable deterministic services in packet networks may be configured to support delay guarantees for GD traffic flows of a network based on a queuing arrangement that is based on network outputs of the network, a packet scheduling method that is configured to support scheduling of packets of the GD traffic flows, and a service rate allocation rule configured to support delay guarantees for the GD traffic flows.

    APPLICATION-BASED QUEUE MANAGEMENT
    12.
    发明申请

    公开(公告)号:US20210112006A1

    公开(公告)日:2021-04-15

    申请号:US16599592

    申请日:2019-10-11

    Abstract: Various example embodiments for supporting queue management in communication systems are presented. Various example embodiments for supporting queue management in communication systems may be configured to support application-based queue management. Various example embodiments for supporting application-based queue management may be configured to support application-based congestion control. Various example embodiments for supporting application-based congestion control may be configured to support application-based congestion control based on use of trigger templates.

    UNIVERSAL HIERARCHICAL SHAPER FOR NETWORK DETERMINISM IN GENERIC NETWORK TOPOLOGIES

    公开(公告)号:US20250112867A1

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

    申请号:US18478298

    申请日:2023-09-29

    Abstract: A scheduling controller configured to control a network having ingress nodes, interior nodes, and egress nodes, including: a network interface configured to communicate with the network; a memory; and a processor coupled to the memory and the network interface, wherein the processor is further configured to: define a traffic shaping hierarchy with a first level having a first traffic shaper associated with an ingress link between an ingress node and an interior node and a second level with a plurality of second traffic shapers associated with each path of a plurality of paths between the ingress link and the egress nodes; determine, each time a service assignment is due, which of the plurality of paths associated with the ingress link to service, based upon which of the plurality of paths has a lowest eligible finishing potential and wherein each link in the path has an eligible finishing potential; and determine, for the determined path, which of the packet queues associated with the network flows that are routed through the path to service, based upon which of the plurality of queues has a lowest eligible finishing potential.

    Protocol agnostic cognitive congestion control

    公开(公告)号:US12199872B2

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

    申请号:US18083768

    申请日:2022-12-19

    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.

    Packet queuing
    15.
    发明授权

    公开(公告)号:US11240169B2

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

    申请号:US16051097

    申请日:2018-07-31

    Abstract: Various example embodiments relate generally to supporting queuing of packets in a communication network. Various example embodiments for supporting queuing of packets in a communication network may be configured to support queueing of packets based on a packet queuing memory space including a hash entry space configured to maintain a set of H hash entries and a packet queue space configured to maintain a set of Q packet queues, wherein H is greater than Q. Various example embodiments for supporting queuing of packets in a communication network may be configured to support queueing of packets in a manner for handling packet events (e.g., packet arrival events, packet departure events, or the like) while preventing or mitigating queue collisions of hash entries (where a queue collision occurs when multiple hash entries, and the respective network flows of those hash entries, are associated with a single packet queue).

    PACKET QUEUING
    16.
    发明申请
    PACKET QUEUING 审中-公开

    公开(公告)号:US20200044980A1

    公开(公告)日:2020-02-06

    申请号:US16051097

    申请日:2018-07-31

    Abstract: Various example embodiments relate generally to supporting queuing of packets in a communication network. Various example embodiments for supporting queuing of packets in a communication network may be configured to support queueing of packets based on a packet queuing memory space including a hash entry space configured to maintain a set of H hash entries and a packet queue space configured to maintain a set of Q packet queues, wherein H is greater than Q. Various example embodiments for supporting queuing of packets in a communication network may be configured to support queueing of packets in a manner for handling packet events (e.g., packet arrival events, packet departure events, or the like) while preventing or mitigating queue collisions of hash entries (where a queue collision occurs when multiple hash entries, and the respective network flows of those hash entries, are associated with a single packet queue).

Patent Agency Ranking