CN1595879A - A method for increasing efficiency of multicast data forwarding in circumstance of large-capacity routing table - Google Patents
A method for increasing efficiency of multicast data forwarding in circumstance of large-capacity routing table Download PDFInfo
- Publication number
- CN1595879A CN1595879A CN 03156710 CN03156710A CN1595879A CN 1595879 A CN1595879 A CN 1595879A CN 03156710 CN03156710 CN 03156710 CN 03156710 A CN03156710 A CN 03156710A CN 1595879 A CN1595879 A CN 1595879A
- Authority
- CN
- China
- Prior art keywords
- multicast
- route
- polymerization
- address
- routing table
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method of improving multicast data transmitting efficiency by high-capacity multicast route list, including the steps: 1) a multicast router establishes multicast message routes; 2) the multicast router polymerizes multicast routes to generate polymerized multicast route; and 3) after completing polymerization, searching a multicast route in new multicast data transmitted by a multicast source, and transmitting the new multicast data through a polymerized route. The invention polymerizes multicast (S, G) routes according to unicast addresses, and thus largely reduces the number of multicast routes in the router and reduces the consumption of internal memory in the router. Besides, because of the reduction of the number of the route lists, the router searching efficiency is also correspondingly improved, and if it adopts the polymerized route to guide multicast data transmission, it can improve multicast transmitting efficiency. In addition, it can reduce the protocol consumption for high-capacity multicast application down to the minimum.
Description
Invention field
The present invention relates generally to the network communications technology, thereby particularly a kind of route table items that is used to reduce multicast PIM agreement improves the method for the transmitting multicast data efficient under the big capacity multicast routing condition.
Background technology
Traditional internet, applications all is with point-to-point IP transmission (unicast technique), and the IP of point-to-multipoint transmission (broadcast technology) is only limited to the local area network (LAN) internal application, and multicasting technology then is to realize the IP transmission technology of point to multiple spot in wide area network.
The eighties in 20th century, the doctor Steve Deering of Stanford University has begun the research of three layers of multicasting technology and has delivered its thesis for the doctorate---" multicast in a kind of datagram network " in December, 1991.Described multicast group managing I GMP agreement (IGMP) and the multicast path basis by DVMRP agreement (Distance Vector Multicast Routing Protocol) in this paper, it successfully is advanced to the IP layer to multicasting technology.Exploration about the IP multicasting technology is being carried out always, and on doctor's Deering basis, people have finished PIM multicast routing protocols such as (Protocol Independent Multicast agreements) successively, and multicast protocol is pushed to whole the Internet.The basic thought of multicast route technology is in the duplicated multicast data just now from the nearest ground of recipient, so network bandwidth in the time of can saving the transmission of a large amount of repeating datas greatly, thereby increasing people believes, in broadband internet is from now on used, multicasting technology will become one of primary circuit routing agreement of multimedia data communication.
Multicast packet relies on the multicast routing table item to finish forwarding.In PIM-DM agreement (PIM multicast routing protocol dense mode), the form of expression of multicast route entry all be (S, G), promptly, two tuples of forming by a source (S) and a group (G) express multicast path by essential information, wherein S and G are unique IP address rather than network segments.Fig. 1 is the schematic diagram of conventional transmitting multicast data process, and as shown in Figure 1, when multicast packet arrives router, router will be finished searching and transmitting of multicast routing table according to this data source address and purpose group address.
PIM-SM agreement (PIM multicast routing protocol sparse mode) relative complex some.For the PIM-SM agreement, except need have identical with the PIM-DM agreement (S, G) outside the routing table, also have (
*, G) routing table is come the forwarding of guide data at shared tree.In the PIM-SM agreement, the forwarding of multicast packet is divided into two kinds of situations, and a kind of multicast share tree that is based on Rendezvous Point is transmitted, this forwarding dependence (
*, G) route table items, a kind of shortest path tree that is based on the source is transmitted, and this forwarding is based on (S, G) route table items.(
*, G) route table items with (S, G) difference of route table items is that the former can mate all S, that is to say that no matter which multicast source sends to the data of multicast group G, can match this route, but it is pointed out that (
*G) route is based on the shared forwarding tree foundation of convergent point, not necessarily multicast source is to the optimal path of multicast group, therefore the PIM-SM agreement is after the user receives multicast data message, also has one from sharing the process that forwarding tree switches to the shortest path forwarding tree, after switching is finished, all create (S, G) route table items to the router the multicast recipient G from multicast source S.Fig. 2 is the schematic diagram of transfer of data shared tree and shortest path tree.In Fig. 2, the shared tree path is represented that by B-C-D shortest path tree is then represented by A-E-D.Therefore, as can be seen from Figure 2, multicast packet lacks through a hop router than shared tree along shortest path tree from S to G.
By above description, we are (S as can be seen, G) list item is to use maximum multicast lists in the multicast PIM agreement, when multicast user and multicast source are many, (S, G) number of list item is also many, thereby reduces (S, G) number of list item will be saved the internal memory of router greatly, improve speed of route lookup and data forwarding efficient.
In addition, multicast only is in starting stage of application in present stage, uses less, in the application of reality, the route table items number seldom thereby also be can't see the actual influence of router, the demand that reduces routing table is not urgent yet, does not all relate to the description of this respect in the present agreement.
From another aspect, multicast PIM-SM agreement has been introduced the notion of shared tree, objectively the route table items decreased number of multicast on shared tree a lot, on shared tree, transmit data, corresponding to a plurality of multicast source S (S1 is to Sn) of a logical group G, only need a multicast path by (
*, G) just can mate.With the PIM-SM protocol class seemingly, other multicast protocols based on shared tree also have similar functions.
But, above-mentioned realization has only solved the problem of route quantity on multicast share tree, on shortest path tree, still there is a large amount of (S, G) route table items, and in actual applications, consider data forwarding efficient, all shared trees are transmitted and all can be switched to the shortest path tree forwarding, so shared tree (
*, G) list item is little to the effect that reduces the multicast route entry.
In a word, in the multicast routing table of prior art, there is a large amount of (S, G) route table items, have a strong impact on the forward efficiency of multicast packet under by many situations at multicast path, consume the memory source of router,, support jumbo multicast application therefore in order to improve the forward efficiency of multicast packet, must reduce (S, G) route table items.
Summary of the invention
Therefore, the present invention makes at solving the aforementioned problems in the prior, thereby its objective is and provide a kind of route table items that can reduce multicast PIM agreement to improve the method for the transmitting multicast data efficient under the big capacity multicast application.
To achieve these goals, improve the method for big capacity multicast path by transmitting multicast data efficient under the situation about existing thereby the invention provides a kind of route table items that reduces multicast PIM agreement, this method may further comprise the steps:
1) multicast router is finished the establishment of multicast message route;
2) multicast router carries out the multicast route aggregation, generates polymerization multicast route;
3) after polymerization is finished, the new multicast packet that sends from multicast source search multicast path by, use the routing forwarding after the polymerization.
Further, for the PIM-SM agreement, in described step 1) and step 2) between also comprise the step that switches to shortest path tree from shared tree.
Wherein, in described step 2) in have only multicast group address, incoming interface, outgoing interface tabulation and the flag bit same multicast route just can polymerization.
In above-mentioned steps, the feature of the new polymerization multicast route that is generated is that the incoming interface of this route is identical with original route with the outgoing interface tabulation, and various flag bits are also identical, and the multicast source source address is the network segment address after the polymerization, and subsidiary network segment information, multicast group address is constant.
Wherein, the method for calculating the mask of multicast source address preferably adopts the mask coding method of indifference address.
In addition, in the described step 3) preferably according to source address optimum Match principle search multicast path by.
Further, above-mentioned steps 2) may further comprise the steps:
2-1) check multicast routing table, judge whether to exist more than 1 multicast path by, as not having, then finish polymerization process; If any then the multicast path of same multicast group address correspondence by finding out, sort, and to get article one route be current route;
2-2) judge whether also to exist other routes,, then finish polymerization process,, then take off a route as existing as not existing, and judge institute's route of getting whether can with current route aggregation; As polymerizable not, getting route is made as current route, repeat this step; As polymerizable, then
2-3), generate a new polymerization multicast route for routing table that can polymerization.And
2-4) judged whether next bar route,, then finished polymerization process as not having; If any, take off a route, and judge this route whether can with step 2-3) in polymerization multicast route aggregation; As can not, getting route is made as current route, get back to step 2-2; If can then finish the polymerization of this route and polymerization route, repeat this step then.
Further described step 2-3) may further comprise the steps:
A. calculate the mask of multicast source address;
B. generate the polymerization route;
C. with the periodicity timer in the polymerization multicast route, be made as the minimum value of the periodicity timer in the preceding route of polymerization.
Further, thereby the route table items of minimizing multicast PIM agreement provided by the present invention improves in the method for transmitting multicast data efficient, also comprise the step 4) that simplify to handle adds prune packet, it is characterized in that source address information in the message is the network segment address after the route table items polymerization.
Method of the present invention to be in the multicast router on the shortest path tree (S, G) route table items is realized polymerization according to multicast source address S.Its beneficial effect is: 1) multicast path by source address be unicast ip address, and the IP address assignment of clean culture is clocklike, generally be to distribute according to a network segment, therefore, realize multicast (S according to unicast address, G) polymerization of route can significantly reduce the number of multicast routes in the router, reduces the consumption to router memory; 2) simultaneously because the quantity of routing table reduces, route querying efficient also obtains corresponding raising, if adopt the polymerization route to instruct transmitting multicast data, can improve multicast forwarding efficient.3) the adding prune packet after the optimization can significantly reduce, and the agreement consumption of the multicast application under the big capacity is reduced to minimum.
Brief description of drawings
Fig. 1 is the schematic diagram of conventional transmitting multicast data process;
Fig. 2 is the schematic diagram of transfer of data shared tree and shortest path tree;
Fig. 3 is the example of multicast route aggregation;
Fig. 4 is the polymerization process schematic diagram.
Embodiment
Below in conjunction with accompanying drawing method of the present invention is described in detail.
For realize multicast path by polymerization, need finish following steps:
1, multicast router is finished the establishment of multicast message route according to the normal flow of agreement regulation, and two multicast source S1 and S2 send multicast packet to multicast group G.For convenience of description, in the present embodiment, the IP address of S1 is 10.10.1.2, and the IP address of S2 is 10.10.1.5, and multicast group address G is 224.2.2.2.
If the PIM-SM agreement need finish from shared tree and switch to shortest path tree, like this all-router between multicast source and multicast recipient have (10.10.1.2,224.2.2.2) and (10.10.1.5,224.2.2.2) route.
2, multicast router starts multicast path by polymerization process, the multicast path that finds same multicast group 224.2.2.2 by, discovery has two multicasts to be routed to group 224.2.2.2, and these two routes are except the IP address in source is inequality, and other are all identical, meet polymerizing condition, carry out polymerization according to the indifference addressing mode, generate new multicast path by (10.10.1.0/29,224.2.2.2), finish the process of multicast polymerization, two original multicast paths by the deletion (see figure 3).It should be noted that above-mentioned multicast path by in 29 to represent the length of mask be 29, its implication is equal to following method for expressing, and (10.10.1.0/255.255.255.248,224.2.2.2), this shows that it is the route of a network segment.
3, after polymerization is finished, the route after the new multicast packet use polymerization of source S1 and S2 transmission is finished forwarding.
The implementation procedure of this programme has more than been described, below specifically describe with regard to the realization of route aggregation wherein.
Multicast (S, G) route generally also should include interface except comprising multicast source S and multicast group information, the outgoing interface tabulation, flag bit and some timer values, have only group address in the above, incoming interface, outgoing interface tabulation identical with flag bit (S, G) route table items just can polymerization.After the polymerization, originally route table items also comprises many timers, for periodic timer wherein, as adding prune packet timer regularly, get the value of the minimum of original all list items, it is not overtime that assurance is in the list item of router of multicast transmit tree upstream like this, and the value of other timers is analyzed according to actual, each manufacturer may define own more distinctive timers, so remaining timer is relevant with the specific implementation of each manufacturer.Route after the polymerization need keep original multicast source S information, so that route partition is used, in the present embodiment, information about multicast source is present in the route after the polymerization in the mode of two kinds of recommendations, 1, doubly linked list form, application efficiency is higher under the fewer situation in source; 2, the form of Hash (Hash) table, efficient is higher when the source is many.
For finish multicast path by polymerization, as shown in Figure 4, step 2) may further comprise the steps:
2-1, check multicast routing table, judge whether to exist more than 1 multicast path by, as not having, then finish polymerization process; If any then the multicast path of same multicast group address correspondence by finding out, sort, and get article one route;
2-2, judge whether also to exist other routes,, then finish polymerization process,, then take off a route, and judge that according to above-mentioned standard it whether can polymerization as existing as not existing; As polymerizable not, repeat this step; As polymerizable, then
2-3, for routing table that can polymerization, calculate the mask of its multicast source address, the method that unicast protocol calculates mask has two kinds, and a kind of is to adopt indifference address mask coding (get the best mask of source address, can comprise the minimum mask of all IP addresses), the polymerization of a kind of employing nature network segment, the former handles more complicated, and amount of calculation is big, but matched routings is effective, the latter handles simply, but the matched routings inaccuracy.The polymerizing condition of considering multicast is than unicast protocol strictness, when the multiple source S of the same natural network segment to the multicast path of group G by going out or incoming interface when inconsistent, express the paradigmatic relation more complicated according to natural network segment polymerization, therefore preferably adopt indifference address mask coded system realize multicast path by polymerization.
Generate a new polymerization multicast route then, the incoming interface of this route is identical with original route with the outgoing interface tabulation, and various flag bits are also identical, and the multicast source source address is the network segment address after the polymerization, attach network segment information, and multicast group address is constant.Then
2-4, take off a route, and judge this route whether can with step 2-3) the polymerization route aggregation; As can not, then get back to step 2-2; If can get back to step 2-3.
When multicast packet arrives router, search multicast path by (being the mask minimum) according to source address optimum Match principle, the purpose of doing like this is that its source address mask is 32, must be optimum if multicast path is not by participating in polymerization.
Below with the process above the real example explanation:
Supposing has 5 multicast paths by as follows to same group of 224.1.1.1 in the router:
(10.1.1.1,224.1.1.1), (10.1.1.2,224.1.1.1), (202.1.1.9,224.1.1.1), (202.1.1.1,224.1.1.1) and (202.1.1.2,224.1.1.1).
The first step, judge whether to organize whether have under the 224.1.1.1 more than 1 multicast path by, then these 5 routes are sorted according to source address IP, the result is as follows:
(10.1.1.1，224.1.1.1)、(10.1.1.2，224.1.1.1)、(202.1.1.1，224.1.1.1)、(202.1.1.2，224.1.1.1)、(202.1.1.9，224.1.1.1)。
Second step, get article one route (10.1.1.1,224.1.1.1), and then get route (10.1.1.2,224.1.1.1), judge that these two routes whether can polymerization, for our problem is described, we suppose that these two routes can polymerization, then generate new polymerization route (10.1.1.0/255.255.255.252,224.1.1.1), the generative process of polymerization route is as follows: at first, relatively whether the incoming interface of two routes is consistent with outgoing interface, if it is consistent, and then whether the marker bit that compares two routes is identical, if it is identical, show that two routes can polymerization, calculate the minimum network segment that can comprise IP address 10.1.1.1 and 10.1.1.2 then, and whether check with existing multicast path by network segment conflict, through calculating, the network segment is 10.1.1.0/255.255.255.252, and with existing multicast path by not conflicting, in multicast routing table, generate so new multicast path by (10.1.1.0/255.255.255.252,224.1.1.1), the route of its access interface before the polymerization duplicated, marker bit is also done same processing, be recorded in the polymerization route at last two original route deletions, and original source information 10.1.1.1 and 10.1.1.2, use in order to list item division in the future.
The 3rd the step, get route (202.1.1.1,224.1.1.1), judge whether can and the route of polymerization (10.1.1.0/255.255.255.252,224.1.1.1) polymerization is in order to say something, suppose the inconsistent of the mark of this route and top polymerization, then this route can not polymerization.
The 4th the step, continue to take off a route (202.1.1.2,224.1.1.1), judge whether that (the energy polymerization is supposed in 202.1.1.1,224.1.1.1) polymerization for energy and route just now, generate new polymerization route (202.1.1.0/255.255.255.252,224.1.1.1).
The 5th the step, continue to take off a route (202.1.1.9,224.1.1.1), judging whether can (supposing can polymerization for 202.1.1.0/255.255.255.252,224.1.1.1) polymerization with the polymerization route, then generate new route (202.1.1.0/255.255.255.240,224.1.1.1).
The 6th step, search whether also have under the group 224.1.1.1 multicast path by, do not have, the route aggregation of this multicast group is finished.
Can see that by polymerization, 5 multicast paths originally are by becoming 2.
Under specific circumstances, polymerization route can divide:
1, the route of polymerization has been received the adding prune packet, and its state is changed, and no longer meets the condition of polymerization.
2, router has been created new route entry.The source address of this route entry is in polymerization multicast route scope, but original multicast polymerization route can not comprise this route.
For situation 1, because the information of source S originally is kept in the route table items, the polymerization route is the boundary with this route, split into two polymerization routes, realize polymerization because adopt indifference address mask coding, therefore this division can be carried out, and this multicast path that causes the division of polymerization route is by oneself forming a non-polymeric route.
For situation 2, newly-generated multicast path by by the multicast path of polymerization by covering, but therefore new route and do not meet polymerizing condition need divide the route of original polymerization, with this route is the boundary, and original polymerization route is split into two polymerization routes.
After the route implementing polymerization, can simplify processing to the adding among the PIM-SM (join) message, stipulate according to multicast protocol, the downstream router router transmission upstream regularly that is in multicast transmit tree joins message, join message is according to each (S, G) list item is constructed, therefore when downstream router has a lot of list item, it is also a lot of to the number of upstream to send the Join message, had a strong impact on the handling property of router, but after realizing the multicast route aggregation, can become a message to a plurality of messages and send, reduce the quantity that message sends.For example before the polymerization, router has that (S, G) list item is 100, when each Join message sends, needs 100 messages of structure to send.If but realize polymerization, 100 multicast routing table items become 5 list items after the polymerization, because the attribute unanimity between the route of polymerization, join message so can send to common upstream, in last example, source address information no longer is independent host address in the message, but network segment address, the then corresponding multicast number that joins message also reduces to 5, after upstream router is received and is joined message, according to the mask in the message mate multicast path by, if can mate, then refresh corresponding multicast path by, so the join message treatment effect after the polymerization is tangible.
It should be noted that the message after this polymerization just can not send if upstream router is not supported route aggregation, still should (S, G) list item sends the Join message separately according to each.This function relies on manual configuration to finish.
The simplification that adds prune packet can improve the efficient of multicast protocol itself greatly, reduces multicast protocol consumption, and objectively the free time goes out more CPU ability processing forward incident, thereby can further improve the forward efficiency of multicast packet.
Adopt indiscriminate coded system realization route aggregation also can realize the simplification of forwarding-table item, for the routing device that adopts software to transmit, route after the polymerization directly just can instruct the forwarding of multicast packet, because the minimizing of list item, search expending time in of list item and also will reduce, so the search efficiency of repeating process will be improved.For the router that adopts hardware to transmit, for forwarding-table item can generate from the route after the polymerization, if the hardware plane supports the source address of mask to search, then the route table items of these polymerizations can directly be issued to microcode, if do not support, then can be according to the S address, source of list item record after the polymerization, the polymerization list item of correspondence is converted to independently (S, G) list item information is issued to microcode.
Though the above description of this invention carries out with reference to its embodiment,, these descriptions should not be considered to limitation of the present invention.Any modification and conversion that does not deviate from spirit and scope of the invention all belongs to by within the defined scope of the present invention of accessory claim.
Claims (9)
1. one kind big capacity multicast routing table improves the method for transmitting multicast data efficient down, may further comprise the steps:
1) multicast router is finished the establishment of multicast message route;
2) multicast router carries out the multicast route aggregation, generates polymerization multicast route; And
3) after polymerization is finished, the new multicast packet that sends from multicast source search multicast path by, use the routing forwarding after the polymerization.
2. big capacity multicast routing table according to claim 1 improves down the method for transmitting multicast data efficient, it is characterized in that the agreement for PIM-SM, in described step 1) and step 2) between state and comprise the step that switches to shortest path tree from shared tree.
3. big capacity multicast routing table according to claim 1 improves down the method for transmitting multicast data efficient, it is characterized in that in described step 2) in have only multicast group address, incoming interface, the outgoing interface tabulation multicast path identical by just can polymerization with flag bit.
4. improve the method for transmitting multicast data efficient down according to claim 1,2 or 3 described big capacity multicast routing tables, it is characterized in that in the incoming interface and outgoing interface tabulation of the polymerization multicast route that generated, various flag bits are identical with original route, the multicast source source address is the network segment address after the polymerization, and subsidiary network segment information, multicast group address is constant.
5. big capacity multicast routing table according to claim 4 improves the method for transmitting multicast data efficient down, it is characterized in that described network segment address adopts the mask coding method of indifference address to calculate.
6. improve the method for transmitting multicast data efficient down according to claim 1,2 or 3 described big capacity multicast routing tables, it is characterized in that described step 3) according to source address optimum Match principle search multicast path by.
7. improve the method for transmitting multicast data efficient according to claim 1,2 or 3 described big capacity multicast routing tables down, it is characterized in that described step 2) may further comprise the steps:
2-1) check multicast routing table, judge whether to exist more than 1 multicast path by, as not having, then finish polymerization process; If any then the multicast path of same multicast group address correspondence by finding out, sort, and to get article one route be current route;
2-2) judge whether also to exist other routes,, then finish polymerization process,, then take off a route as existing as not existing, and judge institute's route of getting whether can with current route aggregation; As polymerizable not, getting route is made as current route, repeat this step; As polymerizable, then
2-3), generate a new polymerization multicast route for routing table that can polymerization.And
2-4) judged whether next bar route,, then finished polymerization process as not having; If any, take off a route, and judge this route whether can with step 2-3) in polymerization multicast route aggregation; As can not, getting route is made as current route, get back to step 2-2; If can then finish the polymerization of this route and polymerization route, repeat this step then.
8. big capacity multicast routing table according to claim 7 improves the method for transmitting multicast data efficient down, it is characterized in that step 2-3) may further comprise the steps:
A. calculate the mask of multicast source address;
B. generate the polymerization route;
C. with the periodicity timer in the polymerization multicast route, be made as the minimum value of the periodicity timer in the preceding route of polymerization.
9. big capacity multicast routing table according to claim 1 and 2 improves down the method for transmitting multicast data efficient, it is characterized in that also comprising that step 4) adds the network segment address after source address information in the prune packet is set to the route table items polymerization.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB03156710XA CN100384131C (en) | 2003-09-08 | 2003-09-08 | A method for increasing efficiency of multicast data forwarding in circumstance of large-capacity routing table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB03156710XA CN100384131C (en) | 2003-09-08 | 2003-09-08 | A method for increasing efficiency of multicast data forwarding in circumstance of large-capacity routing table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1595879A true CN1595879A (en) | 2005-03-16 |
| CN100384131C CN100384131C (en) | 2008-04-23 |
Family
ID=34660050
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB03156710XA Expired - Fee Related CN100384131C (en) | 2003-09-08 | 2003-09-08 | A method for increasing efficiency of multicast data forwarding in circumstance of large-capacity routing table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100384131C (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007062597A1 (en) * | 2005-12-01 | 2007-06-07 | Huawei Technologies Co., Ltd. | A method, system and user-determining unit for building a bearing of an application service |
| WO2008095435A1 (en) * | 2007-02-05 | 2008-08-14 | Huawei Technologies Co., Ltd. | Multicast method and multicast routing method |
| CN100454893C (en) * | 2005-03-21 | 2009-01-21 | 中兴通讯股份有限公司 | Rapid multicast realizing method |
| CN101242419B (en) * | 2008-03-19 | 2010-12-29 | 中兴通讯股份有限公司 | Fast multicast processing method |
| CN101764756B (en) * | 2010-01-14 | 2012-01-25 | 福建星网锐捷网络有限公司 | Method and device for pruning forwarding path of multicast data and network equipment |
| CN104426781A (en) * | 2013-09-05 | 2015-03-18 | 华为技术有限公司 | Method for realizing gathering of multicast routers, multicast method and route equipment |
| WO2016082614A1 (en) * | 2014-11-27 | 2016-06-02 | 中兴通讯股份有限公司 | Method and device for processing multicast route table entry, and computer storage medium |
| CN109561022A (en) * | 2017-09-27 | 2019-04-02 | 华为技术有限公司 | A kind of multicast forward method and multicast router |
| CN111629275A (en) * | 2020-05-15 | 2020-09-04 | 浙江信网真科技股份有限公司 | Safety filtering method for multicast table item self-aggregation |
| CN111629276A (en) * | 2020-05-15 | 2020-09-04 | 浙江信网真科技股份有限公司 | Security filtering method and device for controlling self-conversion of items |
| CN111698231A (en) * | 2020-06-02 | 2020-09-22 | 浙江宇视科技有限公司 | Address data management method, device, equipment and storage medium |
| CN111917651A (en) * | 2020-07-13 | 2020-11-10 | 烽火通信科技股份有限公司 | Multicast forwarding method and system for cross chip |
| CN112104560A (en) * | 2020-07-27 | 2020-12-18 | 深圳市风云实业有限公司 | Method for customizing multicast path |
| CN112468395A (en) * | 2020-12-08 | 2021-03-09 | 信而泰(无锡)信息技术有限公司 | Method and device for processing BGP (border gateway protocol) route |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102104488B (en) | 2009-12-22 | 2013-03-13 | 华为技术有限公司 | Multicast message processing method and device |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6928075B2 (en) * | 2000-12-07 | 2005-08-09 | Nortel Networks Limited | Method and apparatus for aggregating multicast interfaces |
| US6633548B2 (en) * | 2001-01-30 | 2003-10-14 | Nokia Intelligent Edge Routers Inc. | Method and apparatus for ternary content addressable memory (TCAM) table management |
| CN100499530C (en) * | 2002-05-10 | 2009-06-10 | 华为技术有限公司 | IP group broadcast route forwarding optimizing method |
| CN1207878C (en) * | 2002-10-14 | 2005-06-22 | 港湾网络有限公司 | Routing table compression method |
-
2003
- 2003-09-08 CN CNB03156710XA patent/CN100384131C/en not_active Expired - Fee Related
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100454893C (en) * | 2005-03-21 | 2009-01-21 | 中兴通讯股份有限公司 | Rapid multicast realizing method |
| WO2007062597A1 (en) * | 2005-12-01 | 2007-06-07 | Huawei Technologies Co., Ltd. | A method, system and user-determining unit for building a bearing of an application service |
| WO2008095435A1 (en) * | 2007-02-05 | 2008-08-14 | Huawei Technologies Co., Ltd. | Multicast method and multicast routing method |
| US8009671B2 (en) | 2007-02-05 | 2011-08-30 | Huawei Technologies Co., Ltd. | Multicast method and multicast routing method |
| CN101242342B (en) * | 2007-02-05 | 2012-09-19 | 华为技术有限公司 | Multicast method and multicast route method |
| CN101242419B (en) * | 2008-03-19 | 2010-12-29 | 中兴通讯股份有限公司 | Fast multicast processing method |
| CN101764756B (en) * | 2010-01-14 | 2012-01-25 | 福建星网锐捷网络有限公司 | Method and device for pruning forwarding path of multicast data and network equipment |
| CN104426781A (en) * | 2013-09-05 | 2015-03-18 | 华为技术有限公司 | Method for realizing gathering of multicast routers, multicast method and route equipment |
| WO2016082614A1 (en) * | 2014-11-27 | 2016-06-02 | 中兴通讯股份有限公司 | Method and device for processing multicast route table entry, and computer storage medium |
| CN109561022B (en) * | 2017-09-27 | 2020-09-08 | 华为技术有限公司 | Multicast forwarding method and multicast router |
| CN109561022A (en) * | 2017-09-27 | 2019-04-02 | 华为技术有限公司 | A kind of multicast forward method and multicast router |
| US11190367B2 (en) | 2017-09-27 | 2021-11-30 | Huawei Technologies Co., Ltd. | Multicast forwarding method and multicast router |
| CN111629275A (en) * | 2020-05-15 | 2020-09-04 | 浙江信网真科技股份有限公司 | Safety filtering method for multicast table item self-aggregation |
| CN111629276A (en) * | 2020-05-15 | 2020-09-04 | 浙江信网真科技股份有限公司 | Security filtering method and device for controlling self-conversion of items |
| CN111629276B (en) * | 2020-05-15 | 2022-04-19 | 浙江信网真科技股份有限公司 | Security filtering method and device for controlling self-conversion of items |
| CN111698231A (en) * | 2020-06-02 | 2020-09-22 | 浙江宇视科技有限公司 | Address data management method, device, equipment and storage medium |
| CN111698231B (en) * | 2020-06-02 | 2022-06-24 | 浙江宇视科技有限公司 | Address data management method, device, equipment and storage medium |
| CN111917651A (en) * | 2020-07-13 | 2020-11-10 | 烽火通信科技股份有限公司 | Multicast forwarding method and system for cross chip |
| CN111917651B (en) * | 2020-07-13 | 2022-04-15 | 烽火通信科技股份有限公司 | Multicast forwarding method and system for cross chip |
| CN112104560A (en) * | 2020-07-27 | 2020-12-18 | 深圳市风云实业有限公司 | Method for customizing multicast path |
| CN112468395A (en) * | 2020-12-08 | 2021-03-09 | 信而泰(无锡)信息技术有限公司 | Method and device for processing BGP (border gateway protocol) route |
| CN112468395B (en) * | 2020-12-08 | 2022-07-01 | 信而泰(无锡)信息技术有限公司 | Method and device for processing BGP (border gateway protocol) route |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100384131C (en) | 2008-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1595879A (en) | A method for increasing efficiency of multicast data forwarding in circumstance of large-capacity routing table | |
| US8064446B2 (en) | Multicast with adaptive dual-state | |
| CN1838634A (en) | Rapid multicast realizing method | |
| CN1731760A (en) | Ad Hoc network routing method based on flooding mechanism | |
| CN1809022A (en) | Ethernet device stacking method and its system | |
| CN101047550A (en) | Block structure of P2P network and its network set method | |
| CN1716904A (en) | Group broadcast realizing method based on multiple service transmission platform | |
| CN101060494A (en) | A route selection method, system and router | |
| CN1716905A (en) | Multicast packet relay device adapted for virtual router | |
| CN1791054A (en) | Virtual special network multicast method by virtual router mode | |
| CN1243430C (en) | Method for realizing registration from multicast source to collection point | |
| CN1866845A (en) | Virtual identifying method for multicast forwarding table output port | |
| CN1588927A (en) | Method for large scale multimedia cut-in net gate | |
| CN101035088A (en) | Method, system and access device for realizing the intercommunication of two layers of local specific service | |
| Maddali et al. | Efficient Capacity-Constrained Multicast in RC-Based P2P Networks | |
| CN101577628B (en) | Application level any-source multi-cast method satisfying capacity constraint and QoS constraint | |
| Majumder et al. | Scalable content-based routing in pub/sub systems | |
| CN1819556A (en) | Multi-routing broadcasting method with dynamic delay constraining based on minimal generating tree and greedy algorithm | |
| CN1716910A (en) | Method to provide multicast data transmission in a discontinuous network | |
| CN1592250A (en) | Flow medium data multi-point transmission method | |
| CN1216491C (en) | Application tier combined playing method for multi-point video conference system based on reciprocal interconnection | |
| CN1599357A (en) | Fuzzy path selecting method for cooperating energy protection and service quality guarantee at self-organizing network enviroment | |
| CN1917398A (en) | Method for creating shared multicast tree in single kernel | |
| CN1870564A (en) | Method and system for group playing look-up based on three-state address associative storage | |
| CN1968122A (en) | Simulated annealing-based dynamically distributed multicast routing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080423 Termination date: 20190908 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |