Conference control method, system, electronic device and storage medium

Abstract

Disclosed in the present disclosure are a conference control method, a system, an electronic device and a storage medium. The method is applied to a first node bound with a first member in a conference, and comprises: on the basis of a region to which a second member in the conference belongs, establishing a connection relationship between the first node and a second node bound with the second member; receiving a multicast tree of the conference sent by a control center, the multicast tree being obtained by the control center on the basis of states of links between nodes bound with members in the conference and transmission costs of regions to which the nodes bound with the members belong; and updating the connection relationship between the first node and the second node on the basis of the multicast tree. A node bound with a member is directly connected to a node bound with another member, so as to complete establishment of a multicast tree quickly, thus shortening the time to first frame data when a user joins the conference; after the conference is established, the connection between the nodes bound with the members is updated by receiving a new multicast tree computed by the control center.

Description

[0001] A conference control method, system, electronic device and storage medium cross-reference This disclosure requires the application filed with the China Patent Office on March 6, 2024, application number

[0002] 202410257281.2, claims priority from Chinese patent application entitled "A Conference Control Method, System, Electronic Device, and Storage Medium," the entire contents of which are incorporated herein by reference. TECHNICAL FIELD This disclosure relates to the field of computer technology, and more specifically, to a conference control method, system, electronic device, and storage medium. BACKGROUND With the advancement of digital technology, audio and video conferencing technology plays a vital role in social development. To provide global communication services for audio and video conferencing, service providers typically deploy clusters for audio and video conferencing services in different countries and regions. Data transmission for cross-domain audio and video conferencing primarily involves client-to-cluster transmission and cluster-to-cluster transmission. Because cluster-to-cluster transmission requires long, transnational links, and because regional carrier rates vary, transmission quality fluctuates significantly and transmission costs are high. Considering the unique characteristics of transmission quality and cost for cross-domain audio and video conferencing, establishing appropriate inter-cluster transmission paths is a key issue in improving the cross-domain user audio and video experience and minimizing transmission costs. SUMMARY OF THE INVENTION The present disclosure addresses the shortcomings of the aforementioned prior art by providing a conference control method, system, electronic device, and storage medium. This objective is achieved through the following technical solutions. In a first aspect, the present disclosure provides a conference control method for a conference including members located in different regions. The method is applied to a first node bound to a first member in the conference, where the first member is any member in the conference. The method comprises: establishing a connection relationship between the first node and a second node bound to the second member based on the region to which the second member belongs, wherein the second member is a member of the conference other than the first member; receiving a multicast tree for the conference from a control center, wherein the multicast tree is obtained by the control center based on the link status between nodes bound to each member in the conference and the transmission cost of the region to which each node bound to each member belongs; and updating the connection relationship between the first node and the second node based on the multicast tree.The conference control method based on the first aspect has at least the following beneficial effects or advantages: During the conference establishment phase, nodes bound to a joining member directly establish connections with nodes bound to other joining members without waiting for interaction with the control center, thereby quickly completing multicast tree establishment and avoiding excessively long conference joining wait times. This reduces the first frame data transmission time when a user joins the conference, thereby improving the user's audio and video experience. After the conference is established, due to dynamic changes in network quality, the connections between the nodes bound to each member are updated by receiving a new multicast tree calculated by the control center to adapt to changes in link quality and ensure the user's audio and video experience. Because the new multicast tree calculated by the control center takes both transmission cost and transmission quality into consideration, it can effectively reduce data transmission costs while ensuring data transmission quality for members in different regions. A second aspect of the present disclosure provides a conference control method, wherein the conference includes members located in different areas and is applied to a control center. The method includes: determining a multicast tree for the nodes bound to each member based on the link status reported by the nodes bound to each member in the conference and the transmission cost of the area to which the nodes bound to each member belong; determining a target node whose activity is lower than a preset threshold based on the amount of member-generated data reported by the nodes bound to each member at different times; and sending the multicast tree of the target node to the nodes bound to each member, so that the nodes bound to each member update the connection relationship between the nodes bound to each member based on the multicast tree. The conference control method based on the second aspect has at least the following beneficial effects or advantages: the control center collects the link status reported by each node and calculates the multicast tree of the nodes bound to each member based on the real-time link status and the transmission cost of each region, so as to effectively combat problems such as delay and packet loss caused by changes in cross-regional link status, and avoid transmission paths with high transmission costs, so that the transmission quality and transmission cost are balanced. When sending the multicast tree, the activity of the node is tracked by the amount of data generated by the members reported by the node, and the multicast tree of the node with low activity is selected and sent to each node for update, so as to reduce the impact of path switching on the audio and video experience.A third aspect of the present disclosure provides a conference control system. A conference includes members located in different regions. The system includes a control center, a first node bound to a first member in the conference, and a second node bound to a second member in the conference. The first node is configured to establish a connection relationship between the first node and the second node based on the region to which the second member belongs. The control center is configured to receive link status reported by nodes bound to each member in the conference, determine a multicast tree for each node bound to each member based on the link status and the transmission cost of the region to which each node belongs, determine nodes with activity below a preset threshold based on the amount of member-generated data reported by each node bound to each member at different times, and send the multicast tree of nodes with activity below the preset threshold to each node bound to each member. The first node is configured to update the connection relationship between the first node and the second node based on the multicast tree. A fourth aspect of the present disclosure provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the method of the first or second aspect described above. A fifth aspect of the present disclosure provides a computer-readable storage medium having a computer program stored thereon. The program is executed by a processor to implement the method of the first or second aspect described above. The above description is merely an overview of the technical solution of the present disclosure. To provide a clearer understanding of the technical means of the present disclosure, implementation can be carried out in accordance with the contents of the specification. To further enhance the above and other objectives, features, and advantages of the present disclosure, specific embodiments of the present disclosure are described below. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings described herein are provided to provide a further understanding of the present disclosure and constitute a part of the present disclosure. The illustrative embodiments of the present disclosure and their descriptions are provided for illustrative purposes only and are not intended to unduly limit the present disclosure. In the accompanying drawings: Figure 1 is a schematic diagram of an application scenario according to an exemplary embodiment; Figure 2A is a flowchart of an embodiment of a conference control method according to an exemplary embodiment; Figure 2B is a schematic diagram of an old and new multicast tree according to an exemplary embodiment; Figures 2C and 2D are schematic diagrams of a multicast tree update according to an exemplary embodiment; Figure 3 is a flowchart of an embodiment of another conference control method according to an exemplary embodiment; Figure 4 is a schematic diagram of the hardware structure of an electronic device according to an exemplary embodiment; Figure 5 is a schematic diagram of the structure of a storage medium according to an exemplary embodiment. DETAILED DESCRIPTION OF THE EMBODIMENTS Exemplary embodiments will be described in detail herein, with examples illustrated in the accompanying drawings. In the following description, when referring to the drawings, identical numerals in different drawings represent identical or similar elements, unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present disclosure.Rather, they are merely examples of systems and methods consistent with some aspects of the present disclosure, as detailed in the appended claims. The terminology used in this disclosure is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used in this disclosure and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and / or," as used herein, refers to and encompasses any and all possible combinations of one or more of the associated listed items. It should be understood that while the disclosure may employ the terms "first," "second," and "third," etc., to describe various information, such information should not be limited to these terms. These terms are used solely to distinguish information of the same type from one another. For example, first information could be referred to as second information, and similarly, second information could be referred to as first information, without departing from the scope of this disclosure. Depending on the context, the term "if," as used herein, could be interpreted as meaning "when," "when," or "in response to determining." Cross-domain audio and video conferencing occurs when multiple members from different regions join the same conference. Each member connects to the nearest cluster and receives and transmits audio and video data through the cluster. Clusters in different regions also transmit data to each other, ensuring that members in different regions can receive each other's audio and video data. Data transmission in cross-domain audio and video conferencing primarily involves member-to-cluster transmission and cluster-to-cluster transmission. From a transmission quality perspective, communication from a member to a nearby cluster traverses a shorter network path within the same region, typically resulting in better network quality. However, communication between clusters traverses longer paths, crosses international links, and must traverse cross-border firewalls, resulting in significant fluctuations in network quality over time. From a transmission cost perspective, communication from a member to a nearby cluster is typically within the same region, resulting in lower costs. However, cluster-to-cluster transmission traverses international links, resulting in higher costs. Furthermore, cross-domain transmission between different regions often results in significant differences in network operator fees. Therefore, the key challenge facing cross-domain audio and video conferencing is establishing appropriate transmission paths between clusters to improve the audio and video experience and minimize transmission costs.Figure 1 illustrates a cross-domain audio and video conferencing scenario. Participants are located in different regions, and each member is bound to a cluster node deployed in that region. Establishing and optimizing the transmission paths between these bound cluster nodes is crucial for both audio and video experience and transmission costs. For example, in Figure 1, three members, A, B, and C, are located in regions 1, 2, and 3, respectively. Member A binds to cluster node 1.1 in region 1, member B binds to cluster node 2.1 in region 2, and member C binds to cluster node 3.1 in region 3. Therefore, establishing and optimizing the transmission paths between these three cluster nodes is crucial. Furthermore, a control center is included, which manages nodes in clusters deployed in different regions. Specifically, the control center can be an integrated system of multiple controllers, each of which synchronizes data with the other, with each controller managing a corresponding cluster. It should be noted that interactions between cluster nodes are referred to as data plane interactions, while interactions between the control center and cluster nodes are referred to as control plane interactions. Based on this, the conference control method proposed in this disclosure uses a method where, during the conference establishment phase, nodes bound to conference members directly establish connections with nodes bound to other members based on the regions of the other conference members. This method eliminates the need for interaction with the control center, allowing for rapid transmission path establishment and the generation of a multicast tree for each node bound to each member. This reduces long conference joining wait times, shortens the first frame data transmission time when a user joins the conference, and improves the user's audio and video experience. After the conference is established, due to dynamic changes in network quality, connections between nodes bound to each member are updated by receiving a new multicast tree calculated by the control center to adapt to link quality changes and ensure a consistent user audio and video experience. Because the new multicast tree calculated by the control center takes both transmission cost and quality into account, it effectively reduces transmission costs while ensuring data transmission quality for members in different regions. As can be seen, during the conference establishment phase, each member's node establishes a connection directly with the nodes bound to other members on the data plane based on the regions to which the other members belong, without interacting with the control plane. This speeds up conference establishment and reduces the first frame data time. At the same time, this also ensures that the data plane works independently. Even if the control plane fails, the conference can still be successfully established. Since the data plane's dependence on the control plane is reduced during the conference establishment phase, it can provide higher reliability.Because the transmission path established through direct data plane connections doesn't consider network transmission quality, it can lead to increased latency and packet loss after a conference is established, causing issues like lag and screen artifacts. Therefore, after a conference is established, the control plane optimizes the transmission path accordingly to mitigate these issues. Specifically, the control center considers both transmission cost and quality when calculating a new multicast tree to optimize and update the transmission path. Furthermore, the control center collects the real-time link status reported by each node and calculates the multicast tree for each member's bound nodes based on the link status and the transmission cost of each node's region. This effectively mitigates latency and packet loss issues caused by cross-region link status changes, avoids high-cost transmission paths, and achieves a balance between transmission quality and cost. During updates, the control center tracks node activity based on the amount of member data reported by the nodes. The multicast tree of less active nodes is selected and sent to each node for updates, minimizing the impact of path switching on the audio and video experience. In addition to being applicable to cross-domain audio and video conferences, the conference control method disclosed in the embodiments of the present disclosure is also applicable to cross-domain live broadcast conferences in live broadcast scenarios. The following describes in detail the technical solution of the present disclosure and how the technical solution of the present disclosure solves the aforementioned technical problems with specific embodiments. The several specific embodiments listed can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings. Figure 2A is a flow chart of an embodiment of a conference control method according to an exemplary embodiment. The conference control method is applied to the first node bound to the first member in the conference. The first member can be any member in the conference. In combination with the scenario shown in Figure 1 above, the first member can be any member of members A, B, and C. As shown in Figure 2A, the conference control method includes the following steps: Step 201: Establish a connection relationship between the first node and the second node bound to the second member based on the region to which the second member in the conference belongs, wherein the second member is a member of the conference other than the first member. Step 202: Receive the multicast tree for the conference sent by the control center. This multicast tree is obtained by the control center based on the link status between the nodes bound to each conference member and the transmission cost of the region to which each node belongs. Step 203: Update the connection relationship between the first node and the second node based on this multicast tree. In this embodiment of the present disclosure, the region is represented by the region information of the second member. Once the relevant information of the second node bound to the second member is determined based on the region information, a connection can be directly established between the first node and the second node, enabling data communication between the two nodes.Specifically, the first member acts as the stream puller, and the second member acts as the stream pusher. The first node bound to the first member uses the information it has determined about the second node bound to the second member to send a direct connection request to the second node bound to the second member, establishing a connection between the two nodes. This ensures that the first member, acting as the stream puller, can receive data from the other members in the conference acting as stream pushers. Thus, the conference establishment phase is equivalent to establishing a fast multicast tree in reverse order for the stream puller. The multicast tree comprises sending and receiving nodes, and records the transmission path from the sending node to the receiving node. The multicast tree is represented as a tree structure, with the sending node as the root node. Because the multicast tree is derived by the control center based on the link status between the nodes bound to each conference member and the transmission cost of the region to which each node belongs, the connections between the nodes bound to each member, as updated by the multicast tree, can balance the transmission quality and cost of conference data. Each member in a conference can act as both a pusher and a puller. Typically, during a conference, only one person is speaking, so only one member is in the pusher role at any given time. All other members act as pullers, receiving data from the pusher. Therefore, for each member in a conference, if they are acting as a pusher, a multicast tree with the node bound to that member as the root node is created. This tree records the transmission paths from the root node to the nodes bound to other members. Based on the transmission paths recorded in the multicast tree, connections between the nodes bound to each member can be updated and optimized. It should be noted that the terms "first node" and "second node" above are used to distinguish between the first and second members being bound to different nodes. At this point, the conference control process shown in FIG2A is completed. During the conference establishment phase, nodes bound to a joining member directly establish connections with nodes bound to other joining members without waiting for interaction with the control center. This allows for rapid multicast tree establishment, avoids excessively long conference joining wait times, reduces the first frame data transmission time when a user joins the conference, and improves the user's audio and video experience. After the conference is established, due to dynamic changes in network quality, the connections between nodes bound to each member are updated by receiving a new multicast tree calculated by the control center to adapt to changes in link quality and ensure the user's audio and video experience. Because the new multicast tree calculated by the control center takes both transmission cost and transmission quality into consideration, it can effectively reduce data transmission costs while ensuring data transmission quality for members in different regions.In some embodiments of the present disclosure, in step 201, establishing a connection between a first node and a second node bound to a second member based on the second member's region in the conference can involve obtaining the second member's conference identifier from the control center. Based on the obtained conference identifier, the second member's region is determined. Based on the obtained conference identifier, the node address of the second node bound to the second member is determined from the node list corresponding to the second member's region. This node address is then used to establish a connection between the first node and the second node. This connection is a connection between the first node bound to the first member and the second node bound to the second member. In this embodiment, each member in the conference has a unique conference identifier that includes the member's region information and conference ID. Therefore, the second member's region can be determined by parsing the conference identifier. In this way, the first node bound to the first member can directly establish a connection with the second node bound to the second member based on the conference identifier, thereby completing the conference establishment without waiting for interaction with the control center. Because the control center manages the nodes in the cluster deployed in each region, it maintains a global node list. As shown in Table 1, this node list records the identifiers and node addresses of the nodes in each region. Therefore, the control center can pre-distribute the global node list to each node during initialization, so that the first node bound to the first member can obtain the node list corresponding to the region to which the second member belongs based on the locally stored global node list. Table 1 In an optional embodiment, in the process of determining the node address of the second node bound to the second member from the node list corresponding to the second member's region based on the obtained conference identifier, a hash calculation is performed on the conference identifier to obtain a hash result. The hash calculation uses the same hash algorithm as the hash algorithm used by the second member when selecting the node to be bound from the node list corresponding to the region. A node identifier matching the hash result is then determined from the node list, and the node address corresponding to the node identifier is obtained. Since the hash calculation for the first node bound to the first member uses the same hash algorithm as the hash algorithm used by the second member when selecting the node to be bound from the node list corresponding to the region, the node address ultimately selected from the node list is necessarily the address of the actual node bound to the second member. In some embodiments of the present disclosure, in step 203, in the process of updating the connection between the first node and the second node based on the multicast tree, if the first node bound to the first member is not the root node of the multicast tree, a comparison result is obtained by comparing the connection relationship of the first node recorded in the multicast tree with the connection relationship between the first node and the second node bound to the second member. Based on the comparison result, the connection between the first node and the second node is updated. If the first node bound to the first member is not the root node in the multicast tree, this indicates that the first member is not a pusher in the multicast tree, but a puller. It must pull conference data from the root node of the multicast tree via a transmission path. The transmission path from the root node to the first node recorded in the multicast tree includes the connection relationship of the first node. The comparison results include two scenarios: the first node's connection relationship is reversed and the first node is not reversed. By switching the first node's connection based on the comparison results, packet loss and data loop issues can be resolved. The new and old multicast trees shown in Figure 2B illustrate that the member bound to node N1 is the pusher, and the members bound to nodes N2 through N5 are the pullers. Therefore, with node N1 as the root node, comparing the new and old multicast trees reveals that the connection relationship between node N2 and node N3 is reversed. Therefore, the connection relationship between node N2 and node N3 is reversed. The connection relationship to node N5 has changed, but has not reversed. The connection relationship to node N4 has not changed.In an optional embodiment, in a process of updating the connection between the first node and the second node based on the comparison result, if the comparison result shows that the connection relationship of the first node has been reversed, a connection between the first node and the root node in the multicast tree is first established, and then all connections with connection relationships pointing to the first node other than the connection between the first node and the root node are disconnected. A timer is started, and when the timer reaches a preset timer, a new connection relationship for the first node is established based on the record in the multicast tree that shows the connection relationship pointing to the first node, and the connection between the first node and the root node is disconnected. If the comparison result shows that the connection relationship of the first node has not been reversed, a new connection relationship for the first node is established based on the record in the multicast tree that shows the connection relationship pointing to the first node, and the connection with the connection relationship pointing to the first node is disconnected. In this embodiment, if the first node's connection relationship has reversed, a connection switch is implemented by adding a directly connected intermediate multicast tree between the old and new multicast trees. Specifically, the intermediate multicast tree is first established, then the old multicast tree connection is disconnected. Then, the new multicast tree connection is established, and then the intermediate multicast tree connection is disconnected. This allows each node to independently complete the update without synchronization or coordination with other nodes, resulting in fast update convergence and ensuring an update without packet loss or data loops. If the first node's connection relationship has not reversed, a new connection can be directly established, and then the old connection can be disconnected, thereby implementing a connection switch. This shows that when switching a node's connection, the root node of the multicast tree is not considered. Only changes in the connection pointing to the node itself are considered during the connection switch. No operation is performed on nodes whose connections pointing to the node itself have not changed. Continuing with FIG2B as an example, as shown in FIG2C , when performing a multicast tree update on node N5, whose connection relationship has changed but not reversed, node N5 first establishes a new connection with node N4 and then disconnects the old connection pointing to node N5. Furthermore, as shown in FIG2D , for nodes N2 and N3 whose connection relationships are reversed, node N2 first establishes a connection with the root node N1, and node N3 establishes a connection with the root node N1, to ensure that the data of the root node can be transmitted to nodes N2 and N3 during the connection switching process to avoid data loops. Node N3 then disconnects its old connection, that is, the connection with node N2. Since node N2 does not have any old connection pointing to itself, there is no need to disconnect any connection. Node N2 and node N3 both wait for a certain period of time to ensure that each node has completed the disconnection of the old connection. Then, node N3 establishes a new connection relationship pointing to itself, that is, the connection with the root node N1. Node N2 establishes a new connection relationship pointing to itself, that is, the connection with node N3. Node N2 and node N3 disconnect the previously established connection with the root node.In other embodiments of the present disclosure, after executing step 201, to facilitate the control center's dynamic calculation of the multicast tree, taking into account both transmission quality and transmission cost, and selecting appropriate times to distribute the multicast tree to nodes, the control center can send the amount of data generated by the first node bound to the first member to the control center when the first member generates data, allowing the control center to determine the first node's activity. Furthermore, the control center can periodically collect the link status between the first node and the second node and send the collected link status to the control center. The first member generates data when speaking, which needs to be transmitted to the other member, namely the second member. This data can reflect the activity of the streaming end. Link status can include latency rate, packet loss rate, and other indicators, reflecting network transmission quality. Based on the embodiment shown in FIG2A above, FIG3 is a flowchart illustrating another embodiment of a conference control method according to an exemplary embodiment. This conference control method is applied to the control center and includes the following steps: Step 301: Determine the multicast tree for each node bound to each member in the conference based on the link status reported by the nodes bound to each member and the transmission cost of the region to which each node belongs. Step 302: Based on the amount of member-generated data reported by each member's bound nodes at different times, a target node with activity below a preset threshold is determined. Step 303: The multicast tree of the target node is sent to each member's bound nodes, so that each member's bound nodes update the connection relationship between each member's bound nodes based on the multicast tree. In this embodiment, the link status between two nodes can reflect network transmission quality, and the transmission costs in different regions can reflect regional charging differences. Therefore, the multicast tree calculated by the control center is a suitable transmission path obtained by combining these two indicators: transmission quality and transmission cost. In a conference, since each member has the potential to act as a streaming end to transmit data, a multicast tree must be calculated for each member's bound node. In other words, the root node in the multicast tree is the node to which the member is bound. The amount of data reported at different times can reflect the member's activity. For example, the total amount of data generated by the member during a period close to the current system time can be used as the activity level. By sending the multicast tree of the target node with relatively low activity to each member's bound nodes to complete the multicast tree update, the impact of connection switching on the audio and video experience can be reduced.Based on the above-described second embodiment, the control center collects the link status reported by each node and calculates a multicast tree for each member's bound nodes based on the real-time link status and local transmission costs. This effectively mitigates delays and packet loss caused by cross-regional link status changes and avoids expensive transmission paths, achieving a balance between transmission quality and transmission costs. When distributing the multicast tree, the control center tracks the node activity based on the amount of member-generated data reported by the node. The multicast tree for nodes with low activity is selected and distributed to each node for update, minimizing the impact of path switching on the audio and video experience. In some embodiments of the present disclosure, in step 301, determining the multicast tree for each member's bound nodes based on the link status reported by each member's bound nodes and the transmission costs of the regions to which each member's bound nodes belong can be accomplished by constructing a directed graph based on the link status reported by each member's bound nodes and the transmission costs of the regions to which each member's bound nodes belong. Then, for each member's bound nodes, the multicast tree with the member's bound node as the root node is determined based on the directed graph, thereby obtaining the multicast tree for the member's bound nodes. In a directed graph, a point represents a region, and an edge represents a link between two regions. The weight of an edge is the weighted sum of the link state between nodes in the two regions and the transmission cost of the edge's direction to the region. When calculating a multicast tree based on a directed graph, relevant algorithms can be used, including but not limited to the directed Steiner tree algorithm and the minimum dendrogram algorithm. In this embodiment, considering that traffic charging standards vary across regions in cross-domain scenarios, the multicast tree is calculated using link state and transmission cost to ensure cross-domain transmission quality and reduce bandwidth costs. Traditional solutions for optimizing multicast trees typically aim to ensure that the latency from the stream pusher to the stream puller meets standards or to minimize bandwidth consumption. However, this approach is not applicable to cross-domain scenarios. While traditional solutions take bandwidth consumption into account, they do not directly translate into cost. Therefore, simply reducing bandwidth consumption does not necessarily translate into cost reductions. In other embodiments of the present disclosure, in step 301, the process of determining the multicast tree for each member's bound node based on the link status reported by each member's bound node and the transmission cost of the region to which each member's bound node belongs can be performed once every update cycle. This update cycle can be used to learn link variation patterns based on historically collected link status, with a machine learning model predicting an appropriate update cycle based on these link variation patterns. By optimizing the multicast tree calculation based on the update cycle, the dynamic and variable link status in cross-domain scenarios can be accommodated, addressing the issues of increased transmission delay and packet loss.In other embodiments of the present disclosure, before determining the multicast tree of the nodes to which each member is bound in step 301, the control center may receive the conference number and region information sent by the nodes to which each member is bound, and generate a conference identifier for each member based on the conference number and region information, so that each member corresponds to a unique conference identifier, which facilitates obtaining the region based on the conference identifier. Based on the embodiments shown in Figures 2A and 3 above, and in combination with the application scenario shown in Figure 1 above, the present disclosure also provides a conference control system, which includes a control center, a first node bound to a first member in the conference, and a second node bound to a second member in the conference, wherein the conference includes members located in different regions, wherein the first member is any member in the conference, and the second member is any member in the conference other than the first member. During the initialization phase, the control center sends a global node list to the nodes in the cluster deployed in each region. During the conference establishment phase, the control center generates a conference identifier for each member joining the conference, consisting of the conference number and region information. The first node bound to the first member obtains the conference identifier of the second member from the control center. Based on the obtained conference identifier, it determines the region of the second member. Based on the obtained conference identifier, it then determines the node address of the second node bound to the second member from the node list corresponding to the second member's region. This node address is used to establish a connection between the first and second nodes, thereby quickly establishing a multicast tree for transmitting the first frame of data. It should be noted that the multicast tree formed during the conference establishment phase for each member's bound node is rooted at that node, with the nodes bound to other members serving as leaf nodes. Direct paths connect the root node to each leaf node. After a conference is established and enters a stable phase, the nodes bound to each member in the conference will report link status and member-generated data volume in real time. The control center can then periodically build a directed graph based on the link status reported by each member-bound node and the transmission cost of the region to which each node belongs. The control center then determines the multicast tree for each member-bound node using this directed graph, with the node as the root node. Furthermore, based on the member-generated data volume reported by each member-bound node at different times, the control center identifies target nodes whose activity falls below a preset threshold and distributes the target node's multicast tree to each member-bound node.If the first node bound to the first member is not the root node in the received multicast tree, the node compares the connection relationship of the first node recorded in the multicast tree with the connection relationship between the first node and the second node to obtain a comparison result. If the comparison result indicates that the connection relationship of the first node has reversed, the node first establishes a connection with the root node in the multicast tree. Then, all connections pointing to the first node, except the connection between the first node and the root node, are disconnected. A timer is then started. When the timer reaches a preset duration, a new connection relationship is established for the first node based on the connection relationship pointing to the first node in the multicast tree, and the connection between the first node and the root node is disconnected. If the comparison result indicates that the connection relationship of the first node has not reversed, a new connection relationship is established for the first node based on the connection relationship pointing to the first node in the multicast tree, and the connection pointing to the first node is disconnected. At this point, the node completes the multicast tree update. It should be noted that the multicast tree formed during the conference stabilization phase for each member's bound node still has the corresponding node as the root node. However, the nodes bound to other members may be leaf nodes or not, and the transmission paths from the root node to the leaf nodes may not be direct paths. As shown in Figure 2B above, both the old and new multicast trees are calculated by the control center after the conference is successfully established, taking into account transmission quality and transmission cost. It can be seen that in the old multicast tree, there is root node N1 and leaf nodes N3, N4, and N5, but the transmission paths from root node N1 to leaf nodes N3, N4, and N5 are not direct paths. Similarly, in the new multicast tree, there is root node N1 and leaf node N5, but the transmission paths from root node N1 to leaf node N5 are not direct paths. It should be noted that all user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, storage, and display) referred to in this disclosure are authorized by the user or fully authorized by all parties. The collection, use, and processing of relevant data must comply with the relevant laws, regulations, and standards of the relevant countries and regions, and corresponding operation portals are provided for users to choose to authorize or deny. The present embodiments also provide an electronic device corresponding to the conference control method provided in the aforementioned embodiments, for executing the aforementioned conference control method. Figure 4 is a hardware structure diagram of an electronic device according to an exemplary embodiment. The electronic device includes: a communication interface 601, a processor 602, a memory 603, and a bus 604. The communication interface 601, the processor 602, and the memory 603 communicate with each other via the bus 604.The processor 602 can execute the conference control method described above by reading and executing machine-executable instructions corresponding to the control logic of the conference control method in the memory 603. The details of this method are described in the above embodiments and will not be repeated here. The memory 603 mentioned in this disclosure can be any electronic, magnetic, optical, or other physical storage system and can contain stored information such as executable instructions, data, etc. Specifically, the memory 603 can be RAM (Random Access Memory), flash memory, a storage drive (such as a hard disk drive), any type of storage disk (such as an optical disk, DVD, etc.), or similar storage media, or a combination thereof. The system network element and at least one other network element are connected via at least one communication interface 601 (which can be wired or wireless). This connection can be achieved through the Internet, a wide area network, a local area network, a metropolitan area network, etc. The bus 604 can be an ISA bus, a PCI bus, or an EISA bus, etc. Buses can be categorized as address buses, data buses, and control buses, etc. Memory 603 is used to store programs, and processor 602 executes the programs after receiving execution instructions. Processor 602 may be an integrated circuit chip with signal processing capabilities. During implementation, the steps of the above method can be completed by hardware integrated logic circuits in processor 602 or by software instructions. Processor 602 may be a general-purpose processor, including a network processor (NP), a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this disclosure. A general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in conjunction with the embodiments of this disclosure may be directly executed by a hardware decoding processor or by a combination of hardware and software components in the decoding processor. The electronic device provided in the embodiments of this disclosure and the conference control method provided in the embodiments of this disclosure are based on the same inventive concept and have the same beneficial effects as the methods employed, executed, or implemented by them. The present disclosure also provides a computer-readable storage medium corresponding to the conference control method provided in the aforementioned embodiments. Referring to FIG. 5 , the computer-readable storage medium shown therein is a CD 30 on which a computer program (i.e., a program product) is stored. When the computer program is executed by a processor, the conference control method provided in any of the aforementioned embodiments is executed.It should be noted that examples of computer-readable storage media may also include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory, or other optical or magnetic storage media, and these are not detailed here. The computer-readable storage media provided in the above-described embodiments of the present disclosure and the conference control methods provided in the embodiments of the present disclosure are based on the same inventive concept and have the same beneficial effects as the methods employed, executed, or implemented by the application programs stored therein. Those skilled in the art will readily identify other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art not disclosed herein. The description and examples are to be considered as exemplary only; the true scope and spirit of the present disclosure are indicated by the following claims. It should also be noted that the terms "comprise," "include," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, product, or apparatus comprising a series of elements includes not only those elements but also other elements not explicitly listed, or elements inherent to such process, method, product, or apparatus. In the absence of further limitations, an element defined by the phrase "comprising a..." does not preclude the presence of additional identical elements in the process, method, product, or apparatus comprising the element. The above are merely preferred embodiments of the present disclosure and are not intended to limit the present disclosure. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present disclosure are intended to be included within the scope of protection of the present disclosure. Industrial Applicability The solution provided by the embodiment of the present disclosure can establish a connection relationship between a first node and a second node bound to the second member according to the region to which the second member in the meeting belongs; the second member is a member other than the first member; a multicast tree of the meeting sent by the control center is received; the multicast tree is obtained by the control center based on the link status between the nodes bound to each member in the meeting and the transmission cost of the region to which the nodes bound to each member belong; the connection relationship between the first node and the second node is updated based on the multicast tree, thereby solving the technical problems of delay and packet loss caused by changes in cross-regional link status.

Claims

Claims 1. A conference control method, wherein the conference includes members located in different areas, is applied to a first node bound to a first member of the conference, where the first member is any member of the conference, the method comprising: Establish a connection relationship between the first node and the second node bound to the second member according to the area to which the second member in the conference belongs, wherein the second member is a member of the conference other than the first member; receive a multicast tree of the conference sent by the control center, wherein the multicast tree is obtained by the control center based on the link status between the nodes bound to each member in the conference and the transmission cost of the area to which the nodes bound to each member belong; based on the multicast tree, update the connection relationship between the first node and the second node.

2. The method according to claim 1, wherein: The establishing, based on the region to which the second member belongs, a connection relationship between the first node and a second node bound to the second member includes: obtaining a conference identifier of the second member in the conference from the control center; determining, based on the obtained conference identifier, a region to which the second member belongs; and determining, based on the obtained conference identifier, a node address of the second node to which the second member is bound in a node list corresponding to the region to which the second member belongs; The connection relationship between the first node and the second node bound to the second member is established using the node address.

3. The method according to claim 2, wherein: The determining, based on the obtained conference identifier, the node address of the second node to which the second member is bound in the node list corresponding to the region to which the second member belongs, includes: performing a hash calculation on the conference identifier to obtain a hash result, wherein a hash algorithm used in the hash calculation is the same as a hash algorithm used by the second member when selecting a node to be bound from the node list corresponding to the region to which the second member belongs; determining a node identifier in the first node list that matches the hash result; and obtaining a node address corresponding to the node identifier.

4. The method according to claim 1, wherein: The updating of the connection relationship between the first node and the second node based on the multicast tree includes: when the first node is not the root node in the multicast tree, comparing the connection relationship of the first node recorded in the multicast tree with the connection relationship of the second node bound to the second member to obtain a comparison result; and updating the connection relationship between the first node and the second node according to the comparison result.

5. The method according to claim 4, wherein: The updating of the connection relationship between the first node and the second node based on the comparison result includes: when the comparison result shows that the connection relationship of the first node has reversed, establishing a connection between the first node and the root node in the multicast tree, disconnecting the connection relationships other than the connection between the first node and the root node that point to the first node, starting timing, and when the timing reaches a preset duration, establishing a new connection relationship for the first node based on the record of the connection relationship in the multicast tree that points to the first node, and disconnecting the connection between the first node and the root node.

6. The method according to claim 4, wherein: The updating of the connection relationship between the first node and the second node based on the comparison result includes: when the comparison result shows that the connection relationship of the first node has not been reversed, establishing a new connection relationship for the first node based on the record of the connection relationship pointing to the first node in the multicast tree, and disconnecting the connection relationship pointing to the first node.

7. The method according to any one of claims 1 to 6, wherein: After establishing a connection between the first node and the second node bound to the second member, the method further includes: when the first member generates data volume, sending the generated data volume to the control center; and / or periodically collecting the link status between the first node and the second node, and sending the collected link status to the control center.

8. A conference control method, wherein the conference includes members located in different areas and is applied to a control center, the method comprising: Determine the multicast tree of the nodes bound to each member according to the link status reported by the nodes bound to each member in the conference and the transmission cost of the area to which the nodes bound to each member belong; determine the target node whose activity is lower than a preset threshold according to the amount of member-generated data reported by the nodes bound to each member at different times; send the multicast tree of the target node to the nodes bound to each member, so that the nodes bound to each member update the connection relationship between the nodes bound to each member based on the multicast tree.

9. The method according to claim 8, wherein: The method of determining the multicast tree of the nodes bound to each member according to the link status reported by the nodes bound to each member in the conference and the transmission cost of the area to which the nodes bound to each member belong includes: establishing a directed graph according to the link status reported by the nodes bound to each member in the conference and the transmission cost of the area to which the nodes bound to each member belong; and determining, for the nodes bound to each member, the multicast tree with the node bound to the member as the root node according to the directed graph, as the multicast tree of the nodes bound to the member.

10. The method according to any one of claims 8 to 9, wherein: Before determining the multicast tree of the node bound to each member, the method further includes: receiving a conference number and region information sent by the node bound to each member; and generating a conference identifier for each member according to the conference number and the region information.

11. A conference control system, wherein the conference includes members located in different areas, and the system includes a control center, a first node bound to a first member in the conference, and a second node bound to a second member in the conference; the first node is configured to establish a connection relationship between the first node and the second node based on the area to which the second member in the conference belongs; the control center is configured to receive link status reported by nodes bound to each member in the conference, determine a multicast tree for each node bound to each member based on the link status and the transmission cost of the area to which each node bound to each member belongs, determine nodes with activity lower than a preset threshold based on the amount of member-generated data reported by each node bound to each member at different times, and send a multicast tree of nodes with activity lower than the preset threshold to each node bound to each member; the first node is configured to update the connection relationship between the first node and the second node based on the multicast tree.

12. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the method according to any one of claims 1 to 10.

13. A computer-readable storage medium having a computer program stored thereon, wherein the program is executed by a processor to implement the method according to any one of claims 1 to 0.

14. A computer program product, wherein: The invention comprises a non-volatile computer-readable storage medium storing a computer program, wherein the computer program implements the method according to any one of claims 1 to 10 when executed by a processor. 17

Images