CN102111424A - Method and system for pushing information through SNS network node relation chain - Google Patents
Method and system for pushing information through SNS network node relation chain Download PDFInfo
- Publication number
- CN102111424A CN102111424A CN2009102390612A CN200910239061A CN102111424A CN 102111424 A CN102111424 A CN 102111424A CN 2009102390612 A CN2009102390612 A CN 2009102390612A CN 200910239061 A CN200910239061 A CN 200910239061A CN 102111424 A CN102111424 A CN 102111424A
- Authority
- CN
- China
- Prior art keywords
- bunch
- good friend
- information
- network node
- alternative
- 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.)
- Granted
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/21—Monitoring or handling of messages
- H04L51/214—Monitoring or handling of messages using selective forwarding
-
- 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/52—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail for supporting social networking services
-
- 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/55—Push-based network services
-
- 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/1859—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast adapted to provide push services, e.g. data channels
Abstract
The invention discloses a method and a system for pushing information through a social networking services (SNS) network node relation chain. The method comprises the following steps of: establishing a cluster relation in an SNS network node, and setting a cluster head node; sending the information to the cluster head node; and forwarding the information to other SNS network nodes according to the established cluster relation by using the cluster head node. The system divides the network nodes into relatively independent cluster structures through a buddy relation chain and pushes the information by using the cluster structures so as to solve the problem of limited communication bandwidth by fully using the conventional communication channel; meanwhile, by pushing the information through the buddy relation chain, certain information can be converted into identities of buddies to perform recommendation; and the information transmission mode is more friendly, the information transmission is quicker, and user experience of the network nodes is promoted.
Description
Technical field
The present invention relates to electric data processing field, specially refer to and a kind ofly close tethers by the SNS network node and carry out information push method and system.
Background technology
Network has become the important component part of people's life, along with SNS (Social NetworkingServices, social network services) continuous development, the activity of the network user on internet (Internet) has been converted to the activity of socialization from personal behavior before.A networked society is closed the part that tethers has become the numerous network users' social relationships.In addition, because number of users is explosive growth, MSN is from original simple information media of communication, and progressively developing becomes the main carrier that everybody closes the tethers precipitation.As the provider of instant messaging network service, how to seem very important to the important system information of mass users issue.
In the prior art, the issue of system information is the mode that adopts server directly to push; The instant messaging network is served the provider by several specific servers, utilizes the particular network passage, carries out the propelling movement of message to all instant communication software client terminals.
Above-mentioned propelling movement mode is the plain mode of one-to-many, and push server need send to information each user client, can't use existing communication port; In addition, because the transmission channel limited bandwidth can't be pushed to information all users at short notice.
Summary of the invention
One of purpose of the present invention is carried out information push method and system for providing a kind of by SNS network node pass tethers, has promoted the information pushing efficiency.
The present invention proposes a kind ofly to close tethers by the SNS network node and carry out the information push method, comprises step:
In the SNS network node, set up bunch relation, and set leader cluster node;
Information is sent to leader cluster node;
Utilize leader cluster node described information to be forwarded to other SNS network nodes according to bunch relation of setting up.
Preferably, the described step of setting up bunch relation in the SNS network node further comprises step:
Choose alternative bunch of head according to good friend's degree of network node;
Judge alternative bunch of head the good friend good friend's degree whether more than or equal to the cohesion of the good friend of first threshold and alternative bunch of head and alternative bunch of head whether more than or equal to second threshold value; In this way, then choosing described good friend is bunch member; Otherwise, finish.
Preferably, describedly choose described good friend for also comprising step after bunch member's the step:
Judge described bunch of member the good friend good friend's degree whether more than or equal to first threshold and bunch member's good friend and bunch member's cohesion whether more than or equal to second threshold value; In this way, then choosing described good friend is bunch member; Otherwise, finish.
Preferably, the step of described setting leader cluster node further comprises step:
In bunch member who chooses, bunch member of good friend's degree maximum is set at leader cluster node.
Preferably, describedly close tethers by the SNS network node and carry out the information push method, also comprise good friend's degree that described bunch of member is set and first threshold and bunch member's good friend and bunch member's the cohesion and the judgement number of times of second threshold value.
Preferably, the described leader cluster node that utilizes further comprises step according to bunch relation of setting up with the step that described information is forwarded to other SNS network nodes:
Utilize leader cluster node reception information and be transmitted to the good friend;
Utilize bunch member among the good friend of leader cluster node to receive information and be transmitted to the good friend;
Bunch member among utilization bunch member's the good friend receives information and is transmitted to the good friend.
Preferably, described method also comprises:
When a bunch member receives information, judge whether to receive and transmitted described information; In this way, then refusal receives described information once more; Otherwise, receive described information.
The present invention also proposes a kind of system that carries out the information propelling movement by SNS network node pass tethers, comprising:
Relation is set up module, sets up bunch relation in the SNS network node, and sets leader cluster node;
Message transmission module is sent to leader cluster node with information;
Message transmitting module utilizes leader cluster node according to bunch relation of setting up described information to be forwarded to other SNS network nodes.
Preferably, described relation is set up module and is further comprised:
Alternative bunch of head unit chosen alternative bunch of head according to good friend's degree of network node;
Bunch member's judging unit, judge alternative bunch of head the good friend good friend's degree whether more than or equal to the cohesion of the good friend of first threshold and alternative bunch of head and alternative bunch of head whether more than or equal to second threshold value, whether be a bunch member to judge described good friend.
Preferably, described bunch of member's judging unit also be used to judge described bunch of member the good friend good friend's degree whether more than or equal to first threshold and bunch member's good friend and bunch member's cohesion whether more than or equal to second threshold value, whether be a bunch member to judge described good friend.
Preferably, described relation is set up module and is further comprised:
A bunch setup unit in bunch member who chooses, is set at leader cluster node with bunch member of good friend's degree maximum.
Preferably, described bunch of member's judging unit is provided with bunch member's good friend's degree and first threshold and bunch member's good friend and bunch member's the cohesion and the judgement number of times of second threshold value.
Preferably, described message transmitting module further comprises:
A bunch retransmission unit utilizes leader cluster node to receive information and is transmitted to the good friend;
First bunch of member's retransmission unit utilizes bunch member among the good friend of leader cluster node to receive information and be transmitted to the good friend;
Second bunch of member's retransmission unit, bunch member among utilization bunch member's the good friend receives information and is transmitted to the good friend.
Preferably, described system also comprises:
The information filtering module when a bunch member receives information, judges whether to receive and transmitted described information, receives described information once more with refusal.
The present invention is closed tethers by the good friend network node is divided into relatively independent clustering architecture, and utilizes clustering architecture to carry out the propelling movement of information, solves the limited problem of communication bandwidth thereby can make full use of existing communication port; Simultaneously, close the tethers pushed information by the good friend, can be with some information translation for to recommend with good friend's identity; More friendly and the information transmission of the mode that the information that makes is transmitted is quicker etc., promotes the user experience of network node.
Description of drawings
Fig. 1 closes the steps flow chart schematic diagram that tethers carries out the information push method by the SNS network node in one embodiment of the invention;
Fig. 2 is the schematic flow sheet of step S10 in one embodiment of the invention;
Fig. 3 is the schematic flow sheet of step S12 in one embodiment of the invention;
Fig. 4 is the structural representation of server push message in one embodiment of the invention;
Fig. 5 closes the structural representation that tethers carries out the system of information propelling movement by the SNS network node in another embodiment of the present invention;
Fig. 6 is the structural representation that relation is set up module in another embodiment of the present invention;
Fig. 7 is the structural representation of message transmitting module in another embodiment of the present invention;
Fig. 8 is the structural representation that closes the system that the tethers information of carrying out pushes in another execution mode of another embodiment of the present invention by the SNS network node.
The realization of the object of the invention, functional characteristics and advantage will be in conjunction with the embodiments, are described further with reference to accompanying drawing.
Embodiment
The present invention passes through SNS (Social Networking Services, social network services) the network node good friend is closed tethers and is carried out deep analysis in, use the good friend to close tethers network node is divided into relatively independent clustering architecture, and utilize clustering architecture to carry out the propelling movement of information, thereby can make full use of existing communication port and solve the limited problem of communication bandwidth, make the information transmission quicker etc.And, close the tethers pushed information by the good friend, can be with some information translation for to recommend with good friend's identity, make the easier acceptance of network node, promote the user experience of network node.Described SNS network node can be the user among the SNS etc.
With reference to Fig. 1, the present invention proposes a kind of of an embodiment and carries out the information push method by SNS network node pass tethers, comprising:
Step S10, in the SNS network node, set up bunch relation, and set leader cluster node;
Step S11, information is sent to leader cluster node;
Step S12, utilize leader cluster node described information to be forwarded to other SNS network nodes according to bunch relation of setting up.
As described in step S10, wherein, the SNS network node can be MSN user, internet forum user and other have user of Web Community of the user of colony etc.By setting up bunch relation, the network node among some SNS (overall network node or specific subnetwork node etc.) can be divided into a plurality of relatively independent bunch formula colonies, make things convenient for the propelling movement of information.
Above-mentioned steps mainly is to close tethers according to the good friend of mass network node, is relatively independent bunch formula group structure with the mass network node division, and picks out the leader cluster node of each bunch, helps information is sent to the mass network node.
As described in step S11, the provider of SNS service, by server to bunch in leader cluster node send information.The system information that described information can the side of providing need send to the SNS network node etc.
As described in step S12, leader cluster node after receiving described information, other bunches member in information can being continued to be forwarded to bunch and good friend of bunch member etc.
With reference to Fig. 2, in an execution mode of present embodiment, described step S10 further comprises:
Step S100, choose alternative bunch of head according to good friend's degree of network node;
Step S101, judge alternative bunch of head the good friend good friend's degree whether more than or equal to the cohesion of the good friend of first threshold and alternative bunch of head and alternative bunch of head whether more than or equal to second threshold value; In this way, then choosing described good friend is bunch member (step S102); Otherwise, finish.
As described in step S100, good friend's quantity that described good friend's degree can be a network node.Can mass network node among the SNS be sorted according to good friend's quantity of each network node, the network node of picking out some good friends degree big (being that good friend's quantity is many) is as alternative bunch of head.Because bunch situation that relation repeats may occur, described some can be about 2 to 3 times that server once can issue maximum network node quantity.Choosing of alternative bunch of head can be carried out according to good friend's degree, such as can choose good friend's degree be the network node of 200 (i.e. 200 good friends) be alternative bunch first-class.
As described in step S101, whether matching network node A and network node B are same cluster, need judge at first whether two network nodes are that the good friend concerns; In this way, then continue to judge that whether both cohesions and good friend's degree separately are more than or equal to second threshold value; In this way, then decidable two network nodes are bunch member with cluster.
, under the situation of having chosen alternative bunch of head in advance, when choosing bunch member again, can at first select one alternative bunch of head herein, it is alternative that the good friend of this alternative bunch of head is bunch member; Then, can judge the alternative good friend's degree of described bunch of member whether more than or equal to the cohesion of first threshold and the alternative and alternative bunch head of bunch member whether more than or equal to second threshold value; In this way, the good friend that then can choose described alternative bunch of head is bunch member (step S102).Described cohesion is the quantity of common good friend between network node and the network node, such as common good friend's quantity of the good friend of alternative bunch of head and alternative bunch of head etc.; The good friend number of degrees value of described first threshold for setting; The cohesion numerical value of described second threshold value for setting.The setting of the described first threshold and second threshold value can be according to the clustering architecture quantity of final division, and the average size of each bunch is carried out.Alternative bunch of head in each bunch belongs to one of bunch member.
Also comprise behind the described step S102:
Step S103, judge bunch member good friendship good friend's degree whether more than or equal to first threshold and bunch member's good friend and bunch member's cohesion whether more than or equal to second threshold value; In this way, then choosing described good friend is bunch member (step S104); Otherwise, finish.
As described in step S103, it is alternative that bunch member's good friend also can be bunch member.After the part among the good friend who has chosen a certain alternative bunch of head (promptly bunch member is alternative) is bunch member, can in bunch member's who chooses good friend (promptly bunch member is alternative), select a bunch member again.Good friend's degree that can be by judging bunch member alternative (i.e. bunch member's good friend) whether more than or equal to first threshold and bunch member is alternative and bunch member's cohesion whether more than or equal to second threshold value, from bunch member is alternative, select a bunch member.Described bunch of alternative can the continuity by good friend's chain of bunch member of member, then bunch member equally also can continue.Described bunch of member's quantity can control by the first threshold and second threshold value.When the numerical value of the first threshold and second threshold setting was big, bunch member's quantity was less relatively, and relevance is stronger relatively between bunch member; At first threshold and the second threshold setting numerical value hour, bunch member's quantity is more relatively, between bunch member relevance relatively a little less than.Described bunch of member's good friend's degree and first threshold and bunch member's good friend can be provided with the judgement number of times of bunch member's the cohesion and second threshold value, judge that such as being provided with number of times is 2 times, then through stopping choosing of bunch member after twice judgement, to limit bunch member's quantity.
Described step S10 also comprises:
Step S105, in bunch member who chooses, bunch member of good friend's degree maximum is set at leader cluster node.
As described in step S105, after choosing bunch member, can select leader cluster node according to good friend's degree with in the cluster bunch of member, bunch member that can select good friend's degree maximum usually is leader cluster node.Common and alternative bunch of first the causing of described leader cluster node.
With reference to Fig. 3, in another execution mode of present embodiment, described step S12 further comprises:
Step S120, utilize leader cluster node to receive information and be transmitted to the good friend;
Step S121, utilize bunch member among the good friend of leader cluster node to receive information and be transmitted to the good friend;
Bunch member among step S122, utilization bunch member's the good friend receives information and is transmitted to the good friend.
Server among the SNS at first sends to leader cluster node with information.Leader cluster node can be transmitted to bunch member alternative (being the good friend of leader cluster node) after receiving described information.After bunch alternative reception information of member, bunch member wherein can be transmitted to described information bunch member alternative (i.e. bunch member's good friend).Then, utilize bunch member's forwarding information among bunch member's the good friend again.So, information can be sent to in the cluster bunch of member and bunch member alternative.Described server only needs information is sent to leader cluster node, all the other are transmitted by a bunch member, made full use of existing communication port (passage between network node and the network node) thereby the limited problem of solution communication bandwidth (server bandwidth), conserve network resources.
Described bunch of member can be sent to information and be not more than self good friend (bunch member is alternative) of " good friend's degree ".Therefore, the alternative good friend's degree of described bunch of member of reception information is less than or equal to good friend's degree of described bunch of member.
For avoiding information between bunch member, to repeat to transmit, can when receiving information, judge whether to have received and transmitted described information earlier a bunch member (comprising leader cluster node and bunch member); In this way, then refusal receives described information once more; Otherwise, receive described information.Because each information can calculate unique hash value by hash algorithm, then can judge by hash value whether information is identical.
Below be example with SNS with the instant messaging network, technical scheme in the present embodiment is elaborated.
At first, the mass network node in the instant messaging network is sorted according to good friend's degree, pick out the big network node of good friend's degree of some as alternative bunch of head.With the good friend of described alternative bunch of head is that bunch member of ground floor is alternative, picks out bunch member of ground floor from bunch member of ground floor is alternative according to first threshold and second threshold value.Bunch member's of described ground floor good friend is that bunch member of the second layer is alternative, from bunch member of the second layer is alternative, pick out bunch member of the second layer once more according to first threshold and second threshold value, then bunch member's of the second layer good friend is that the 3rd layer bunch member is alternative, and the rest may be inferred, selects until a bunch member and finish.So long as that bunch member's good friend is bunch member is alternative, and bunch member can pick out from bunch member is alternative by the first threshold and second threshold value, can pass through the first threshold and the second threshold value may command bunch number of members, thus the time that control information issues.After bunch member is selected, can pick out leader cluster node according to good friend's degree.Thereby, the mass network node can be divided into some bunches.Also can set, such as setting bunch member who only chooses to the 3rd layer bunch member's the number of times of choosing.
Then, the server of instant messaging during to mass network node transmitting system information, can be sent to information the leader cluster node of each bunch at needs earlier.(with reference to Fig. 4)
Be again, each leader cluster node is after reception information, and the hash value by information filters the information that repeats to transmit earlier; To the non-information that repeats to transmit, bunch member who then is transmitted to ground floor is alternative.Equally, bunch member of described ground floor is alternative, at first duplicate message is filtered; If be the non-information that repeats to transmit, then pass through bunch member of ground floor, bunch member who is forwarded to the second layer is alternative, filter duplicate message, it is alternative that bunch member by the second layer is forwarded to the 3rd layer bunch member again, and the rest may be inferred, alternative until information being sent to bunch member in the cluster and bunch member, thereby realize the system information of server is pushed to the mass network node, can reduce the server burden, conserve network resources.
Simultaneously, in the repeating process of information, can send automatically adding content, when the forwarding information, can add " your good friend A is to recommending you ... " in that information is anterior, perhaps add inscription " referrer A " etc. at the information afterbody such as bunch member A.
With reference to Fig. 5, the present invention proposes a kind of of another embodiment and closes the system 30 that tethers carries out the information propelling movement by the SNS network node, comprising:
Relation is set up module 31, sets up bunch relation in the SNS network node, and sets leader cluster node;
Wherein, the SNS network node can be MSN user, internet forum user and other have user of Web Community of the user of colony etc.
Described relation is set up module 31 by setting up bunch relation, the network node among some SNS (overall network node or specific subnetwork node etc.) can be divided into a plurality of relatively independent bunch formula colonies, makes things convenient for the propelling movement of information.
Described relation is set up module 31 and is closed tethers according to the good friend of mass network node, is relatively independent bunch formula group structure with the mass network node division, and picks out the leader cluster node of each bunch, helps information is sent to the mass network node.
The message that described message transmission module 32 can need send the provider of SNS service is sent to leader cluster node by server.The system information that described information can the side of providing need send to the SNS network node etc.
Described message transmitting module 33 can be after leader cluster node receives described information, other bunches member in information can being continued to be forwarded to bunch and good friend of bunch member etc.
With reference to Fig. 6, in an execution mode of present embodiment, described relation is set up module 31 and is further comprised:
Alternative bunch of head unit 311 chosen alternative bunch of head according to good friend's degree of network node;
Bunch member's judging unit 312, judge alternative bunch of head the good friend good friend's degree whether more than or equal to the cohesion of the good friend of first threshold and alternative bunch of head and alternative bunch of head whether more than or equal to second threshold value, whether be a bunch member to judge described good friend.
Described alternative bunch of head unit 311 can sort to mass network node among the SNS according to good friend's quantity of each network node, and the network node of picking out some good friends degree big (being that good friend's quantity is many) is as alternative bunch of head.Good friend's quantity that described good friend's degree can be a network node.Because bunch situation that relation repeats may occur, described some can be about 2 to 3 times that server once can issue maximum network node quantity.Choosing of alternative bunch of head can be carried out according to good friend's degree, such as can choose good friend's degree be the network node of 200 (i.e. 200 good friends) be alternative bunch first-class.
Whether described bunch of member's judging unit 312 is during with cluster at matching network node A and network node B, need judge at first whether two network nodes are that the good friend concerns; In this way, the cohesion that then continues to judge both whether more than or equal to second threshold value and good friend's degree separately whether more than or equal to first threshold; In this way, then decidable two network nodes are bunch member with cluster.
Herein, described bunch of member's judging unit 312 can at first be selected one alternative bunch of head under the situation of having chosen alternative bunch of head in advance, and it is alternative that the good friend of this alternative bunch of head is bunch member; Then, can judge the alternative good friend's degree of described bunch of member whether more than or equal to the cohesion of first threshold and the alternative and alternative bunch head of bunch member whether more than or equal to second threshold value; In this way, the good friend that then can choose described alternative leader cluster node is bunch member.Described cohesion is the quantity of common good friend between network node and the network node, such as common good friend's quantity of the good friend of alternative bunch of head and alternative bunch of head etc.; The good friend number of degrees value of described first threshold for setting; The cohesion numerical value of described second threshold value for setting.The setting of the described first threshold and second threshold value can be according to the clustering architecture quantity of final division, and the average size of each bunch is carried out.Alternative bunch of head in each bunch belongs to one of bunch member.
Described bunch of member's judging unit 312 also be used to judge described bunch of member the good friend good friend's degree whether more than or equal to first threshold and bunch member's good friend and bunch member's cohesion whether more than or equal to second threshold value, whether be a bunch member to judge described good friend.
It is alternative that bunch member's good friend also can be bunch member.After the part among the good friend who has chosen a certain alternative bunch of head (promptly bunch member is alternative) was bunch member, described bunch of member's judging unit 312 also can be selected a bunch member again in bunch member's who chooses good friend (promptly bunch member is alternative).
Described bunch of member's judging unit 312 can be by judging bunch member alternative (i.e. bunch member's good friend) good friend's degree whether more than or equal to first threshold and bunch member is alternative and bunch member's cohesion whether more than or equal to second threshold value, from bunch member is alternative, select a bunch member.Described bunch of alternative can the continuity by good friend's chain of bunch member of member, then bunch member equally also can continue.Described bunch of member's quantity can control by the first threshold and second threshold value.When the numerical value of the first threshold and second threshold setting was big, bunch member's quantity was less relatively, and relevance is stronger relatively between bunch member; At first threshold and the second threshold setting numerical value hour, bunch member's quantity is more relatively, between bunch member relevance relatively a little less than.Described bunch of member's judging unit 312 can be provided with bunch member's the cohesion and the judgement number of times of second threshold value bunch member's good friend's degree and first threshold and bunch member's good friend, judge that such as being provided with number of times is 2 times, then through stopping choosing of bunch member after twice judgement, to limit bunch member's quantity.
Described relation is set up module 31 and is further comprised a bunch setup unit 313, in bunch member who chooses, bunch member of good friend's degree maximum is set at leader cluster node.
A described bunch of setup unit 313 can be according to selecting leader cluster node behind selected good bunch member with good friend's degree of in the cluster bunch of member, bunch member that can select good friend's degree maximum usually is leader cluster node.Common and alternative bunch of first the causing of described leader cluster node.
With reference to Fig. 7, in another execution mode of present embodiment, described message transmitting module 33 further comprises:
A bunch retransmission unit 331 utilizes leader cluster node to receive information and is transmitted to the good friend;
First bunch of member's retransmission unit 332 utilizes bunch member among the good friend of leader cluster node to receive information and be transmitted to the good friend;
Second bunch of member's retransmission unit 333, bunch member among utilization bunch member's the good friend receives information and is transmitted to the good friend.
A described bunch of retransmission unit 331 can utilize leader cluster node to receive the information that the server among the SNS sends, and is transmitted to bunch member alternative (being the good friend of leader cluster node).Described first bunch of member's retransmission unit 332 is by after the alternative reception information of bunch member, and utilization bunch member wherein is transmitted to bunch member alternative (i.e. bunch member's good friend) with described information.Described second bunch of member's retransmission unit 333 utilizes bunch member's forwarding information among bunch member's the good friend again.So, information can be sent to in the cluster bunch of member and bunch member alternative.Described server only needs information is sent to leader cluster node, all the other are transmitted by a bunch member, made full use of existing communication port (passage between network node and the network node) thereby the limited problem of solution communication bandwidth (server bandwidth), conserve network resources.
Described bunch of member can be sent to information and be not more than self good friend (bunch member is alternative) of " good friend's degree ".Therefore, the alternative good friend's degree of described bunch of member of reception information is less than or equal to good friend's degree of described bunch of member.
With reference to Fig. 8, in another execution mode of present embodiment, the described system 30 that pushes by the SNS network node pass tethers information of carrying out also comprises information filtering module 34, when a bunch member receives information, judge whether to receive and transmitted described information, receive described information once more with refusal.
For avoiding information to repeat to transmit between bunch member, described information filtering module 34 can when receiving information, judge whether to have received and transmitted described information earlier a bunch member (comprising leader cluster node and bunch member); In this way, then refusal receives described information once more; Otherwise, receive described information.Because each information can calculate unique hash value by hash algorithm, then can judge by hash value whether information is identical.
The above only is the preferred embodiments of the present invention; be not so limit claim of the present invention; every equivalent structure or equivalent flow process conversion that utilizes specification of the present invention and accompanying drawing content to be done; or directly or indirectly be used in other relevant technical fields, all in like manner be included in the scope of patent protection of the present invention.
Claims (14)
1. one kind closes tethers by the SNS network node and carries out the information push method, it is characterized in that, comprises step:
In the SNS network node, set up bunch relation, and set leader cluster node;
Information is sent to leader cluster node;
Utilize leader cluster node described information to be forwarded to other SNS network nodes according to bunch relation of setting up.
2. according to claim 1ly close tethers by the SNS network node and carry out the information push method, it is characterized in that the described step of setting up bunch relation in the SNS network node further comprises step:
Choose alternative bunch of head according to good friend's degree of network node;
Judge alternative bunch of head the good friend good friend's degree whether more than or equal to the cohesion of the good friend of first threshold and alternative bunch of head and alternative bunch of head whether more than or equal to second threshold value; In this way, then choosing described good friend is bunch member; Otherwise, finish.
3. according to claim 2ly close tethers by the SNS network node and carry out the information push method, it is characterized in that, describedly choose described good friend for also comprising step after bunch member's the step:
Judge described bunch of member the good friend good friend's degree whether more than or equal to first threshold and bunch member's good friend and bunch member's cohesion whether more than or equal to second threshold value; In this way, then choosing described good friend is bunch member; Otherwise, finish.
4. describedly close tethers by the SNS network node and carry out the information push method according to claim 2 or 3, it is characterized in that the step of described setting leader cluster node further comprises step:
In bunch member who chooses, bunch member of good friend's degree maximum is set at leader cluster node.
5. according to claim 3ly close tethers by the SNS network node and carry out the information push method, it is characterized in that, also comprise good friend's degree that described bunch of member is set and first threshold and bunch member's good friend and bunch member's the cohesion and the judgement number of times of second threshold value.
According in the claim 1 to 3 any one describedly close tethers by the SNS network node and carry out the information push method, it is characterized in that the described leader cluster node that utilizes further comprises step according to bunch relation of setting up with the step that described information is forwarded to other SNS network nodes:
Utilize leader cluster node reception information and be transmitted to the good friend;
Utilize bunch member among the good friend of leader cluster node to receive information and be transmitted to the good friend;
Bunch member among utilization bunch member's the good friend receives information and is transmitted to the good friend.
7. according to claim 6ly close tethers by the SNS network node and carry out the information push method, it is characterized in that described method also comprises:
When a bunch member receives information, judge whether to receive and transmitted described information; In this way, then refusal receives described information once more; Otherwise, receive described information.
8. a system that carries out the information propelling movement by SNS network node pass tethers is characterized in that, comprising:
Relation is set up module, sets up bunch relation in the SNS network node, and sets leader cluster node;
Message transmission module is sent to leader cluster node with information;
Message transmitting module utilizes leader cluster node according to bunch relation of setting up described information to be forwarded to other SNS network nodes.
9. the system that carries out the information propelling movement by SNS network node pass tethers according to claim 8 is characterized in that described relation is set up module and further comprised:
Alternative bunch of head unit chosen alternative bunch of head according to good friend's degree of network node;
Bunch member's judging unit, judge alternative bunch of head the good friend good friend's degree whether more than or equal to the cohesion of the good friend of first threshold and alternative bunch of head and alternative bunch of head whether more than or equal to second threshold value, whether be a bunch member to judge described good friend.
10. the system that carries out the information propelling movement by SNS network node pass tethers according to claim 9, it is characterized in that, described bunch of member's judging unit also be used to judge described bunch of member the good friend good friend's degree whether more than or equal to first threshold and bunch member's good friend and bunch member's cohesion whether more than or equal to second threshold value, whether be a bunch member to judge described good friend.
11., it is characterized in that described relation is set up module and further comprised according to claim 9 or the 10 described systems that carry out the information propelling movement by SNS network node pass tethers:
A bunch setup unit in bunch member who chooses, is set at leader cluster node with bunch member of good friend's degree maximum.
12. the system that carries out the information propelling movement by SNS network node pass tethers according to claim 10, it is characterized in that described bunch of member's judging unit is provided with bunch member's good friend's degree and first threshold and bunch member's good friend and bunch member's the cohesion and the judgement number of times of second threshold value.
13. according to Claim 8 in 10 any one describedly close tethers by the SNS network node and carry out the system that information pushes, it is characterized in that described message transmitting module further comprises:
A bunch retransmission unit utilizes leader cluster node to receive information and is transmitted to the good friend;
First bunch of member's retransmission unit utilizes bunch member among the good friend of leader cluster node to receive information and be transmitted to the good friend;
Second bunch of member's retransmission unit, bunch member among utilization bunch member's the good friend receives information and is transmitted to the good friend.
14. the system that carries out the information propelling movement by SNS network node pass tethers according to claim 13 is characterized in that described system also comprises:
The information filtering module when a bunch member receives information, judges whether to receive and transmitted described information, receives described information once more with refusal.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910239061.2A CN102111424B (en) | 2009-12-28 | 2009-12-28 | The method and system of information pushing are carried out by SNS network node relation chain |
| PCT/CN2010/073698 WO2011079577A1 (en) | 2009-12-28 | 2010-06-09 | Method and system for pushing information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910239061.2A CN102111424B (en) | 2009-12-28 | 2009-12-28 | The method and system of information pushing are carried out by SNS network node relation chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102111424A true CN102111424A (en) | 2011-06-29 |
| CN102111424B CN102111424B (en) | 2015-07-29 |
Family
ID=44175454
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910239061.2A Active CN102111424B (en) | 2009-12-28 | 2009-12-28 | The method and system of information pushing are carried out by SNS network node relation chain |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN102111424B (en) |
| WO (1) | WO2011079577A1 (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102710556A (en) * | 2012-06-28 | 2012-10-03 | 奇智软件（北京）有限公司 | Method and device for adding instant messenger (IM) friends |
| CN102724139A (en) * | 2012-06-28 | 2012-10-10 | 奇智软件（北京）有限公司 | Method and device for friend recommending through instant messaging |
| CN102724140A (en) * | 2012-06-28 | 2012-10-10 | 奇智软件（北京）有限公司 | Method and device for adding instant messaging (IM) friend |
| WO2013044647A1 (en) * | 2011-09-27 | 2013-04-04 | 腾讯科技（深圳）有限公司 | Method and system for pushing associated user in sns network |
| CN103179522A (en) * | 2011-12-26 | 2013-06-26 | 中国移动通信集团四川有限公司 | Method, device and system for transmitting information |
| CN103188353A (en) * | 2011-12-31 | 2013-07-03 | 北京神州泰岳软件股份有限公司 | Method providing contact persons for user in internetwork communication tool and system providing contact persons for user in internetwork communication tool |
| WO2014000627A1 (en) * | 2012-06-28 | 2014-01-03 | 腾讯科技（深圳）有限公司 | Network information push method and system thereof, and computer storage medium |
| CN104702493A (en) * | 2012-06-28 | 2015-06-10 | 北京奇虎科技有限公司 | Instant messaging friend recommendation method and instant messaging friend recommendation device |
| WO2017190488A1 (en) * | 2016-05-05 | 2017-11-09 | 腾讯科技（深圳）有限公司 | User interaction parameter acquisition method and device, and computer storage medium |
| CN108769150A (en) * | 2018-05-14 | 2018-11-06 | 百度在线网络技术（北京）有限公司 | Data processing method, device, clustered node and the storage medium of block chain network |
| CN109587198A (en) * | 2017-09-29 | 2019-04-05 | 北京国双科技有限公司 | Graph text information method for pushing and device |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103812898A (en) * | 2012-11-13 | 2014-05-21 | 金至尊数码科技有限公司 | System and method for social network information popularization |
| CN107665225B (en) | 2016-07-29 | 2022-01-28 | 北京京东尚科信息技术有限公司 | Information pushing method and device |
| CN109218429B (en) * | 2018-09-26 | 2021-05-18 | 深圳市云歌人工智能技术有限公司 | Method, apparatus and storage medium for publishing information based on target selection |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060173963A1 (en) * | 2005-02-03 | 2006-08-03 | Microsoft Corporation | Propagating and responding to announcements in an environment having pre-established social groups |
| US8775261B2 (en) * | 2006-04-28 | 2014-07-08 | Nec Corporation | Network advertisement delivery system |
| US7627542B2 (en) * | 2006-09-22 | 2009-12-01 | Microsoft Corporation | Group identification in large-scaled networks via hierarchical clustering through refraction over edges of networks |
| KR100953594B1 (en) * | 2007-12-18 | 2010-04-21 | 한국전자통신연구원 | Method and apparatus for providing social networking service base on peer-to-peer network |
| US20090319359A1 (en) * | 2008-06-18 | 2009-12-24 | Vyrl Mkt, Inc. | Social behavioral targeting based on influence in a social network |
-
2009
- 2009-12-28 CN CN200910239061.2A patent/CN102111424B/en active Active
-
2010
- 2010-06-09 WO PCT/CN2010/073698 patent/WO2011079577A1/en active Application Filing
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9544384B2 (en) | 2011-09-27 | 2017-01-10 | Tencent Technology (Shenzhen) Company Limited | Method and system for pushing associated users in social networking service network |
| WO2013044647A1 (en) * | 2011-09-27 | 2013-04-04 | 腾讯科技（深圳）有限公司 | Method and system for pushing associated user in sns network |
| CN103179522B (en) * | 2011-12-26 | 2016-08-03 | 中国移动通信集团四川有限公司 | A kind of method for sending information, Apparatus and system |
| CN103179522A (en) * | 2011-12-26 | 2013-06-26 | 中国移动通信集团四川有限公司 | Method, device and system for transmitting information |
| CN103188353B (en) * | 2011-12-31 | 2016-06-15 | 北京神州泰岳软件股份有限公司 | A kind of internet communication instrument provides the user the method and system of contact person |
| CN103188353A (en) * | 2011-12-31 | 2013-07-03 | 北京神州泰岳软件股份有限公司 | Method providing contact persons for user in internetwork communication tool and system providing contact persons for user in internetwork communication tool |
| CN102724140B (en) * | 2012-06-28 | 2016-06-01 | 北京奇虎科技有限公司 | Instant messaging good friend's addition means and device |
| CN102724139A (en) * | 2012-06-28 | 2012-10-10 | 奇智软件（北京）有限公司 | Method and device for friend recommending through instant messaging |
| CN104702493A (en) * | 2012-06-28 | 2015-06-10 | 北京奇虎科技有限公司 | Instant messaging friend recommendation method and instant messaging friend recommendation device |
| CN102710556B (en) * | 2012-06-28 | 2015-10-14 | 北京奇虎科技有限公司 | The adding method of instant messaging good friend and device |
| CN102710556A (en) * | 2012-06-28 | 2012-10-03 | 奇智软件（北京）有限公司 | Method and device for adding instant messenger (IM) friends |
| WO2014000627A1 (en) * | 2012-06-28 | 2014-01-03 | 腾讯科技（深圳）有限公司 | Network information push method and system thereof, and computer storage medium |
| CN102724140A (en) * | 2012-06-28 | 2012-10-10 | 奇智软件（北京）有限公司 | Method and device for adding instant messaging (IM) friend |
| CN102724139B (en) * | 2012-06-28 | 2015-05-06 | 北京奇虎科技有限公司 | Method and device for friend recommending through instant messaging |
| CN104702493B (en) * | 2012-06-28 | 2018-07-10 | 北京奇虎科技有限公司 | Instant messaging friend recommendation method and device |
| WO2017190488A1 (en) * | 2016-05-05 | 2017-11-09 | 腾讯科技（深圳）有限公司 | User interaction parameter acquisition method and device, and computer storage medium |
| CN109587198A (en) * | 2017-09-29 | 2019-04-05 | 北京国双科技有限公司 | Graph text information method for pushing and device |
| CN109587198B (en) * | 2017-09-29 | 2021-11-19 | 北京国双科技有限公司 | Image-text information pushing method and device |
| CN108769150A (en) * | 2018-05-14 | 2018-11-06 | 百度在线网络技术（北京）有限公司 | Data processing method, device, clustered node and the storage medium of block chain network |
| CN108769150B (en) * | 2018-05-14 | 2021-11-12 | 百度在线网络技术（北京）有限公司 | Data processing method and device of block chain network, cluster node and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2011079577A1 (en) | 2011-07-07 |
| CN102111424B (en) | 2015-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102111424B (en) | The method and system of information pushing are carried out by SNS network node relation chain | |
| CN101217517B (en) | A method and system to realize one-to-many chatting in the instant communication | |
| CN103095746A (en) | Method and device capable of sending information to group users through microblog | |
| US11012356B2 (en) | Method of forwarding a received message in a mesh network comprising a plurality of communicatively interconnected mesh nodes as well as a corresponding mesh node | |
| CN101820523B (en) | Method and system for processing session | |
| CN101964717A (en) | Method for initiating meetings based on instant communication groups | |
| CN101345718A (en) | Method, system and apparatus for supporting topic classification in group | |
| CN102547600A (en) | Method and system for establishing chat group based on vehicle-mounted terminal | |
| CN103188130A (en) | Social network user information correlation method and correlation device | |
| CN101977163A (en) | Instant messenger based method for initiating network conference | |
| CN102082740A (en) | Method and system for adding friends in invitation link mode | |
| CN103124254A (en) | Method, server and device establishing directional push | |
| CN101160875A (en) | Method of transmitting deferred information | |
| WO2013063886A1 (en) | Gateway, inter-community group information processing system and method | |
| CN102123133B (en) | Method and the message system of message receipt is transmitted during the intercommunication of different messages business platform | |
| CN102497328A (en) | Instant messaging (IM) message sending method and IM system | |
| CN102238495A (en) | System for intercommunicating short messages and instant messages (IM) | |
| CN104579910A (en) | Method for initiating group meeting based on instant messaging | |
| CN103051513A (en) | Information real-time interaction method and system | |
| CN1984129A (en) | System and method for realizing and appearing instant message service by SIP protocol | |
| CN101883322B (en) | Method and system for group-sending union IP message in large message mode | |
| CN103905287B (en) | Signal procedure correlating method and device based on local area network | |
| Greene et al. | Instant messaging & presence management in mobile adhoc networks | |
| US9374328B1 (en) | Selective messaging using online presence information | |
| CN102710540B (en) | Method, client and system for setting publishing channel in instant messaging |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |