CN100433689C - An organization method for tree network of control stream in the stream media living broadcast system - Google Patents
An organization method for tree network of control stream in the stream media living broadcast system Download PDFInfo
- Publication number
- CN100433689C CN100433689C CNB2006101245196A CN200610124519A CN100433689C CN 100433689 C CN100433689 C CN 100433689C CN B2006101245196 A CNB2006101245196 A CN B2006101245196A CN 200610124519 A CN200610124519 A CN 200610124519A CN 100433689 C CN100433689 C CN 100433689C
- Authority
- CN
- China
- Prior art keywords
- node
- child
- request
- level
- change step
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention relates to a tree network organic method of control flow in flow media direct-broadcast system. Wherein, it comprises that (1) starting protecting process; (2), detecting the network interface, waiting to receive the request pack from other nodes; (3), judging the type of request pack, to add or leave the node, redirecting the request; (4), based on received jump pack, refreshing the sub node of local node. The invention uses the double-layer topology structure with separated control flow and data flow; the control tree optimizes the network nearby nodes; the mesh logic cover network exchanges data, to supply the demand of P2P online flow media; the control tree uses the node group method based on GUID; based on the position each node, it generates GUID, to organize the nearby nodes in logic layer. The invention can reduce network flux, reduce load and improve the service quality.
Description
Technical field
The invention belongs to reciprocity Streaming Media field, be specifically related to the organization method for tree network of control flows in a kind of flow medium live system.
Background technology
In recent years, legacy clients/server model, browser/server model are along with distributed computing technology and network technology further develops and Internet user's scale huge day by day, and server becomes the bottleneck of systematic function gradually.Computing Technology has solved these shortcomings of above-mentioned model better owing to its self-organizing, nonconcentrated characteristics.In reciprocity computing network, node is served as two kinds of roles of client-server simultaneously, both, also enjoyed the service of other nodes, thereby obtained using widely in fields such as resource-sharing, reciprocity cooperation, distribution of content, information managements for other nodes provide service.
In the flow medium live system that calculates based on equity at present, generally adopt tree-like framework, the topology of DHT framework or mesh architecture.But no matter adopt which kind of topological structure, all require as much as possible under the situation that takies Internet resources (as bandwidth) less, to transmit more media data.Therefore the objective requirement system can utilize the network proximity of each node preferably, allows and more transmits data between the contiguous node.At optimization (the Migue Castrol that mainly concentrates on DHT aspect the research network proximity, PeterDruschel, Y.Charlie Hu and Antony Rowstron, Proximity neighborselection in tree-based structured peer-to-peer overlays, Technical Report, MSR-TR-2003-52) and cancellated file-sharing optimization (YunhaoLiu, Xiaomei Liu, Li Xiao, Lionel M Ni, and Xiaodong Zhang.Location-Aware topology matching in P2P systems.In:Proc.of theIEEE INFOCOM 2004.Hong Kong, 2004.), the first kind is difficult to the node switching media data of accomplishing that network is contiguous owing to structural too strong.Its main thought of second class is RTT (delay) information that constantly exchanges between each node, optimize dynamically, but this method also is not suitable for live streaming media, because require system to have certain stability in the P2P flow medium live system, if frequent artificial allow node add to leave to increase system's upheaval and unsteadiness on the contrary, influence systematic function.In addition since the natural requirement of P2P stream media system based on netted building method (can avoid single point failure), therefore the control flows of most of P2P stream media systems also adopts network structure, be not suitable for second kind of optimization method mentioned above, therefore be difficult to solve intrinsic problems such as node clustering, message redundancy.
Summary of the invention
The object of the present invention is to provide in a kind of flow medium live system based on the organization method for tree network of GUID, the present invention has reduced network traffics, has improved the performance of P2P live broadcast stream media system simultaneously.
The organization method for tree network of control flows in a kind of flow medium live system provided by the invention, the arbitrary node P of system all handles according to the following steps:
Start finger daemon, executed in parallel finger daemon and host process, wherein, finger daemon comprises step (11)-(16), host process comprises step (21)-(29);
(11) node P accepts user's request;
(12) node P judges whether received request joins request, if enter step (13); Otherwise, enter step (14);
(13) node P initiatively adds;
(14) node P initiatively leaves;
(15) whether decision node P leaves the P2P network, if finish finger daemon; Otherwise, get back to step (11) and continue to accept user's request;
(16) node P begins to monitor the network port of regulation, waits for receiving the request package that sends from other nodes;
(21) node P begins to monitor the network port of regulation, waits for receiving the request package that sends from other nodes, and the type of request package is divided into three kinds: the bag that joins request, leave request package and heartbeat packet;
(22) node P judges whether to receive the request package from other nodes, if enter step (23); Otherwise, forward step (27) to;
(23) node P judges whether received request package is the bag that joins request, if enter step (24); Otherwise, enter step (25);
(24) node P handles joining request according to following process according to the bag of receiving that joins request:
(C1) judge whether add ingress is the outer net node, in this way, change step (C2), otherwise change step (C15);
(C2) utilize step (d1)-(d2) to calculate to add the level of ingress, establish the Field Count that MAX LEVEL equals among the GUID and subtract 1, L is the level that is added into node, as and L=MAX LEVEL identical with this node level, changes step (C3), otherwise changes step (C10);
(d1) level of root node is defined as 0, the level scope of other node be 1 and MAX LEVEL between;
(d2) all identical if add ingress with preceding L the field that is added into node GUID, then define its level and add 1, otherwise define its level and to be added into node layer time identical for being added into the node level;
(C3) whether there are and the number of plies and an own identical outer net child contiguous in the child nodes tabulation of inspection oneself with entrant GUID, as existence, commentaries on classics step (C9), otherwise change step (C4);
(C4) check oneself whether to also have vacant child position, in this way, change step (C5), otherwise change step (C6);
(C5) level that adds ingress being set is the level L of oneself, the new entrant is added in the child nodes tabulation and sends Agree message arrive the new entrant, is added into flow process and finishes, and changes step (27);
(C6) judge whether add ingress is the outer net node, in this way, change step (C7), otherwise change step (C8);
(C7) select an outer net address and the nearest child nodes of the person of being added into GUID, transmission redirects message to selected child and receives the child of new entrant for oneself, is added into flow process and finishes, and changes step (27);
(C8) refusal entrant is added into flow process and finishes, and changes step (27);
(C9) be redirected the new entrant to this child nodes, be added into flow process and finish, change step (27);
(C10) search the node of the middle-level ratio of child oneself big 1, change step (C11) as existing, otherwise change step (C14);
(C11) if the child nodes of finding is the outer net node, change step (C12), otherwise change step (C13);
(C12) entrant is redirected to this child, is added into flow process and finishes, change step (27);
(C13) select an outer net address and the nearest child nodes of the person of being added into GUID, transmission redirects message to selected child and receives the child of new entrant for oneself, is added into flow process and finishes, and changes step (27);
(C14) new entrant's level is made as current level and adds 1, add the new entrant in the child nodes tabulation and send Agree message, be added into flow process and finish, change step (27) to the new entrant;
(C15) whether there is an Intranet child with entrant GUID same gateway, in this way, changes step (C16), otherwise change step (C4);
(C16) be redirected the new entrant to this child nodes; Be added into flow process and finish, change step (27);
(25) node P judges whether received request package is to leave request package, if enter step (26); Otherwise, enter step (27);
(26) node P handles leaving request according to the request package of receiving of leaving, and removal request person changes step (27) then;
(27) node P carries out regular heartbeat processing;
(28) whether decision node P leaves the P2P network, if, finishing finger daemon, the network port and the packet receiving work that stop to monitor regulation simultaneously enter step (29) then; Otherwise, get back to step (22) and continue to monitor;
(29) finish.
The double-deck topological structure that the inventive method is separated control flows and data flow carries out the optimization of network adjacent node by the control tree, and netted logic nerve of a covering carries out exchanges data, adapts to the online Streaming Media demand of P2P preferably.In addition, the tissue of control tree has been introduced the node clustering method based on GUID (Global UniqueIdentifier).The present invention is according to the position of each node in network, for it produces corresponding GUID, finally according to this GUID, at logical layer with contiguous node organization together.The inventive method can be used to organize a kind of tree network that is used to transmit control flows efficiently to be flow medium live system.Particularly, the inventive method has the following advantages and purposes:
(1) enhanced scalability
Control tree only is responsible for control informations such as transmission adds, leaves, heartbeat, and not responsible transmission of media data, so transmission quantity is very little, and the branch of control tree can be very big, so improved the extensibility of system greatly.
(2) stability
Heartbeat module guarantees that node can add automatically again when the father node fault, and loses efficacy or normally withdraw from Shi Zehui deletion child node information in child node, make own can stable existence in control is set and be unlikely to go offline, thereby guaranteed the stability of system.
(3) nerve of a covering and physical network are complementary
Control tree is made into a tree by the geographical position layering by geographical location information GUID with groups of nodes, so the approaching node of physical location is also approaching relatively on the control tree.Flow medium live system can obtain effective, contiguous service node at short notice and ask media data by the control tree, the partner selection strategy of comparing traditional, can obviously improve partner's quality, reduce the client terminal playing operating lag, improve streaming media service quality.
Description of drawings
Fig. 1 is the overview flow chart of this method;
Fig. 2 is for adding the flow chart of ingress in the finger daemon;
The flow chart that Fig. 3 leaves for node in the finger daemon;
Fig. 4 is for being added into the process chart of node in the host process;
Fig. 5 is for being left the process chart of node in the host process;
Fig. 6 is the heartbeat flow chart;
Fig. 7 is the instance graph of the inventive method;
Fig. 8 is the GUID schematic diagram.
Embodiment
The present invention is further detailed explanation below in conjunction with accompanying drawing and example.
Shown in Fig. 1 (A), the concrete steps of the inventive method are: the arbitrary node P that enters live broadcast system all organizes peer-to-peer network according to the following steps:
(1) node P starts finger daemon.Finger daemon and host process executed in parallel are used to accept user's request.Host process comprises shown in step (21)-(29) that shown in Fig. 1 (A) finger daemon is shown in Fig. 1 (B), and its workflow comprises step (11)-(16), specifically describes as follows:
(11) node P accepts user request, and user's request is divided into two kinds: join request and leave request;
(12) node P judges whether received request joins request, if enter step (13); Otherwise, enter step (14);
(13) node P carries out and initiatively adds flow process; Initiatively the flow process that adds is as shown in Figure 2:
(A1) adding object Obj being set is root node;
(A2) this node number of times of continuous adding Obj.n being set is 0;
(A3), otherwise change step (A5) if step (A4) is changeed in Obj.n＞3;
(A4) if Obj is a root node, adition process can't be finished, and enters step (15), otherwise it is root node that adding object Obj is set, and changes step (A5) then.
(A5) Obj.n is revised as Obj.n+1, and sends adding message, change step (A6) to Obj;
(A6) judge whether the reception response message is overtime, if receive time-out changes step (A3), otherwise, change step (A7);
(A7) judge whether the response message of receiving is refuse information,, otherwise change step (A8) if refuse information is changeed step (A1);
(A8) judge whether the response message of receiving is redirect message, if enter step (A9), otherwise change step (A10);
(A9) establish the node of node that is redirected sensing, change step (A2) for adding;
(A10) with this entrant as father's node, the initialization child nodes; Adition process finishes, and enters step (15).
(14) node P carries out and initiatively leaves flow process; Initiatively the flow process of leaving is as shown in Figure 3:
(B1) node P sends leave group message to its father node;
(B2) node P inquires about all child node information, sends leave group message to its child node simultaneously;
(B3) node P promptly empties child's tabulation with the deletion from its child's tabulation of its all child node information, interrupts simultaneously being connected with the network of child nodes;
(B4) node P is changed to sky with its father node and grandfather's nodal information, stops to accept and handling any internet message of this channel simultaneously, leaves flow process and finishes, and enters step (15).
(15) whether decision node P leaves the P2P network, if finish finger daemon; Otherwise, get back to step (11) and continue to accept user's request.
So far, the finger daemon flow process of the control of flow medium live system tree part is discussed and is finished.
(21) node P begins to monitor the network port of regulation, waits for receiving the request package that sends from other nodes, and the type of request package is divided into three kinds: the bag that joins request, leave request package and heartbeat packet;
(22) node P judges whether to receive the request package from other nodes, if enter step (23); Otherwise, forward step (27) to;
(23) node P judges whether received request package is the bag that joins request, if enter step (24); Otherwise, enter step (25);
(24) node P handles joining request according to the bag of receiving that joins request, and changes step (27) then.Handle flow process that other node adds as shown in Figure 3, its flow process is:
(C1) judge whether add ingress is the outer net node, in this way, change step (C2), otherwise change step (C15);
(C2) calculate the level that adds ingress,, change step (C3), otherwise change step (C10) as and L=MAX LEVEL identical with this node level.Can following step calculate level:
(d1) level of root node is defined as 0, the level scope of other node be 1 and MAX LEVEL between, wherein the Field Count that equals among the GUID of MAX_LEVEL subtracts 1;
(d2) establishing the level that is added into node is L, if it is all identical with preceding L the field that is added into node GUID to add ingress, then defines its level and adds 1 for being added into the node level, otherwise define its level and to be added into node layer time identical.
(C3) whether there are and the number of plies and an own identical outer net child contiguous in the child nodes tabulation of inspection oneself with entrant GUID, as existence, commentaries on classics step (C9), otherwise change step (C4);
(C4) check oneself whether to also have vacant child position, in this way, change step (C5), otherwise change step (C6);
(C5) level that adds ingress being set is the level L of oneself, the new entrant is added in the child nodes tabulation and sends Agree message arrive the new entrant, is added into flow process and finishes, and changes step (27).
(C6) judge whether add ingress is the outer net node, in this way, change step (C7), otherwise change step (C8);
(C7) select an outer net address and the nearest child nodes of the person of being added into GUID, transmission redirects message to selected child and receives the child of new entrant for oneself.Concrete effect is exactly to have exchanged selected child and the position of new entrant on the control tree; Be added into flow process and finish, change step (27).
(C8) refusal entrant.Necessarily satisfy all child nodes this moment all is the Intranet node, and the entrant is different Intranet node; Be added into flow process and finish, change step (27).
(C9) be redirected the new entrant to this child nodes; Be added into flow process and finish, change step (27).
(C10) search the node of the middle-level ratio of child oneself big 1, change step (C11) as existing, otherwise change step (C14);
(C11) if the child nodes of finding is the outer net node, change step (C12), otherwise change step (C13);
(C12) entrant is redirected to this child; Be added into flow process and finish, change step (27).
(C13) select an outer net address and the nearest child nodes of the person of being added into GUID, transmission redirects message to selected child and receives the child of new entrant for oneself.Concrete effect is exactly to have exchanged selected child and the position of new entrant on the control tree; Be added into flow process and finish, change step (27).
(C14) new entrant's level is made as current level and adds 1, add the new entrant in the child nodes tabulation and send Agree message to the new entrant; Be added into flow process and finish, change step (27).
(C15) whether there is an Intranet child with entrant GUID same gateway, in this way, changes step (C16), otherwise change step (C4);
(C16) be redirected the new entrant to this child nodes; Be added into flow process and finish, change step (27).
(25) node P judges whether received request package is to leave request package, if enter step (26); Otherwise, enter step (27);
(26) node P handles leaving request according to the request package of receiving of leaving, and changes step (27) then.The concrete steps of handling other node leave group message as shown in Figure 5, its flow process is:
(E1) node is judged the identity of the node that sends leave group message, and the father of oneself changes step (E2) in this way, otherwise changes step (E4);
(E2) because father's node leaves, grandfather's node is changed to father node;
(E3) set up network with father node and connect, and send the information that joins request, re-execute adition process, handle and leave the flow process end, change step (27) to new father node;
(E4) because child nodes is left,, stop to handle message, handle and leave the flow process end, change step (27) from the sender with sender information deletion from its child's tabulation.
(27) node P carries out regular heartbeat processing.The heartbeat flow process of node as shown in Figure 6, detailed process is:
(F1) obtain current time C, and loop initialization count value K=1.
(F2) to the node T[K among the child nodes tabulation T], calculate the difference D of current time C and the time of the heartbeat message of receiving this node for the last time.
(F3) whether judge difference D greater than setting threshold,, otherwise change step (F5) if change step (F4);
(F4) child node T[K is described] do not sent heartbeat message for a long time to own, think node T[K this moment] leave, system is with T[K] from tabulating T, child nodes deletes.
(F5)K＝K+1，
(F6) do you judge that k is less than list size? if change (F7), otherwise change (F2).
(F5) check whether need to end thread,, otherwise after sleep a period of time, change step (F1) if flow process finishes.
(28) whether decision node P leaves the P2P network, if, finishing finger daemon, the network port and the packet receiving work that stop to monitor regulation simultaneously enter step (29) then; Otherwise, get back to step (22) and continue to monitor.
(29) finish.
Example:
In the method, each node all uses a GUID to come unique identification.GUID is one 16 byte being generated according to the information of node by system when each node adds network totally 128 a value, and its structure as shown in Figure 7.Wherein node type represents this node belongs to which kind of type in outer net, Intranet, NAT and the firewall node; ISP represents the ISP (Internet Service Provider) at node place, and the city at node place is represented in the city, and postcode is represented the postcode at node place, outer net IP field and Intranet IP field, if node is the Intranet node, corresponding outer net IP is its gateway IP, and Intranet IP is its IP; If node is the outer net node, corresponding outer net IP and Intranet IP are its IP values.Reserved field does not use at present as yet, gives over to expand to use in the future.
Utilize the node organization method together of utilizing virtual level with GUID contiguous (being that the position is contiguous in fact) set forth in the present invention, in order to narrate conveniently, each part of GUID is reduced to little integer, shown in Fig. 6-(a).Before new node adds, there have been many nodes to be organized in the hierarchical tree, shown in Fig. 6-(b).Wherein s is a root node, and X is a newly added node.H
i(i=1,2 ... 11) for adding ingress.The little rectangle plane of grey represents that several child nodes that stalk tree and it are led are on the same level, couples together by two nodes between the little rectangle, and the level of the node of following one deck is to add 1 by the upper strata.Following one deck is represented the further polymerization of the higher node of similarity.It is 4 that maximum level is set, and each node can be accepted 5 child nodes (in fact can be more, because these connect not transmission of media data, be transmitting control data).
Nodes X (1,2,3) at first connects root node S, sends to add the nerve of a covering request, node S (0,0,0) calculates the level of X, because the level of S is 0, whether the 0th dimension of GUID that should compare entrant X so is identical, obvious with the 0th dimension of S, and 1 ≠ 0, the level of X and S should be at same one decks.For simplicity, suppose that X is the outer net node.Whether S then searches GUID and the contiguous outer net node of X, owing to there is H
1(1,0,0) satisfies condition, and X is redirected to H
1After X receives redirect message, to H
1Send and add message.
H
1Level be 0, after receiving the adding message of X, search the child nodes contiguous, because H with the GUID node of X
5GUID be (1,0,0), it is identical that the 0th dimension and the 1st of X tie up, so X is redirected to H
5Each node uses identical access agreement after receiving and adding message, adds ingress and is receiving that redirect message sends adding message to specified node.The whole process that circulates is up to adding success or being rejected or adding again.
Claims (4)
1, the organization method for tree network of control flows in a kind of flow medium live system, the arbitrary node P of system all handles according to the following steps:
Start finger daemon, executed in parallel finger daemon and host process, wherein, finger daemon comprises step (11)-(16), host process comprises step (21)-(29);
(11) node P accepts user's request;
(12) node P judges whether received request joins request, if enter step (13); Otherwise, enter step (14);
(13) node P initiatively adds;
(14) node P initiatively leaves;
(15) whether decision node P leaves the P2P network, if finish finger daemon; Otherwise, get back to step (11) and continue to accept user's request;
(16) node P begins to monitor the network port of regulation, waits for receiving the request package that sends from other nodes;
(21) node P begins to monitor the network port of regulation, waits for receiving the request package that sends from other nodes, and the type of request package is divided into three kinds: the bag that joins request, leave request package and heartbeat packet;
(22) node P judges whether to receive the request package from other nodes, if enter step (23); Otherwise, forward step (27) to;
(23) node P judges whether received request package is the bag that joins request, if enter step (24); Otherwise, enter step (25);
(24) node P handles joining request according to following process according to the bag of receiving that joins request:
(C1) judge whether add ingress is the outer net node, in this way, change step (C2), otherwise change step (C15);
(C2) utilize step (d1)-(d2) to calculate to add the level of ingress, establish the Field Count that MAX LEVEL equals among the GUID and subtract 1, L is the level that is added into node, as and L=MAX_LEVEL identical with this node level, changes step (C3), otherwise changes step (C10);
(d1) level of root node is defined as 0, the level scope of other node be 1 and MAX_LEVEL between;
(d2) all identical if add ingress with preceding L the field that is added into node GUID, then define its level and add 1, otherwise define its level and to be added into node layer time identical for being added into the node level;
(C3) whether there are and the number of plies and an own identical outer net child contiguous in the child nodes tabulation of inspection oneself with entrant GUID, as existence, commentaries on classics step (C9), otherwise change step (C4);
(C4) check oneself whether to also have vacant child position, in this way, change step (C5), otherwise change step (C6);
(C5) level that adds ingress being set is the level L of oneself, the new entrant is added in the child nodes tabulation and sends Agree message arrive the new entrant, is added into flow process and finishes, and changes step (27);
(C6) judge whether add ingress is the outer net node, in this way, change step (C7), otherwise change step (C8);
(C7) select an outer net address and the nearest child nodes of the person of being added into GUID, transmission redirects message to selected child and receives the child of new entrant for oneself, is added into flow process and finishes, and changes step (27);
(C8) refusal entrant is added into flow process and finishes, and changes step (27);
(C9) be redirected the new entrant to this child nodes, be added into flow process and finish, change step (27);
(C10) search the node of the middle-level ratio of child oneself big 1, change step (C11) as existing, otherwise change step (C14);
(C11) if the child nodes of finding is the outer net node, change step (C12), otherwise change step (C13);
(C12) entrant is redirected to this child, is added into flow process and finishes, change step (27);
(C13) select an outer net address and the nearest child nodes of the person of being added into GUID, transmission redirects message to selected child and receives the child of new entrant for oneself, is added into flow process and finishes, and changes step (27);
(C14) new entrant's level is made as current level and adds 1, add the new entrant in the child nodes tabulation and send Agree message, be added into flow process and finish, change step (27) to the new entrant;
(C15) whether there is an Intranet child with entrant GUID same gateway, in this way, changes step (C16), otherwise change step (C4);
(C16) be redirected the new entrant to this child nodes; Be added into flow process and finish, change step (27);
(25) node P judges whether received request package is to leave request package, if enter step (26); Otherwise, enter step (27);
(26) node P handles leaving request according to the request package of receiving of leaving, and removal request person changes step (27) then;
(27) node P carries out regular heartbeat processing;
(28) whether decision node P leaves the P2P network, if, finishing finger daemon, the network port and the packet receiving work that stop to monitor regulation simultaneously enter step (29) then; Otherwise, get back to step (22) and continue to monitor;
(29) finish.
2, method according to claim 1 is characterized in that: node P active adition process comprises the steps: in the step (13)
(A1) adding object Obj being set is root node;
(A2) this node number of times of continuous adding Obj.n being set is 0;
(A3), otherwise change step (A5) if step (A4) is changeed in Obj.n＞3;
(A4) if Obj is a root node, adition process can't be finished, and enters step (15), otherwise it is root node that adding object Obj is set, and changes step (A5) then;
(A5) Obj.n is revised as Obj.n+1, and sends adding message, change step (A6) to Obj;
(A6) judge whether the reception response message is overtime, if receive time-out changes step (A3), otherwise, change step (A7);
(A7) judge whether the response message of receiving is refuse information,, otherwise change step (A8) if refuse information is changeed step (A1);
(A8) judge whether the response message of receiving is redirect message, if enter step (A9), otherwise change step (A10);
(A9) establish the node of node that is redirected sensing, change step (A2) for adding;
(A10) with this entrant as father's node, the initialization child nodes; Adition process finishes, and enters step (15).
3, method according to claim 1 and 2 is characterized in that: the middle node P of step (14) initiatively leaves process and comprises the steps:
(B1) node P sends leave group message to its father node;
(B2) node P inquires about all child node information, sends leave group message to its child node simultaneously;
(B3) node P interrupts the deletion from its child's tabulation of its all child node information to be connected with the network of child nodes simultaneously;
(B4) node P is changed to sky with its father node and grandfather's nodal information, stops to accept and handling any internet message of this channel simultaneously, leaves flow process and finishes, and enters step (15).
4, method according to claim 3 is characterized in that: node P handles leaving request according to following process in the step (26):
(E1) node is judged the identity of the node that sends leave group message, and the father of oneself changes step (E2) in this way, otherwise changes step (E4);
(E2) because father's node leaves, grandfather's node is changed to father node;
(E3) set up network with father node and connect, and send the information that joins request, re-execute adition process, handle and leave the flow process end, change step (27) to new father node;
(E4) because child nodes is left,, stop to handle message, handle and leave the flow process end, change step (27) from the sender with sender information deletion from its child's tabulation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101245196A CN100433689C (en) | 2006-09-13 | 2006-09-13 | An organization method for tree network of control stream in the stream media living broadcast system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101245196A CN100433689C (en) | 2006-09-13 | 2006-09-13 | An organization method for tree network of control stream in the stream media living broadcast system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1953413A CN1953413A (en) | 2007-04-25 |
| CN100433689C true CN100433689C (en) | 2008-11-12 |
Family
ID=38059545
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006101245196A Expired - Fee Related CN100433689C (en) | 2006-09-13 | 2006-09-13 | An organization method for tree network of control stream in the stream media living broadcast system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100433689C (en) |
Families Citing this family (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080294788A1 (en) * | 2007-05-21 | 2008-11-27 | Hong Kong Applied Science And Technology Research Institute Co., Ltd. | Systems and methods for p2p streaming |
| CN100461740C (en) | 2007-06-05 | 2009-02-11 | 华为技术有限公司 | Customer end node network topological structure method and stream media distributing system |
| FR2928800A1 (en) * | 2008-03-14 | 2009-09-18 | Thomson Licensing Sas | METHOD OF MANAGING PEER IDENTIFIER RECEIVERS TO ACCESS P2P MODE TO CONTENTS THAT THEY STORE, AND ASSOCIATED MANAGEMENT DEVICE AND NETWORK EQUIPMENT THEREFOR. |
| CN101820351B (en) * | 2009-02-27 | 2013-08-07 | 华为技术有限公司 | Method, device and system for discovering P2P flow optimization service |
| CN101860469A (en) * | 2009-04-13 | 2010-10-13 | 华为技术有限公司 | Method and device for carrying out grouping on nodes in peer-to-peer technology network |
| CN101730101B (en) | 2009-04-15 | 2012-07-04 | 中兴通讯股份有限公司 | Realizing method, system and device for separating identify label from position |
| US9392056B2 (en) | 2010-07-23 | 2016-07-12 | Nec Corporation | Method for operating a network and a network |
| CN102387072B (en) * | 2011-10-15 | 2014-04-23 | 西安交通大学 | Application layer multicasting method supporting heterogeneous terminal and heterogeneous network environment |
| CN102394777A (en) * | 2011-11-04 | 2012-03-28 | 迈普通信技术股份有限公司 | Network management method and system based on geographical position information |
| CN102573002B (en) * | 2012-02-27 | 2014-08-06 | 杭州星纬物联技术有限公司 | Network access request method of MESH network of wireless sensor based on network grade interval |
| CN104657385A (en) * | 2013-11-22 | 2015-05-27 | 乐视网信息技术（北京）股份有限公司 | Search method and device of node |
| CN103763172A (en) * | 2013-12-31 | 2014-04-30 | 江苏宁克传感器科技有限公司 | Network topology building method |
| CN109151570B (en) * | 2018-10-10 | 2022-04-01 | 深圳市网心科技有限公司 | Streaming media processing method and system based on HTML5 and related components |
| CN111046065B (en) * | 2019-10-28 | 2022-06-17 | 北京大学 | Extensible high-performance distributed query processing method and device |
| CN112055048B (en) * | 2020-07-29 | 2022-09-06 | 北京智融云河科技有限公司 | P2P network communication method and system for high-throughput distributed account book |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1141546A (en) * | 1995-07-13 | 1997-01-29 | 深圳市华为技术有限公司 | Mixed style comprehensive business connecting net work equipment and method for forming the net work |
| US20050187946A1 (en) * | 2004-02-19 | 2005-08-25 | Microsoft Corporation | Data overlay, self-organized metadata overlay, and associated methods |
| US20050198290A1 (en) * | 2003-06-04 | 2005-09-08 | Sony Computer Entertainment Inc. | Content distribution overlay network and methods for operating same in a P2P network |
-
2006
- 2006-09-13 CN CNB2006101245196A patent/CN100433689C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1141546A (en) * | 1995-07-13 | 1997-01-29 | 深圳市华为技术有限公司 | Mixed style comprehensive business connecting net work equipment and method for forming the net work |
| US20050198290A1 (en) * | 2003-06-04 | 2005-09-08 | Sony Computer Entertainment Inc. | Content distribution overlay network and methods for operating same in a P2P network |
| US20050187946A1 (en) * | 2004-02-19 | 2005-08-25 | Microsoft Corporation | Data overlay, self-organized metadata overlay, and associated methods |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1953413A (en) | 2007-04-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100433689C (en) | An organization method for tree network of control stream in the stream media living broadcast system | |
| Voulgaris et al. | Sub-2-Sub: Self-Organizing Content-Based Publish Subscribe for Dynamic Large Scale Collaborative Networks. | |
| KR100505265B1 (en) | Semantic information network(SION) | |
| CN101764807B (en) | Multisource internet resource device and method based on meta search engine | |
| CN104717304B (en) | A kind of CDN P2P content optimizations select system | |
| CN101568911B (en) | Method and system of group-to-group computing | |
| CN101170578A (en) | Hierarchical peer-to-peer network structure and constructing method based on syntax similarity | |
| CN1692616A (en) | Network traffic control in peer-to-peer environments | |
| CN102571839A (en) | P2P content delivery method based on social attribute of users and system adopting same | |
| CN101217565B (en) | A network organization method of classification retrieval in peer-to-peer network video sharing system | |
| CN110866046B (en) | Extensible distributed query method and device | |
| CN111046065B (en) | Extensible high-performance distributed query processing method and device | |
| CN102843420A (en) | Fuzzy division based social network data distribution system | |
| CN104967677A (en) | File transmission method and apparatus based on NDN cache optimization | |
| CN102325093B (en) | Routing system constructing method in structuralized P2P (peer-to-peer) network | |
| EP3902279A1 (en) | Audio and video stream distribution method in audio and video stream distribution system, and dynamic parent node | |
| CN103179191B (en) | P2P network control device and P2P network managing and control system | |
| CN1937553B (en) | Reciprocal network data dispatching method based on flow media data frame | |
| CN106657333B (en) | Centralized directory data exchange system and method based on cloud service mode | |
| CN101668037A (en) | Method for dispatching P2P network | |
| CN101645872B (en) | Business service system of Internet large-scale application environment and working method thereof | |
| CN101616182A (en) | A kind of structure has the method for semantic P2P network | |
| Lingjun et al. | Improving file distribution performance by grouping in peer-to-peer networks | |
| CN107800567B (en) | Method for establishing P2P streaming media network topology model of mixed mode | |
| Anandaraj et al. | An efficient QOS based multimedia content distribution mechanism in P2P network |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081112 Termination date: 20110913 |