WO2014187416A1 - 一种组播组优化方法及锚点 - Google Patents

一种组播组优化方法及锚点 Download PDF

Info

Publication number
WO2014187416A1
WO2014187416A1 PCT/CN2014/079650 CN2014079650W WO2014187416A1 WO 2014187416 A1 WO2014187416 A1 WO 2014187416A1 CN 2014079650 W CN2014079650 W CN 2014079650W WO 2014187416 A1 WO2014187416 A1 WO 2014187416A1
Authority
WO
WIPO (PCT)
Prior art keywords
multicast group
node
same
access gateway
multicast
Prior art date
Application number
PCT/CN2014/079650
Other languages
English (en)
French (fr)
Inventor
崔勇
刘岩
徐鑫
王文东
刘国燕
沈岷
周娜
朱春晖
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP14801016.8A priority Critical patent/EP3043591A4/en
Priority to US14/916,433 priority patent/US20160212597A1/en
Publication of WO2014187416A1 publication Critical patent/WO2014187416A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H04W4/08—User group management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/40—Connection management for selective distribution or broadcast
    • 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
    • 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/189—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast in combination with wireless systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
    • H04W8/186—Processing of subscriber group data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/16—Gateway arrangements

Definitions

  • the present invention relates to a multicast group optimization method and an anchor point, and more particularly to a multicast group optimization method and an anchor point using a new method.
  • BACKGROUND With the rapid development of wireless networks, voice and video applications such as teleconferences, remote online education, and online games are frequently used on mobile intelligent terminals such as mobile phones, and these applications require a large amount of network bandwidth. If the traditional unicast technology is used, it is difficult to meet the user experience requirements. On the wired network, the above problems are solved by adopting IP multicast technology.
  • the anchor acts as a home agent
  • the AG access gateway acts as an intermediary between the anchor and the mobile node MN.
  • proxy mobile IP protocol can realize node-free mobility because it does not need terminal participation, so it can solve the advantages of insufficient computing power and limited energy of mobile nodes and is widely used.
  • proxy IPv6 Internet Protocol Version 6
  • PMIP Proxy Mobile IP
  • the multicast nodes are directly established to communicate with the access node; and during the multicast group transmission, the anchor point only targets the multicast route in the multicast tree, and the multicast group data is According to the route, different nodes that pass through the same gateway often send multicast group data to the gateway repeatedly, which causes waste of network resources.
  • the embodiments of the present invention provide a multicast group optimization method and an anchor point, which solves the technical problem of repeatedly transmitting multicast group data to different nodes sharing the same gateway in the prior art, resulting in waste of network resources.
  • the present application provides a multicast group optimization method, which includes the following steps: An anchor point identification multicast group requests the same multicast group data and shares the same connection. a node set of the gateway, the node set includes at least two nodes requesting the same multicast group data and sharing the same access gateway; and the anchor point sends the same multicast group data to each of the node sets by using the same access gateway. node. Further, at least one node in the node set has two or more access interfaces, and each access interface is connected to a different access gateway.
  • the step of the anchor point identifying the node sharing the same access gateway in the multicast group includes: obtaining, from the binding cache entry of the anchor point, an access gateway care-of address of each node in the multicast group; The access gateway forwards the address, and determines whether each node in the multicast group shares the same access gateway.
  • the step of identifying, by the anchor point, the node requesting the same multicast group data in the multicast group includes: obtaining, from a correspondence table between the identity identification identifier of the binding cache entry of the anchor point and the multicast group identification number The multicast group data of each node in the multicast group; determining, according to the multicast group data, whether each node in the multicast group requests the same multicast group data.
  • the method further includes: determining, according to the request information of the received node, whether the node has other new Access interface access.
  • the application further provides an anchor point, which includes an identification module and a sending module.
  • the foregoing identifying module is configured to identify a node set in the multicast group that requests the same multicast group data and shares the same access gateway, where the node set includes requesting the same group. Broadcasting data and sharing at least two nodes of the same access gateway; the sending module is configured to send the same multicast group data to each node in the node set by using the same access gateway.
  • the foregoing identification module further includes: a first obtaining unit and a first determining unit; the first acquiring unit is configured to obtain, from the binding cache entry of the anchor point, access of each node in the multicast group The gateway is forwarded to the address; the first determining unit is configured to determine, according to the access gateway care-of address, whether each node in the multicast group shares the same access gateway.
  • the foregoing identification module further includes: a second obtaining unit and a second determining unit; wherein the second acquiring unit is configured to correspond to an identity between the identity identifier of the binding cache entry of the anchor point and the multicast group identification number
  • the table obtains the multicast group data of each node in the multicast group.
  • the second determining unit is configured to determine, according to the multicast group data, whether each node in the multicast group requests the same multicast group data.
  • the anchor point of the application further includes: a determining module; the determining module is configured to determine, according to the request information of the received node, whether the requesting node has other new access interfaces.
  • the beneficial effects achieved by the embodiments of the present invention are:
  • the anchor point identifies the node set in the multicast group that requests the same multicast group data and shares the same access gateway, and sends the same multicast group data to the same access gateway through the same access gateway.
  • the anchor point can be optimized by the above-mentioned node optimization method, in the case where the node has multiple access interfaces, Multicast routing of nodes that request the same multicast group data and share the same access gateway is optimized to the same shared gateway for forwarding, which can reduce unnecessary multicast routing and reduce the size of the multicast forwarding tree. Reduced resource waste on the network side.
  • FIG. 1 is a schematic structural diagram of an anchor point according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of an anchor point according to another embodiment of the present invention
  • FIG. 1 is a schematic structural diagram of an anchor point according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of an anchor point according to another embodiment of the present invention
  • FIG. 3 is a flowchart of a multicast group optimization method according to an embodiment of the present invention
  • 4 is a flowchart of a method for optimizing a multicast group in another embodiment of the present invention
  • FIG. 5 is a flowchart of a multicast deployment scenario of an IPv6 node in the embodiment of the present invention
  • FIG. 6 is a signaling diagram of a multicast group optimization method according to an embodiment of the present invention.
  • FIG. 7 is a flow chart of signaling interaction of a multicast group optimization method according to another embodiment of the present invention
  • FIG. 8 is a flow chart of signaling interaction of a multicast group optimization method according to still another embodiment of the present invention.
  • the general idea of the present invention is to match each node in a multicast group by an anchor point, and find an optimal multicast route, so that the anchor sends the same multicast group data to the same access gateway through the same access gateway.
  • Different nodes the anchor point determines whether each node shares the same access gateway by comparing the access gateway care-of addresses of each node, and then compares the multicast group data of each node in the multicast group to determine whether each node in the multicast group is Request the same multicast group data. Therefore, the process of planning an optimal multicast route for each node in the multicast group is implemented by the anchor point.
  • the anchor point is extended by binding the cache entry, and the corresponding entry between the ID of the node and the multicast group identification number of the node is added in the entry, so that the anchor point can be based on the ID of the node.
  • Group data The node in the multicast group in this application may be a node that has established a multicast group link and sends multicast group data, or a new node that requests a new multicast group to request multicast group data.
  • an anchor point 10 is provided in the present application, which includes: an identification module 101 and a sending module 102.
  • the identification module 101 is mainly configured to identify that the same multicast group data is requested in the multicast group and share the same connection.
  • the anchor point 10 in the present application may further include a determining module 103, which is mainly configured to determine, according to the request information of the received node, whether the node has other new access interfaces.
  • the judgment of the new access interface by the judging module 103 in the present application is mainly compared by comparing the identity identification identifier of the access node with the identity identification identifier of the node in the binding cache entry, if a new access interface is added.
  • the determining module 103 may further include the following subunits: a third obtaining unit 1031 and a third determining unit 1032; wherein the third obtaining unit 1031 is configured to acquire the requesting node.
  • the third identification unit 1032 is configured to compare the identity identification identifier of the requesting node with the corresponding node identification identifier in the binding cache entry of the anchor point, and if not, determine that there are other new access interfaces. Access.
  • the node is applied to join the multicast group mainly by requesting information, and the request message may be classified into a node new interface access request message or a new join group request of the mobile node according to the state of the node interface.
  • the message is a request message for requesting to join the multicast group, and the determining module 103 determines, according to the request message, whether another new access interface is accessed.
  • the identification module 101 can mainly identify the node set sharing the same access gateway with the requesting node that currently requests to join the multicast group by comparing the access gateway care-of address. Specifically, it may further include the following units: a first obtaining unit 1011 and a first determining unit 1012; wherein the first obtaining unit 1011 is configured to obtain, from the binding cache entry of the anchor point, the access interface of each node in the multicast group.
  • the gateway enters the address; the first determining unit 1012 is configured to determine, according to the access gateway care-of address, whether each node in the multicast group shares the same access gateway.
  • the identification module 101 is configured to determine whether the nodes in the multicast group request the same multicast group data by determining the multicast group message of the node. Specifically, the identification module 101 may further include: a second obtaining unit 1013 and a second determining unit.
  • the breaking unit 1014 is mainly configured to determine, according to the multicast group data, whether each node in the multicast group requests the same multicast group data.
  • the present application further provides a multicast group optimization method, which includes the following steps: Step 304: An anchor point identifies a node set in a multicast group that requests the same multicast group data and shares the same access gateway; Step 306: In this step, the identification module 101 identifies the gateway address, identifies a node that shares the same access gateway with the requesting node that is currently requesting to join the multicast group, and performs whether the node requests the same multicast group data. Identification. Specifically, please refer to FIG.
  • step 304 may further include the following sub-steps: Step 3041 : Obtain an access gateway care-of address of each node access interface in the multicast group from the binding cache entry of the anchor; The first obtaining unit 1011 obtains the first access gateway care-of address of the access interface of each node in the multicast group from the binding cache entry of the anchor group; Step 3042: Determine the multicast according to the access gateway care-of address Whether the nodes in the group share the same access gateway; in this step, the first determining unit 1012 compares the access gateways corresponding to the access interfaces of the interfaces, and finds the same node of the access gateway; Go to step 3043; Step 3043: For step 3042, obtain the multicast group of the same node as the discovered access gateway from the correspondence table between the identity identifier of the binding cache entry of the anchor and the multicast group identification number.
  • the second obtaining unit 1013 is responsible for the node searched for the first determining unit 1012, and queries the correspondence between the identity identification identifier and the multicast group identification number. Based sheet for their respective multicast group data.
  • the second obtaining unit 1013 obtains the correspondence table between the identity identification identifier and the multicast group identification number according to the identity identification identifier of the node, and obtains the multicast group data of each node in the node set.
  • the correspondence list is extended by the binding cache entry maintained by the anchor point, that is, the corresponding entry between the node ID and the multicast group identification number added by the node is added, and the real-time relationship is real-time. Update.
  • Step 3044 Determine, according to the obtained multicast group data, whether each node requests the same multicast group data.
  • the second judging unit 1014 compares the acquired multicast group data of each node to obtain a node that requests the same multicast group data.
  • the comparison process in this step is to maximize the use of the multicast data by the access gateway and send it to more nodes as much as possible. Therefore, after matching the node set, the node can be centralized to the node through the same gateway.
  • Send multicast group data Step 3045: Collect the nodes obtained in step 3044 to form a node set.
  • the access gateway of each node in the multicast group is first determined, and then it is determined whether the same multicast group data is requested.
  • the determining whether to request the same multicast group data may be performed first, and then determining whether the obtained node passes the same access gateway, that is, steps 3043-3045 in this embodiment. It can be performed before step 3041 without affecting the acquisition of the node set in this embodiment.
  • Step 306 The anchor sends the same multicast group data to each node in the node set through the same access gateway. In this step, the sending module 102 is responsible for transmitting multicast data to each node through the same access gateway shared by each node in the node set. Referring to FIG.
  • step 302 Determine, according to the request information of the received node, whether the node has other new access interfaces to access; Specifically, the judging module 103 determines, the specific step is performed by the following sub-steps: Step 3021: Acquire an identifier of the node; In this step, the third acquiring unit 1031 acquires the identifier of the node; Step 3022: Determining whether the acquired identification identifier is the same as the corresponding node identification identifier in the binding cache entry in the anchor; if the same, the process proceeds to step 304, and if no, the process ends.
  • Step 308 Update the multicast forwarding tree.
  • the anchor deletes the interface or node or the access gateway that does not have the anchor data in the multicast tree from the multicast forwarding tree, reduces the size of the multicast forwarding tree, and minimizes the waste of resources on the network side.
  • the multicast routing method of the anchor does not need to be repeatedly sent for the gateway corresponding to each node, and only needs to send one copy to the same access gateway shared by each node in the node set, and then The gateway forwards to each node, which saves the overhead of the network side to the greatest extent.
  • the following describes the multicast group optimization method in the present application in detail through three specific implementation cases: Referring to FIG. 5 and FIG. 6, in this embodiment, there are two nodes MN1 and MN2 in the PMIPv6 network domain respectively.
  • Interfaces IF1 and IF2 interface IF1 of node MN1 accesses the network through access gateway 1, interface IF1 of MN2 accesses the network through access gateway 2, IF2 accesses the network through access gateway 3, MN1-IF1-access gateway 1—Anchor, MN2-IF2—Access Gateway 3—The multicast data transmitted between anchors.
  • the node MN1 decides to connect the interface IF2 to the network through the access gateway 2.
  • the main features of the multicast routing optimization technology are as follows: Step 601: The node MN1 enters the range of the access gateway 2, and connects the interface IF2 to the PMIP domain through the access gateway 2 according to RFC5213.
  • Step 602 After receiving the PBU message sent by the access gateway, the anchor node extracts related information and performs multicast routing optimization decision.
  • the anchor point determines that MN1-IF2 and MN2-IF1 share one access gateway 2 at the same time, and two The multicast group information of each node is the same.
  • the multicast data sent to MN1 is sent through MN1-IF2
  • the multicast data sent to MN2 is sent through MN2-IF1
  • an MLD proxy request message is sent to access gateway 2, and the message includes new access.
  • Step 603 After receiving the MLD proxy request message sent by the anchor point, the access gateway 2 first checks whether the mobile node has a network interface and establishes a connection with the access gateway. If not, the optimization ends; otherwise, it passes the MN1. - IF2 and MN2-IF1 send MLD proxy request messages.
  • Step 604 After receiving the MLD proxy request message sent by the access gateway 2, the MN1 and the MN2 send a Join (G) message to the access gateway 2 through the interface that receives the MLD request message, and the message includes two nodes. Multicast group information.
  • Step 605 After receiving the Join (G) from MN1 and MN2, the access gateway 2 checks the multicast group information and sends the multicast group information of the two interfaces to the anchor point.
  • the message includes the node.
  • Step 606 After receiving the join group message sent by the access gateway 2, the anchor extracts the multicast group information, updates the binding cache entry maintained by the anchor, updates the multicast forwarding tree, and joins the interface MN1-IF2.
  • the multicast tree if there is no multicast data on the IF1 interface, IF1 is deleted from the multicast tree. If the node on the access gateway 3 does not receive multicast data, the access gateway 3 is also multicast. Deleted on the tree.
  • G1 is: multicast group identification number
  • G2 is: multicast group identification number
  • G3 node 1 identification number, node 2 identification number, multicast group identification number.
  • the interface IF1 of the node MN1 accesses the network through the access gateway 1, the IF2 accesses the network through the access gateway 2, and the interface IF1 of the node MN2 accesses through the access gateway 2.
  • the network, IF2 accesses the network through the access gateway 3, and the multicast data received by the MN2 is transmitted through the MN2-IF2-access gateway 3-anchor. If the MN1 needs to join certain multicast groups at this time, since the MN1 has multiple network interfaces, it may request the multicast data through IF1 or IF2.
  • Step 701 The node MN1 sends a join group message Join (G) to the access gateway 1 through the IF1, where the message includes the multicast group information that the MN1 wishes to receive.
  • Step 702 After receiving the Join (G) message sent by MN1-IF1, the access gateway 1 obtains the identity (MN-ID) of the mobile node by reading the policy file, and sends a multicast routing request message Join (G) to the anchor point.
  • the message includes the MN-ID of MN1 and the multicast group information that MN1 wishes to receive.
  • Step 703 After receiving the multicast routing request message sent by the access gateway 1, the anchor extracts the related information, performs multicast routing optimization, and analyzes that both the MN1-IF2 and the MN2-IF1 are accessed through the access gateway 2. , and the multicast group information is the same. Then, through the decision, the multicast data sent to the MN1 is sent through the MN1-IF2, and the multicast data sent to the MN2 is sent through the MN2-IF1, and the MLD proxy request message is sent to the access gateway 2, where the message includes the MN-ID of the MN1. MN-ID of MN2 and multicast group information joined by MN1 and MN2.
  • Step 704 After receiving the MLD proxy request message sent by the anchor point, the access gateway 2 first checks whether the node has a network interface and establishes a connection with the access gateway. If the node is found to have no network interface associated with the node, the optimization ends. Otherwise, it sends an MLD Proxy Request message to MN1-IF2 and MN2-IF1, respectively.
  • Step 705 After receiving the MLD proxy request message sent by the access gateway 2, the MN1 and the MN2 send a join group message Join (G) to the access gateway 2, and include the multicast group information that is added by the MN1 and the MN2.
  • G join group message Join
  • Step 706 After receiving the join group message from MN1 and MN2, the access gateway 2 checks the multicast group information and sends the multicast group information of the two interfaces to the anchor by adding the group message.
  • Step 707 After receiving the join group message sent by the access gateway 2, the anchor extracts the multicast group information, updates the binding cache entry maintained by the anchor, updates the multicast forwarding tree, and adds the interface MN1-IF2. In the multicast tree, if there is no multicast data on the IF1 interface, IF1 is deleted from the multicast tree. If the node on the access gateway 3 does not receive multicast data, the access gateway 3 is also multicast. Deleted on the tree.
  • G1 is: multicast group identification number
  • G2 is: node 1 identification number, multicast group identification number
  • G3 is: multicast group identification number
  • G4 is: multicast group identification number
  • G5 is: node 1 Identification number, node 2 identification number, multicast group identification number.
  • Step 801 The node MN sends a join multicast routing request message Join (G) to the access gateway 2 through the MN1-IF2, where the message includes the multicast group information that the MN1 wishes to receive.
  • G join multicast routing request message
  • Step 802 After receiving the Join (G) message sent by the IF2, the access gateway 2 obtains the identity (MN-ID) of the mobile node by reading the policy file, and sends a join group message Join (G) to the anchor, the message The MN-ID of MN1 and the multicast group information that MN1 wishes to receive are included.
  • Step 803 After receiving the multicast routing request message sent by the access gateway 2, the anchor point performs the multicast routing optimization decision by extracting the related information in the message, and analyzes that both the MN1-IF2 and the MN2-IF1 pass the access gateway. 2 Access, and the multicast group information is the same.
  • Step 804 After receiving the MLD proxy request message sent by the anchor, the access gateway 2 first checks whether the node has a network interface and establishes a connection with the access gateway. If the node is found to have no network interface associated with the node, the optimization ends. Otherwise, it sends an MLD Proxy Request message to MN2-IF1.
  • Step 805 After receiving the MLD proxy request message sent by the access gateway 2, the MN2 sends a join group message Join (G) to the access gateway 2, and includes the multicast group information that it joins.
  • Step 806 After receiving the Join (G) message from the MN2, the access gateway 2 checks the multicast group information and sends the multicast group information of the interface to the anchor by adding the group message.
  • Step 807 After receiving the join group message sent by the access gateway 2, the anchor extracts the multicast group information, updates the binding cache entry maintained by the anchor, updates the multicast forwarding tree, and joins the interface MN1-IF2. In the multicast tree, if there is no multicast data on the IF1 interface, IF1 is deleted from the multicast tree.
  • the embodiment of the present invention provides an optimization of multicast routing through routing decisions in three different scenarios in the PMIPv6 domain.
  • the effect of optimization is relatively limited.
  • the optimization effect will be generated. It is very obvious, which can save a lot of network side overhead.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开一种组播组优化方法及锚点，通过识别组播组中请求相同组播组数据并共用同一接入网关的节点集，并将相同组播组数据通过该同一接入网关发送至所述节点集中的各个节点。从而实现了通过同一网关向不同节点转发组播数据，节约了网络侧流量，实现了组播组的优化。此外，在本申请中，锚点通过上述对节点优化方式，在节点存在多接入接口的情况下，能够将请求相同组播组数据并共用同一接入网关的节点的组播路由优化到同一个共用的网关进行转发，可以减少不必要的组播路由，减小组播转发树的规模，最大程度上减少了网络侧的资源浪费。

Description

一种组播组优化方法及锚点 技术领域 本发明涉及一种组播组优化方法及锚点， 尤其涉及一种采用新方法组播组优化方 法及锚点。 背景技术 随着无线网络的快速发展,诸如电话会议、 远程在线教育、 网络游戏等语音、 视频 应用在手机等移动智能终端上使用的越来越频繁,而这些应用都需要占用大量的网络 带宽， 如果使用传统的单播技术， 很难满足用户体验要求， 而在有线网络上， 上述问 题都是通过采用 IP组播技术来解决的。 在代理移动 IP协议中， 锚点起到家乡代理的 作用， 而接入网关 （AG access gateway) 则在锚点和移动节点 MN之间起到中介的 作用。 多年来， 代理移动 IP协议因其无需终端参与， 可以实现节点无感知移动， 从而 能很好的解决移动节点计算能力不足、 能源有限的优点而得到广泛的应用。 现在， 代 理移动 IPv6 (Internet Protocol Version 6) 已成为移动网络研究的主要方向之一。 现有的代理移动 IP协议 PMIP (Proxy Mobile IP) 域组播部署方案虽然实现了移 动节点在 PMIP域中对组播域的无感知接入， 并解决了隧道汇聚等问题， 但是这些方 案都较为简单和单一， 都是对接入的节点直接建立组播组链路， 进行通信； 且在组播 组的发送过程中，锚点只针对组播树中的组播路由，将组播组数据按照路由进行发送， 而对经过同一网关的不同节点来说， 往往会重复向该网关发送组播组数据， 造成网络 资源的浪费。 发明内容 本发明实施例提供一种组播组优化方法及锚点， 解决了现有技术中重复向共用同 一网关的不同节点重复发送组播组数据， 造成网络资源浪费的技术问题。 为解决上述技术问题， 本发明实施例采用的技术方案如下： 本申请提供一种组播组优化方法， 其包括以下歩骤： 锚点识别组播组中请求相同 组播组数据并共用同一接入网关的节点集， 上述节点集包括请求相同组播组数据并共 用同一接入网关的至少两个节点； 锚点将上述相同组播组数据通过上述同一接入网关 发送至上述节点集中的各个节点。 进一步地， 上述节点集中至少一个节点具有两个或两个以上的接入接口， 且各接 入接口连接不同的接入网关。 更进一步地， 锚点识别组播组中共用同一接入网关的节点的步骤包括： 从锚点的 绑定缓存条目中获取上述组播组中各节点接入接口的接入网关转交地址； 根据上述接 入网关转交地址， 判断上述组播组中各节点是否共用同一接入网关。 更进一步地， 上述锚点识别组播组中请求相同组播组数据的节点的步骤包括： 从 锚点的绑定缓存条目的身份识别标识与组播组标识号之间的对应关系表中获取上述组 播组中各节点的组播组数据； 根据上述组播组数据， 判断上述组播组中各节点是否请 求相同组播组数据。 更进一步地， 在锚点识别组播组中请求相同组播组数据并共用同一接入网关的节 点集的步骤之前， 还包括： 根据接收的节点的请求信息， 判断该节点是否有其他新的 接入接口接入。 本申请还提供一种锚点， 其包括识别模块和发送模块； 上述识别模块设置为识别 组播组中请求相同组播组数据并共用同一接入网关的节点集， 上述节点集包括请求相 同组播组数据并共用同一接入网关的至少两个节点； 上述发送模块设置为将上述相同 组播组数据通过上述同一接入网关发送至上述节点集中的各个节点。 进一步地， 上述节点集中至少一个节点具有两个或两个以上的接入接口， 且各接 入接口连接不同的接入网关。 更进一步地， 上述识别模块还包括： 第一获取单元和第一判断单元； 上述第一获 取单元设置为从锚点的绑定缓存条目中获取上述组播组中各节点接入接口的接入网关 转交地址； 上述第一判断单元设置为根据上述接入网关转交地址， 判断上述组播组中 各节点是否共用同一接入网关。 更进一步地， 上述识别模块还包括： 第二获取单元和第二判断单元； 上述第二获 取单元设置为从锚点的绑定缓存条目的身份识别标识与组播组标识号之间的对应关系 表中获取上述组播组中各节点的组播组数据； 上述第二判断单元设置为根据上述组播 组数据， 判断上述组播组中各节点是否请求相同组播组数据。 更进一步地， 本申请的锚点还包括： 判断模块； 上述判断模块设置为根据接收的 节点的请求信息， 判断该请求节点是否有其他新的接入接口接入。 本发明实施例所达到的有益效果是： 锚点通过识别组播组中请求相同组播组数据 并共用同一接入网关的节点集， 并将相同组播组数据通过该同一接入网关发送至所述 节点集中的各个节点。 从而实现了通过同一网关向不同节点转发组播数据， 节约了网 络侧流量， 实现了组播组的优化。 此外， 从现在的发展趋势来看， 移动节点多接口接入已经成为一种趋势， 所以在 本申请中， 锚点通过上述对节点优化方式， 在节点存在多接入接口的情况下， 能够将 请求相同组播组数据并共用同一接入网关的节点的组播路由优化到同一个共用的网关 进行转发， 可以减少不必要的组播路由， 减小组播转发树的规模， 很大程度上减少了 网络侧的资源浪费。 附图说明 图 1为本发明一实施例中锚点结构示意图； 图 2为本发明又一实施例中锚点结构示意图； 图 3为本发明一实施例中组播组优化方法流程图； 图 4为本发明又一实施例中组播组优化方法流程图； 图 5是本发明实施例中的 IPv6节点组播部署场景图； 图 6是本发明一实施例中组播组优化方法信令交互流程图； 图 7是本发明又一实施例中组播组优化方法信令交互流程图； 图 8是本发明又一实施例中组播组优化方法信令交互流程图。 具体实施方式 本发明的总体构思为:通过锚点对组播组中的各节点进行匹配， 寻找到最优的组播 路由让锚点将相同的组播组数据通过同一个接入网关发送给不同的节点。 具体的， 锚 点是通过对比各节点的接入网关转交地址来判断各节点是否共用同一接入网关， 然后 通过对比组播组中各节点的组播组数据来判断组播组中各节点是否请求相同组播组数 据。 从而实现锚点为组播组中的各节点规划最优组播路由的过程。 具体的本申请中锚 点是通过对绑定缓存条目进行扩展，在条目中加入节点的 ID与节点加入的组播组标识 号两者之间的对应表项，从而锚点可以根据节点的 ID查询该表，获取节点对应的组播 组数据。 本申请中组播组中的节点， 可以为已经建立组播组链接， 发送组播组数据的 节点， 也可以为新申请加入组播组， 请求组播组数据的新节点。 而当节点集中的节点 存在多个接入接口时，根据上述锚点的组播路由优化方法，可以将节点原始组播路由， 优化为与该节点共用同一网关的其他接入接口上来进行组播数据的传递。 为使本发明的技术方案和优点更加清楚， 下面通过具体实施方式结合附图对本发 明作进一步详细说明。 请参考图 1，在本申请中提供一种锚点 10，其包括：识别模块 101和发送模块 102; 其中， 识别模块 101主要设置为识别组播组中请求相同组播组数据并共用同一接入网 关的节点集， 该节点集包括请求相同组播组数据并共用同一接入网关的至少两个节 点； 而发送模块 102设置为将所述相同组播组数据通过该同一接入网关发送至节点集 中的各个节点。 请参考图 2， 本申请中的锚点 10还可以进一步包括判断模块 103， 其主要设置为 根据接收的节点的请求信息， 判断该节点是否有其他新的接入接口接入。 而本申请中 的判断模块 103对新接入接口的判定， 主要是通过对比接入节点的身份识别标识与绑 定缓存条目中该节点的身份识别标识进行对比， 若有新的接入接口增加， 则判定有其 他新的接入接口接入； 具体的， 判断模块 103还可以包括以下子单元： 第三获取单元 1031和第三判断单元 1032; 其中， 第三获取单元 1031设置为获取请求节点的身份识 别标识；第三判断单元 1032设置为将请求节点的身份识别标识与锚点的绑定缓存条目 中对应的节点身份识别标识进行对比， 若不相同， 则确定有其他新的接入接口接入。 在本申请中， 节点主要是通过请求信息的方式申请加入组播组中， 该请求消息可以根 据节点接口的处于的状态不同， 分为节点新接口接入请求消息或移动节点新的加入组 请求消息； 都是请求加入组播组的请求消息， 而判断模块 103则根据该请求消息判断 是否有其他新的接入接口接入。 在本申请中， 识别模块 101主要可以通过对比接入网关转交地址来识别出与当前 请求加入组播组的请求节点共用同一接入网关的节点集。 具体的其可以进一步包括以 下单元： 第一获取单元 1011和第一判断单元 1012; 其中第一获取单元 1011设置为从 锚点的绑定缓存条目中获取组播组中各节点接入接口的接入网关转夂地址； 第一判断 单元 1012 设置为根据接入网关转交地址， 判断组播组中各节点是否共用同一接入网 关。 而识别模块 101主要是通过判断节点的组播组消息来判断组播组中各节点是否请 求相同组播组数据； 具体的， 识别模块 101还可以包括： 第二获取单元 1013和第二判 断单元 1014， 其中， 第二获取单元 1013设置为从錨点的绑定缓存条目的身份识别标 识与组播组标识号之间的对应关系表中获取组播组中各节点的组播组数据； 而第二判 断单元 1014主要设置为根据所述组播组数据，判断所述组播组中各节点是否请求相同 组播组数据。 下面结合附图，对本申请中锚点 10各个组成模块的功能以及本申请提供的组播组 优化方法进行详细说明。 请参考图 3， 本申请中还提供一种组播组优化方法， 其包括如下步骤： 步骤 304: 锚点识别组播组中请求相同组播组数据并共用同一接入网关的节点集; 进入步骤 306; 在本步骤中， 由识别模块 101对网关地址进行识别， 识别出与当前请求加入组播 组的请求节点共用同一接入网关的节点； 以及对节点是否请求相同的组播组数据进行 识别。 具体的， 请参考图 4， 步骤 304还可以包括以下子步骤： 步骤 3041 : 从锚点的绑定缓存条目中获取组播组中各节点接入接口的接入网关转 交地址； 在本步骤中，第一获取单元 1011从锚点的绑定缓存条目中获取组播组中各节点的 接入接口的第一接入网关转交地址； 步骤 3042: 根据所述接入网关转交地址， 判断组播组中各节点是否共用同一接入 网关； 本步骤中，由第一判断单元 1012将获取的各接口的接入接口对应的接入网关转交 地址进行对比， 查找出接入网关相同的节点； 并进入步骤 3043 ; 步骤 3043 : 针对步骤 3042，从锚点的绑定缓存条目的身份识别标识与组播组标识 号之间的对应关系表中获取查找出的接入网关相同的节点的组播组数据； 在本步骤中， 由第二获取单元 1013负责针对第一判断单元 1012查找出的节点， 查询身份识别标识与组播组标识号之间的对应关系表， 获取的其各自的组播组数据。 第二获取单元 1013 具体根据节点的身份识别标识查询身份识别标识与组播组标识号 之间的对应关系表， 获得节点集中各节点的组播组数据。 其中， 该对应关系列表， 是 由锚点维护的绑定缓存条目进行扩展而来的，即在其中增加了节点 ID与节点加入的组 播组标识号两者之间的对应表项， 并实时进行更新。 步骤 3044: 根据获取的组播组数据， 判断各节点是否请求相同组播组数据; 在本步骤中， 由第二判断单元 1014对获取的各节点的组播组数据进行对比，获得 请求相同的组播组数据的节点。 本步骤中的对比过程， 是为了接入网关最大限度的利 用其组播数据， 尽可能多的发送给更多的节点， 所以匹配出节点集后， 可以通过同一 个网关， 向节点集中的节点发送组播组数据。 步骤 3045 : 将步骤 3044中获取的节点进行采集， 形成节点集。 在本实施例中， 是先对组播组中的各节点的接入网关进行判断， 再判断是否请求 相同的组播组数据。 而在另一实施例中， 还可以先进行是否请求相同的组播组数据的 判断， 再将得到的节点进行是否经过同一接入网关的判断， 也就是说本实施例中的步 骤 3043-3045可以在步骤 3041之前进行， 并不影响本实施例中节点集的获取。 步骤 306: 锚点将所述相同组播组数据通过同一接入网关发送至节点集中的各个 节点。 在本步骤中， 由发送模块 102负责通过节点集中各节点共用的同一接入网关向各 个节点发送组播数据。 请参考图 4， 在本申请中， 步骤 304之前， 还可以包括步骤 302; 步骤 302: 根据接收的节点的请求信息， 判断该节点是否有其他新的接入接口接 入； 在本步骤中， 具体由判断模块 103进行判断， 具体的该步骤由以下子步骤完成： 步骤 3021 : 获取节点的身份识别标识； 在本步骤中， 由第三获取单元 1031来获取节点的身份识别标识； 步骤 3022: 判断获取的身份识别标识与锚点中绑定缓存条目中对应的节点身份识 别标识是否相同； 若相同， 则进入步骤 304， 否， 则结束。 在本步骤中，由第三判断单元 1032根据绑定缓存条目中对应的节点身份识别标识 与获取的请求节点的身份识别标识进行对比， 判断节点中是否有新的接入接口请求接 入或原来连入网络中的接口请求组播数据。 此外， 在 306之后， 还可以包括步骤 308: 步骤 308: 更新组播转发树。 在本步骤中， 锚点将组播树上没有主播数据的接口或者节点或者接入网关从组播 转发树删除， 减小组播转发树的规模， 最大程度上减少了网络侧的资源浪费。 本申请通过该种组播路由选择方法， 使锚点的组播数据无需针对各个节点对应的 网关进行重复发送， 只需要发送一份给节点集中各节点共用的同一接入网关， 然后再 由该网关转发给各节点， 最大程度上节省了网络侧的开销。 下面通过三个具体的实施案例， 对本申请中的组播组优化方法进行详细说明： 请参考图 5和图 6，在本实施例中，在 PMIPv6网络域中的节点 MN1和节点 MN2 分别有两个接口 IF1和 IF2， 节点 MN1的接口 IF1通过接入网关 1接入网络， MN2的 接口 IF1通过接入网关 2接入网络， IF2通过接入网关 3接入网络， MN1-IF1—接入网 关 1—锚点、 MN2-IF2—接入网关 3—锚点之间传输的为组播数据。 节点 MN1决定将 接口 IF2通过接入网关 2接入网络。在该场景下， 组播路由优化技术的主要特征在于： 步骤 601 : 节点 MN1进入接入网关 2的范围， 并按照 RFC5213将接口 IF2通过 接入网关 2接入 PMIP域。 步骤 602: 锚点接收到接入网关发送的 PBU消息后， 提取其中的相关信息， 进行 组播路由优化决策， 锚点经过判断 MN1-IF2与 MN2-IF1同时共用一个接入网关 2， 且 两个节点的组播组信息相同。则通过决策，决定将发往 MN1的组播数据通过 MN1-IF2 发送， 发往 MN2的组播数据通过 MN2-IF1发送， 同时向接入网关 2发送 MLD代理 请求消息，该消息包含新接入接口 MN1的 MN-ID、MN2的 MN-ID以及 MN1和 MN2 加入的组播组信息等。 步骤 603 : 当接入网关 2接收到锚点发送的 MLD代理请求消息后， 首先检查该移 动节点是否有网络接口与该接入网关建连， 如果没有， 则优化结束； 否则， 它会通过 MN1-IF2和 MN2-IF1发送 MLD代理请求消息。 步骤 604: MN1和 MN2收到接入网关 2发送的 MLD代理请求消息后， 会通过自 己接收 MLD请求消息的接口向接入网关 2发送 Join (G)消息， 该消息中包含两个节 点接收的组播组信息。 步骤 605: 接入网关 2在接收到来自 MN1和 MN2的 Join (G) 后， 会检查其中 的组播组信息， 同时将两个接口的组播组信息发送给锚点， 该消息中包含节点的 MN-ID以及节点需要接收的组播组信息。 步骤 606: 锚点在收到接入网关 2发来的加入组消息后， 提取其中的组播组信息， 更新自己维护的绑定缓存条目，同时更新组播转发树，将接口 MN1-IF2加入组播树中， 如果 IF1接口上没有组播数据， 则将 IF1从组播树上删除， 同时， 如果接入网关 3上 已经没有接收组播数据的节点， 将接入网关 3也从组播树上删除。 图 6中， G1表示： 组播组标识号； G2表示： 组播组标识号； G3表示： 节点 1标 识号， 节点 2标识号， 组播组标识号。 请参考如 5和图 7， 在本实施例中， 节点 MN1的接口 IF1通过接入网关 1接入网 络， IF2通过接入网关 2 接入网络， 节点 MN2的接口 IF1通过接入网关 2接入网络， IF2通过接入网关 3接入网络， MN2接收的组播数据通过 MN2-IF2—接入网关 3—锚 点传输。 如果此时节点 MN1需要加入某些组播组， 由于 MN1有多个网络接口， 因此 其可能通过 IF1或 IF2请求该组播数据， 当通过接口 IF1请求组播数据时， 组播路由 优化技术的主要特征在于： 步骤 701 : 节点 MN1通过 IF1 向接入网关 1发送加入组消息 Join (G) ， 消息中 包含 MN1希望接收的组播组信息。 步骤 702: 接入网关 1接收到 MN1-IF1发送的 Join (G) 消息后， 通过读取策略 文件获得移动节点的标识 （MN-ID) ， 并向锚点发送组播路由请求消息 Join (G) ， 该消息中包含 MN1的 MN-ID和 MN1希望接收的组播组信息。 步骤 703 : 锚点接收到接入网关 1发送的组播路由请求消息后， 提取其中的相关 信息， 进行组播路由优化决策， 分析得到 MN1-IF2与 MN2-IF1都通过接入网关 2接 入， 且组播组信息相同。 则通过决策， 将发往 MN1的组播数据通过 MN1-IF2发送， 发往 MN2的组播数据通过 MN2-IF1发送， 向接入网关 2发送 MLD代理请求消息， 该消息包含 MN1的 MN-ID、MN2的 MN-ID以及 MN1和 MN2加入的组播组信息等。 步骤 704: 当接入网关 2接收到锚点发送的 MLD代理请求消息后， 首先检查该节 点是否有网络接口与该接入网关建连， 如果发现该节点没有网络接口与之关联， 则优 化结束； 否则， 它会分别向 MN1-IF2和 MN2-IF1发送 MLD代理请求消息。 步骤 705: MN1和 MN2收到接入网关 2发送的 MLD代理请求消息后， 会向接入 网关 2发送加入组消息 Join (G) ， 将自己加入的组播组信息包含其中。 步骤 706: 接入网关 2在接收到来自 MN1和 MN2的加入组消息后， 会检查其中 的组播组信息， 同时将两个接口的组播组信息通过加入组消息发送给锚点。 步骤 707: 锚点在收到接入网关 2发来的加入组消息后， 提取其中的组播组信息， 更新自己维护的绑定缓存条目，同时更新组播转发树，将接口 MN1-IF2加入组播树中， 如果 IF1接口上没有组播数据， 则将 IF1从组播树上删除， 同时， 如果接入网关 3上 已经没有接收组播数据的节点， 将接入网关 3也从组播树上删除。 图 7中， G1表示： 组播组标识号； G2表示： 节点 1标识号， 组播组标识号； G3 表示： 组播组标识号； G4表示： 组播组标识号； G5表示： 节点 1标识号， 节点 2标 识号， 组播组标识号。 请参考图 5和图 8， 在本实施例中， 节点 MN1的接口 IF1通过接入网关 1接入网 络， IF2通过接入网关 2 接入网络， 节点 MN2的接口 IF1通过接入网关 2接入网络， IF2通过接入网关 3接入网络， MN2接收的组播数据通过 MN2-IF2—接入网关 3—锚 点传输。 如果此时移动节点 MN1需要加入某些组播组， 由于 MN1有多个网络接口， 因此其可能通过 IF1或 IF2请求该组播数据， 当通过接口 IF2请求组播数据时， 组播 路由优化技术的主要特征在于： 步骤 801 : 节点 MN通过 MN1-IF2向接入网关 2发送加入组播路由请求消息 Join (G) ， 消息中包含 MN1希望接收的组播组信息。 步骤 802: 接入网关 2接收到 IF2发送的 Join (G) 消息后， 通过读取策略文件获 得移动节点的标识 （MN-ID) ， 并向锚点发送加入组消息 Join (G) ， 该消息中包含 MN1的 MN-ID和 MN1希望接收的组播组信息。 步骤 803 : 锚点接收到接入网关 2发送的组播路由请求消息后， 通过提取该消息 中的相关信息， 进行组播路由优化决策， 分析得到 MN1-IF2与 MN2-IF1都通过接入 网关 2 接入， 且组播组信息相同。 则通过决策， 决定将发往 MN1 的组播数据通过 MN1-IF2发送， 同时将发往 MN2的组播数据从 MN2-IF2转到 MN2-IF1上发送， 同时 向接入网关 2发送 MLD代理请求消息， 该消息包含 MN2的 MN-ID以及加入的组播 组信息等。 步骤 804: 当接入网关 2接收到锚点发送的 MLD代理请求消息后， 首先检查该节 点是否有网络接口与该接入网关建连， 如果发现该节点没有网络接口与之关联， 则优 化结束； 否则， 它会向 MN2-IF1发送 MLD代理请求消息。 步骤 805: MN2收到接入网关 2发送的 MLD代理请求消息后， 会向接入网关 2 发送加入组消息 Join (G) ， 将自己加入的组播组信息包含其中。 步骤 806: 接入网关 2在接收到来自 MN2的 Join (G) 消息后， 会检查其中的组 播组信息， 同时将接口的组播组信息通过加入组消息发送给锚点。 步骤 807: 锚点在收到接入网关 2发来的加入组消息后， 提取其中的组播组信息， 更新自己维护的绑定缓存条目，同时更新组播转发树，将接口 MN1-IF2加入组播树中， 如果 IF1接口上没有组播数据， 则将 IF1从组播树上删除， 同时， 如果接入网关 3上 已经没有接收组播数据的节点， 将 接入网关 3也从组播树上删除。 图 8中， G1表示： 组播组标识号； G2表示： 节点 1标识号， 组播组标识号； G3 表示： 组播组标识号； G4表示： 节点 2标识号， 组播组标识号。 综上所述， 本发明实施例提供了在 PMIPv6域中， 三种不同场景下通过锚点进行 路由决策实现组播路由的优化。 在本申请中， 由于仅设计 3个接入网关和两个节点的 场景， 优化产生的效果相对有限， 但在实际网络部署中， 存在大量的此类可优化路由， 其产生的优化效果将会是十分明显， 可大量节省网络侧的开销。 以上内容是结合具体的实施方式对本发明所作的进一步详细说明， 不能认定本发 明的具体实施只局限于这些说明。 对于本发明所属技术领域的普通技术人员来说， 在 不脱离本发明构思的前提下， 还可以做出若干简单推演或替换， 都应当视为属于本发 明的保护范围。

Claims

权 利 要 求 书
1. 一种组播组优化方法， 包括以下步骤：
锚点识别组播组中请求相同组播组数据并共用同一接入网关的节点集， 所 述节点集包括请求相同组播组数据并共用同一接入网关的至少两个节点；
锚点将所述相同组播组数据通过所述同一接入网关发送至所述节点集中的 各个节点。
2. 如权利要求 1所述的组播组优化方法， 其中， 所述节点集中至少一个节点具有 两个或两个以上的接入接口， 且各接入接口连接不同的接入网关。
3. 如权利要求 1所述的组播组优化方法， 其中， 锚点识别组播组中共用同一接入 网关的节点的步骤包括：
从锚点的绑定缓存条目中获取所述组播组中各节点接入接口的接入网关转 交地址；
根据所述接入网关转交地址， 判断所述组播组中各节点是否共用同一接入 网关。
4. 如权利要求 1-3中任一项所述的组播组优化方法， 其中， 所述锚点识别组播组 中请求相同组播组数据的节点的步骤包括：
从锚点的绑定缓存条目的身份识别标识与组播组标识号之间的对应关系表 中获取所述组播组中各节点的组播组数据；
根据所述组播组数据，判断所述组播组中各节点是否请求相同组播组数据。
5. 如权利要求 1-3中任一项所述的组播组优化方法， 其中， 在锚点识别组播组中 请求相同组播组数据并共用同一接入网关的节点集的步骤之前， 还包括：
根据接收的节点的请求信息， 判断该节点是否有其他新的接入接口接入。
6. 一种锚点， 包括识别模块和发送模块；
所述识别模块设置为识别组播组中请求相同组播组数据并共用同一接入网 关的节点集， 所述节点集包括请求相同组播组数据并共用同一接入网关的至少 两个节点； 所述发送模块设置为将所述相同组播组数据通过所述同一接入网关发送至 所述节点集中的各个节点。 如权利要求 8所述的锚点， 其中， 所述节点集中至少一个节点具有两个或两个 以上的接入接口， 且各接入接口连接不同的接入网关。 如权利要求 8所述的锚点， 其中， 所述识别模块还包括： 第一获取单元和第一 判断单元；
所述第一获取单元设置为从锚点的绑定缓存条目中获取所述组播组中各节 点接入接口的接入网关转交地址；
所述第一判断单元设置为根据所述接入网关转交地址， 判断所述组播组中 各节点是否共用同一接入网关。 如权利要求 6-8中任一项所述的锚点， 其中， 所述识别模块还包括： 第二获取 单元和第二判断单元；
所述第二获取单元设置为从锚点的绑定缓存条目的身份识别标识与组播组 标识号之间的对应关系表中获取所述组播组中各节点的组播组数据；
所述第二判断单元设置为根据所述组播组数据， 判断所述组播组中各节点 是否请求相同组播组数据。 如权利要求 6-8中任一项所述的锚点， 其中， 所述锚点还包括： 判断模块； 所 述判断模块设置为根据接收的节点的请求信息， 判断该请求节点是否有其他新 的接入接口接入。
PCT/CN2014/079650 2013-09-05 2014-06-11 一种组播组优化方法及锚点 WO2014187416A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP14801016.8A EP3043591A4 (en) 2013-09-05 2014-06-11 MULTICAST GROUP OPTIMIZATION METHOD AND ANCHORAGE
US14/916,433 US20160212597A1 (en) 2013-09-05 2014-06-11 Method for Optimizing Multicast Group and Anchor

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310400656.8A CN104427553B (zh) 2013-09-05 2013-09-05 一种组播组优化方法及锚点
CN201310400656.8 2013-09-05

Publications (1)

Publication Number Publication Date
WO2014187416A1 true WO2014187416A1 (zh) 2014-11-27

Family

ID=51932961

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/079650 WO2014187416A1 (zh) 2013-09-05 2014-06-11 一种组播组优化方法及锚点

Country Status (4)

Country Link
US (1) US20160212597A1 (zh)
EP (1) EP3043591A4 (zh)
CN (1) CN104427553B (zh)
WO (1) WO2014187416A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109787870B (zh) * 2017-11-13 2021-08-31 中兴通讯股份有限公司 接入管理方法、装置、系统、初始及目标接入设备
CN115512003B (zh) * 2022-11-16 2023-04-28 之江实验室 一种独立关系检测的场景图生成方法和系统

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1434612A (zh) * 2002-01-23 2003-08-06 华为技术有限公司 一种单信息源至多接收点的分组数据业务实现方法
CN1437355A (zh) * 2002-02-09 2003-08-20 华为技术有限公司 移动网络中多播用户的管理方法
CN1996924A (zh) * 2005-12-31 2007-07-11 华为技术有限公司 在自组网与固定网络间实现跨域组播业务的方法及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7499466B2 (en) * 2001-08-28 2009-03-03 Telefonaktiebolaget L M Ericsson (Publ) Multicast group management in telecommunication networks
GB2398207A (en) * 2003-02-06 2004-08-11 King S College London Multicast group management in packet radio networks
US9160547B2 (en) * 2008-10-15 2015-10-13 Orange Method and devices for managing a data flow transfer
EP3324691A1 (en) * 2011-07-22 2018-05-23 Interdigital Patent Holdings, Inc. Managing multicast traffic

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1434612A (zh) * 2002-01-23 2003-08-06 华为技术有限公司 一种单信息源至多接收点的分组数据业务实现方法
CN1437355A (zh) * 2002-02-09 2003-08-20 华为技术有限公司 移动网络中多播用户的管理方法
CN1996924A (zh) * 2005-12-31 2007-07-11 华为技术有限公司 在自组网与固定网络间实现跨域组播业务的方法及系统

Also Published As

Publication number Publication date
CN104427553A (zh) 2015-03-18
CN104427553B (zh) 2019-08-02
EP3043591A1 (en) 2016-07-13
EP3043591A4 (en) 2016-08-24
US20160212597A1 (en) 2016-07-21

Similar Documents

Publication Publication Date Title
US8837511B2 (en) Seamless mobility schemes in names-data networking using multi-path routing and content caching
EP3340681B1 (en) Seamless mobility schemes in named-data networking using multi-path routing and content caching
US9191459B2 (en) Method and apparatus for seamless mobility techniques in content-centric network
US20040264463A1 (en) Method, apparatus and system for distributing multicast data
CN104301445B (zh) 一种移动互联网数据传输方法和系统
US20090119406A1 (en) Method for data communication and system thereof
KR20050037370A (ko) 이동 검지 방법 및 이동 단말
US8625476B2 (en) Mobility management system and method for distributed mobility management network
WO2013040970A1 (zh) 中继节点选择方法及装置
WO2012065531A1 (zh) 实现中继选择的方法及装置、系统
US20120134313A1 (en) Access point, l2 switch and method of supporting multicast handover using the access point and l2 switch
CN101784010B (zh) 为移动组播业务辅助建立固网组播回传通道的方法及装置
CN104468371A (zh) 组播业务报文处理方法及装置
WO2013056669A1 (zh) 在组播接收端切换场景下建立优化路径的方法及系统
Jin et al. MANET for Disaster Relief based on NDN
WO2014187416A1 (zh) 一种组播组优化方法及锚点
KR101300040B1 (ko) 분산형 이동성 관리 네트워크를 위한 이동성 관리 시스템 및 방법
Jain et al. NDN architectures in VANET scenario
KR101248954B1 (ko) 분산형 이동성 관리 네트워크를 위한 멀티캐스트 지원방법
US9763083B2 (en) Method and apparatus for managing mobility of terminal in communication system
Lavi et al. MaGMA: mobility and group management architecture for real‐time collaborative applications
KR101077596B1 (ko) 프록시 모바일 인터넷 프로토콜에서 ｓｓｍ을 위한 컨텍스트 프로필을 이용하는 멀티캐스트 스트림 제공 시스템, 멀티캐스트 접속 게이트웨이 및 모바일 노드 접속 처리 방법
CN102984182B (zh) 一种p2p网络移动性管理方法及系统
Qiu et al. A distributed mapping system to support mobility in identifier/locator separation architecture
CN102196599A (zh) 一种使终端加入多播组的方法和基站

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14801016

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 14916433

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2014801016

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014801016

Country of ref document: EP