会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 20. 发明授权
    • Mintree-based routing in highly constrained networks
    • 在高度有限的网络中基于Mintree的路由
    • US09219682B2
    • 2015-12-22
    • US13668894
    • 2012-11-05
    • Cisco Technology, Inc.
    • Jean-Philippe VasseurSukrit DasguptaJonathan W. Hui
    • H04L12/28H04L12/753H04L12/751
    • H04L45/48H04L45/02
    • In one embodiment, a capable node in a computer network may host a path computation element, receive one or more neighborhood discovery messages including neighborhood information from a plurality of nodes in the computer network, and compute a minimum spanning tree (MinTree) for the computer network based on the neighborhood information. The MinTree may divide the plurality of nodes in the computer network into a first subset of routing nodes and a second subset of host nodes. The first subset of routing nodes may form one or more interconnected paths of routing nodes within the MinTree, and each host node within the second subset of host nodes may be located within one hop of at least one routing node. The capable node may then communicate a MinTree message to the plurality of nodes in the computer network to build the MinTree by enabling routing on each routing node.
    • 在一个实施例中,计算机网络中的能力节点可以承载路径计算元件,从计算机网络中的多个节点接收包括邻域信息的一个或多个邻域发现消息,并计算计算机的最小生成树(MinTree) 基于邻居信息的网络。 MinTree可以将计算机网络中的多个节点划分为路由节点的第一子集和主节点的第二子集。 路由节点的第一子集可以在MinTree内形成路由节点的一个或多个互连路径,并且主节点的第二子集内的每个主机节点可以位于至少一个路由节点的一跳内。 有能力的节点可以然后通过在每个路由节点上启用路由来将MinTree消息传送到计算机网络中的多个节点以构建MinTree。