知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

330 records (took 0.025 seconds)

    LOOP AVOIDANCE DURING NETWORK CONVERGENCE IN SWITCHED NETWORKS
    122.
    发明申请
    LOOP AVOIDANCE DURING NETWORK CONVERGENCE IN SWITCHED NETWORKS 有权
    开关网络网络融合期间的环绕避免

    公开(公告)号：US20150381406A1

    公开(公告)日：2015-12-31

    申请号：US14319353

    申请日：2014-06-30

    Applicant: Cisco Technology, Inc.

    Inventor： Pierre Jean Rene Francois ,  Clarence Filsfils ,  Stefano B. Previdi ,  Stewart F. Bryant ,  Ian Michael Charles Shand

    IPC: H04L12/24 ,  H04L12/703 ,  H04L12/751

    CPC classification number: H04L45/28 ,  H04L12/24 ,  H04L41/00 ,  H04L41/0654 ,  H04L45/02

    Abstract: Various techniques can be used to avoid loops during network convergence after a topology change such as a failure. For example, a method can involve detecting a failure that disrupts an existing forwarding path between a node and a destination node; calculating at least one updated forwarding path from the node to the destination node; identifying a maximum time for at least a portion of the network to reach a post-convergence state with respect to the failure; until the maximum time has elapsed at the node, explicitly specifying at least a portion of the updated forwarding path in packet headers of any packets being sent from the node to the destination node; and after the maximum time has elapsed at the node, non-explicitly specifying the portion of the updated forwarding path in packet headers of any additional packets being sent from the node to the destination node.

    Abstract translation: 在拓扑变化（如故障）后，可以采用各种技术避免网络融合过程中的环路。 例如，一种方法可以涉及检测中断节点和目的地节点之间的现有转发路径的故障; 计算从所述节点到所述目的地节点的至少一个更新的转发路径; 识别所述网络的至少一部分相对于所述故障达到后收敛状态的最大时间; 直到节点经过最长时间，明确地指定从节点发送到目的地节点的任何分组的分组报头中的更新转发路径的至少一部分; 并且在节点经过最大时间之后，非明确地指定从节点发送到目的地节点的任何附加分组的分组报头中更新的转发路径的部分。

    MPLS segment-routing
    123.
    发明授权
    MPLS segment-routing 有权
    MPLS段路由

    公开(公告)号：US09049233B2

    公开(公告)日：2015-06-02

    申请号：US13760155

    申请日：2013-02-06

    Applicant: Cisco Technology, Inc.

    Inventor： Daniel C. Frost ,  Stewart F. Bryant ,  Clarence Filsfils

    IPC: H04L12/70 ,  H04L29/06 ,  H04L12/721 ,  H04L12/723 ,  H04L12/751 ,  H04L12/717

    CPC classification number: H04L45/50 ,  H04L41/00 ,  H04L45/02 ,  H04L45/26 ,  H04L45/34 ,  H04L45/38 ,  H04L45/42 ,  H04L45/44 ,  H04L45/58 ,  H04L45/66 ,  H04L69/166

    Abstract: MPLS segment routing is disclosed. In one embodiment, a first core router generates a first data structure that maps first portcodes to respective identities of first neighbor routers or respective first links, wherein the first portcodes identify respective first ports of the first core router, and wherein the first ports are coupled to the first neighbor routers, respectively, via the first links, respectively. The first core router generates and transmits a first link-state packet, wherein the first link-state packet comprises an identity of the first core router and the first data structure.

    Abstract translation: 公开了MPLS段路由。 在一个实施例中，第一核心路由器生成第一数据结构，其将第一端口码映射到第一邻居路由器或相应的第一链路的相应标识，其中第一端口号标识第一核心路由器的相应第一端口，并且其中第一端口被耦合 分别通过第一链路到达第一邻居路由器。 第一核心路由器生成并发送第一链路状态分组，其中第一链路状态分组包括第一核心路由器的标识和第一数据结构。

    Scalable BGP protection from edge node failure using dynamically assigned labels in data packets
    124.
    发明授权
    Scalable BGP protection from edge node failure using dynamically assigned labels in data packets 有权
    在数据包中使用动态分配的标签，可以从边缘节点故障中扩展BGP保护

    公开(公告)号：US09036463B2

    公开(公告)日：2015-05-19

    申请号：US13935639

    申请日：2013-07-05

    Applicant: Cisco Technology, Inc.

    Inventor： Ahmed R Bashandy ,  Clarence Filsfils ,  Eric C. Rosen

    IPC: H04L12/24 ,  H04L12/707

    CPC classification number: H04L41/0668 ,  H04L45/04 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50

    Abstract: In one embodiment, a method comprises detecting, by a provider edge router configured for providing reachability for core network traffic to a prescribed destination address prefix, a backup provider edge router relative to the prescribed destination address prefix; allocating, by the provider edge router, a distinct protected next-hop address for reachability to at least the destination address prefix via the provider edge router; and sending via a core network, by the provider edge router, repair information for the prescribed destination address prefix to ingress provider edge routers and a BGP-free core network router in the core network, the repair information enabling the ingress provider edge routers to insert primary and backup switching labels into each data packet of the core network traffic enabling the BGP-free core network router to reroute the received packet to the backup provider edge router if the provider edge router is unavailable.

    Abstract translation: 在一个实施例中，一种方法包括通过被配置为将核心网络业务的可达性提供到规定的目的地地址前缀的提供商边缘路由器检测备用提供商边缘路由器相对于规定的目的地地址前缀; 由提供商边缘路由器分配经由提供商边缘路由器到达至少目的地地址前缀的不同的受保护的下一跳地址; 并通过提供商边缘路由器的核心网络向核心网络中的入口提供商边缘路由器和无BGP核心网络路由器修复用于规定目的地地址前缀的信息，允许入口提供商边缘路由器插入的修复信息 主交换标签和备份交换标签分配到核心网络流量的每个数据包中，如果提供商边缘路由器不可用，则使无BGP核心网络路由器将接收到的数据包重新路由到备份提供商边缘路由器。

    DISTRIBUTED CONNECTIVITY VERIFICATION PROTOCOL REDUNDANCY
    125.
    发明申请
    DISTRIBUTED CONNECTIVITY VERIFICATION PROTOCOL REDUNDANCY 审中-公开
    分布式连接验证协议冗余

    公开(公告)号：US20150085860A1

    公开(公告)日：2015-03-26

    申请号：US14500046

    申请日：2014-09-29

    Applicant: Cisco Technology, Inc.

    Inventor： Sami Boutros ,  Sylvain Masse ,  Clarence Filsfils

    IPC: H04L12/26 ,  H04L29/06 ,  H04L12/709

    CPC classification number: H04L43/0811 ,  H04L41/0663 ,  H04L45/245 ,  H04L45/68 ,  H04L69/16 ,  Y02D50/30

    Abstract: In one embodiment, a connectivity verification protocol (CVP) session for a particular virtual interface (VI) may operate on a particular group of two or more line cards (LCs) on a network device. The group of LCs may then transmit CVP session packets, at a reduced rate that is sufficient to maintain the CVP session based on a negotiated CVP full rate, onto the particular VI through ingress path processing on the network device. Ingress path processing, in particular, takes transmitted CVP session packets and egresses them onto an appropriate LC of the network device currently responsible for the VI egress. Also, in response to receiving CVP session packets for the VI on an LC of the network device currently responsible for the VI ingress, the receiving LC may forward the received CVP session packets to the particular corresponding group of LCs, which may then process the received CVP session packets.

    Abstract translation: 在一个实施例中，用于特定虚拟接口（VI）的连接性验证协议（CVP）会话可以在网络设备上的两个或多个线路卡（LC）的特定组上操作。 然后，LC组可以以足够的速率传输CVP会话分组，该速率足以通过协商的CVP全速率将CVP会话维持在通过网络设备上的入口路径处理的特定VI上。 入口路径处理特别是将传输的CVP会话数据包发送到当前负责VI出口的网络设备的适当LC上。 此外，响应于在当前负责VI入口的网络设备的LC上接收到针对VI的CVP会话分组，接收LC可以将接收的CVP会话分组转发到特定对应的LC组，然后可以处理接收的 CVP会话数据包。

    A MULTI-LAYER STATEFUL PATH COMPUTATION ELEMENT ARCHITECTURE
    126.
    发明申请
    A MULTI-LAYER STATEFUL PATH COMPUTATION ELEMENT ARCHITECTURE 有权
    多层稳定路径计算元素建筑

    公开(公告)号：US20150003283A1

    公开(公告)日：2015-01-01

    申请号：US13930081

    申请日：2013-06-28

    Applicant: Cisco Technology, Inc.

    Inventor： Stefano Previdi ,  Jean-Philippe Vasseur ,  Jan Medved ,  David Ward ,  Clarence Filsfils ,  Christopher Metz

    IPC: H04L12/751 ,  H04L12/723

    CPC classification number: H04L45/02 ,  H04L41/12 ,  H04L45/04 ,  H04L45/50 ,  H04L45/64

    Abstract: In one embodiment, a stateful computing entity in a computer network determines underlying network information (physical and/or optical) for the computer network, and also determines topologies (Internet Protocol (IP) and/or Multiprotocol Label Switching (MPLS)) for the computer network and associated resource information. Further, the stateful computing entity determines label switched path (LSP) state information for the computer network. The stateful computing entity may then build network state knowledge by aggregating the underlying network information, the topologies and associated resource information, and the LSP state information, and establishes communication within a dynamic network of other stateful computing entities sharing network state knowledge for parallel computation performance. Accordingly, the stateful computing entity may perform network computation based on the network state knowledge.

    Abstract translation: 在一个实施例中，计算机网络中的状态计算实体确定用于计算机网络的底层网络信息（物理和/或光学），并且还确定用于所述计算机网络的拓扑（互联网协议（IP））和/或多协议标签交换（MPLS）） 计算机网络和相关资源信息。 此外，有状态计算实体确定计算机网络的标签交换路径（LSP）状态信息。 有状态计算实体可以通过聚合底层网络信息，拓扑和相关资源信息以及LSP状态信息来构建网络状态知识，并且在共享网络状态知识的其他有状态计算实体的动态网络内建立用于并行计算性能的通信 。 因此，有状态计算实体可以基于网络状态知识来执行网络计算。

    GRACEFUL HANDLING OF CRITICAL TRAFFIC BLACKHOLING FAULTS
    127.
    发明申请
    GRACEFUL HANDLING OF CRITICAL TRAFFIC BLACKHOLING FAULTS 审中-公开
    严格处理关键交通黑化故障

    公开(公告)号：US20140192630A1

    公开(公告)日：2014-07-10

    申请号：US14148494

    申请日：2014-01-06

    Applicant: Cisco Technology, Inc.

    Inventor： Nikunj R. Vaidya ,  Pradosh Mohapatra ,  Arun Satyanarayana ,  Pankaj Bhagra ,  Clarence Filsfils

    IPC: H04L12/24

    CPC classification number: H04L41/0672 ,  H04L41/04 ,  H04L41/0659 ,  H04L41/0677 ,  H04L43/0811 ,  H04L43/0817 ,  H04L45/02 ,  H04L45/28

    Abstract: In one embodiment, a network device may detect a data plane critical fault condition, while a corresponding control plane is not experiencing a critical fault condition. In response to a network device based critical fault condition, the network device may activate and advertise an increased and expensive usable metric for each network interface of the network device. On the other hand, in response to an interface based critical fault condition, the network device may activate and advertise an increased and expensive usable metric for one or more particular network interfaces of the interface based critical fault, and signals, over the control plane to a corresponding network device at an opposing end of each particular network interface of the interface based critical fault, a request to activate and advertise an increased and expensive usable metric at the opposing end of each particular network interface.

    Abstract translation: 在一个实施例中，网络设备可以检测数据平面关键故障状况，而相应的控制平面没有经历严重故障状况。 响应于基于网络设备的关键故障状况，网络设备可以激活和通告网络设备的每个网络接口的增加且昂贵的可用度量。 另一方面，响应于基于接口的关键故障条件，网络设备可以激活并通告在基于接口的关键故障的一个或多个特定网络接口和控制平面上的信号的增加且昂贵的可用度量 在基于接口的关键故障的每个特定网络接口的相对端处的相应网络设备，激活并在每个特定网络接口的相对端处通告增加且昂贵的可用度量的请求。

    DISTRIBUTED DEMAND MATRIX COMPUTATIONS
    128.
    发明申请
    DISTRIBUTED DEMAND MATRIX COMPUTATIONS 有权
    分布式需求矩阵计算

    公开(公告)号：US20130265905A1

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

    申请号：US13752926

    申请日：2013-01-29

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： Clarence Filsfils

    IPC: H04L12/26

    CPC classification number: H04L43/00 ,  H04L41/00 ,  H04L41/0681 ,  H04L43/04 ,  H04L43/08 ,  H04L43/0805 ,  H04L45/70

    Abstract: In one embodiment, a method includes receiving a packet at a first network device, logging the packet into a demand corresponding to a cell of a demand matrix, and storing the demand in a demand database at the first network device. The demand database includes a plurality of demands computed for a specified time period and corresponding to cells of the demand matrix associated with traffic entering a network at the first network device. Demands corresponding to cells of the demand matrix associated with traffic entering the network at a second network device are computed and stored at the second network device. An apparatus and logic are also disclosed herein.

    Abstract translation: 在一个实施例中，一种方法包括在第一网络设备处接收分组，将分组记录到与需求矩阵的小区相对应的需求中，并将需求存储在第一网络设备的需求数据库中。 需求数据库包括在指定的时间周期内计算出的多个需求量，并对应于与在第一网络设备处进入网络的流量相关联的需求矩阵的单元。 在第二网络设备处计算并存储与在第二网络设备处进入网络的业务相关联的需求矩阵的小区所对应的需求。 本文还公开了一种装置和逻辑。

Patent Agency Ranking