CN104660488A - Tree group instant message communication method based on semantic P2P network technology - Google Patents
Tree group instant message communication method based on semantic P2P network technology Download PDFInfo
- Publication number
- CN104660488A CN104660488A CN201410512239.7A CN201410512239A CN104660488A CN 104660488 A CN104660488 A CN 104660488A CN 201410512239 A CN201410512239 A CN 201410512239A CN 104660488 A CN104660488 A CN 104660488A
- Authority
- CN
- China
- Prior art keywords
- group
- message
- user
- node
- virtual
- 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
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
The invention relates to a tree group instant message communication method based on a semantic P2P network technology. The method comprises the following steps: classifying by institutions, organizations and the like, namely classifying into various vertical tree organizations by a classifying method according to the characteristics of the institutions and the organizations; building a semantic P2P network for vertical tree virtual organizations; carrying out instant message communication for users in a tree group. Compared with the prior art, the method has the benefits that all the institutions and organizations are classified according to certain classifying standards to form hierarchical trees, and one vertical virtual organization is formed on each path in the trees; the users participate in the corresponding virtual organizations according to interests, so that instant messages are sent to each user in the group. With the method, the instant messages can be simultaneously sent to the group with hundred million users without causing network blockage.
Description
Technical field
The present invention relates to the computer network data communications field, be specifically related to the tree-like group instant messaging communication method based on Technology of Semantic P 2 P Network.
Background technology
Traditional instant communication system user can with other user communications, also can in group with all user communications in group.Tengxun is domestic and international more successful enterprise, and its product QQ is the instant communicating system that user is maximum in the world.But it can not be the problem that message is sent out by multiple relevant group (in such as enterprise department of the superior and the subordinate) that current instant communicating system exists simultaneously.Traditional instant communicating system adopts client/server configuration.When sending message to millions user simultaneously, the problem that networking is blocked can be run into.This method employing Technology of Semantic P 2 P Network (a kind of method of searching related node subclass based on P2P, the patent No.:
200910096247;set up the method based on the large-scale distributed file system of P2P, the patent No.:
200910097651;structure has a method for semantic P2P network, the patent No.:
200910100682;build a method for the P2P network of vertical virtual group, the patent No.:
200910100926)build instant communicating system and can solve above problem.
Summary of the invention
Based on a tree-like group instant messaging communication method for Technology of Semantic P 2 P Network, it is characterized in that: 1) foundation must have and only have the tree sort website of a root virtual group; 2) user adds according to interest or is withdrawn into relevant virtual group; 3) node transfers immediate news to user in group (wherein higher level group comprises the user node of group of all subordinates).
Foundation according to claim 1 must have and only have the tree sort website of a root virtual group, and wherein sorting technique is divided into various tree-like tissue vertically according to the feature of mechanism, tissue by sorting technique, and classification can be modified by authority.
User according to claim 2 adds according to interest or is withdrawn into relevant virtual group, wherein user adds relevant virtual group (can add multiple virtual group), the node of its virtual group for this reason of system log (SYSLOG), user exits relevant virtual group, and system-kill remembers the record of its node of virtual group for this reason.
Node according to claim 3 transfers immediate news to user in group (wherein higher level group comprises the user node of group of all subordinates), wherein message format: send " message " group ID; Group ID presses DNS domain name rule encoding; Send a message to leaf node group (not having the group of subgroup), message is sent to all users of this leaf node group; Send a message to group of nodes (group containing subgroup), message is sent to all users of all subordinate groups.
Node according to claim 3 transfers immediate news to user in group (wherein higher level group comprises the user node of group of all subordinates), wherein 3a) virtual group that adds according to oneself of user builds virtual group tree, and this virtual group contains the virtual group that all users add; 3b) user sends message to the user node of oneself group; If 3c) also have the group needing to send, then search its routing table by intermediate node, forward instant message to the adjacent node closer to destination virtual group domain name as next-hop node, repetition step 3c) arrive final leaf virtual group, be then sent to all leaf virtual group members; 3d) targeted customer accepts instant message.
Build the step of vertical tree-like virtual group semantics P2P network:
The entities such as mechanism, tissue, industry classify according to specific classification method (can be formulated by expert, also can be chosen in a vote by user), form tree sort catalogue; The method for expressing of classified catalogue is similar with DNS.Such as, company .IT. Hangzhou Yu Zhu Science and Technology Ltd. is Hangzhou Yu Zhu Science and Technology Ltd., belongs to IT class company.Set up a web site and issue these classified catalogues.Catalogue has unique total root, does not have the catalogue of subdirectory to be called leaf catalogue.The ability that the user that certain rank is given in website increases, revises and deltree.
User adds according to interest or is withdrawn into the step of relevant virtual group:
User adds relevant virtual group (can add multiple virtual group), the node of its virtual group for this reason of system log (SYSLOG); User exits relevant virtual group, and system-kill remembers the record of its node of virtual group for this reason; Also user's authority that can add virtual group can be given.User adds respective fictional group, then all members of this virtual group are by this user awareness.Also mutually message can be sent.Network can reach.
The step that node transfers immediate news to user in group:
The virtual group that user adds according to oneself builds virtual group tree, and this virtual group contains the virtual group that all users add.As user adds amusement. music. pop music. Liu Huan, amusement. music. pop music. A Daier group and company .IT. Hangzhou Yu Zhu Science and Technology Ltd., then user will to build virtual tree as follows:
Amusement
Music
Pop music
Liu Huan
. A Daier
Company
IT
Hangzhou Yu Zhu Science and Technology Ltd.
Meanwhile, know that Liu Huan, A Daier and all of Hangzhou Yu Zhu Science and Technology Ltd. add member.According to " a kind of method of searching related node subclass based on P2P, the patent No.:
200910096247 "method whole system the virtual group of constructing system is set, if Liu Huan group group member A is amusement simultaneously. music. pop music. Liu Huan virtual group, amusement. music. pop music virtual group and amusement. member of music virtual group etc.
Message format can for sending (send) ' message ' virtual group ID.Virtual group ID is the title (as company .IT. Hangzhou Yu Zhu Science and Technology Ltd.) indicating the similar DNS of virtual group.If the virtual group ID sent is leaf virtual group, then sends a message to all members of this virtual group, then terminate.If the virtual group ID sent is not leaf virtual group, comprise other sub-virtual group, then search its routing table by intermediate node, forward instant message to the adjacent node closer to destination virtual group domain name as next-hop node, repeat this step and arrive end user's leaf virtual group, be then sent to all leaf virtual group members.
Suppose there are three virtual group: college course. operating system. class all over Britain, college course. operating system. bilingual class and college course. C language. ordinary-student class; College course. operating system. class member all over Britain is A1, A2, A3, A4, A5; College course. operating system. bilingual class member is B1, B2, B3, B4, B5; College course. C language. ordinary-student class member is C1, C2, C3, C4, C5, C6.Wherein A2, A3, B1, B4 are college courses. the member of operating system virtual group, and A3, B1 are also the virtual members of college course.C5, C6 are then college courses. the virtual member of C language, C6 is then the virtual member of college course.When A1 sends a message to operating system, then because A1 is in college course. operating system. class all over Britain, A1 sends a message to all college courses. operating system. the member of class all over Britain, namely A1, A2, A3, A4, A5.Due to also will college course be sent. operating system. bilingual class, because A2, A3 are college courses. the member of operating system virtual group, A2 or A3 sends message to being both college course. B1, B4 of operating system; B1 or B4 sends a message to college course. operating system. and all member B1, B2, B3, B4, B5 of bilingual class.Suppose that A1 will send a message to college course, then because A1 is in college course. operating system. class all over Britain, A1 sends a message to all college courses. operating system. the member of class all over Britain, namely A1, A2, A3, A4, A5.Due to also will college course be sent. operating system. bilingual class, because A2, A3 are college courses. the member of operating system virtual group, A2 or A3 sends message to being both college course. B1, B4 of operating system; B1 or B4 sends a message to college course. operating system. and all member B1, B2, B3, B4, B5 of bilingual class.B1 or A3 sends a message to all members of college course, namely sends a message to C6, and C6 sends a message to all college courses. C language. and the member of ordinary-student class, namely C1, C2, C3, C4, C5, C6.
This case embodiment 1:
Suppose the operating system class of our simultaneously Jiao Liangge class (civilian class all over Britain, bilingual class).We first set domain classification: college course. operating system. and class all over Britain and college course. operating system. bilingual class.College course is set up in website. operating system. class all over Britain and college course. operating system. bilingual class catalogue.As follows:
Total root
College course
Operating system
. class all over Britain
Bilingual class
. the classmate of class all over Britain and teacher add class all over Britain virtual group by website; . the classmate of bilingual class and teacher add bilingual class virtual group by website.This case member can send message to class all over Britain and bilingual class simultaneously, also can send message respectively.Such as, be a teacher and send teaching material for " operating system concept " message, because two classes use identical teaching material, this message should be received by class all over Britain and all students of bilingual class.Teacher sends parent virtual group---the college course of this message to Liang Ge class. and operating system virtual group, this message will be forwarded to the student of all classes all over Britain and bilingual class.If the student of class all over Britain sends message to his class classmate all over Britain, so he sends a message to college course. operating system. and class all over Britain, class all over Britain is also only that class all over Britain can receive this message.
This case embodiment 2:
Suppose American I TDK company of certain transnational enterprise, there is a lot of company, factory and a lot of mechanism.As: American I TDK corporate HQ (wherein having administrative execution department, Human Resource Department, public relations department), Chinese ITDK research institute (wherein having administrative department, research and development of software portion, hardware research and development department, test department), Chinese ITDK factory (wherein having factory director office, workshop 1, workshop 2, workshop 3).It is as follows that we first set domain classification:
Total root
Company
IT
American I TDK company
American I TDK corporate HQ
Administrative execution department
Human Resource Department
Public relations department
ITDK research institute of China
Administrative department
Research and development of software portion
Hardware research and development department
Test department
ITDK factory of China
Factory director office
Workshop 1
Workshop 2
Workshop 3
Website is set up classified catalogue as .IT. American I TDK company of company. American I TDK corporate HQ. administrative execution department etc.Corresponding employee joins corresponding group.As president sends out message to all employees, president sends out message to .IT. American I TDK company of company, then all employees will receive message.Concrete technical process is, " sends .IT. American I TDK company of ' message ' company " send message by message format; Because president A adds .IT. American I TD company of company. American I TDK corporate HQ. administrative execution department, this message will be sent to .IT. American I TD company of all companies. American I TDK corporate HQ. the employee of administrative execution department; Simultaneously because a certain employee B1 is wherein .IT. American I TD company of company. the virtual member of American I TDK corporate HQ, employee B1 by this message of forwarding to there being .IT. American I TD company of company. American I TDK corporate HQ. Human Resource Department a certain employee B2 and .IT. American I TD company of company. American I TDK corporate HQ. a certain employee B3 of public relations department; Then employee B2 forwards this message to .IT. American I TD company of company. American I TDK corporate HQ. and all employees of Human Resource Department; Employee B3 forwards this message to .IT. American I TD company of company. American I TDK corporate HQ. and all employees of public relations department; In these employees, have a certain employee C to be the virtual member of .IT. American I TDK company of company, employee C will forward this message to .IT. American I TDK company of company. Chinese ITDK graduate virtual member D1 and .IT. American I TDK company of company. and the virtual member D2 of Chinese ITDK factory.D1 will forward this message to .IT. American I TDK company of company. Chinese ITDK research institute. and the virtual member E1 of administrative department, .IT. American I TDK company of company. Chinese ITDK research institute. the virtual member E2 in research and development of software portion .IT. American I TDK company of company. Chinese ITDK research institute. the virtual member E3 of hardware research and development department and .IT. American I TDK company of company. Chinese ITDK research institute. the virtual member E4 of test department; E1 will forward this message to .IT. American I TDK company of company. Chinese ITDK research institute. and all members of administrative department; E2 will forward this message to .IT. American I TDK company of company. Chinese ITDK research institute. and all members in research and development of software portion; E3 will forward this message to .IT. American I TDK company of company. Chinese ITDK research institute. and all members of hardware research and development department; E4 will forward this message to .IT. American I TDK company of company. Chinese ITDK research institute. and all members of test department; In like manner, D2 will forward this message to .IT. American I TDK company of company. Chinese ITDK factory. and the virtual member F1 of factory director office, .IT. American I TDK company of company. Chinese ITDK factory. the virtual member F2 in workshop 1 .IT. American I TDK company of company. Chinese ITDK factory. the virtual member F3 in workshop 2 and .IT. American I TDK company of company. Chinese ITDK factory. the virtual member F4 in workshop 3; F1 will forward this message to .IT. American I TDK company of company. Chinese ITDK factory. and all members of factory director office; F2 will forward this message to .IT. American I TDK company of company. Chinese ITDK factory. and all members in workshop 1; F3 will forward this message to .IT. American I TDK company of company. Chinese ITDK factory. and all members in workshop 2; F4 will forward this message to .IT. American I TDK company of company. Chinese ITDK factory. and all members in workshop 3.
This case embodiment 3:
Suppose that certain music alliance promotes and sells music.First, similar amusement is set up. music. pop music. Liu Huan, amusement. music. pop music. A Daier, amusement. music. classical music. the classified catalogue of Beethovan etc.Whole world netizen joins in interested group, and the bean vermicelli as Liu Huan adds amusement. music. and pop music. Liu Huan group; If global netizen 1,000,000,000 adds corresponding group, so message " send ' message ' amusement. music. " 1,000,000,000 netizens will be sent to.Detailed process and embodiment 2 similar.
Owing to have employed the forwarding of intermediate virtual member, overload and the network congestion of server can not be caused.There is the instant message transmitting capacity of hundred million grades of users.
Claims (5)
1. based on a tree-like group instant messaging communication method for Technology of Semantic P 2 P Network, it is characterized in that: 1) foundation must have and only have the tree sort website of a root virtual group; 2) user adds according to interest or is withdrawn into relevant virtual group; 3) node transfers immediate news to user in group (wherein higher level group comprises the user node of group of all subordinates).
2. foundation according to claim 1 must have and only have the tree sort website of a root virtual group, and wherein sorting technique is divided into various tree-like tissue vertically according to the feature of mechanism, tissue by sorting technique, and classification can be modified by authority.
3. user according to claim 2 adds according to interest or is withdrawn into relevant virtual group, wherein user adds relevant virtual group (can add multiple virtual group), the node of its virtual group for this reason of system log (SYSLOG), user exits relevant virtual group, and system-kill remembers the record of its node of virtual group for this reason.
4. node according to claim 3 transfers immediate news to user in group (wherein higher level group comprises the user node of group of all subordinates), wherein message format: send " message " group ID; Group ID presses DNS domain name rule encoding; Send a message to leaf node group (not having the group of subgroup), message is sent to all users of this leaf node group; Send a message to group of nodes (group containing subgroup), message is sent to all users of all subordinate groups.
5. node according to claim 3 transfers immediate news to user in group (wherein higher level group comprises the user node of group of all subordinates), wherein 3a) virtual group that adds according to oneself of user builds virtual group tree, and this virtual group contains the virtual group that all users add; 3b) user sends message to the user node of oneself group; If 3c) also have the group needing to send, then search its routing table by intermediate node, forward instant message to the adjacent node closer to destination virtual group domain name as next-hop node, repeat step 3c) arrive final leaf virtual group, be then sent to all leaf virtual group members; 3d) targeted customer accepts instant message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410512239.7A CN104660488A (en) | 2014-09-29 | 2014-09-29 | Tree group instant message communication method based on semantic P2P network technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410512239.7A CN104660488A (en) | 2014-09-29 | 2014-09-29 | Tree group instant message communication method based on semantic P2P network technology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104660488A true CN104660488A (en) | 2015-05-27 |
Family
ID=53251213
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410512239.7A Pending CN104660488A (en) | 2014-09-29 | 2014-09-29 | Tree group instant message communication method based on semantic P2P network technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104660488A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187297A (en) * | 2015-08-17 | 2015-12-23 | 湖南简成信息技术有限公司 | Multi-stage group control method based on instant messaging |
| CN105574100A (en) * | 2015-12-14 | 2016-05-11 | 杭州域竹科技有限公司 | Method for automatically constructing distributed classified search engine |
| CN105634916A (en) * | 2015-12-11 | 2016-06-01 | 中青冠岳科技(北京)有限公司 | Management method based on tree chatting group organization |
| CN111181833A (en) * | 2019-09-26 | 2020-05-19 | 腾讯科技（深圳）有限公司 | Enterprise interconnection realization method and device |
-
2014
- 2014-09-29 CN CN201410512239.7A patent/CN104660488A/en active Pending
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187297A (en) * | 2015-08-17 | 2015-12-23 | 湖南简成信息技术有限公司 | Multi-stage group control method based on instant messaging |
| CN105187297B (en) * | 2015-08-17 | 2019-04-16 | 李卫军 | Multi-level groups control method based on instant messaging |
| CN105634916A (en) * | 2015-12-11 | 2016-06-01 | 中青冠岳科技(北京)有限公司 | Management method based on tree chatting group organization |
| CN105574100A (en) * | 2015-12-14 | 2016-05-11 | 杭州域竹科技有限公司 | Method for automatically constructing distributed classified search engine |
| CN111181833A (en) * | 2019-09-26 | 2020-05-19 | 腾讯科技（深圳）有限公司 | Enterprise interconnection realization method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| HerdaĞdelen et al. | An exploration of social identity: The geography and politics of news‐sharing communities in twitter | |
| CN104660488A (en) | Tree group instant message communication method based on semantic P2P network technology | |
| CN102385607B (en) | Internet sharing application programming interface (API) port aggregation and monitoring technology | |
| CN106779481A (en) | A kind of enterprise commerce management information integrated service system based on internet | |
| Wu et al. | Predict whom one will follow: followee recommendation in microblogs | |
| Niu et al. | An empirical study of a Chinese online social network--renren | |
| Wang et al. | Analyzing Communication Interaction Networks (CINs) in enterprises and inferring hierarchies | |
| Talia et al. | Peer-to-peer models for resource discovery in large-scale grids: a scalable architecture | |
| Steele et al. | Putting the public into public health information dissemination: social media and health-related web pages | |
| Xiong et al. | Social network service and social development in China | |
| CN103312822B (en) | A kind of based on the SNS protocol optimization method pushed | |
| Chao | Reconceptualizing the mechanism of Internet human flesh search: A review of the literature | |
| Saleem et al. | Tackling the challenges of situational awareness extraction in Twitter with an adaptive approach | |
| Guo | Research on information spreading model of social network | |
| Li et al. | Social network analysis of information diffusion on Sina Weibo micro-blog system | |
| Chin | Finding cohesive subgroups and relevant members in the nokia friend view mobile social network | |
| De Koning | Hello world! Challenges for blogging as anthropological outreach | |
| He et al. | Tree-based mining for discovering patterns of reposting behavior in microblog | |
| Xu et al. | Exploiting the spam correlations in scalable online social spam detection | |
| He et al. | Internet public opinion monitoring model based on cloud computing | |
| Dong et al. | Analysis and research on microblogging network model based on crawler data | |
| Trifa et al. | Effects of churn on structured P2P overlay networks | |
| Huang | Semantic P2P networks: future architecture of cloud computing | |
| Zhang et al. | Efficient range query processing over DHTs based on the balanced Kautz tree | |
| Huang | Instant messaging based on semantic P2P network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20150527 |
|
| WD01 | Invention patent application deemed withdrawn after publication |