Terminal and N-tree constructing method
    1.
    发明授权
    Terminal and N-tree constructing method 有权
    终端和N树构造方法

    公开(公告)号:US08520556B2

    公开(公告)日:2013-08-27

    申请号:US12865134

    申请日:2008-12-26

    IPC分类号: H04L12/28

    摘要: A terminal apparatus minimizes traffic congestion by reducing end-to-end delay and maximizes the bandwidth available in shared N-tree ALM nodes. In this terminal apparatus, an optimal stream path information table stores N-tree session information for all nodes. A server forwarding table stores bandwidth-fair ALM route information for all nodes in a specific N-tree session. An ALM forwarding table constructor updates N-tree session information stored in an optimal stream path information table using network metrics and heuristic rules stored in a heuristic rule database, executes ALM_N-tree algorithm using updated N-tree session information, and thereby generates bandwidth-fair ALM route information.

    摘要翻译: 终端设备通过减少端到端延迟并使共享的N树ALM节点中的可用带宽最大化来最小化流量拥塞。 在该终端装置中,最佳流路径信息表存储所有节点的N树会话信息。 服务器转发表存储特定N树会话中所有节点的带宽公平的ALM路由信息。 ALM转发表构造器使用存储在启发式规则数据库中的网络度量和启发式规则来更新存储在最优流路径信息表中的N树会话信息,使用更新的N树会话信息执行ALM_N树算法,从而生成带宽 - 公平的ALM路线信息。

    TERMINAL AND N-TREE CONSTRUCTING METHOD
    2.
    发明申请
    TERMINAL AND N-TREE CONSTRUCTING METHOD 有权
    终端和N-树结构方法

    公开(公告)号:US20110002333A1

    公开(公告)日:2011-01-06

    申请号:US12865134

    申请日:2008-12-26

    IPC分类号: H04L12/56

    摘要: A terminal apparatus is provided that minimizes traffic congestion by reducing end-to-end delay and maximizes the bandwidth available in shared N-tree ALM nodes. In this terminal apparatus, an optimal stream path information table (204) stores N-tree session information for all nodes. A server forwarding table (202) stores bandwidth-fair ALM route information for all nodes in a specific N-tree session. An ALM forwarding table constructor (218) updates M-tree session information stored in an optimal stream path information table (204) using network metrics and heuristic rules stored in a heuristic rule database (206), executes ALM_N-tree algorithm using updated N-tree session information, and thereby generates bandwidth-fair ALM route information.

    摘要翻译: 提供一种终端装置,其通过减少端到端延迟并最大化共享N树ALM节点中的可用带宽来最小化业务拥塞。 在该终端装置中,最优流路径信息表(204)存储所有节点的N树会话信息。 服务器转发表(202)在特定N树会话中存储针对所有节点的带宽公平的ALM路由信息。 ALM转发表构造器(218)使用存储在启发式规则数据库(206)中的网络度量和启发式规则来更新存储在最优流路径信息表(204)中的M树会话信息,使用更新的N 树会话信息,从而生成带宽公平的ALM路由信息。