Unlock instant, AI-driven research and patent intelligence for your innovation.

Method for calculating forwarding shortest path

A shortest path and message forwarding technology, applied in digital transmission systems, data exchange networks, electrical components, etc., can solve the problems of low message forwarding efficiency, high bandwidth occupancy, and unreasonable use of link bandwidth, etc., to improve Forwarding performance, reasonable use of bandwidth, and improved forwarding efficiency

Active Publication Date: 2011-04-20
ZTE CORP
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] At present, when using the existing technology for packet forwarding, the packet is usually forwarded directly according to the pre-set forwarding path between the switches in the switch stack system, instead of forwarding the packet according to the calculated and judged shortest path. Forwarding, therefore, the disadvantages of using the existing technology are: the forwarding efficiency of the message is low; the bandwidth occupancy rate is high, and the bandwidth usage on the link is unreasonable

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for calculating forwarding shortest path
  • Method for calculating forwarding shortest path
  • Method for calculating forwarding shortest path

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] The core idea of ​​the present invention is: recursively traverse and calculate the weight array from the current switch to the destination switch; compare and obtain the minimum value in the weight array from the current switch to the destination switch to obtain the shortest distance from the current switch to the destination switch in the switch stacking system path.

[0022] The implementation of the technical solution will be further described in detail below in conjunction with the accompanying drawings.

[0023] Such as figure 1 As shown, a method for calculating the forwarding shortest path, the method includes the following steps:

[0024] Step 101, create a weight array; initialize the created weight array according to the preset port attributes, so as to obtain the weight array from the switch to its neighbor switch.

[0025] It should be pointed out here that the weight array is used to identify the distance of the packet forwarding path between the switc...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for computing the transmit shortest path, including the steps of: building the weighting array; initializing the built array according to the presupposed port attribute, to obtain the weighting array of the exchanger to the neighbor exchanger; recurrently traversing and computing the weighting array of the current exchanger to the other exchanger; comparing and acquiring the minimum in the weighting array of current exchanger to the other exchanger, to obtain the shortest path from the current exchanger to the other exchanger in the exchanger stacking system. The invention realizes the shortest path transmit in the exchanger stacking system to lift the transmitting efficiency of the message, reduce the wide band occupancy, cause the wide band use more reasonable on the link.

Description

technical field [0001] The invention relates to a technology for calculating the shortest path for forwarding, in particular to a method for calculating the shortest path for forwarding in a switch stacking system. Background technique [0002] When there are many switches in the switch stack system, the selection of the packet forwarding path will affect the load and forwarding capability of the entire switch stack system. For example, in a stack system composed of six switches, a daisy chain is adopted from switch 1 to switch 6 in sequence, that is, the switches are connected in a ring topology. When a packet comes in from the port of switch 1 and needs to be forwarded to the port of switch 6, if it is forwarded from switch 1 through six switches one by one, it will occupy a lot of bandwidth and make the use of bandwidth on the link unreasonable. For this situation, the fastest forwarding method is to directly forward the message from the port of switch 1 to the port conn...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04L12/56H04L45/122
Inventor 陈建光
Owner ZTE CORP