CN110460453A - A kind of group chat implementation method based on P2P instant messaging - Google Patents
A kind of group chat implementation method based on P2P instant messaging Download PDFInfo
- Publication number
- CN110460453A CN110460453A CN201910769927.4A CN201910769927A CN110460453A CN 110460453 A CN110460453 A CN 110460453A CN 201910769927 A CN201910769927 A CN 201910769927A CN 110460453 A CN110460453 A CN 110460453A
- Authority
- CN
- China
- Prior art keywords
- node
- group
- list
- message
- oneself
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1813—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for computer conferences, e.g. chat rooms
- H04L12/1822—Conducting the conference, e.g. admission, detection, selection or grouping of participants, correlating users to one or more conference sessions, prioritising transmission
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- 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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1046—Joining mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/54—Presence management, e.g. monitoring or registration for receipt of user log-on information, or the connection status of the users
Abstract
The invention belongs to instant messaging fields, disclose a kind of group chat implementation method based on P2P instant messaging, this method is carried out on the basis of friend relation has been established between the user node in P2P social networks, group is managed using a kind of tree-network topology structure and completes the transmission of message, including group's creation, synchronizing information and group's message transmitting step；P2P peer-to-peer network is applied to the group chat technical field of instant messaging, has broken traditional C/S model, so that the status of each node in a network is reciprocity.Each node both serves as server, provides service for other nodes, while also enjoying the service of other nodes offer), avoid in communication process to excessive rely on of server and caused by server become communication performance bottleneck it is various constantly, fill up technological gap；The message broadcast mode in traditional group chat has been abandoned, and the destination node that message is transmitted is definitely, information transmission is more efficient.
Description
Technical field
The invention belongs to instant messaging fields, include a kind of instant communicating method based on P2P, specifically
A kind of group chat implementation method based on P2P instant messaging.
Background technique
Peer-to-peer network, i.e. peer-to-peer computer network are that one kind distributes task and workload between fellow (Peer)
Distributed Application framework, a kind of networking or latticed form that be P2P computing model form in application layer." Peer " is in English
In have the meaning of " fellow, partner, opposite end ".Therefore, from literal, P2P can be understood as P2P computing or peer-to-peer network.Its
It can be with is defined as: the participant of network shares a part of hardware resource (processing capacity, storage capacity, the network that they are possessed
Concatenation ability, printer etc.), these shared resources, can be by other peer nodes (Peer) by network offering services and content
Directly access is without being subjected to intermediate entities.Participant in this network is both the supplier of resource, service and content
It (Server), and is that resource, service and content obtain taker (Client).
In P2P network environment, all in the status of equity between the multiple stage computers that are connected to each other, each computer has
Identical function, no master-slave, a computer can not only be used for server, set shared resource for other computers in network
It is used, and can be used as work station, in general whole network does not depend on dedicated centralized servers, without dedicated work yet
It stands.Each computer in network can serve as the requestor of network service and sound is made in the request of other computers
It answers, resource, service and content is provided.These usual resources and service include: shared and the exchange, computing resource (such as CPU of information
Computing capability is shared), storage shared (such as the use of caching and disk space), network share, sharing printer.
And existing instant messaging field, P2P are not really applied and are implemented, such as QQ or wechat i.e.
Shi Tongxin, which is remained as, occupies client/server (Client/Server) structure of leading position (namely in current network
Frame mode used by WWW), the information communication that group chat is uses message broadcast type, and this communication mode directionality is unknown
Really, it can not achieve the information with Objective, directive property to send.And an essential distinction of P2P and client/server is,
Central node (or central server) is not present in whole network structure.Just because of P2P structure numerous advantages (each node
(peer) mostly has the function of three aspect such as information consumer, informant and information communication simultaneously.From calculating mode
For, P2P has broken traditional Client/Server (C/S) mode, and the status of each node in a network is equity
's.Each node both serves as server, provides service for other nodes, while also enjoying the service of other nodes offer), more
It urgently needs in instant messaging, especially group chat technical field is applied, to fill up technological gap.
Summary of the invention
The present invention to solve the above-mentioned problems, devises a kind of group chat implementation method based on P2P instant messaging, this method
A kind of tree-network topology structure is established to complete the communication of group chat, group's message based on P2P network, abandoned it is existing i.e.
Broadcast message published method in Shi Tongxin group chat, and make message transmission directivity definitely, information is transmitted more
Efficiently.
The technical solution adopted by the present invention is that: a kind of group chat implementation method based on P2P instant messaging, this method be
It has been established between user node in P2P social networks and carries out on the basis of friend relation, it is important to: the method is based on tree
Type network topology structure, including group creates, synchronizing information and group's message transmitting step, group's foundation step include:
Group operation, system automatically generated group ID and group's title are established in 1-1) user node A initiation, and user node A is institute
The root node of the group of foundation；
1-2) root node of group skips to step 1-3 as node is invited)；
It 1-3) invites node to send group invitation to request to the good friend of oneself, includes ID, the name of group in group invitation request message
Whether title and customized description information after good friend receives group invitation request message, agree to the letter into group to invitation node reverts back
Breath, if it is, skipping to step 1-4)；If not, skipping to step 1-8)；
1-4) judge invite node whether be root node, if it is, invite node by be invited to node be added to oneself
In group member list, child list and head's node listing, being invited to node will invite node to be added to the father node of oneself
In list, step 1-5 is skipped to)；If it is not, then invite node by reply agree into group be invited to node be added to the group of oneself at
In member's list, child list, being invited to node will invite node to be added into the father node list of oneself, skip to step 1-5)；
It 1-5) invites node bulletin to be invited to the notice that group chat is added in node, and sends group member list and head's node listing
To node is invited to, receive the group member list of the node updates oneself of notice information, child node whether send group invitation request to
The good friend of oneself, if it is, skipping to step 1-3)；If it is not, then skipping to step 1-6)；
1-6) child node is online, and the father node online to its sends online notice, and father node adds the online child node
Into the interim child list of oneself, and synchronic group information, to child node, which is added to by child node
In the temporary parent list of oneself, and send the online notice of group members；
1-7) group's message is transmitted；
1-8) terminate.
Further, step 1-6) in the lookup method of online father node include the following steps:
2-1) online child node is successively sent to its N (N is more than or equal to 1 integer) for the above father node from the near to the distant
PING detective surveys that its is no online, if detecting online father node, skips to step 2-2)；It, will if be not detected
First first node in head's node listing skips to step 2-2 as father node)；
Online notice 2-2) is sent to father node, father node carries out authentication to child node, whether verifies the child node
It is present in group member list, if it is present synchronic group information, to child node, which is updated to oneself by father node
In interim child list, which is updated in the temporary parent list of oneself by child node, skips to step 2-3)；Such as
Fruit is not present, then skips to step 2-3)；
2-3) terminate.
Further, step 2-2) described in father node the child node is updated in the interim child list of oneself,
After the father node is updated in the temporary parent list of oneself by child node, following steps are also carried out:
3-1) node in online child node and its temporary parent list carries out a heartbeat at interval of time T, such as
Heartbeat feedback information is not received in fruit time S, skips to step 3-2)；If receiving heartbeat feedback information in time S, skip to
Step 3-3), wherein T > S；
3-2) judge in temporary parent list whether to be sky, if it is not, then removing the father from temporary parent list
Nodal information, if it is sky, repeating said steps 2-1)；
3-3) terminate.
Further, the content of the synchronic group message includes title, the public affairs of the group sent out in group when child node is offline
Announcement, group member list, head's node listing, father node list and group's historical information.
Further, group's message transmission includes the following steps:
The message package for 5-1) transmitting node transmission contains message id, message content；Collection of letters node records after receiving group message
Simultaneously an expired checkout time T is arranged for the message in the message id, skips to step 5-2)；
5-2) collection of letters node searches the message id in the messaging list of oneself, if so, then deleting the message；Otherwise,
Forward that message to the interim child node and temporary parent of oneself in addition to transmitting node.
The beneficial effects of the present invention are: 1, P2P peer-to-peer network be applied to the group chat technical field of instant messaging, breaks
Traditional Client/Server (C/S) mode, so that the status of each node in a network is reciprocity.Each node
Both server is served as, provides service for other nodes, while the service of other nodes offer being also provided), avoid communication process
In to excessive rely on of server and caused by server become communication performance bottleneck it is various constantly, fill up technological gap.2, it abandons
Message broadcast mode in traditional group chat, and the destination node that message is transmitted is definitely, information transmission is more increased
Effect.3, the tree topology that the method for the present invention uses makes system performance more stable, safeguards simpler.
Detailed description of the invention
The tree-network topology structural schematic diagram for the group that Fig. 1 is established by the embodiment of the present invention.
Fig. 2 is that father node B is offline in Fig. 1, and M and N are directly and A establishes the schematic diagram of connection.
Fig. 3 is that root node A is offline in Fig. 1, and first first node B, C, D mutually establish the schematic diagram of connection.
Specific embodiment
The present invention is described in detail with reference to the accompanying drawings and examples.
The present invention realizes that group chat, precondition need to complete the single chat function of P2P in P2P network, i.e., appoints in P2P network
Two users that anticipate can be identified by the ID of oneself to be communicated, creative management of the method for the present invention by group, message transmission, letter
Synchronous 3 parts of breath illustrate.
The method of the present invention interior joint is added group chat and needs to invite to complete by the good friend in group chat.According to group
This hierarchical relationship of group chat is added in member, and this method is managed group using a kind of tree-network topology structure and completes group's message
Transmission.The method of the present invention is the member definition in group following role (referring to Fig. 1):
Root node: the founder of group, such as node A
First first node: root node invites the node being added, such as node B, C, D
Father node: the node M and N, node B that node B is invited are node M and the father node of N
Leaf node: without the node of any child node, such as node M, N, C, D.
Step 1 creates group (for creating group shown in FIG. 1): user node A creates one " XXX discussion group "
Step 1.1 user node A creates a new group, and generating unique group ID, (the random length that generates is the random of N
Number), entitled " the XXX discussion group " of group.
Root node of the step 1.2 user node A as " XXX discussion group ", while having the administration authority of group, including but
It is not limited to change group pet name, announce, kick out of member, prohibit speech, and dismiss and transfer the possession of group
Step 2 user node A invites the good friend's node B of oneself, and C, D are added
Step 2.1 user node A sends group invitation request to good friend's node B, C, D, includes group in group invitation request message
ID, title and customized description information.
Then agree to reply into group to node A transmission if step 2.2 user node B, C, D adhere to " XXX discussion group ",
And carry out step 2.3；Otherwise it sends and replys the refusal addition group chat, terminate.
Step 2.3 invites whether node, that is, user node A is root node, if it is, inviting node that will be invited to node i.e.
User node B, C, D are added in the group member list to oneself, child list and head's node listing, and being invited to node will invite
Please node (i.e. user node B by user node A, user node C by user node A, user node D by user node A) be added
Into the father node list of oneself, step 2.4) is skipped to；If it is not, then invite node (i.e. user node A) by reply agree into
Be invited to node (i.e. user node B, C, D) of group is added into the group member list of oneself, child list, and being invited to node will invite
Please node (i.e. user node B by user node A, user node C by user node A, user node D by user node A) be added
Into the father node list of oneself, step 2.4) is skipped to；
Step 2.4 invites node bulletin to be invited to the notice that group chat is added in node, and sends group member list and first first node
List receives the group member list of the node updates oneself of notice information, child node (i.e. user node B, C, D) to node is invited to
Whether send group invitation to request to the good friend of oneself, be asked if it is, child node sends group invitation to good friend as invitation node
It asks, such as the node M of good friend of node B, N adhere to this group, then node B is as inviting node to send group to node M, N and invite
It please request, node M, N agree to reply into group to node B transmission, skip to step 2.3；It is invited if not, for example node C, D is not sent
It please request to the good friend of oneself, then skip to step 2.5；
Step 2.5 child node is online, searches its online father node, online child node is from the near to the distant successively to its N (N
For the integer more than or equal to 1) for the above father node sending PING detective, to survey its no online, if detecting online father's section
Point then sends online notice to its online father node, which is added to the interim child node of oneself by father node
In list, and (content of synchronic group message includes title, the public affairs of the group sent out in group when child node is offline to synchronic group information
Announcement, group member list, head's node listing, father node list and group's historical information) give child node, child node is online by this
Father node is added in the temporary parent list of oneself, and send group members it is online notice (as shown in Fig. 2, father node A from
Line, user node M, N are directly and A establishes connection)；If be not detected, the online head in head's node listing is saved
Point is sent to it online notice, which is added to the interim son of oneself by first first node as online father node
In node listing, and synchronic group information, to child node, which is added to the interim father of oneself by child node
In node listing, and send the online notice of group members (as shown in figure 3, root node A is offline, first first node B, C, D mutually company of foundation
It connects)；
In addition, the node in online child node and its temporary parent list carries out a heartbeat at interval of time T, such as
Heartbeat feedback information is not received in fruit time S, then it is assumed that the temporary parent is offline, then removes the temporary parent；If
List is empty for temporary parent, then repeatedly step 2.5.
The transmission of step 3 group message
The repetition of step 3.1 message judges
Every group's message package contains message id (being generated by sending node, length is the random number of N), whenever node receives one
The message id can be all recorded when item group's message, and one expired checkout time T is set for the entry；If node is received
To a piece of news, its ID can be inquired in the messaging list of local terminal oneself, then illustrate that the information is attached most importance to again received message,
Delete the message；Otherwise the interim child node and temporary parent of oneself in addition to transmitting node are forwarded that message to.
The forward rule of message: after receiving message from some group members P, judging whether message repeats, and does not repeat then to forward
To all interim child nodes and temporary parent (removing P).
As shown in Figure 1, node D has issued a piece of news msg1 in " XXX discussion group ", node A is had received from node D
Group message m sg1, node A can forward messages to all good friend node B and C in " XXX discussion group " in addition to D, together
Shi Jiedian A will record the message id of msg1, receives group group's message of message identical message ID again later and then directly abandons not do and locates
Reason (the identical group's message expression of ID receives duplicate message), node B is forwarded messages in the same way after receiving msg1
Node M and N, group's message m sg1 that so far node D is sent have sent all members in " XXX discussion group " to.
The method of the present invention uses the communication pattern of tree topology, and system maintenance is fairly simple, transmission speed is fast, and
Target person in message transmitting procedure is very clear, and directive property is stronger, the transmission accuracy and essence of guarantee data that can be strong
Parasexuality.The method of the present invention has abandoned client-server mode, using P2P peer-to-peer network, significantly reduce to network according to
Rely, avoiding server becomes the bottleneck of information transmission.
Claims (5)
1. a kind of group chat implementation method based on P2P instant messaging, this method be between the user node in P2P social networks
It establishes on the basis of friend relation and carries out, it is characterised in that: the method created based on tree-network topology structure, including group
It builds, synchronizing information and group's message transmitting step, group's foundation step include:
1-1) group operation, system automatically generated group ID and group's title are established in user node A initiation, and user node A is to be established
Group root node；
1-2) root node of group skips to step 1-3 as node is invited)；
1-3) invite node to send group invitation to request to the good friend of oneself, include in group invitation request message the ID of group, title and
Customized description information, after good friend receives group invitation request message, to inviting whether node reverts back agrees to the information into group, such as
Fruit is then to skip to step 1-4)；If not, skipping to step 1-8)；
1-4) judge invite node whether be root node, if it is, invite node will be invited to node be added to the group of oneself at
In member's list, child list and head's node listing, being invited to node will invite node to be added to the father node list of oneself
In, skip to step 1-5)；If it is not, then inviting node that will reply agrees to that the node that is invited into group is added to the group members column of oneself
In table, child list, being invited to node will invite node to be added into the father node list of oneself, skip to step 1-5)；
1-5) invite node bulletin to be invited to the notice that group chat is added in node, and send group member list and head's node listing to by
Node is invited, the group member list of the node updates oneself of notice information is received, whether child node, which sends group invitation, is requested to oneself
Good friend, if it is, skipping to step 1-3)；If it is not, then skipping to step 1-6)；
1-6) child node is online, and the father node online to its sends online notice, which is added to certainly by father node
In oneself interim child list, and synchronic group information, to child node, which is added to oneself by child node
Temporary parent list in, and send the online notice of group members；
1-7) group's message is transmitted；
1-8) terminate.
2. a kind of group chat implementation method based on P2P instant messaging according to claim 1, it is characterised in that: step 1-
6) lookup method of online father node includes the following steps: in
2-1) online child node successively sends PING for the above father node to its N (N is more than or equal to 1 integer) from the near to the distant
Detective surveys that its is no online, if detecting online father node, skips to step 2-2)；If be not detected, by head
First first node in node listing skips to step 2-2 as father node)；
Online notice 2-2) is sent to father node, father node carries out authentication to child node, and verifying the child node whether there is
In group member list, if it is present synchronic group information, to child node, which is updated to the interim of oneself by father node
In child list, which is updated in the temporary parent list of oneself by child node, skips to step 2-3)；If no
In the presence of then skipping to step 2-3)；
2-3) terminate.
3. a kind of group chat implementation method based on P2P instant messaging according to claim 2, it is characterised in that: step 2-
2) child node is updated in the interim child list of oneself by the father node described in, which is updated to certainly by child node
After in oneself temporary parent list, following steps are also carried out:
3-1) node in online child node and its temporary parent list carries out a heartbeat at interval of time T, if when
Between do not receive heartbeat feedback information in S, skip to step 3-2)；If receiving heartbeat feedback information in time S, step is skipped to
3-3), wherein T > S；
3-2) judge in temporary parent list whether to be sky, if it is not, then removing the father node from temporary parent list
Information, if it is sky, repeating said steps 2-1)；
3-3) terminate.
4. a kind of group chat implementation method based on P2P instant messaging according to claim 1 or 2, it is characterised in that: described
The content of synchronic group message include the title of group sent out in group when child node is offline, bulletin, group member list, first first node
List, father node list and group's historical information.
5. a kind of group chat implementation method based on P2P instant messaging according to claim 1, it is characterised in that: described
Group's message transmission includes the following steps:
The message package for 5-1) transmitting node transmission contains message id, message content；Collection of letters node, which receives, to be recorded this after group message and disappears
It ceases ID and one expired checkout time T is set for the message, skip to step 5-2)；
5-2) collection of letters node searches the message id in the messaging list of oneself, if so, then deleting the message；Otherwise, by this
Message is transmitted to the interim child node and temporary parent of oneself in addition to transmitting node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910769927.4A CN110460453A (en) | 2019-08-20 | 2019-08-20 | A kind of group chat implementation method based on P2P instant messaging |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910769927.4A CN110460453A (en) | 2019-08-20 | 2019-08-20 | A kind of group chat implementation method based on P2P instant messaging |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110460453A true CN110460453A (en) | 2019-11-15 |
Family
ID=68487987
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910769927.4A Pending CN110460453A (en) | 2019-08-20 | 2019-08-20 | A kind of group chat implementation method based on P2P instant messaging |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110460453A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110971426A (en) * | 2019-12-05 | 2020-04-07 | 深圳前海达闼云端智能科技有限公司 | Method for constructing group session, client and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859147A (en) * | 2006-03-23 | 2006-11-08 | 华为技术有限公司 | Method for realizing social network |
| CN1984015A (en) * | 2006-05-10 | 2007-06-20 | 华为技术有限公司 | Construction and operation for wireless self-organizing network |
| US20140025987A1 (en) * | 2011-09-08 | 2014-01-23 | Mark Kern | Systems, Methods and Media for Distributing Peer-to-Peer Communications |
-
2019
- 2019-08-20 CN CN201910769927.4A patent/CN110460453A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859147A (en) * | 2006-03-23 | 2006-11-08 | 华为技术有限公司 | Method for realizing social network |
| CN1984015A (en) * | 2006-05-10 | 2007-06-20 | 华为技术有限公司 | Construction and operation for wireless self-organizing network |
| US20140025987A1 (en) * | 2011-09-08 | 2014-01-23 | Mark Kern | Systems, Methods and Media for Distributing Peer-to-Peer Communications |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110971426A (en) * | 2019-12-05 | 2020-04-07 | 深圳前海达闼云端智能科技有限公司 | Method for constructing group session, client and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| RU2280275C2 (en) | Method and device for a tree of distributed servers | |
| US20060209727A1 (en) | Peer-to-peer instant messaging and chat system | |
| KR20120089591A (en) | System and method for managing multiple queues of non-persistent messages in a networked environment | |
| JP2009543447A5 (en) | ||
| KR100474235B1 (en) | An event alerting method using a dynamic local grouping, and a method thereof | |
| CN101651708B (en) | Topological construction method of P2P streaming media network | |
| US20200320497A1 (en) | Messaging transaction application | |
| Tato et al. | Designing overlay networks for decentralized clouds | |
| CN110460453A (en) | A kind of group chat implementation method based on P2P instant messaging | |
| Greene et al. | Instant messaging & presence management in mobile adhoc networks | |
| Apolonia et al. | SELECT: A distributed publish/subscribe notification system for online social networks | |
| JP2003303145A (en) | Method and system for providing presence information backup service, information request program, and medium recorded with program | |
| Oliveira et al. | Improving peer neighborhood on P2P video distribution networks using Push/Pull protocol | |
| El Hamzaoui et al. | A new signaling topology for multiparty web real-time video conference networks | |
| JP5415352B2 (en) | Content delivery method, peer node and program adapted to user preference using overlay network | |
| Liquori et al. | Babelchord: a social tower of dht-based overlay networks | |
| Yu et al. | A distributed architecture of video conference using P2P technology | |
| Jiang et al. | Bandwidth-and latency-aware peer-to-peer instant friendcast for online social networks | |
| Subedi et al. | Synchronizing tasks for distributed learning in connected and autonomous vehicles | |
| CN101114947A (en) | Method for measuring performance of cooperative communication system | |
| Zhai et al. | An improved DDS publish/subscribe automatic discovery algorithm | |
| Anandaraj et al. | An efficient QOS based multimedia content distribution mechanism in P2P network | |
| Mezö et al. | Distributed mailing system:(DMS) | |
| KR100574385B1 (en) | An event alerting system using a peer-to-peer network, and methods thereof | |
| Banno et al. | Adaptive topology for scalability and immediacy in distributed publish/subscribe messaging |
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 | ||
| AD01 | Patent right deemed abandoned | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20220325 |