FORWARDING OF PACKETS BASED ON A FILTERED FORWARDING INFORMATION BASE
    31.
    发明申请
    FORWARDING OF PACKETS BASED ON A FILTERED FORWARDING INFORMATION BASE 审中-公开
    基于过滤的前向信息库转发分组

    公开(公告)号:WO2011041442A1

    公开(公告)日:2011-04-07

    申请号:PCT/US2010/050760

    申请日:2010-09-29

    CPC classification number: H04L45/00 H04L45/02 H04L45/54

    Abstract: A filtered Forwarding Information Base (FIB) (the "complete local FIB") is used to determine how to forward packets, typically on line cards. The complete local FIB is generated by filtering (i.e., dropping or removing) extraneous entries in the standard global FIB of a router. This smaller FIB is then installed within the memory of a forwarding engine, possibly implemented as a single application-specific integrated circuit (ASIC), for use in determining how to forward packets, with the router forwarding packets accordingly.

    Abstract translation: 过滤的转发信息库(FIB)(“完整本地FIB”)用于确定如何转发数据包,通常在线路卡上。 完整的本地FIB通过过滤(即,丢弃或删除)路由器的标准全局FIB中的无关条目来生成。 然后将较小的FIB安装在转发引擎的存储器内,可能实现为单个专用集成电路(ASIC),用于确定如何转发数据包,路由器会相应地转发数据包。

    ALGORITHM FOR BACKUP PE SELECTION
    32.
    发明申请

    公开(公告)号:WO2006101825A3

    公开(公告)日:2006-09-28

    申请号:PCT/US2006/009073

    申请日:2006-03-14

    Abstract: A fast reroute (FRR) technique is implemented at the edge of a computer net work. If an edge device detects a node or link failure that prevents it from communi cating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The backup edge device is not permitted to reroute the packets a second time. According to the inventive technique, the edge device first identifies a group one or more possible backup edge devices and then selects at least one preferred backup edge device from the group. The edge device makes its selection based on the values of one or more metrics associated with the possible backup edge devices. The metrics are input to a novel selection algorithm that selects the preferred backup edge device(s) using a hierarchical selection process or a weighted-metric se lection process, or some combination thereof.

    AVOIDING MICRO-LOOP UPON FAILURE OF FAST REROUTE PROTECTED LINKS

    公开(公告)号:WO2006001969A3

    公开(公告)日:2006-01-05

    申请号:PCT/US2005/018690

    申请日:2005-05-26

    Abstract: A technique incorporates an efficient means for avoiding micro-loops on a backup path associated with a failed protected link. An intermediate node delays updating a forwarding database (FDB) contained in the intermediate node based on the intermediate node's distance from the failed link (Figure 8). Specifically, intermediate nodes near failed protected link delay updating their FDBs for a longer period of time than nodes farther away from the failed link (880). By updating FDBs in this manner, micro-loops may be avoided on the failed link's backup path as nodes on the backup path that are close to the failed link do not update their FDBs ahead of nodes farther away on the backup path.

    HIERARCHICAL QoS BEHAVIORAL MODEL
    34.
    发明申请
    HIERARCHICAL QoS BEHAVIORAL MODEL 审中-公开
    分层QoS行为模型

    公开(公告)号:WO2005112347A2

    公开(公告)日:2005-11-24

    申请号:PCT/US2005/011796

    申请日:2005-04-08

    Abstract: A hierarchical traffic management system and method (i.e., a QoS behavioral model) are disclosed herein. The system includes a classifier operable to identify and classify incoming traffic streams and a queuing system. The queuing system includes a plurality of queues and is operable to apply scheduling policies to the traffic streams. The queues of the queuing system each include enqueue attributes configured to control a depth of the queue and dequeue attributes configured to control scheduling of the queue. The dequeue attributes include minimum bandwidth, maximum bandwidth, excess bandwidth, and priority, wherein each of the queues has one or more of the dequeue attributes defined.

    Abstract translation: 本文公开了分级业务管理系统和方法(即,QoS行为模型)。 该系统包括可用于识别和分类输入业务流的分类器和排队系统。 排队系统包括多个队列,并且可操作以将调度策略应用于业务流。 排队系统的队列每个都包括配置为控制队列深度的入队属性,并将配置为控制队列调度的属性出队。 出队属性包括最小带宽,最大带宽,超额带宽和优先级,其中每个队列具有定义的一个或多个出队属性。

    PACKET TRACING MECHANISM IN A NETWORK LEVERAGING SRV6

    公开(公告)号:WO2021096760A1

    公开(公告)日:2021-05-20

    申请号:PCT/US2020/059206

    申请日:2020-11-05

    Abstract: The present disclosure provides a packet tracing mechanism will be described that provides packet tracing information to a mobile network controller. In one aspect, a method includes receiving a data packet sent from a source node to a destination node; determining if the data packet is to be updated with packet tracing information; and upon determining that the data packet is to be updated, updating the packet tracing information of the data packet to include identification of the network device and an ingress timestamp of the data packet at the network device for a corresponding network controller to determining network routing policies.

    NETWORK INTERWORKING WITH NO CROSS-DOMAIN STATE

    公开(公告)号:WO2021011392A1

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

    申请号:PCT/US2020/041646

    申请日:2020-07-10

    Abstract: Network interworking with no cross-domain state may be provided. First, an edge node may receive a packet from an intermediate node in a first domain. The edge node may be between the first domain and a second domain. Next, the edge node may pop, in response to a first Service Identifier (SID) in the packet, headers corresponding to the first domain from the packet. The edge node may then push, in response to the first SID, a label stack corresponding to the second domain onto the packet. The first SID may include data corresponding to the label stack. Then the edge node may route the packet to the second domain destine to an end node in the second domain.

    APPLYING ATTESTATION TOKENS TO THE INTERMEDIATE SYSTEM TO INTERMEDIATE SYSTEM (ISIS) ROUTING PROTOCOL

    公开(公告)号:WO2020206195A1

    公开(公告)日:2020-10-08

    申请号:PCT/US2020/026499

    申请日:2020-04-03

    Abstract: In one embodiment, a method includes receiving an ISIS hello message including an attestation token from a second network apparatus, determining that the attestation token is valid for the second network apparatus at a current time, establishing an adjacency to the second network apparatus in response to the determination, computing, based at least on the attestation token, a trust level for a first link from the first network apparatus to the second network apparatus and a trust level for first prefixes associated with the first link, and sending an LSP comprising the trust level for the first link and the trust level for the first prefixes to neighboring network apparatuses, where the trust level for the first link and the trust level for the prefixes are used by the network apparatuses in the network to compute a routing table of the network.

    SYSTEMS AND METHODS FOR DETERMINING SECURE NETWORK PATHS

    公开(公告)号:WO2020206120A1

    公开(公告)日:2020-10-08

    申请号:PCT/US2020/026385

    申请日:2020-04-02

    Abstract: In one embodiment, an apparatus includes one or more processors and one or more computer-readable non-transitory storage media coupled to the one or more processors. The one or more computer-readable non-transitory storage media include instructions that, when executed by the one or more processors, cause the apparatus to perform operations including determining a path through a plurality of provider nodes within a provider network and determining that the path through the plurality of provider nodes within the provider network is secure. The operations also include receiving, from a customer node, a Resource Reservation Protocol (RSVP) path message comprising an attribute for a security request. The operations further include routing the RSVP path message along the path of the plurality of provider nodes.

    SCALABLE NETWORK SLICE BASED QUEUING USING SEGMENT ROUTING FLEXIBLE ALGORITHM

    公开(公告)号:WO2020092045A1

    公开(公告)日:2020-05-07

    申请号:PCT/US2019/057322

    申请日:2019-10-22

    Abstract: The present technology is directed to a system and method for implementing network resource partitioning and Quality of Service (QoS) separation through network slicing. Embodiments of the present invention describe scalable network slicing method based on defining Segment Routing Flexible Algorithm to represent a network slice and assigning a distinct QoS policy queue to each of the Flexible Algorithms configured on a network node. Therefore, scalable network slice based queuing is implemented wherein a single packet processing queue is assigned to each Flex-Algorithm based network slice. QoS policy queue may be implemented in a hierarchical fashion by differentiation between flow packets in a single QoS policy queue based on value of experimental bits in the header.

    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES

    公开(公告)号:WO2020086160A1

    公开(公告)日:2020-04-30

    申请号:PCT/US2019/049490

    申请日:2019-09-04

    Abstract: The present technology is directed to a scalable solution for end-to-end performance delay measurement for Segment Routing Policies on both SR-MPLS and SRv6 data planes. The scalability of the solution stems from the use of distributed PM sessions along SR Policy ECMP paths. This is achieved by dividing the SR policy into smaller sections comprised of SPT trees or sub-paths, each of which is associated with a Root-Node. Downstream SID List TLVs may be used in Probe query messages for signaling SPT information to the Root-Nodes Alternatively, this SPT signaling may be accomplished by using a centralized controller. Root-Nodes are responsible for dynamically creating PM sessions and measuring delay metrics for their associated SPT tree section. The root-nodes then send the delay metrics for their local section to an ingress PE node or to a centralized controller using delay metric TLV field of the response message.

Patent Agency Ranking