IP loop distribution type and width processing method

Abstract

An IP distributed bandwidth process method relating to electric communication technology is to carry out a certain access control to every nexus on the IP ring applying dual-ring topological structure, a flow control packet controls data transfer according to congestion nexus information on IP ring and its situated relative position to finish the flow control on each nexus by fair algorithm with weight to transfer flow information mutually, solving the problem of line head blocking

Description

technical field [0001] The invention relates to electric communication technology, in particular to an IP ring distributed bandwidth processing method. Background technique [0002] CISCO proposed DPT technology, namely Dynamic Packet Transport, which is the fourth step in CISCO's optical interconnection strategy. Its core is target node stripping and bandwidth multiplexing, but DPT technology has the feature of Head of line blocking weakness: [0003] DPT's SRP-fa algorithm restricts the "fairness" principle in detail, but does not fully implement bandwidth reuse. When the SRP-fa fairness algorithm restricts the uplink traffic of nodes, it only limits the total traffic. Destination nodes are not considered. Such as figure 1 As shown, assume that node 1, node 2, and node 3 all send data packets from the outer ring to node 4. If node 3 is congested, it will send a flow control packet with flow limit information to node 2 through the inner ring, that is, an announcement pac...

AI Technical Summary

Problems solved by technology

[0003] DPT's SRP-fa algorithm restricts the "fairness" principle in detail, but does not fully implement bandwidth reuse. When the SRP-fa fairness algorithm restricts the uplink traffic of nodes, it only limits the total traffic. The destination node is not considered

like figure 1 As shown, assume that node 1, node 2, and node 3 all send data packets from the outer ring to node 4. If node 3 is congested, it will send a flow control packet with flow limit information to node 2 through the inner ring, that is, an announcement packet , node 2 then copies the flow control packet and sends it from the inner ring to node 1. Following the principle of the shortest path, the control packet is sent in the opposite ring direction of the corresponding data packet path. The fairness algorithm SRP-fa executed on node 1 and node 2 is based on The received traffic limit information restricts the total traffic of the node on the ring, the purpose is to relieve or reduce the congestion of node 3, so that all the traffic of node 1 on the outer ring will be restricted; assuming that node 1 sends to node 2, 3, 4 data packets, among these data packets, only the data packets sent to node 4 are responsible for the congestion of node 3, and the data packets sent to nodes 2 and 3 have no "contribution" to the congestion of node 3, in In SRP-fa, due to the congestion of node 3, the traffic sent from node 1 to nodes 2 and 3 is restricted, resulting in head-of-line blocking. This processing method is unreasonable and wastes bandwidth.

Images