A route selection method, system and router

A router and routing technology, applied in the direction of transmission systems, digital transmission systems, branch offices to provide special services, etc., can solve the problems that the next-hop router cannot be selected, and the load sharing of multicast data streams cannot be achieved. To achieve the effect of load sharing

Inactive Publication Date: 2007-10-24
HUAWEI TECH CO LTD
View PDF0 Cites 19 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, for the same multicast source or multicast RP, when the router arrives at the multicast source or multicast RP with an equivalent route, it can only select the next-hop router corresponding to one of the routes as its next-hop router. , while other next-hop routers cannot be selected
Subsequent forwarding of multicast data can only be forwarded according to this path, and the load sharing of multicast data streams cannot be achieved

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
  • A route selection method, system and router
  • A route selection method, system and router
  • A route selection method, system and router

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0030] Embodiment 1: Routing with the same multicast source but different multicast groups. As shown in FIG. 1 , FIG. 1 is a schematic diagram of a routing selection method with the same multicast source but different multicast groups according to an embodiment of the present invention. There are two equal-cost routes from router RTC103 to multicast source S1, and the next-hop routers corresponding to these two routes are RTA101 and RTB102 respectively. There are (S1, G1) and (S1, G2) multicast forwarding table entries on router RTC103, S1 is the multicast source address, and G1 and G2 are multicast group addresses. The multicast sources of the two multicast forwarding entries are the same, but the multicast groups are different.

[0031] When selecting the next-hop router corresponding to (S1, G1), router RTC103 uses the hash algorithm:

[0032] Value(G1, M1, N) =

[0033] (1103515245*((1103515245*(G1&M1)+12345)XOR N)+12345)mod2^31

[0034] The values ​​corresponding to t...

Embodiment 2

[0042] Embodiment 2: Routing with the same multicast RP and different multicast groups. As shown in FIG. 2 , FIG. 2 is a schematic diagram of a routing selection method with the same multicast RP but different multicast groups according to an embodiment of the present invention. There are two equal-cost routes from router RTC203 to multicast RP1, and the next-hop routers corresponding to these two routes are RTA201 and RTB202 respectively. There are (*, G1) and (*, G2) multicast forwarding table entries on router RTC203, wherein "*" represents all source addresses, and G1 and G2 are multicast group addresses. The multicast RPs of the two multicast forwarding entries are the same, but the multicast groups are different.

[0043] When selecting the next-hop router corresponding to (*, G1), the router RTC203 uses the hash algorithm:

[0044] Value(G1, M1, N) =

[0045] (1103515245*((1103515245*(G1&M1)+12345)XOR N)+12345)mod2^31

[0046] The values ​​corresponding to the addre...

Embodiment 3

[0054] Embodiment 3: Routing selection with different multicast sources and different multicast groups. As shown in FIG. 3 , FIG. 3 is a schematic diagram of a routing selection method with different multicast sources and different multicast groups according to an embodiment of the present invention. There are two equal-cost routes from router RTC303 to multicast sources S1 and S2, and the corresponding next-hop routers are RTA301 and RTB302 respectively. There are (S1, G1) and (S2, G2) multicast forwarding entries on router RTC303, S1 and S2 are multicast source addresses, and G1 and G2 are multicast group addresses. The multicast sources and multicast groups of the two multicast forwarding entries are different.

[0055] When selecting the next-hop router corresponding to (S1, G1), the router RTC303 uses the hash algorithm:

[0056] Value(S1, G1, M1, N) =

[0057] (1103515245*((1103515245*((S1^G1)&M1)+12345)XOR N)+12345)mod 2^31

[0058] The values ​​corresponding to the...

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 disclosed route selection method comprises: router takes all of the MB address, MB mask and relative next-jump router address as input, calculates with Hash algorithm, and selects the maximal result from multiple next-jump router addresses. This invention shares the loading of MB data flow.

Description

technical field [0001] The invention relates to the technical field of routing, in particular to a routing selection method, system and router. Background technique [0002] Internet Protocol (IP, Internet Protocol) multicast is a data stream transmission mode, which refers to sending a data stream to a certain subset of nodes in the network in a best-effort manner in an IP network. This subset of nodes is called a multicast group. The basic idea of ​​IP multicast is that the source host only sends one copy of data, and the destination address of this data is the address of the multicast group; all hosts in the multicast group can receive the same data copy, and only the hosts in the multicast group The host, that is, the destination host can receive the data copy, but other hosts in the network cannot receive it. [0003] In the multicast mode, the data transmission path is called a multicast distribution tree, and the task of a multicast routing protocol is to build a mu...

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 Applications(China)
IPC IPC(8): H04L12/56H04L12/18
CPCH04L45/00H04L45/16H04L45/22
Inventor 郭锋程松明周小牛张海峰
Owner HUAWEI TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products