Comparison of two bridge routing approaches

Zhang, L.

doi:10.1109/65.3237

Cited by 17 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparing n times like this , we can obtain the shortest path from V i to V j at last. Now there is one n order matrix sequence: D (-1) ,D (0) ,D (1) ……D (k) , …… D (n-1) and computation formulas are shown below [9]: The distance among the three router is as follows: Where the sequence of the router A 、 B 、 C is respectively 0, 1, 2. In the table, P represents path , D (0) represents adding a router A from initial state , D (1) represents adding a router B , D (2) represents adding a router C. …”

Section: Flody Routing Algorithmmentioning

confidence: 99%

Research on the performence of dynamic routing algorithm

Yang

Wang²,

Wen-dong

2009

2009 International Conference on Machine Learning and Cybernetics

View full text Add to dashboard Cite

On the basis of analyzing static routing algorithm and dynamic routing algorithms, this paper focus on the link state routing of the dynamic routing algorithm, puts forward a more concise routing way in the link state routing. Dijkstra routing algorithm is suitable for calculating the shortest path from one router to other routers, but there are more point-to-point links in the computer network, Floyd routing algorithm is more suitable for calculating the shortest distance between two router, and it is more practical in the computer network.

show abstract

Section: Flody Routing Algorithmmentioning

confidence: 99%

Research on the performence of dynamic routing algorithm

Yang

Wang²,

Wen-dong

2009

2009 International Conference on Machine Learning and Cybernetics

View full text Add to dashboard Cite

show abstract

“…For the Metrobridge, a source routing scheme [2,10] was chosen. To increase the efficiency of routing and filtering a CAM was used.…”

Section: Communication Subsystem Hardware Structurementioning

confidence: 99%

“…Other time-critical operations of the PC interface module are routing, filtering and ARC. For the Metrobridge, a source routing scheme [2,10] was chosen. To increase The PC interface module is connected to the CFR interface using two transputer links.…”

Section: Communication Subsystem Hardware Structurementioning

confidence: 99%