会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • MITIGATING CRC CALCULATIONS IN NETWORKS THAT UTILIZE SEGMENT ROUTING
    • 减少网络中利用分段路由的CRC计算
    • WO2017172681A1
    • 2017-10-05
    • PCT/US2017/024416
    • 2017-03-28
    • IDAC HOLDINGS, INC.
    • PERRAS, MichelleCOMINARDI, LucaGAZDA, Robert, G.MOURAD, Alain
    • H04L12/947H04L12/721
    • H04L49/25H04L1/0061H04L45/34H04L45/40H04L45/66
    • Systems, methods, and instrumentalities are disclosed for mitigating CRC calculations in networks that utilize segment routing (SR). CRC calculations may be mitigated at some or all intermediate destinations in an SR path. A switch may receive a frame comprising a segment list comprising an address associated with a switch in a segment routing (SR) path. The switch may read a portion of the frame to determine if the segment list comprises an address associated with another switch in the SR path. If the segment list comprises an address associated with another switch in the SR path, the segment list may be modified. If not, the frame may be forwarded in a cut-through mode at least by forwarding the frame without recalculating a cyclic redundancy check (CRC) value.
    • 公开了用于减轻利用分段路由(SR)的网络中的CRC计算的系统,方法和手段。 可以在SR路径中的一些或全部中间目的地减轻CRC计算。 交换机可以接收包括分段列表的帧,该分段列表包括与分段路由(SR)路径中的交换机相关联的地址。 交换机可以读取帧的一部分以确定段列表是否包括与SR路径中的另一交换机相关联的地址。 如果段列表包括与SR路径中的另一个交换机相关联的地址,则可以修改段列表。 如果不是,则帧至少可以通过转发帧而不用重​​新计算循环冗余校验(CRC)值来以直通模式转发帧。
    • 3. 发明申请
    • TECHNIQUES FOR EXPOSING MAXIMUM NODE AND/OR LINK SEGMENT IDENTIFIER DEPTH UTILIZING IS-IS
    • 使用IS-IS暴露最大节点和/或链接分段标识符深度的技术
    • WO2017141081A1
    • 2017-08-24
    • PCT/IB2016/051892
    • 2016-04-01
    • TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    • TANTSURA, EvgenyCHUNDURI, Uma S.
    • H04L12/721H04L12/717H04L12/723
    • H04L45/34H04L45/12H04L45/42H04L45/50
    • Techniques for exposing maximum node and/or link segment identifier depth using IS-IS are described. A network element in a Segment Routing (SR) network transmits a Type Length Value (TLV) element including a Maximum Segment Identifier Depth (MSD) value. The MSD value identifies a maximum number of segment identifier (SID) labels that the network element is able to push into packet headers of received packets to enable forwarding of the received packets through the SR network. The network element receives, from a controller, data for a path to be utilized by the network element for forwarding the received packets through the SR network. The data includes one or more SID labels to be pushed into the received packets, and the SID labels include fewer than or equal to the MSD value. The controller and the network element do not utilize the Path Computation Element Protocol (PCEP) over a southbound interface.
    • 描述了使用IS-IS公开最大节点和/或链路段标识符深度的技术。 分段路由(SR)网络中的网络元件传输包括最大段标识符深度(MSD)值的类型长度值(TLV)元素。 MSD值标识网络元件能够推入到所接收的分组的分组报头中以使得能够通过SR网络转发所接收的分组的最大数量的分段标识符(SID)标签。 网络元件从控制器接收要由网络元件用于通过SR网络转发所接收的分组的路径的数据。 数据包括一个或多个SID标签以便压入接收的数据包,并且SID标签包含小于或等于MSD值。 控制器和网元不使用南向接口上的路径计算元件协议(PCEP)。
    • 5. 发明申请
    • METHOD TO ROUTE PACKETS IN A DISTRIBUTED DIRECT INTERCONNECT NETWORK
    • 在分布式直接互联网络中路由分组的方法
    • WO2015120539A8
    • 2016-08-11
    • PCT/CA2015000081
    • 2015-02-13
    • ROCKPORT NETWORKS INC
    • OPREA DANCATANA ANDREINEUSTADTER UDO
    • H04L12/733H04L12/751H04L12/863H04L12/951
    • H04L45/24H04L45/12H04L45/26H04L45/34H04L45/40H04L47/6225
    • The present invention provides a method and apparatus to route data packets across a torus or higher radix topology that has low latency, increased throughput and traffic distribution to avoid hot spots development. Disclosed is a method of routing packets in a distributed direct interconnect network from a source node to a destination node comprising the steps of: discovering all nodes and associated ports; updating the database to include the nodes and ports in the network topology; calculating the shortest path from every output port on each node to every other node in the topology; segmenting each packet into flits at the output port of the source node; as the flits are segmented, distributing said flits along the shortest path from each output port on the source node to the destination node using wormhole switching, whereby the packets are distributed along alternate maximum disjoint routes in the network topology; and re-assembling and re-ordering the packets at the destination node so that the packets accord with their original order/form.
    • 本发明提供了一种方法和装置,用于跨越具有低延迟,增加的吞吐量和业务分布的环形或更高基数拓扑来路由数据分组以避免热点开发。 公开了一种在分布式直接互连网络中从源节点到目的地节点路由分组的方法,包括以下步骤:发现所有节点和相关联的端口; 更新数据库以将节点和端口包括在网络拓扑中; 计算每个节点上每个输出端口到拓扑中每个其他节点的最短路径; 在源节点的输出端口将每个分组分段成flit; 当分组时,从源节点上的每个输出端口到目的地节点的最短路径分配所述飞行器使用虫洞切换,由此分组沿网络拓扑中的备选最大不相交路由分布; 并重新组合和重新排序目的地节点上的数据包,使数据包符合其原始顺序/格式。