CN112054953B - Multimedia instant messaging method, system, terminal equipment and computer storage medium - Google Patents
Multimedia instant messaging method, system, terminal equipment and computer storage medium Download PDFInfo
- Publication number
- CN112054953B CN112054953B CN202010970374.1A CN202010970374A CN112054953B CN 112054953 B CN112054953 B CN 112054953B CN 202010970374 A CN202010970374 A CN 202010970374A CN 112054953 B CN112054953 B CN 112054953B
- Authority
- CN
- China
- Prior art keywords
- node
- target
- search request
- information
- instant messaging
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
- H04L51/07—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail characterised by the inclusion of specific contents
- H04L51/10—Multimedia information
Abstract
The application relates to the technical field of video and audio communication, and discloses a multimedia instant messaging method, a multimedia instant messaging system, terminal equipment and a computer storage medium. The method comprises the following steps: receiving a search request of a second node, wherein the search request comprises second node identity information; sending a search request result to the second node based on the search request so that the second node carries out friend search based on the search request result; the searching request result comprises node list information of the first node and node information of the third node; and responding to the target third node of the friend searched in the searching request result by the second node, and guiding the second node and the target third node to establish connection so as to realize multimedia instant communication. By the mode, the problem that the whole/local network is paralyzed or the efficiency is reduced due to server failure in the centralized instant messaging network topology structure in the prior art can be solved on the premise of ensuring the efficiency of establishing the node communication.
Description
Technical Field
The present application relates to the field of audio-video communication technologies, and in particular, to a multimedia instant messaging method, system, terminal device, and computer storage medium.
Background
With the development of the 5G technology, the bandwidth of the internet which can be acquired by a user is larger and larger, the speed is higher and faster, and the cost is cheaper and cheaper. Therefore, the original audio and video quality is gradually increased, and the high definition, the ultra-high definition and the like are gradually popularized.
Traditional multimedia instant messaging service providers need to deploy a large number of servers on the internet to perform the transfer and processing of multimedia transmission services. The speed of the topology structure depending on centralization is higher when communication is established, but once the central server fails in the operation process, the efficiency of network communication is greatly reduced, and meanwhile, hidden danger on information safety is easily caused by recording user privacy information in the central server.
Disclosure of Invention
In order to solve the above problems, the present application provides a multimedia instant messaging method, system, terminal device, and computer storage medium, which can solve the problem of complete/partial network paralysis or efficiency reduction caused by server failure in the prior art centralized instant messaging network topology structure on the premise of ensuring the node communication establishment efficiency, and simultaneously enhance the security of user communication data.
The technical scheme adopted by the application is to provide a multimedia instant messaging method, which comprises the following steps: receiving a search request of a second node, wherein the search request comprises second node identity information; sending a search request result to the second node based on the search request so that the second node can perform friend search based on the search request result; the searching request result comprises node list information of the first node and node information of the third node; and responding to the target third node of the friend searched in the searching request result by the second node, and guiding the second node and the target third node to establish connection so as to realize multimedia instant messaging.
Wherein, sending the search request result to the second node based on the search request comprises: acquiring node information of a third node based on the search request, wherein the logical distance between the third node and the first node is smaller than the preset logical distance; and forming a search request result by the node information of the third node and the node list information of the first node, and sending the search request result to the second node.
Wherein, the method also comprises: the identity information of the second node is analyzed to obtain a physical address and an internet protocol address of the second node; and storing the physical address and the internet protocol address of the second node into the node information of the first node so as to update the node information of the first node.
The method for guiding the second node and the target third node to establish connection in response to the second node finding the target third node of the friend in the finding request result so as to realize multimedia instant messaging comprises the following steps: responding to the second node to find the target third node of the friend in the search request result, and controlling the second node to perform heartbeat detection on the target third node; if the heartbeat detection result is failure, determining that the second node and the target third node cannot communicate; and acquiring a fourth node corresponding to the target third node, and forwarding the service message of the second node to the target third node by using the fourth node, so that the second node and the target third node are connected to realize multimedia instant communication.
Wherein, the method also comprises: acquiring a fourth node which is closest to the target third node in logical distance; and sending the registration information of the second node to the fourth node so that the fourth node registers the registration information and sends registration success information to the second node.
Wherein, the method also comprises: sending a media forwarding request of the second node to the fourth node so as to search a target third node in the fourth node; when the target third node is found in the fourth node, applying for forwarding resources and issuing a forwarding table item; and controlling the second node to send the media message to the fourth node so that the fourth node forwards the media message to the target third node.
The controlling the second node to send the media packet to the fourth node so that the fourth node forwards the media packet to the target third node includes: and controlling the second node to send a request to release the media forwarding resource to the fourth node so that the fourth node releases the forwarding resource.
Another technical solution adopted by the present application is to provide a multimedia instant messaging system, including: a first node; the second node is used for sending a search request to the first node and receiving a search request result sent by the first node; the searching request result comprises node list information of the first node and node information of the third node; and the third node is used for establishing connection with the second node under the guidance of the first node so as to realize multimedia instant messaging.
Another technical scheme adopted by the application is to provide a terminal device, wherein the terminal device comprises a processor and a memory connected with the processor; the memory is used for storing program data and the processor is used for executing the program data to realize any method provided in the technical scheme.
Another technical solution adopted by the present application is to provide a computer storage medium, where the computer storage medium is used to store program data, and when the program data is executed by a processor, the computer storage medium is used to implement any one of the methods provided in the above technical solutions.
The beneficial effect of this application is: different from the prior art, the multimedia instant messaging method of the present application includes: receiving a search request of a second node, wherein the search request comprises second node identity information; sending a search request result to the second node based on the search request so that the second node carries out friend search based on the search request result; the searching request result comprises node list information of the first node and node information of the third node; and responding to the target third node of the friend searched in the searching request result by the second node, and guiding the second node and the target third node to establish connection so as to realize multimedia instant messaging. By the mode, the second node can more quickly find the target third node of the friend from the node information of the third node and the first node information in the first node list by utilizing the second node, on one hand, the configuration of a central server can be reduced on the premise of ensuring the efficiency of establishing the node communication, and the problems of whole/local network paralysis or efficiency reduction caused by server failure in the prior centralized instant communication network topology structure are solved, on the other hand, the central server is reduced, the storage of user data is avoided, and the safety of user communication data is enhanced.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts. Wherein:
fig. 1 is a schematic flowchart of a first embodiment of a multimedia instant messaging method provided in the present application;
FIG. 2 is a schematic diagram of interaction between a first node and a second node provided by the present application;
fig. 3 is a flowchart illustrating a multimedia instant messaging method according to a second embodiment of the present application;
fig. 4 is a flowchart illustrating a third embodiment of a multimedia instant messaging method provided in the present application;
FIG. 5 is a schematic diagram of interaction between a second node and a fourth node provided by the present application;
fig. 6 is a schematic flowchart of a fourth embodiment of a multimedia instant messaging method provided by the present application;
fig. 7 is a schematic structural diagram of an embodiment of a terminal device provided in the present application;
FIG. 8 is a schematic structural diagram of an embodiment of a computer storage medium provided in the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. It is to be understood that the specific embodiments described herein are merely illustrative of the application and are not limiting of the application. It should be further noted that, for the convenience of description, only some of the structures associated with the present application are shown in the drawings, not all of them. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
Referring to fig. 1, fig. 1 is a schematic flow chart of a first embodiment of a multimedia instant messaging method provided by the present application, the method including:
step 11: and receiving a search request of the second node, wherein the search request comprises the identity information of the second node.
In some embodiments, the second node identity information includes a second node ID, a second node IPv4 contact address port, and a second node IPv6 contact address port. The second node ID may have 160 bits, i.e. 20 bytes (40 16-ary characters) as the unique identification ID of the terminal device corresponding to the node. All the node (terminal) IDs in the system are automatically generated based on the information such as their own MAC. Ensuring global uniqueness. Taking the MAC address as an example: for example: MAC address FA:16 e. Then the XXXX (28 character) FA163EEAFBEF is the ID identifier of the node, wherein the unique identifier can be used as a component constituting 20-byte content, and is not necessarily limited to the ID header or tail, and the unique identifier can be customized according to the hardware condition of the unique identifier.
It is understood that the entire multimedia communication network includes a plurality of nodes, and in this embodiment, the node that actively sends the request is used as the second node. A special node is deployed and called as a first node, the first node is special, the address of the first node is fixed, and any node can access the first node. It has the function of common node, but does not participate in video and audio service. It only acts as a guide to the deployment of nodes in the network.
It will be appreciated that in the overall multimedia communication network of the present embodiment, a plurality of first nodes are included.
In some embodiments, at the time of multimedia communication network establishment, physical addresses and internet protocol addresses of the first node and other nodes are obtained; performing hash operation processing on the physical addresses of the first node and other nodes to obtain identity information of the first node; and comparing the identity information of the first node and other nodes to obtain a logical distance, and generating a first routing table by using the logical distance and the Internet protocol address together.
Step 12: sending a search request result to the second node based on the search request so that the second node carries out friend search based on the search request result; the search request result comprises node list information of the first node and node information of the third node.
In some embodiments, node information of a third node is obtained based on the search request, wherein a logical distance between the third node and the first node is smaller than a preset logical distance; and forming a search request result by using the node information of the third node and the node list information of the first node, and sending the search request result to the second node.
In some embodiments, the first node resolves the identity information of the second node to obtain a physical address and an internet protocol address of the second node; and storing the physical address and the internet protocol address of the second node into the node information of the first node so as to update the node information of the first node. It can be understood that, each time a second node sends a search request to the first node, the first node stores the identity information of the second node, and in the first node, except the information of the current second node and the information of the first node, the information of the other nodes is referred to as third node information.
By the method, the second node can quickly acquire the contact address port information of the third node and the friend which are close to the second node, and simultaneously acquire all the first node lists deployed in the system.
Step 13: and responding to the target third node of the friend searched in the searching request result by the second node, and guiding the second node and the target third node to establish connection so as to realize multimedia instant messaging.
In some embodiments, as described with reference to fig. 2, the second node obtains, from the local configuration, contact address port information of the first node that is closer to the second node, interacts with the first node through the contact address port, and sends a search request to the first node. And the first node receives the search request, records the node information of the second node and acquires the third node information which is closer to the second node. The third node information and the first node list are then sent to the second node. And the second node searches friends based on the third node information or the first node list. If the friend is searched in the third node information, if the target third node of the friend is searched, the second node is guided to establish connection with the target third node so as to realize multimedia instant messaging, if the target third node of the friend is not searched, the target third node is interacted with other first nodes in the first node list, the third node information in other first nodes is obtained, and the friend is searched from the third node information. And after the multimedia instant messaging is found, the second node and the target third node are guided to establish connection so as to realize multimedia instant messaging.
In an application scenario, each second node generally has several pieces of friend information that are often communicated, that is, a third node, and it is generally required that a friend is online to perform a video and audio service, and then it is required to know whether the friend is online currently. In the first situation, the third node of the friend is online, the second node is just online, the contact address port information of the friend is searched, a service ping request is initiated, the other node is considered to be online when the response of the third node is received, heartbeat detection needs to be carried out periodically in the period, and the friend is confirmed to be offline when the third node does not respond. In the second situation, the third node of the friend is not online, the second node is online, when the third node is online, the service ping request is sent to the second node according to the above steps, and after the second node receives the service ping request, the service ping request of the second node is triggered. In the third situation, when the third node and the second node call each other, after the communication address port of the friend opposite terminal is obtained, the address port provided by the opposite party can be used for video and audio communication. In the fourth situation, the mutual calling among multiple parties between friends can be decomposed into a plurality of single calls. And in the fifth situation, the friend scheme is optimized, friends are online, and the timeliness is not good enough due to the fact that the number of searched friend nodes is large. The buddy address is addressed step by step through the DHT algorithm. The method for inquiring the first node can be adopted to accelerate the speed of searching the friend node. When the second nodes are on line, each second node accesses a plurality of first nodes which are stored by the second node and are closest to the friends, and the information of the friends is obtained from the first nodes. Meanwhile, the first node stores the node information into the local after receiving the request. The second node is equivalent to increasing the first node when searching for the third node of the friend, so that the speed and the probability of finding the friend node are much faster than those of finding the friend node close to the second node. If the first node a, the first node B and the first node C have the node information of the friend a, the second node can directly establish connection with the node of the friend a.
Different from the situation in the prior art, the present embodiment receives a search request of a second node, where the search request includes second node identity information; sending a search request result to the second node based on the search request so that the second node carries out friend search based on the search request result; the searching request result comprises node list information of the first node and node information of the third node; and responding to the target third node of the friend searched in the searching request result by the second node, and guiding the second node and the target third node to establish connection so as to realize multimedia instant communication. By the mode, the second node can more quickly find the target third node of the friend from the node information of the third node and the first node information in the first node list by utilizing the second node, on one hand, the configuration of a central server can be reduced on the premise of ensuring the efficiency of establishing the node communication, and the problems of whole/local network paralysis or efficiency reduction caused by server failure in the prior centralized instant communication network topology structure are solved, on the other hand, the central server is reduced, the storage of user data is avoided, and the safety of user communication data is enhanced.
Referring to fig. 3, fig. 3 is a flowchart illustrating a multimedia instant messaging method according to a second embodiment of the present application. The method comprises the following steps:
step 31: and receiving a search request of the second node, wherein the search request comprises the identity information of the second node.
Step 32: sending a search request result to the second node based on the search request so that the second node can perform friend search based on the search request result; the search request result comprises node list information of the first node and node information of the third node.
Step 33: and responding to the target third node of the friend searched in the search request result by the second node, and controlling the second node to perform heartbeat detection on the target third node.
Step 34: and if the heartbeat detection result is failure, determining that the second node and the target third node cannot communicate.
In some embodiments, a large number of security firewall devices are used on the internet for operator reasons to shield user nodes inside firewalls, in which case, two nodes cannot communicate with each other many times.
Step 35: and acquiring a fourth node corresponding to the target third node, and forwarding the service message of the second node to the target third node by using the fourth node, so that the second node and the target third node are connected to realize multimedia instant communication.
In some embodiments, if the second node or the third node is under the firewall, the second node or the third node directly accessing the firewall is inaccessible because the firewall intercepts the request from the outside when there is no internal to external communication. If a forwarding server exists, if a node under the firewall forwards a message to the forwarding server first, the forwarding server can send the message to the node under the firewall through the just message channel, and at this time, the interworking can be performed. By the principle, when the two nodes cannot directly communicate, the fourth node corresponding to the target third node is obtained, and the fourth node is utilized to forward the service message of the second node to the target third node, so that the second node and the target third node are connected to realize multimedia instant communication.
In some embodiments, the fourth node may be designed to generate a different node according to a regional relationship. For example, because of the domestic network relationship, there are 4 home telecom operators, mobile, telecom, unicom plus radio and television. The intercommunication and bandwidth between the own networks of each operator are better than those of two different operators, in addition, the regional relationship is adopted, the internal network speed and bandwidth of each region are faster, and the cross-region bandwidth and network speed are not as high as those of the same region. Therefore, in the generation of the node ID, the information of the operator and the region is added into the ID, for example, 1 represents telecommunication, 2 represents mobile, 3 links, 4 telecommunication, and the region is divided into 34 provincial administrative areas, which are respectively represented by 101,102, 103-134, so that the necessary distances of the same operator and the same region are relatively close. When the fourth node ID is generated, the rule is referred, so that the same operator, the same province, the same city or even the same county can be in the closest distance, and the network quality is better. According to the kademlia algorithm, the second node can use the fourth node in the same area as much as possible when the fourth node is selected to be used for forwarding the message.
In some embodiments, the forwarding of the message may be performed using the functionality of the fourth node of the first node.
Referring to fig. 4, fig. 4 is a schematic flowchart of a third embodiment of a multimedia instant messaging method provided by the present application, where the method includes:
step 41: and acquiring a fourth node which is closest to the target third node in logic distance.
In some embodiments, the fourth node needs to forward media in addition to the service message implemented above. Since if the nodes are not connected, their media cannot be communicated, a fourth node is needed for relay forwarding. Media forwarding needs to determine which node of both parties of a call corresponds to a server that forwards media. In order to ensure the communication rate and efficiency, a called end, that is, a fourth node corresponding to the third node is generally used for relay forwarding instead of the fourth node corresponding to the second node. Because the fourth node corresponding to the called terminal does not have the intercommunication problem with the called terminal.
Step 42: and sending the registration information of the second node to the fourth node so that the fourth node registers the registration information and sends registration success information to the second node.
In this way, the fourth node is caused to register the information of the second node.
In some embodiments, the present embodiment is described with reference to fig. 2 and 5: after the second node in fig. 2 finishes friend finding, it starts to interact with the fourth node according to the flow shown in fig. 5. And after the second node acquires the fourth node information, searching for a fourth node which is closest to the target third node in logical distance. A registration request is sent to the fourth node, along with identity information of the second node. And after receiving the registration request, if the request is legal, the fourth node acquires and stores the ID and the contact address port of the second node based on the identity information of the second node. The fourth node then sends a registration success instruction and a fourth node list to the second node. By the above manner, when the second node acquires the fourth node list, the fourth node corresponding to the target third node can be quickly found through the fourth node list, and media forwarding is completed through the fourth node.
Referring to fig. 6, fig. 6 is a flowchart illustrating a fourth embodiment of the instant multimedia communication method provided by the present application. The method comprises the following steps:
step 61: and sending a media forwarding request of the second node to the fourth node so as to search the target third node in the fourth node.
In some embodiments, the third node of the fourth nodes is registered in the manner of registration of the above embodiments.
Step 62: and when the target third node is found in the fourth node, applying for forwarding resources and issuing a forwarding table item.
It can be understood that if the target third node is not online, the target third node cannot be found, and the request is ended.
In some embodiments, the related information of the application forwarding resource and the forwarding table entry is synchronously sent to the second node, so that the second node knows that the target third node is online and can perform media forwarding.
And step 63: and controlling the second node to send the media message to the fourth node so that the fourth node forwards the media message to the target third node.
In some embodiments, the target third node and the second node interact through a fourth node.
After step 63 is complete, step 64 is performed.
Step 64: and controlling the second node to send a request to release the media forwarding resource to the fourth node so that the fourth node releases the forwarding resource.
The resource release of the fourth node is completed, via step 64.
In some embodiments, when the first node, the second node, the third node, and the fourth node in the above embodiments receive a corresponding request or instruction, a response result is fed back to the corresponding node after the request or instruction is responded.
In some embodiments, the fourth node is mainly composed of a node registration module, a media forwarding module, a DHT processing module, and a link management module. The node registration module is a module for registering the second node or the third node when the second node or the third node starts to be online, and records the contact address port information of the second node or the third node which is online currently. The link management module is used for starting a timer to age the logged link after receiving the registration message of the second node or the third node, and resetting the timer if receiving the node registration refreshing message. The DHT processing module mainly processes various messages of the DHT. The media special visit module is mainly responsible for forwarding media, establishes a media forwarding table in cooperation with the node registration module, and updates the media forwarding table to the link management module for media forwarding. And simultaneously, after the conversation is finished, sending down a message for removing the media forwarding table item.
By the method, the fourth node is arranged in the multimedia communication network, the forwarding of the media information is completed, the multimedia instant communication between the second node and the third node is realized, and the problem that the second node or the third node cannot communicate due to the firewall problem is solved.
In some implementations, the present application also provides a multimedia instant messaging system, the system comprising: a first node; the second node is used for sending a search request to the first node and receiving a search request result sent by the first node; the searching request result comprises node list information of the first node and node information of the third node; and the third node is used for establishing connection with the second node under the guidance of the first node so as to realize multimedia instant messaging.
In some embodiments, the system further includes a fourth node, configured to perform message and media forwarding to complete communication between the second node and the third node when the second node and the third node cannot directly communicate.
It is understood that the number of the first node and the fourth node is set according to the actual situation. The multimedia instant messaging system can realize the method of any embodiment.
Referring to fig. 7, the terminal device 70 includes a processor 71 and a memory 72 connected to the processor 71; the memory 72 is used for storing program data and the processor 71 is used for executing the program data to realize the following method:
receiving a search request of a second node, wherein the search request comprises second node identity information; sending a search request result to the second node based on the search request so that the second node carries out friend search based on the search request result; the searching request result comprises node list information of the first node and node information of the third node; and responding to the target third node of the friend searched in the searching request result by the second node, and guiding the second node and the target third node to establish connection so as to realize multimedia instant communication.
It will be appreciated that the processor 71, when executing program data, is also adapted to perform any of the above-described embodiment methods.
In some embodiments, the terminal device may be the first node or the second node or the third node or the fourth node in the above embodiments, for implementing the corresponding method.
Referring to fig. 8, fig. 8 is a schematic structural diagram of an embodiment of a computer storage medium 80 provided in the present application, where the computer storage medium 80 is used for storing program data 81, and the program data 81, when being executed by a processor, is used for implementing the following method steps:
receiving a search request of a second node, wherein the search request comprises second node identity information; sending a search request result to the second node based on the search request so that the second node carries out friend search based on the search request result; the searching request result comprises node list information of the first node and node information of the third node; and responding to the target third node of the friend searched in the searching request result by the second node, and guiding the second node and the target third node to establish connection so as to realize multimedia instant messaging.
It will be appreciated that the program data 81, when executed by a processor, is also for implementing any of the embodiment methods described above.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other manners. For example, the above-described device embodiments are merely illustrative, and for example, the division of the modules or units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units may be integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated units in the other embodiments described above may be stored in a computer-readable storage medium if they are implemented in the form of software functional units and sold or used as separate products. Based on such understanding, the technical solutions of the present application, which are essential or contributing to the prior art, or all or part of the technical solutions may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the methods according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above description is only for the purpose of illustrating embodiments of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application or are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.
Claims (10)
1. A multimedia instant messaging method, characterized in that the method comprises:
receiving a search request of a second node, wherein the search request comprises the identity information of the second node;
sending a search request result to the second node based on the search request so that the second node carries out friend search based on the search request result; the searching request result comprises node list information of the first node and node information of the third node;
responding to the second node to find the target third node of the friend in the search request result, and guiding the second node and the target third node to establish connection so as to realize multimedia instant messaging;
the method further comprises the following steps: the second node is configured as a node actively sending a request; the address of the first node is configured to be a fixed address, any node can access the first node, the first node has the function of a common node, the first node does not participate in video and audio services, and the first node plays a guiding role in the deployment of nodes in a network.
2. The method of claim 1,
the sending a search request result to the second node based on the search request comprises:
acquiring node information of the third node based on the search request, wherein the logical distance between the third node and the first node is smaller than a preset logical distance;
and composing the node information of the third node and the node list information of the first node into the search request result, and sending the search request result to the second node.
3. The method of claim 1,
the method further comprises the following steps:
analyzing the second node identity information to obtain a physical address and an internet protocol address of the second node;
and storing the physical address and the internet protocol address of the second node into the node information of the first node so as to update the node information of the first node.
4. The method of claim 1,
the responding to the second node to find the target third node of the friend in the search request result, and guiding the second node and the target third node to establish connection so as to realize multimedia instant messaging, including:
responding to the second node to find the target third node of the friend in the searching request result, and controlling the second node to perform heartbeat detection on the target third node;
if the heartbeat detection result is failure, determining that the second node and the target third node cannot communicate;
and acquiring a fourth node corresponding to the target third node, and forwarding the service message of the second node to the target third node by using the fourth node, so that the second node and the target third node establish connection to realize multimedia instant messaging.
5. The method of claim 4,
the method further comprises the following steps:
acquiring a fourth node which is closest to the target third node in logical distance;
and sending the registration information of the second node to the fourth node so that the fourth node registers the registration information and sends registration success information to the second node.
6. The method of claim 5,
the method further comprises the following steps:
sending a media forwarding request of the second node to the fourth node to search the target third node in the fourth node;
when the target third node is found in the fourth node, applying for forwarding resources and issuing a forwarding table item;
and controlling the second node to send the media message to the fourth node so that the fourth node forwards the media message to the target third node.
7. The method of claim 6,
the controlling the second node to send the media packet to the fourth node, so that after the fourth node forwards the media packet to the target third node, the method includes:
and controlling the second node to send a request to release the media forwarding resource to the fourth node so that the fourth node releases the forwarding resource.
8. A multimedia instant messaging system, the system comprising:
a first node;
the second node is used for sending a search request to the first node and receiving a search request result sent by the first node; the searching request result comprises node list information of the first node and node information of the third node;
and the third node is used for establishing connection with the second node under the guidance of the first node so as to realize multimedia instant messaging.
9. A terminal device, characterized in that the terminal device comprises a processor and a memory connected with the processor;
the memory is for storing program data, and the processor is for executing the program data to implement the method of any one of claims 1-7.
10. A computer storage medium for storing program data for implementing the method according to any one of claims 1-7 when executed by a processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010970374.1A CN112054953B (en) | 2020-09-15 | 2020-09-15 | Multimedia instant messaging method, system, terminal equipment and computer storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010970374.1A CN112054953B (en) | 2020-09-15 | 2020-09-15 | Multimedia instant messaging method, system, terminal equipment and computer storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112054953A CN112054953A (en) | 2020-12-08 |
| CN112054953B true CN112054953B (en) | 2022-11-11 |
Family
ID=73604212
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010970374.1A Active CN112054953B (en) | 2020-09-15 | 2020-09-15 | Multimedia instant messaging method, system, terminal equipment and computer storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112054953B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112688870B (en) * | 2020-12-28 | 2022-11-04 | 杭州趣链科技有限公司 | Routing method, routing device and node equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101616171A (en) * | 2008-06-27 | 2009-12-30 | 华为技术有限公司 | A kind of methods, devices and systems of retaining node guiding state |
| CN110266766A (en) * | 2019-05-22 | 2019-09-20 | 深圳华科云动力科技有限公司 | A kind of construction method, system and the terminal device of attack resistance distributed network node |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7870425B2 (en) * | 2007-11-23 | 2011-01-11 | International Business Machines Corporation | De-centralized nodal failover handling |
| CN103780490B (en) * | 2012-10-17 | 2018-03-30 | 中兴通讯股份有限公司 | A kind of method and device for updating route querying tree |
| CN105376308B (en) * | 2015-10-29 | 2019-05-28 | 合一网络技术(北京)有限公司 | A kind of accurate system and method for searching the nearest resource node of P2P system |
| CN108337170B (en) * | 2018-01-30 | 2021-08-17 | 浙江省公众信息产业有限公司 | Distributed resource searching method and system |
| CN110336741B (en) * | 2019-08-20 | 2021-05-18 | 深圳市中仁信息科技有限公司 | Kad algorithm optimization method suitable for P2P instant messaging |
-
2020
- 2020-09-15 CN CN202010970374.1A patent/CN112054953B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101616171A (en) * | 2008-06-27 | 2009-12-30 | 华为技术有限公司 | A kind of methods, devices and systems of retaining node guiding state |
| CN110266766A (en) * | 2019-05-22 | 2019-09-20 | 深圳华科云动力科技有限公司 | A kind of construction method, system and the terminal device of attack resistance distributed network node |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112054953A (en) | 2020-12-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9307039B2 (en) | Method, system, push client, and user equipment for service communication | |
| JP4829248B2 (en) | Method and apparatus for providing communication group information to a client | |
| US8437757B2 (en) | Systems for providing peer-to-peer communications | |
| US20200374321A1 (en) | Session control logic with internet protocol (ip)-based routing | |
| US10637794B2 (en) | Resource subscription method, resource subscription apparatus, and resource subscription system | |
| US20080288654A1 (en) | Node and method to provide and keep real-time up-to-date data in a distributed hash table | |
| KR20100053688A (en) | Centralized call log for synchronized call protocol information | |
| US20070280136A1 (en) | SIP-based instant messaging in mobile ad hoc networks | |
| CN112118266B (en) | Distributed state synchronization method based on cooperation of HTTP and WebSocket | |
| JP2002094558A (en) | Packet transfer method, mobile terminal and router device | |
| EP2924942A2 (en) | Method, device and system for achieving multi-service server distribution of session initiation protocol | |
| CN113573326A (en) | Address acquisition method and device | |
| EP2220842B1 (en) | Ip-based interworking methods and apparatus for voice and data communications | |
| WO2016112674A1 (en) | Communication method, terminal, system and computer storage medium | |
| CN101606378A (en) | The method and system that is used for communication session initialization in the communication network | |
| CN112054953B (en) | Multimedia instant messaging method, system, terminal equipment and computer storage medium | |
| CN106970843B (en) | Remote calling method and device | |
| JP7065789B2 (en) | A system for communicating through multiple networks | |
| US10938865B2 (en) | Management of subscriber identity in service provision | |
| KR100976050B1 (en) | System and Method for Providing Anonymous Message Using Temporary Identification of Mobile Communication Terminal | |
| CN110381450A (en) | A kind of group's method for building up and device | |
| JP2023540063A (en) | Methods, systems and computer-readable media for routing packets for lawful interception | |
| US20160315977A1 (en) | Session initiation handling | |
| US9451420B2 (en) | Data processing method, in an ad hoc radio communication network, radio communication stations and corresponding computer programs | |
| CN111726887B (en) | Tunnel establishment method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |