会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 32. 发明授权
    • Computing the widest shortest path in high-speed networks
    • 计算高速网络中最宽的最短路径
    • US06370119B1
    • 2002-04-09
    • US09036354
    • 1998-03-06
    • Claude BassoPaolo Scotton
    • Claude BassoPaolo Scotton
    • G01R3108
    • H04L45/14H04L45/12H04L45/123H04L45/124
    • A method and system is described for determining the optimal path for routing a communication in a communication network between a source node and at least one destination node. The determination is based upon evaluation of the path offering the widest bandwidth in the direction of data transmission, the lowest additive cost, and the lowest hop count. Each link of the network is associated with at least a restrictive cost and an additive cost reflecting selected link characteristics. A path is characterized by a restrictive cost and an additive cost derived from the link costs of its component links. A connection to be routed identifies a source node, a destination node and a maximum restrictive cost allowed for routing the connection. All acceptable paths from the source node to all the other nodes of the network are determined and stored. These paths deemed acceptable and are stored if they have the lowest restrictive cost that allows the routing of the connection, and if they have the lowest additive cost and minimum hop count. Finally, from the plurality of stored acceptable paths, the path that originates from the source node and terminates at the destination node is selected as the optimal path to route the connection.
    • 描述了一种方法和系统,用于确定用于在源节点和至少一个目的地节点之间的通信网络中路由通信的最佳路径。 该决定是基于在数据传输方向上提供最宽带宽的路径评估,最低附加成本和最低跳数。 网络的每个链路至少具有限制性成本和反映所选链路特征的附加成本。 路径的特征在于限制性成本和来自其组件链路的链路成本的附加成本。 要路由的连接标识源节点,目的地节点和允许路由连接的最大限制性成本。 确定并存储从源节点到网络的所有其他节点的所有可接受的路径。 这些路径被认为是可接受的,并且如果它们具有允许连接路由的限制性成本最低,并且如果它们具有最低的附加成本和最小跳数,则被存储。 最后,从多个存储的可接受路径中,选择源自源节点并终止于目的节点的路径作为路由连接的最佳路径。