CN109639574B - Self-adaptive multicast routing method - Google Patents

Self-adaptive multicast routing method Download PDF

Info

Publication number
CN109639574B
CN109639574B CN201910093919.2A CN201910093919A CN109639574B CN 109639574 B CN109639574 B CN 109639574B CN 201910093919 A CN201910093919 A CN 201910093919A CN 109639574 B CN109639574 B CN 109639574B
Authority
CN
China
Prior art keywords
multicast
datagram
router
multicast group
core
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.)
Active
Application number
CN201910093919.2A
Other languages
Chinese (zh)
Other versions
CN109639574A (en
Inventor
孙明
罗阳星
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sichuan Electronic Information Industry Technology Research Institute Co ltd
Original Assignee
Sichuan Electronic Information Industry Technology Research Institute Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Sichuan Electronic Information Industry Technology Research Institute Co ltd filed Critical Sichuan Electronic Information Industry Technology Research Institute Co ltd
Priority to CN201910093919.2A priority Critical patent/CN109639574B/en
Publication of CN109639574A publication Critical patent/CN109639574A/en
Application granted granted Critical
Publication of CN109639574B publication Critical patent/CN109639574B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/16—Multipoint routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/26—Route discovery packet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/825—Involving tunnels, e.g. MPLS

Abstract

The invention discloses a self-adaptive multicast routing method, which is characterized in that according to the current specific multicast group and network environment, the optimal routing method is selected in a self-adaptive manner, a core-based discovery method is selected for the multicast group with higher density change rate of multicast group members to transmit data, a flooding and pruning method is selected for the multicast group with denser multicast group members to transmit data, and a tunnel method is selected for the users with more dispersed multicast group members to transmit data, so that the method has higher flexibility, and the advantages of the multicast technology can be exerted in a highest efficiency manner under various environments. In addition, the invention can also serve the users of the unicast network, can be seamlessly connected with the existing multicast technology and application layer technology, can be used together, and has wide application range.

Description

Self-adaptive multicast routing method
Technical Field
The invention belongs to the technical field of wireless network communication, and particularly relates to a design of a self-adaptive multicast routing method.
Background
In 1988, Deering proposed the concept of IP multicast, and since this IP multicast technology has gained widespread attention. Multicasting is intermediate between unicast and broadcast communications and can send packets sent by a sender to a group of receivers located in different subnets. The basic concept of multicast is "group", a multicast group being a group of receivers who wish to receive a particular data stream. This group has no physical or geographical boundaries: the hosts within a group may be located anywhere on the internet or a private network. Each node in a multicast group is called a multicast group member (multicast group member).
In various multicast applications, unicast can be realized, but as the number of receivers increases, the number of data packets to be transmitted increases linearly, and for a plurality of receivers, n copies of the same data packet need to be transmitted, so that the traffic volume is multiplied, a lot of bandwidth of a network is occupied, and network congestion sometimes occurs. However, the multicast IP packet is only sent once, and the router will automatically forward the packet to each receiver located on different network segments, which may be the smallest number of copies of the packet transmitted in the network, so the multicast technology is very necessary.
However, in the conventional multicast mode, a single routing mechanism is adopted, an optimal routing scheme cannot be selected according to the aggregation degree of the members in the multicast group, the flexibility is low, and the advantages of the multicast technology cannot be exerted in various environments with the highest efficiency.
Disclosure of Invention
The invention aims to solve the problem that the existing traditional multicast mode adopts a single routing mechanism and cannot exert the advantages of the multicast technology in various environments most efficiently, and provides a self-adaptive multicast routing method.
The technical scheme of the invention is as follows: an adaptive multicast routing method, comprising the steps of:
and S1, operating RTP protocol in the multicast mode of the server side, and sending the streaming media data to the multicast channel identified by the multicast address.
And S2, taking each user sending the multicast request service in the multicast range as a multicast group member, and counting to obtain the number N of the multicast group members.
And S3, dividing the number N of the multicast group members by the area of the multicast range to obtain the density rho of the multicast group members.
S4, judging whether the time is at the time threshold TmWhether a rate of change V of intra-multicast group membership density ρ is greater than a rate of change threshold VmIf so, the process proceeds to step S5, otherwise, the process proceeds to step S6.
And S5, transmitting data in the multicast channel by a core-based discovery method.
S6, judging whether the density rho of the multicast group members is larger than the threshold rho of the density of the membersmIf so, the process proceeds to step S7, otherwise, the process proceeds to step S8.
And S7, transmitting data in the multicast channel by a flooding and pruning method.
And S8, transmitting data in the multicast channel by the tunnel method.
Further, step S5 includes the following substeps:
s51, appointing a core router for the multicast group, and obtaining its IP unicast address.
S52, creating a forwarding tree of the multicast group with the core router as a root node.
S53, when any router in the forwarding tree sends the datagram to the core router, processing the datagram through each intermediate router between the core router and the router.
Further, the specific method for the intermediate router to process the datagram in step S53 is as follows:
if the sent datagram is a multicast datagram and the destination address of the sent datagram is the group address of the multicast group, forwarding the datagram to each member in the multicast group through an intermediate router;
if the transmitted datagram is a datagram requesting to join the multicast group, the datagram is added to the route of the intermediate router, and a copy of each multicast datagram is forwarded to the router that issued the datagram.
Further, step S7 includes the following substeps:
s71, appointing a core router for the multicast group, and obtaining its IP unicast address.
S72, creating a forwarding tree of the multicast group with the core router as a root node.
S73, judging whether the downstream branch of each router on the forwarding tree has the member of the multicast group, if yes, entering the step S74, otherwise, entering the step S75.
S74, reserving the router and the branches downstream of the router, and going to step S76.
S75, cutting the router and the branches downstream thereof, and proceeding to step S76.
S76, when each router in the forwarding tree receives a multicast datagram, it is determined whether it is sent from the source point via the shortest path, if yes, step S77 is entered, otherwise, step S78 is entered.
S77, forwarding the received multicast datagram to all other directions.
S78, the multicast datagram is discarded.
Further, step S8 includes the following substeps:
and S81, adding the header of the common datagram to the multicast datagram by the router at the datagram sending end, and encapsulating again to obtain the unicast datagram sent to the single destination station.
And S82, sending the unicast datagram to the router at the datagram receiving end through the tunnel.
And S83, stripping the header of the unicast datagram by the router at the receiving end of the datagram to restore the header to the original multicast datagram and continuously transmitting the multicast datagram to other destination stations.
The invention has the beneficial effects that:
(1) the invention self-adaptively selects the optimal routing method according to the current concrete multicast group and network environment, selects a core-based discovery method for the multicast group with larger density change rate of multicast group members to transmit data, selects a flooding and pruning method for the multicast group with denser multicast group members to transmit data, selects a tunnel method for users with more dispersed multicast group members to transmit data, has higher flexibility, and can exert the advantages of the multicast technology in various environments with highest efficiency.
(2) The invention can also serve the users of the unicast network, can be seamlessly connected with the existing multicast technology and application layer technology for common use, and has wide application range.
(3) Before the group member statistics of the multicast group, the RTP protocol is firstly operated in the multicast mode of the server side, and the stream media data is sent to the multicast channel identified by the multicast address, so that the data sent by the server is not influenced by the number of the receiving ends.
Drawings
Fig. 1 is a flowchart illustrating an adaptive multicast routing method according to an embodiment of the present invention.
Fig. 2 is a flowchart of a core-based discovery method according to an embodiment of the present invention.
Fig. 3 is a flowchart of a flooding and pruning method according to an embodiment of the present invention.
Fig. 4 is a flowchart of a tunneling method according to an embodiment of the present invention.
Fig. 5 is a schematic view of an application scenario of the tunneling method according to the embodiment of the present invention.
Fig. 6 is a schematic diagram illustrating encapsulation of multicast datagrams according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It is to be understood that the embodiments shown and described in the drawings are merely exemplary and are intended to illustrate the principles and spirit of the invention, not to limit the scope of the invention.
An embodiment of the present invention provides a method for selecting a self-adaptive multicast route, as shown in fig. 1, including the following steps S1 to S8:
and S1, operating RTP protocol in the multicast mode of the server side, and sending the streaming media data to the multicast channel identified by the multicast address. The design is beneficial to the fact that the data sent by the server is not influenced by the number of the receiving ends.
And S2, taking each user sending the multicast request service in the multicast range as a multicast group member, and counting to obtain the number N of the multicast group members.
And S3, dividing the number N of the multicast group members by the area of the multicast range to obtain the density rho of the multicast group members.
S4, judging whether the time is at the time threshold TmWhether a rate of change V of intra-multicast group membership density ρ is greater than a rate of change threshold VmIf so, the process proceeds to step S5, otherwise, the process proceeds to step S6.
In the embodiment of the invention, the time threshold TmSet to 10 minutes, threshold value of rate of change VmSet to 10%, that is, if the change rate V of the multicast group member density ρ exceeds 10% in 10 minutes, the member density ρ of the multicast group is considered to be largely changed, and the process proceeds to step S5, otherwise, the process proceeds to step S6.
And S5, transmitting data in the multicast channel by a core-based discovery method.
As shown in fig. 2, step S5 includes the following substeps S51-S53:
s51, appointing a core router for the multicast group, and obtaining its IP unicast address.
S52, creating a forwarding tree of the multicast group with the core router as a root node.
S53, when any router in the forwarding tree sends a datagram to the core router, processing the datagram through each intermediate router between the core router and the router, where the specific processing method is:
if the sent datagram is a multicast datagram and the destination address of the sent datagram is the group address of the multicast group, forwarding the datagram to each member in the multicast group through an intermediate router; if the transmitted datagram is a datagram requesting to join the multicast group, the datagram is added to the route of the intermediate router, and a copy of each multicast datagram is forwarded to the router that issued the datagram.
For example, if there is one router R1 sending datagrams to a core router, each intermediate router it passes through on the way examines its contents and processes the datagrams. Assuming that the router R2 is an intermediate router, if R1 sends out a multicast datagram whose destination address is the group address of the multicast group, R2 forwards the multicast datagram to the members of the multicast group; if the datagram from R1 is a datagram requesting to join a multicast group, R2 adds this information to its route and forwards a copy of each multicast datagram to R1. Thus, the number of routers participating in the multicast group increases from the core, and the coverage of the multicast forwarding tree is expanded. Thus, the core-based discovery method is suitable for a case where multicast group members vary in a large range.
S6, judging whether the density rho of the multicast group members is larger than the threshold rho of the density of the membersmIf so, the process proceeds to step S7, otherwise, the process proceeds to step S8.
In the embodiment of the invention, the member density threshold value rhomIs arranged as 104Per km2I.e. if the multicast group member density p exceeds 104Per km2If not, the multicast group members are considered to be relatively dispersed, and the process proceeds to step S8.
And S7, transmitting data in the multicast channel by a flooding and pruning method.
The flooding and pruning method is suitable for the case where the distribution of the multicast group members is very centralized, for example, the multicast group members are all within one organization. The core of the policy is reverse Path broadcast (rpb) policy, that is, when each router receives a multicast datagram, it first checks whether the datagram is transmitted from a source point via the shortest Path. This is called a reverse path because the shortest path is calculated using the source point as the destination point.
As shown in fig. 3, step S7 includes the following substeps S71-S78:
s71, appointing a core router for the multicast group, and obtaining its IP unicast address.
S72, creating a forwarding tree of the multicast group with the core router as a root node.
S73, judging whether the downstream branch of each router on the forwarding tree has the member of the multicast group, if yes, entering the step S74, otherwise, entering the step S75.
In the embodiment of the invention, the downstream branch of a certain router is the multicast group member in the leaf node direction.
S74, reserving the router and the branches downstream of the router, and going to step S76.
S75, cutting the router and the branches downstream thereof, and proceeding to step S76.
S76, when each router in the forwarding tree receives a multicast datagram, it is determined whether it is sent from the source point via the shortest path, if yes, step S77 is entered, otherwise, step S78 is entered.
In the embodiment of the present invention, the specific method for determining whether the multicast datagram is sent from the source point via the shortest path is as follows: when a router receives a multicast datagram, the first router on the shortest path of a source point is found from the router, whether the router is the router which just sends the multicast datagram is judged, if yes, the multicast datagram is sent from the source point through the shortest path, and if not, the multicast datagram is not sent from the source point through the shortest path.
It should be noted that if a router has several neighboring routers on the shortest path to the source point (i.e. there are several shortest paths of the same length), only one shortest path can be selected, and the selection criterion is to see the neighboring router with the smallest IP address in the shortest paths.
S77, forwarding the received multicast datagram to all other directions (except the incoming direction).
S78, the multicast datagram is discarded.
And S8, transmitting data in the multicast channel by the tunnel method.
The tunneling method is suitable for the situation that the locations of the multicast group members are geographically dispersed, and as shown in fig. 4, the step S8 includes the following substeps S81-S83:
and S81, adding the header of the common datagram to the multicast datagram by the router at the datagram sending end, and encapsulating again to obtain the unicast datagram sent to the single destination station.
And S82, sending the unicast datagram to the router at the datagram receiving end through the tunnel.
And S83, stripping the header of the unicast datagram by the router at the receiving end of the datagram to restore the header to the original multicast datagram and continuously transmitting the multicast datagram to other destination stations.
For example, as shown in fig. 5, both network a and network B support multicast, but the network between routers R1 and R2 does not support multicast, and thus R1 and R2 cannot forward datagrams on a multicast address. For this purpose, router R1 needs to re-encapsulate the multicast datagram, i.e. add the normal datagram header, making it a unicast datagram for transmission to a single destination, the encapsulation process is shown in fig. 6, and then send it from router R1 to R2 through a "tunnel". After the unicast datagram reaches router R2, router R2 strips the header of the unicast datagram so that it is restored to the original multicast datagram and is forwarded to a plurality of other destination stations.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.

Claims (4)

1. An adaptive multicast routing method, comprising the steps of:
s1, operating RTP protocol in multicast mode of server end, and sending stream media data to multicast channel identified by multicast address;
s2, taking each user sending the multicast request service in the multicast range as a multicast group member, and counting to obtain the number N of the multicast group members;
s3, dividing the number N of the multicast group members by the area of the multicast range to obtain the density rho of the multicast group members;
s4, judging whether the time is at the time threshold TmWhether a rate of change V of intra-multicast group membership density ρ is greater than a rate of change threshold VmIf yes, go to step S5, otherwise go to step S6;
s5, data transmission is carried out in the multicast channel through a core-based discovery method;
s6, judging whether the density rho of the multicast group members is larger than the threshold rho of the density of the membersmIf yes, go to step S7, otherwise go to step S8;
s7, data transmission is carried out in the multicast channel through a flooding and pruning method;
s8, data transmission is carried out in the multicast channel by a tunnel method;
the step S5 includes the following sub-steps:
s51, appointing a core router for the multicast group and obtaining the IP unicast address;
s52, taking the core router as a root node, and creating a forwarding tree of the multicast group;
s53, when any router in the forwarding tree sends the datagram to the core router, processing the datagram through each intermediate router between the core router and the router.
2. The adaptive multicast routing method according to claim 1, wherein the specific method for the intermediate router to process the datagram in step S53 is as follows:
if the sent datagram is a multicast datagram and the destination address of the sent datagram is the group address of the multicast group, forwarding the datagram to each member in the multicast group through an intermediate router;
if the transmitted datagram is a datagram requesting to join the multicast group, the datagram is added to the route of the intermediate router, and a copy of each multicast datagram is forwarded to the router that issued the datagram.
3. The adaptive multicast routing method according to claim 1, wherein the step S7 includes the following substeps:
s71, appointing a core router for the multicast group and obtaining the IP unicast address;
s72, taking the core router as a root node, and creating a forwarding tree of the multicast group;
s73, judging whether the downstream branch of each router on the forwarding tree has a member of the multicast group, if yes, entering the step S74, otherwise, entering the step S75;
s74, reserving the router and the branches downstream thereof, and proceeding to the step S76;
s75, cutting the router and the branches at the downstream of the router, and entering the step S76;
s76, when each router in the forwarding tree receives a multicast datagram, judging whether the multicast datagram is sent from the source point through the shortest path, if so, entering the step S77, otherwise, entering the step S78;
s77, forwarding the received multicast datagram to all other directions;
s78, the multicast datagram is discarded.
4. The adaptive multicast routing method according to claim 1, wherein the step S8 includes the following substeps:
s81, adding the head of the common datagram to the multicast datagram at the router of the datagram sending end, and encapsulating again to obtain the unicast datagram sent to the single destination station;
s82, sending the unicast datagram to the router at the datagram receiving end through the tunnel;
and S83, stripping the header of the unicast datagram by the router at the receiving end of the datagram to restore the header to the original multicast datagram and continuously transmitting the multicast datagram to other destination stations.
CN201910093919.2A 2019-01-30 2019-01-30 Self-adaptive multicast routing method Active CN109639574B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910093919.2A CN109639574B (en) 2019-01-30 2019-01-30 Self-adaptive multicast routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910093919.2A CN109639574B (en) 2019-01-30 2019-01-30 Self-adaptive multicast routing method

Publications (2)

Publication Number Publication Date
CN109639574A CN109639574A (en) 2019-04-16
CN109639574B true CN109639574B (en) 2021-02-09

Family

ID=66064258

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910093919.2A Active CN109639574B (en) 2019-01-30 2019-01-30 Self-adaptive multicast routing method

Country Status (1)

Country Link
CN (1) CN109639574B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114079627A (en) * 2020-08-14 2022-02-22 华为技术有限公司 Data transmission device and method

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316419A (en) * 2011-09-22 2012-01-11 华为技术有限公司 Method for developing multimedia service in wireless local area network, device and system
CN102378122A (en) * 2011-10-31 2012-03-14 中国科学院计算技术研究所 Method for selecting self-adaptive multicast transmission mechanism
CN103747421A (en) * 2014-01-13 2014-04-23 中国科学院计算技术研究所 Two-stage cooperative multicast method and system
EP3096575A1 (en) * 2015-05-20 2016-11-23 Alcatel Lucent Method, system and computer-readable medium for updating a broadcast area
CN108235158A (en) * 2018-01-15 2018-06-29 北京邮电大学 The treating method and apparatus of optical-fiber network multicast service
CN108307470A (en) * 2018-05-11 2018-07-20 重庆邮电大学 A kind of network cluster dividing method based on node group relationship degree
CN108989972A (en) * 2017-06-02 2018-12-11 成都鼎桥通信技术有限公司 Broadcast group based on regional location exhales processing method and processing device
CN109104697A (en) * 2017-06-20 2018-12-28 中国电信股份有限公司 Multicast control method and radio reception device for WLAN

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316419A (en) * 2011-09-22 2012-01-11 华为技术有限公司 Method for developing multimedia service in wireless local area network, device and system
CN102378122A (en) * 2011-10-31 2012-03-14 中国科学院计算技术研究所 Method for selecting self-adaptive multicast transmission mechanism
CN103747421A (en) * 2014-01-13 2014-04-23 中国科学院计算技术研究所 Two-stage cooperative multicast method and system
EP3096575A1 (en) * 2015-05-20 2016-11-23 Alcatel Lucent Method, system and computer-readable medium for updating a broadcast area
CN108989972A (en) * 2017-06-02 2018-12-11 成都鼎桥通信技术有限公司 Broadcast group based on regional location exhales processing method and processing device
CN109104697A (en) * 2017-06-20 2018-12-28 中国电信股份有限公司 Multicast control method and radio reception device for WLAN
CN108235158A (en) * 2018-01-15 2018-06-29 北京邮电大学 The treating method and apparatus of optical-fiber network multicast service
CN108307470A (en) * 2018-05-11 2018-07-20 重庆邮电大学 A kind of network cluster dividing method based on node group relationship degree

Also Published As

Publication number Publication date
CN109639574A (en) 2019-04-16

Similar Documents

Publication Publication Date Title
US7254132B2 (en) Mobile communication system, mobile communication method, wireless base station, mobile station, and program
JP5448211B2 (en) Wireless communication apparatus, wireless network system, data transfer method, and program
Ozaki et al. Bandwidth-efficient multicast routing for multihop, ad-hoc wireless networks
Ozaki et al. Bandwidth-efficient multicast routing protocol for ad-hoc networks
CN101789874B (en) Multicast tree switching realization method, device and routing equipment in PIM-SM
Semeria et al. Introduction to IP multicast routing
EP3547690B1 (en) Real-time video transmission method of multipath network
CN109981308A (en) Message transmitting method and device
CN109639574B (en) Self-adaptive multicast routing method
CN110999230B (en) Method, network equipment and system for transmitting multicast message
CN104348736A (en) Method for selecting route under multicast load scene and routers
WO2008154796A1 (en) A method and an equipment for controlling the transmission of the multicast data packets in the base station and the gateway of the wimax system
EP1430645B1 (en) Implementing multicasting
Lin et al. Mobile reliable multicast support in IP networks
CN114915588B (en) Upstream multicast hop UMH extension for anycast deployment
Rümmler et al. Multicast in third-generation mobile networks: services, mechanisms and performance
KR100965053B1 (en) Method for transmitting internet broadcasting data using restricted multicast
Kafaie et al. Network coding with link layer cooperation in wireless mesh networks
Boudani et al. Multicast tree in MPLS network
Vijayalakshmi et al. Efficient Multicast Routing Protocol For Manets
He et al. Performance evaluation of a WiMAX multi-hop relay system to support multicast/broadcast service
KR100434913B1 (en) Home agent selection method in mobile host support from multicasting environment
Beatrice et al. ON IMPROVING RELIABILITY IN MULTICAST ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORK
Borcoci Architectures for Networks and Services
Chakraborty et al. Multicast: Concept, problems, routing protocols, algorithms and QoS extensions

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant