会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 31. 发明授权
    • Techniques for distributing information using multicast subsets
    • 使用多播子集分发信息的技术
    • US07623474B2
    • 2009-11-24
    • US11353544
    • 2006-02-14
    • Thuan Van TranYi YangLiem NguyenRussell WhiteDonnie Van Savage
    • Thuan Van TranYi YangLiem NguyenRussell WhiteDonnie Van Savage
    • H04L12/26
    • H04L45/16H04L12/1836H04L12/1868H04L12/1886H04L45/02H04L45/245
    • Techniques for sending data in a packet-switched communications network include determining multiple subsets of adjacent network nodes of the network. The adjacent network nodes communicate without intervening network nodes with a particular network node through an interface on the particular network node. Each subset includes multiple adjacent network nodes. Subset definition data is sent through the interface. The subset definition data indicates which adjacent network nodes belong to which subset. Data for fewer than all adjacent network nodes in all subsets are sent by including, in a multicast data packet sent over the interface with a multicast destination address, subset identifier data that indicates a particular subset. When such data is received by a node, it is discarded unless the subset identifier matches the receiving node's subset identifier. Among other effects, this allows routing messages to be more efficiently sent to better performing neighboring network nodes.
    • 在分组交换通信网络中发送数据的技术包括确定网络的相邻网络节点的多个子集。 相邻的网络节点通过特定网络节点上的接口与特定的网络节点通信而无需中间网络节点。 每个子集包括多个相邻的网络节点。 子集定义数据通过接口发送。 子集定义数据指示哪些相邻网络节点属于哪个子集。 通过在通过接口发送的多播数据分组中包括指示特定子集的子集标识符数据,包括在所有子集中比所有相邻网络节点少的数据。 当节点接收到这样的数据时,除非子集标识符与接收节点的子集标识符相匹配,否则丢弃该数据。 除此之外,这使得路由消息更有效地发送到更好地执行的相邻网络节点。
    • 32. 发明申请
    • Creating Non-transit Nodes in a Link State Network
    • 在链路状态网络中创建非转接节点
    • US20080259820A1
    • 2008-10-23
    • US11736563
    • 2007-04-17
    • Russell WhiteYi YangJames Ng
    • Russell WhiteYi YangJames Ng
    • H04L12/28
    • H04L45/026H04L45/02
    • In one embodiment, a method includes receiving a first link state initiation (HELLO) message from a first neighboring router. The HELLO message requests that a recipient node send a unique identifier for itself in a link state routing protocol. In response to receiving the first HELLO message, a first response message is sent that includes a first identifier from an identifier pool. The identifier pool contains for a local node a plurality of network identifiers that are unique among all nodes in the network that uses the link state routing protocol. A second HELLO message is received from a different second neighboring router. In response to receiving the second HELLO message, a second response message is sent that includes a different second identifier from the identifier pool.
    • 在一个实施例中,一种方法包括从第一相邻路由器接收第一链路状态发起(HELLO)消息。 HELLO消息请求接收方节点在链路状态路由协议中为其自身发送唯一的标识符。 响应于接收到第一HELLO消息,发送包括来自标识符池的第一标识符的第一响应消息。 标识符池为本地节点包含在网络中使用链路状态路由协议的所有节点中唯一的多个网络标识符。 从不同的第二相邻路由器接收第二个HELLO消息。 响应于接收到第二HELLO消息,发送包含来自标识符池的不同的第二标识符的第二响应消息。
    • 33. 发明申请
    • Preventing Loops during Recovery in Network Rings Using Cost Metric Routing Protocol
    • 使用成本计量路由协议在网络环中恢复期间预防环路
    • US20080212585A1
    • 2008-09-04
    • US11681001
    • 2007-03-01
    • Russell WhiteSteven MooreJames NgYi Yang
    • Russell WhiteSteven MooreJames NgYi Yang
    • H04L12/56
    • H04L45/12H04L45/00H04L45/02
    • In one embodiment, a method includes receiving advertised costs to reach a destination address from neighbor routers. Based on the advertised costs, a minimum first cost to reach the destination address from the local router through the neighbors is determined. The first cost corresponds to a successor among the neighbors. Also determined is a minimum second cost of the advertised costs excluding only an advertised cost from the successor. The second cost corresponds to a second router. If it is determined that communication with the successor is interrupted, and the second cost is not less than the first cost, then it is determined whether the second cost is equal to the first cost. If so, then a data packet, which is directed to the destination address and received from a neighbor that is different from the second router, is forwarded to the second router.
    • 在一个实施例中,一种方法包括接收通告的成本以从邻居路由器到达目的地地址。 基于广告费用,确定从本地路由器通过邻居到达目的地地址的最小首要成本。 第一个成本对应于邻居之间的继任者。 还确定了广告成本的最低二次成本,不包括继承人的广告费用。 第二个成本对应于第二个路由器。 如果确定与后继者的通信中断,并且第二成本不低于第一成本,则确定第二成本是否等于第一成本。 如果是这样,那么指向目的地址并且从与第二路由器不同的邻居接收到的数据分组被转发到第二路由器。
    • 34. 发明授权
    • Creating non-transit nodes in a link network
    • 在链路网络中创建非传输节点
    • US07796537B2
    • 2010-09-14
    • US11736563
    • 2007-04-17
    • Russell WhiteYi YangJames Ng
    • Russell WhiteYi YangJames Ng
    • H04L12/28G06F15/177
    • H04L45/026H04L45/02
    • In one embodiment, a method includes receiving a first link state initiation (HELLO) message from a first neighboring router. The HELLO message requests that a recipient node send a unique identifier for itself in a link state routing protocol. In response to receiving the first HELLO message, a first response message is sent that includes a first identifier from an identifier pool. The identifier pool contains for a local node a plurality of network identifiers that are unique among all nodes in the network that uses the link state routing protocol. A second HELLO message is received from a different second neighboring router. In response to receiving the second HELLO message, a second response message is sent that includes a different second identifier from the identifier pool.
    • 在一个实施例中,一种方法包括从第一相邻路由器接收第一链路状态发起(HELLO)消息。 HELLO消息请求接收方节点在链路状态路由协议中为其自身发送唯一的标识符。 响应于接收到第一HELLO消息,发送包括来自标识符池的第一标识符的第一响应消息。 标识符池为本地节点包含在网络中使用链路状态路由协议的所有节点中唯一的多个网络标识符。 从不同的第二相邻路由器接收第二个HELLO消息。 响应于接收到第二HELLO消息,发送包含来自标识符池的不同的第二标识符的第二响应消息。
    • 35. 发明申请
    • Techniques for distributing information using multicast subsets
    • 使用多播子集分发信息的技术
    • US20070192451A1
    • 2007-08-16
    • US11353544
    • 2006-02-14
    • Thuan TranYi YangLiem NguyenRussell WhiteDonnie Savage
    • Thuan TranYi YangLiem NguyenRussell WhiteDonnie Savage
    • G06F15/173
    • H04L45/16H04L12/1836H04L12/1868H04L12/1886H04L45/02H04L45/245
    • Techniques for sending data in a packet-switched communications network include determining multiple subsets of adjacent network nodes of the network. The adjacent network nodes communicate without intervening network nodes with a particular network node through an interface on the particular network node. Each subset includes multiple adjacent network nodes. Subset definition data is sent through the interface. The subset definition data indicates which adjacent network nodes belong to which subset. Data for fewer than all adjacent network nodes in all subsets are sent by including, in a multicast data packet sent over the interface with a multicast destination address, subset identifier data that indicates a particular subset. When such data is received by a node, it is discarded unless the subset identifier matches the receiving node's subset identifier. Among other effects, this allows routing messages to be more efficiently sent to better performing neighboring network nodes.
    • 在分组交换通信网络中发送数据的技术包括确定网络的相邻网络节点的多个子集。 相邻的网络节点通过特定网络节点上的接口与特定的网络节点通信而无需中间网络节点。 每个子集包括多个相邻的网络节点。 子集定义数据通过接口发送。 子集定义数据指示哪些相邻网络节点属于哪个子集。 通过在通过接口发送的多播数据分组中包括指示特定子集的子集标识符数据,包括在所有子集中比所有相邻网络节点少的数据。 当节点接收到这样的数据时,除非子集标识符与接收节点的子集标识符相匹配,否则丢弃该数据。 除此之外,这使得路由消息更有效地发送到更好地执行的相邻网络节点。
    • 36. 发明申请
    • Protection of Transit Links in a Network
    • 保护网络中的传输链路
    • US20090080436A1
    • 2009-03-26
    • US11862161
    • 2007-09-26
    • Russell WhiteJames L. NgDonnie V. Savage
    • Russell WhiteJames L. NgDonnie V. Savage
    • H04L12/28
    • H04L45/02H04L45/025
    • A router identifies transit links and non-transit links. Only the non-transit links are advertised as routes to adjacent routers, thereby protecting the transit links from edge traffic which terminates on a network on one of the transit links. In another aspect of the invention, an administrative whitelist supplements the routes which identify the transit link network routes. In another aspect of the invention, a method for advertising routes identifies entries in a router table as broadcast or point-to-point. Only the router table entries for point-to-point links which are not transit or broadcast links that are not for a neighboring router are advertised, whereas the point-to-point transit links or broadcast transit links are advertised as transit links if an administrative whitelist is enabled.
    • 路由器识别过境链路和非过境链路。 只有非转接链路作为到相邻路由器的路由通告,从而保护转接链路免受终止于其中一个转接链路上的网络上的边缘业务。 在本发明的另一方面,管理白名单补充标识中继链路网络路由的路由。 在本发明的另一方面,广告路由的方法将路由器表中的条目标识为广播或点到点。 仅通告不用于相邻路由器的不转发或广播链路的路由器表条目,而点对点转接链路或广播转发链路则作为传输链路通告,如果管理 白名单启用。
    • 40. 发明授权
    • Protection of transit links in a network
    • 保护网络中的中转链路
    • US07821970B2
    • 2010-10-26
    • US11862161
    • 2007-09-26
    • Russell WhiteJames L. NgDonnie V. Savage
    • Russell WhiteJames L. NgDonnie V. Savage
    • H04L1/00H04L12/26
    • H04L45/02H04L45/025
    • A router identifies transit links and non-transit links. Only the non-transit links are advertised as routes to adjacent routers, thereby protecting the transit links from edge traffic which terminates on a network on one of the transit links. In another aspect of the invention, an administrative whitelist supplements the routes which identify the transit link network routes. In another aspect of the invention, a method for advertising routes identifies entries in a router table as broadcast or point-to-point. Only the router table entries for point-to-point links which are not transit or broadcast links that are not for a neighboring router are advertised, whereas the point-to-point transit links or broadcast transit links are advertised as transit links if an administrative whitelist is enabled.
    • 路由器识别过境链路和非过境链路。 只有非转接链路作为到相邻路由器的路由通告,从而保护转接链路免受终止于其中一个转接链路上的网络上的边缘业务。 在本发明的另一方面,管理白名单补充标识中继链路网络路由的路由。 在本发明的另一方面,广告路由的方法将路由器表中的条目标识为广播或点到点。 仅通告不用于相邻路由器的不转发或广播链路的路由器表条目,而点对点转接链路或广播转发链路则作为传输链路通告,如果管理 白名单启用。