利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

833 条记录 (耗时 0.029 秒)

    Minimal SID depth for ring topologies in Segment Routing via a PCE and Flex-Algo
    2.
    发明公开
    Minimal SID depth for ring topologies in Segment Routing via a PCE and Flex-Algo 审中-公开

    公开(公告)号：US20240340241A1

    公开(公告)日：2024-10-10

    申请号：US18131210

    申请日：2023-04-05

    申请人： Ciena Corporation

    发明人： Cengiz Alaettinoglu ,  Amal Karboubi

    IPC分类号： H04L47/125 ,  H04L45/00 ,  H04L47/10

    CPC分类号： H04L47/125 ,  H04L45/34 ,  H04L47/13

    摘要： Systems and methods, associated with a Segment Routing network including a plurality of nodes in a ring, include defining a first Flexible Algorithm having one or more first constraints for links in the ring to force traffic to flow in a first direction around the ring; and defining a second Flexible Algorithm having one or more second constraints for of the links in the ring to force traffic to flow in a second direction around the ring. A Path Computation Engine (PCE) is configured to group links on the computed path to the one or more rings, for each ring, determine a direction on an associated ring and assign the grouped links on the associated ring with a Flex-Algo SID for a final node in the determined direction, and provide a SID list that includes the Flex-Algo SIDs for the one or more rings, to a source node in a Segment Routing network.

    Memory-efficient technique for weighted round-robin load balancing
    8.
    发明授权
    Memory-efficient technique for weighted round-robin load balancing 有权

    公开(公告)号：US12063159B2

    公开(公告)日：2024-08-13

    申请号：US17307053

    申请日：2021-05-04

    申请人： RED HAT, INC.

    发明人： Julien Viet ,  Thomas Segismont

    IPC分类号： H04L47/62 ,  H04L47/125

    CPC分类号： H04L47/125 ,  H04L47/6225 ,  H04L47/623

    摘要： A memory-efficient technique for performing weighted round-robin load balancing in a distributed computing system is described. In one example of the present disclosure, a system can determine an offset to apply to a list of node identifiers based on a counter value. The system can select a subset of node identifiers from the list of node identifiers based on the offset. The system can then select a node identifier from the subset of node identifiers based on the counter value and a length of the subset of node identifiers. The system can transmit data to a node that corresponds to the node identifier and increment the counter value. The system can repeat this process any number of times to distribute data among a group of nodes in the distributed computing system.

    Technologies for quality of service based throttling in fabric architectures
    9.
    发明授权
    Technologies for quality of service based throttling in fabric architectures 有权

    公开(公告)号：US12058036B2

    公开(公告)日：2024-08-06

    申请号：US17746677

    申请日：2022-05-17

    申请人： Intel Corporation

    发明人： Francesc Guim Bernat ,  Karthik Kumar ,  Thomas Willhalm ,  Raj Ramanujan ,  Brian Slechta

    IPC分类号： H04L45/302 ,  H04L47/125 ,  H04L47/26 ,  H04L49/10 ,  H04L49/20

    CPC分类号： H04L45/302 ,  H04L47/125 ,  H04L47/26 ,  H04L49/10 ,  H04L49/205

    摘要： Technologies for quality of service based throttling in a fabric architecture include a network node of a plurality of network nodes interconnected across the fabric architecture via an interconnect fabric. The network node includes a host fabric interface (HFI) configured to facilitate the transmission of data to/from the network node, monitor quality of service levels of resources of the network node used to process and transmit the data, and detect a throttling condition based on a result of the monitored quality of service levels. The HFI is further configured to generate and transmit a throttling message to one or more of the interconnected network nodes in response to having detected a throttling condition. The HFI is additionally configured to receive a throttling message from another of the network nodes and perform a throttling action on one or more of the resources based on the received throttling message. Other embodiments are described herein.