MITIGATING CRC CALCULATIONS IN NETWORKS THAT UTILIZE SEGMENT ROUTING
    2.
    发明申请
    MITIGATING CRC CALCULATIONS IN NETWORKS THAT UTILIZE SEGMENT ROUTING 审中-公开
    减少网络中利用分段路由的CRC计算

    公开(公告)号:WO2017172681A1

    公开(公告)日:2017-10-05

    申请号:PCT/US2017/024416

    申请日:2017-03-28

    CPC classification number: H04L49/25 H04L1/0061 H04L45/34 H04L45/40 H04L45/66

    Abstract: 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.

    Abstract translation: 公开了用于减轻利用分段路由(SR)的网络中的CRC计算的系统,方法和手段。 可以在SR路径中的一些或全部中间目的地减轻CRC计算。 交换机可以接收包括分段列表的帧,该分段列表包括与分段路由(SR)路径中的交换机相关联的地址。 交换机可以读取帧的一部分以确定段列表是否包括与SR路径中的另一交换机相关联的地址。 如果段列表包括与SR路径中的另一个交换机相关联的地址,则可以修改段列表。 如果不是,则帧至少可以通过转发帧而不用重​​新计算循环冗余校验(CRC)值来以直通模式转发帧。

    TECHNIQUES FOR EXPOSING MAXIMUM NODE AND/OR LINK SEGMENT IDENTIFIER DEPTH UTILIZING IS-IS
    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

    CPC classification number: H04L45/34 H04L45/12 H04L45/42 H04L45/50

    Abstract: 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.

    Abstract translation: 描述了使用IS-IS公开最大节点和/或链路段标识符深度的技术。 分段路由(SR)网络中的网络元件传输包括最大段标识符深度(MSD)值的类型长度值(TLV)元素。 MSD值标识网络元件能够推入到所接收的分组的分组报头中以使得能够通过SR网络转发所接收的分组的最大数量的分段标识符(SID)标签。 网络元件从控制器接收要由网络元件用于通过SR网络转发所接收的分组的路径的数据。 数据包括一个或多个SID标签以便压入接收的数据包,并且SID标签包含小于或等于MSD值。 控制器和网元不使用南向接口上的路径计算元件协议(PCEP)。

    PATH SETUP IN A MESH NETWORK
    4.
    发明申请
    PATH SETUP IN A MESH NETWORK 审中-公开
    网路中的路径设置

    公开(公告)号:WO2016202381A1

    公开(公告)日:2016-12-22

    申请号:PCT/EP2015/063600

    申请日:2015-06-17

    Abstract: A path of relay nodes is set up in a mesh network (100) between a source node (102) and a destination node (104). During a phase of handling path request, PREQ, messages a cluster table is maintained in a node (123) and during a phase of handling path reply, PREP, messages this cluster table is utilized to establish node clusters (120) that comprise nodes that can relay subsequent messages between the source node (102) and the destination node (104).

    Abstract translation: 在源节点(102)和目的地节点(104)之间的网状网络(100)中建立中继节点的路径。 在处理路径请求的阶段期间,PREQ消息,在节点(123)中维护集群表,并且在处理路径应答阶段PREP,消息期间,利用该集群表来建立节点集群(120),节点集群(120)包括节点 可以中继源节点(102)和目的地节点(104)之间的后续消息。

    METHOD TO ROUTE PACKETS IN A DISTRIBUTED DIRECT INTERCONNECT NETWORK
    5.
    发明申请
    METHOD TO ROUTE PACKETS IN A DISTRIBUTED DIRECT INTERCONNECT NETWORK 审中-公开
    在分布式直接互联网络中路由分组的方法

    公开(公告)号:WO2015120539A8

    公开(公告)日:2016-08-11

    申请号:PCT/CA2015000081

    申请日:2015-02-13

    Abstract: 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.

    Abstract translation: 本发明提供了一种方法和装置,用于跨越具有低延迟,增加的吞吐量和业务分布的环形或更高基数拓扑来路由数据分组以避免热点开发。 公开了一种在分布式直接互连网络中从源节点到目的地节点路由分组的方法,包括以下步骤:发现所有节点和相关联的端口; 更新数据库以将节点和端口包括在网络拓扑中; 计算每个节点上每个输出端口到拓扑中每个其他节点的最短路径; 在源节点的输出端口将每个分组分段成flit; 当分组时,从源节点上的每个输出端口到目的地节点的最短路径分配所述飞行器使用虫洞切换,由此分组沿网络拓扑中的备选最大不相交路由分布; 并重新组合和重新排序目的地节点上的数据包,使数据包符合其原始顺序/格式。

    BIT INDEX EXPLICIT REPLICATION (BIER) FOR EFFICIENT ROUTING THROUGH A DESTINATION ORIENTED DIRECTED ACYCLIC GRAPH (DODAG) IN RESOURCE CONSTRAINED LOW-POWER AND LOSSY NETWORKS (LLNS)
    6.
    发明申请
    BIT INDEX EXPLICIT REPLICATION (BIER) FOR EFFICIENT ROUTING THROUGH A DESTINATION ORIENTED DIRECTED ACYCLIC GRAPH (DODAG) IN RESOURCE CONSTRAINED LOW-POWER AND LOSSY NETWORKS (LLNS) 审中-公开
    通过目标定向的方向图(图形)在资源约束的低功耗和损耗网络(LLNS)中进行有效路由的位置索引显示(BIER)

    公开(公告)号:WO2016081224A1

    公开(公告)日:2016-05-26

    申请号:PCT/US2015/059893

    申请日:2015-11-10

    Abstract: In one embodiment, a first node in a network receives one or more bitmaps from one or more child nodes of the first node according to a directed acyclic graph (DAG) as used by RPL, the IPv6 Routing Protocol for Low-power and lossy networks (LLNs). Each of the one or more child nodes is associated with a corresponding unique bit position in the one or more bitmaps. The first node stores, in a forwarding table, the one or more bitmaps received from the one or more child nodes of the first node. The first node receives a message that includes a destination bitmap that identifies one or more destinations of the message via one or more set bits at bit positions associated with the one or more child nodes. The first node forwards the message towards the identified one or more destinations based on the destination bitmap and the one or more bitmaps stored in the forwarding table of the first node. Aggregating node bitmaps by OR operation with the bitmaps of their children allows to spare resources in nodes of LLNs; forwarding to the destination can be easily performed via AND operation on bitmaps. Deciding unicast or broadcast forwarding based on the density of interested children saves energy by optimally avoiding awaking of nodes.

    Abstract translation: 在一个实施例中,网络中的第一节点根据由RPL使用的有向无环图(DAG)接收来自第一节点的一个或多个子节点的一个或多个位图,用于低功率和有损网络的IPv6路由协议 (LLN的)。 一个或多个子节点中的每一个与一个或多个位图中的对应唯一位位置相关联。 第一节点在转发表中存储从第一节点的一个或多个子节点接收的一个或多个位图。 第一节点接收消息,该消息包括目的地位图,其通过与一个或多个子节点相关联的位位置处的一个或多个设置位来标识消息的一个或多个目的地。 第一节点基于目的位图和存储在第一节点的转发表中的一个或多个位图将消息转发到所标识的一个或多个目的地。 通过OR操作与其子节点的位图聚合节点位图,可以在LLN节点中节省资源; 可以通过位图上的AND操作轻松地执行到目的地的转发。 基于感兴趣的孩子的密度决定单播或广播转发通过最佳地避免节点的唤醒来节省能量。

    METHOD AND APPARATUS FOR SCALABLE CONTENT ROUTING AND MOBILITY IN NAMED DATA NETWORKS
    7.
    发明申请
    METHOD AND APPARATUS FOR SCALABLE CONTENT ROUTING AND MOBILITY IN NAMED DATA NETWORKS 审中-公开
    用于可扩展内容路由的方法和装置和命名数据网络中的移动性

    公开(公告)号:WO2015101362A1

    公开(公告)日:2015-07-09

    申请号:PCT/CN2015/073499

    申请日:2015-03-02

    Abstract: Various disclosed embodiments include methods, systems, and computer-readable media for named data network (NDN) inter/intra-domain mobility. A complete de-coupling of identity and addressing space is established. This provides separation of control and forwarding allowing rich policy based routing, using SDN principles, as well as policy based global resolution. In one embodiment, the de-coupling of identity from location is achieved by a changeable forwarding label field in a header that can have nodal/domain/global scope. This disclosure provides content routing/mobility to be handled with a high degree of flexibility. This disclosure also provides mobility as a service for a component of a name space.

    Abstract translation: 各种公开的实施例包括用于命名数据​​网络(NDN)域间/域内移动性的方法,系统和计算机可读介质。 建立了身份和寻址空间的完全去耦合。 这提供了分离控制和转发,允许基于策略的路由,使用SDN原则以及基于策略的全局分辨率。 在一个实施例中,通过头部中可以具有节点/域/全局范围的可变转发标签字段来实现身份从位置的去耦合。 本公开提供了以高度灵活性处理的内容路由/移动性。 本公开还提供了作为名称空间的组件的服务的移动性。

    SWITCH CLUSTERS HAVING LAYER-3 DISTRIBUTED ROUTER FUNCTIONALITY
    9.
    发明申请
    SWITCH CLUSTERS HAVING LAYER-3 DISTRIBUTED ROUTER FUNCTIONALITY 审中-公开
    具有层3分布式路由器功能的交换机集群

    公开(公告)号:WO2015019530A1

    公开(公告)日:2015-02-12

    申请号:PCT/JP2014/003096

    申请日:2014-06-10

    Abstract: According to one embodiment, Layer-3 (L3) distributed router functionality is provided to a switch cluster by receiving an address resolution protocol (ARP) request packet from a first host at an entry switch in a switch cluster, a switch controller being in communication with the entry switch, and the ARP request packet including a virtual router IP address of the switch controller as a target, forwarding the ARP request packet to the switch controller after adding a header that adheres to a communication protocol used by the switch controller, receiving an ARP response packet from the switch controller indicating: a source IP address corresponding to a virtual router of the switch controller and a SMAC corresponding to the switch controller, forwarding the ARP response packet to the first host after stripping the communication protocol header, and setting the virtual router as a default gateway for traffic received from the first host.

    Abstract translation: 根据一个实施例,通过在交换机集群中的入口交换机处接收来自第一主机的地址解析协议(ARP)请求分组,将交换机集群中的层3(L3)分布式路由器功能提供给交换机集群,交换机控制器处于通信 通过入口交换机和包含交换机控制器的虚拟路由器IP地址的ARP请求报文作为目标,在添加了与交换机控制器使用的通信协议相关的报头后,将ARP请求报文转发给交换机控制器,接收 来自交换机控制器的ARP响应报文,指示对应于交换机控制器的虚拟路由器的源IP地址和对应于交换机控制器的SMAC,剥离通信协议报头后将ARP响应报文转发给第一主机,并设置 虚拟路由器作为从第一个主机接收的流量的默认网关。

    SOURCE ROUTING WITH FABRIC SWITCHES IN AN ETHERNET FABRIC NETWORK
    10.
    发明申请
    SOURCE ROUTING WITH FABRIC SWITCHES IN AN ETHERNET FABRIC NETWORK 审中-公开
    使用以太网织物网络中的织物开关的源路由

    公开(公告)号:WO2014132149A1

    公开(公告)日:2014-09-04

    申请号:PCT/IB2014/058659

    申请日:2014-01-30

    Abstract: In one embodiment, a system includes a network fabric having a plurality of fabric switches interconnected in the network fabric and a switch controller having logic adapted to configure the network fabric, determine one or more paths through the network fabric between any two hosts connected thereto, and create a source-routing table to store the one or more paths through the network fabric between any two hosts connected thereto. In another embodiment, a method includes receiving or creating a packet using a NIC of a host connected to a network fabric having a plurality of fabric switches interconnected therein, determining a path through the network fabric by consulting a source-routing table stored to the host, storing source-routing information to a packet header for the packet, the source- routing information including the path, and sending the packet to a first device or hop indicated by the path in the source-routing information.

    Abstract translation: 在一个实施例中,系统包括网络结构,所述网络结构具有在所述网络结构中互连的多个结构交换机,以及具有适于配置所述网络结构的逻辑的交换机控制器,确定与其连接的任何两个主机之间的所述网络结构的一个或多个路径, 并创建源路由表以存储通过网络结构在连接到其之间的任何两个主机之间的一个或多个路径。 在另一个实施例中,一种方法包括使用连接到具有互连在其中的多个结构交换机的网络结构的主机的NIC来接收或创建分组,通过参考存储到主机的源路由表来确定通过网络结构的路径 将源路由信息存储到分组的分组报头,源路由信息包括路径,并将分组发送到源路由信息中由路径指示的第一设备或跳。

Patent Agency Ranking