BANDWIDTH-WEIGHTED EQUAL COST MULTI-PATH ROUTING
    1.
    发明公开
    BANDWIDTH-WEIGHTED EQUAL COST MULTI-PATH ROUTING 审中-公开
    带宽加权平均成本多路径路由

    公开(公告)号:EP3186928A1

    公开(公告)日:2017-07-05

    申请号:EP15760053.7

    申请日:2015-08-31

    IPC分类号: H04L12/707

    摘要: A plurality of equal cost paths through a network from a source node to a destination node are determined. A maximum bandwidth capacity for each link of each of the plurality of equal cost paths is determined, and a smallest capacity link for each of the plurality of equal cost paths is determined from the maximum capacity bandwidths for each link. An aggregated maximum bandwidth from the source node to the destination node is determined by aggregating the smallest capacity links for each of the plurality of equal cost paths. Traffic is sent from the source node along each of the plurality of equal cost paths according to a value of a capacity for the smallest capacity link for each of the plurality of equal cost paths, wherein a total of the sent traffic does not exceed the aggregated maximum bandwidth.

    摘要翻译: 确定从源节点到目的地节点通过网络的多条等成本路径。 确定多个等成本路径中的每一个的每个链路的最大带宽容量,并且根据每个链路的最大容量带宽确定多个等成本路径中的每一个的最小容量链路。 通过聚合多个等成本路径中的每一个的最小容量链路来确定从源节点到目的地节点的聚合最大带宽。 根据多个等成本路径中的每一个的最小容量链路的容量值,从源节点沿多个等成本路径中的每一个发送业务量,其中发送的业务量的总和不超过聚合 最大带宽。