Techniques for one-way synchronization of routing information among intermediate nodes
    1.
    发明申请
    Techniques for one-way synchronization of routing information among intermediate nodes 有权
    中间节点之间路由信息单向同步的技术

    公开(公告)号:US20080031236A1

    公开(公告)日:2008-02-07

    申请号:US11497224

    申请日:2006-08-01

    IPC分类号: H04L12/56

    CPC分类号: H04L45/02 H04L45/021

    摘要: Techniques for synchronizing routing data include determining whether conditions are satisfied for one-way transfer with an adjacent router. If it is determined that conditions are satisfied for one-way transfer of routing table data with the adjacent router, then a refresh-notice message is sent from the initiating router to the adjacent router. The refresh-notice message includes data that indicates a particular direction for transfer of routing table data. If the particular direction is inbound, then a copy of an adjacent routing table is received without sending a copy of the initiating router's own routing table. If the particular direction is outbound, then a copy of the own routing table is sent without receiving a copy of the adjacent routing table.

    摘要翻译: 用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。 如果确定与相邻路由器的路由表数据的单向传输满足条件,则从启动路由器向相邻路由器发送刷新通知消息。 刷新通知消息包括指示用于传送路由表数据的特定方向的数据。 如果特定方向是入站的,则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。 如果特定方向是出站的,则发送自己的路由表的副本而不接收相邻路由表的副本。

    Techniques for one-way synchronization of routing information among intermediate nodes
    2.
    发明授权
    Techniques for one-way synchronization of routing information among intermediate nodes 有权
    中间节点之间路由信息单向同步的技术

    公开(公告)号:US07768995B2

    公开(公告)日:2010-08-03

    申请号:US11497224

    申请日:2006-08-01

    IPC分类号: H04L12/28 H04L12/56

    CPC分类号: H04L45/02 H04L45/021

    摘要: Techniques for synchronizing routing data include determining whether conditions are satisfied for one-way transfer with an adjacent router. If it is determined that conditions are satisfied for one-way transfer of routing table data with the adjacent router, then a refresh-notice message is sent from the initiating router to the adjacent router. The refresh-notice message includes data that indicates a particular direction for transfer of routing table data. If the particular direction is inbound, then a copy of an adjacent routing table is received without sending a copy of the initiating router's own routing table. If the particular direction is outbound, then a copy of the own routing table is sent without receiving a copy of the adjacent routing table.

    摘要翻译: 用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。 如果确定与相邻路由器的路由表数据的单向传输满足条件,则从启动路由器向相邻路由器发送刷新通知消息。 刷新通知消息包括指示用于传送路由表数据的特定方向的数据。 如果特定方向是入站的,则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。 如果特定方向是出站的,则发送自己的路由表的副本而不接收相邻路由表的副本。

    Techniques to support asymmetrical static/dynamic adjacency in routers
    3.
    发明授权
    Techniques to support asymmetrical static/dynamic adjacency in routers 有权
    支持路由器不对称静态/动态邻接的技术

    公开(公告)号:US07583672B2

    公开(公告)日:2009-09-01

    申请号:US11398825

    申请日:2006-04-05

    IPC分类号: H04L12/28

    CPC分类号: H04L45/16 H04L45/00 H04L45/02

    摘要: A static neighbor configured network device is configured with a static neighbor feature including a static neighbor list of network devices. The static neighbor configured network device is in a network segment that includes a dynamically configured network device. The static neighbor configured network device receives a multicast packet from the dynamically configured network device. It is determined if the dynamically configured network device is included in the static neighbor list of the static neighbor configured network device. The multicast packet is accepted if the dynamically configured network device is found in the neighbor list for the static neighbor configured network device. Also, adjacency for the static neighbor configured network device is not lost with any other currently adjacent network devices when the multicast packet is received.

    摘要翻译: 静态邻居配置的网络设备配置了静态邻居特性,包括网络设备的静态邻居列表。 静态邻居配置的网络设备位于包含动态配置的网络设备的网段中。 静态邻居配置的网络设备从动态配置的网络设备接收组播报文。 确定动态配置的网络设备是否包含在静态邻居配置的网络设备的静态邻居列表中。 如果在静态邻居配置的网络设备的邻居列表中找到动态配置的网络设备,则接收组播数据包。 此外,当接收到多播分组时,静态邻居配置的网络设备的邻接不会与任何其他当前相邻的网络设备丢失。

    Two-hop relay for reducing distance vector routing information
    4.
    发明授权
    Two-hop relay for reducing distance vector routing information 有权
    用于减少距离矢量路由信息的两跳中继

    公开(公告)号:US07978612B2

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

    申请号:US12250446

    申请日:2008-10-13

    摘要: In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.

    摘要翻译: 在一个实施例中,使用二跳中继的方法包括从第一邻居接收距离矢量路由协议的更新消息。 更新消息被发送到不同的邻居。 通常,首先确定接收节点是否是协议中的第一邻居的中继节点。 中继节点是优选地从第一邻居更新特定节点两跳的节点。 在另一个实施例中,用作二跳中继的方法包括从每个邻居接收包括指示与邻居直接通信的节点的邻居数据的第一消息。 确定少于所有邻居的中继集。 来自第一节点的每个节点两跳仅使用邻居的中继集更新。 继电器组在协议的第二个消息中发送。

    Two-hop Relay for Reducing Distance Vector Routing Information
    5.
    发明申请
    Two-hop Relay for Reducing Distance Vector Routing Information 有权
    用于减少距离矢量路由信息的两跳中继

    公开(公告)号:US20100091823A1

    公开(公告)日:2010-04-15

    申请号:US12250446

    申请日:2008-10-13

    IPC分类号: H04B3/36

    摘要: In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.

    摘要翻译: 在一个实施例中,使用二跳中继的方法包括从第一邻居接收距离矢量路由协议的更新消息。 更新消息被发送到不同的邻居。 通常,首先确定接收节点是否是协议中的第一邻居的中继节点。 中继节点是优选地从第一邻居更新特定节点两跳的节点。 在另一个实施例中,用作二跳中继的方法包括从每个邻居接收包括指示与邻居直接通信的节点的邻居数据的第一消息。 确定少于所有邻居的中继集。 来自第一节点的每个节点两跳仅使用邻居的中继集更新。 继电器组在协议的第二个消息中发送。

    Techniques for reducing adjacencies in a link-state network routing protocol
    6.
    发明授权
    Techniques for reducing adjacencies in a link-state network routing protocol 有权
    降低链路状态网络路由协议邻接度的技术

    公开(公告)号:US07515551B2

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

    申请号:US11037964

    申请日:2005-01-18

    IPC分类号: H04L12/56 H04J1/16

    CPC分类号: H04L45/26 H04L45/02

    摘要: A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.

    摘要翻译: 通过在路由器处建立链路状态数据来呈现一种通过网络支持数据分组的最短路径优先(SPF)路由的方法和装置。 链路状态数据表示路由器与不同路由器之间的直接链路,并与不同节点建立邻接关系。 初始链路状态数据存储在第一路由器。 在存储初始链路状态数据之后,在第一路由器处接收到hello消息。 hello消息指示与一个网段上的不同第二路由器的直接连接。 基于初始链路状态数据,确定与第二路由器建立邻接关系是否足够有价值。 如果没有,则与第二路由器不响应于hello消息建立邻接关系。 基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。

    Automatic Overlapping Areas that Flood Routing Information
    7.
    发明申请
    Automatic Overlapping Areas that Flood Routing Information 有权
    自动重叠区域洪水路由信息

    公开(公告)号:US20080130500A1

    公开(公告)日:2008-06-05

    申请号:US11565608

    申请日:2006-11-30

    IPC分类号: H04L12/56 G08C15/00

    CPC分类号: H04L12/66

    摘要: In one embodiment, a method includes receiving on a first communication link at a local router all routing information at a certain level of detail for each router of multiple routers communicating in a first flooding domain. A measure of distance is determined from a particular router in the first flooding domain to the local router. It is determined whether the measure of distance exceeds a threshold. If the measure of distance exceeds the threshold, then summary routing information with less than the certain level of detail is determined for the particular router. Also, certain routing information is sent over a different second communication link at the local router. The certain routing information includes the summary information for the particular router, and all routing information at the certain level of detail for a subset of routers communicating in the first flooding domain, which subset excludes the particular router.

    摘要翻译: 在一个实施例中,一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。 从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。 确定距离测量是否超过阈值。 如果距离测量值超过阈值,则确定特定路由器具有小于特定级别细节的汇总路由信息。 而且,通过本地路由器上的不同的第二通信链路发送某些路由信息。 某些路由信息包括特定路由器的摘要信息,以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息,该子集排除特定路由器。

    Techniques for reducing adjacencies in a link-state network routing protocol

    公开(公告)号:US20060159082A1

    公开(公告)日:2006-07-20

    申请号:US11037964

    申请日:2005-01-18

    IPC分类号: H04L12/56 H04L12/28

    CPC分类号: H04L45/26 H04L45/02

    摘要: A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.

    Validating internal routing protocol information passed through an external routing protocol
    9.
    发明授权
    Validating internal routing protocol information passed through an external routing protocol 有权
    验证通过外部路由协议传递的内部路由协议信息

    公开(公告)号:US07782858B2

    公开(公告)日:2010-08-24

    申请号:US11696708

    申请日:2007-04-04

    IPC分类号: H04L12/28 H04L12/56

    CPC分类号: H04L45/50 H04L45/04

    摘要: In one embodiment, a method includes receiving authenticated site data that includes site ID data and address data. The site ID data indicates a unique site ID for each site among multiple sites for a first network that uses an internal routing protocol. Multiple edge sites of those sites are separate from each other and connected to a second network that is under separate administrative control of at least one different party. The address data indicates network addresses associated with each site of the plurality of sites. An external routing protocol message is discounted based on the authenticated site data.

    摘要翻译: 在一个实施例中,一种方法包括接收包括站点ID数据和地址数据的认证站点数据。 站点ID数据指示使用内部路由协议的第一个网络的多个站点中每个站点的唯一站点ID。 这些站点的多个边缘站点彼此分离并连接到处于至少一个不同方的单独管理控制下的第二网络。 地址数据指示与多个站点中的每个站点相关联的网络地址。 外部路由协议消息基于认证的站点数据进行打折。

    System and Method for Controlling the Flooding of Information in a Network Environment
    10.
    发明申请
    System and Method for Controlling the Flooding of Information in a Network Environment 有权
    控制网络环境中信息泛滥的系统和方法

    公开(公告)号:US20080043635A1

    公开(公告)日:2008-02-21

    申请号:US11877104

    申请日:2007-10-23

    IPC分类号: H04L12/28

    摘要: An apparatus for communicating packets in a network environment is provided that includes a first network element that includes a first neighbor list, the first network element being coupled to a second network element and a third network element. The first network element is operable to receive a second neighbor list from the second network element and a third neighbor list from the third network element. The first network element is further operable to determine one or more overlaps provided by the second and third neighbor lists when compared to the first neighbor list, the first network element relaying an update that it receives based on the one or more overlaps.

    摘要翻译: 提供了一种用于在网络环境中传送分组的装置,其包括包括第一邻居列表的第一网络元件,所述第一网络元件耦合到第二网络元件和第三网络元件。 第一网络元件可操作以从第二网络元件接收第二邻居列表,并从第三网络元件接收第三邻居列表。 当与第一邻居列表相比较时,第一网络元件还可操作以确定由第二和第三邻居列表提供的一个或多个重叠,第一网络元件基于一个或多个重叠中继其接收的更新。