CN1316783C - Data restoring method for application layer group broadcast - Google Patents
Data restoring method for application layer group broadcast Download PDFInfo
- Publication number
- CN1316783C CN1316783C CNB2004100626026A CN200410062602A CN1316783C CN 1316783 C CN1316783 C CN 1316783C CN B2004100626026 A CNB2004100626026 A CN B2004100626026A CN 200410062602 A CN200410062602 A CN 200410062602A CN 1316783 C CN1316783 C CN 1316783C
- Authority
- CN
- China
- Prior art keywords
- data
- node
- recovery
- controlling packet
- nodes
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to the technical field of data communication, particularly to a data restoring method for application layer group broadcasts. 1) a data sending tree is constructed in a terminal host machine of group communication by making use of the existing protocol of application layer group broadcasts; 2) the format of a control package of data searching recovery points which needs to be transmitted is determined; 3) the protocol of the application layer group broadcasts is revised; each node can send and process the control package looking for the data recovery points and can send and process the control packet for authenticating and selecting the data recovery points; 4) the protocol of the application layer group broadcasts is revised, after each node detects grouping loss, the node sends requests to the data recovery point and receives recovery data. The present invention provides the recovery data to group members and avoids the loss of data under the condition of occurring the loss of data by looking for potential nodes as data recovery points for each member in the sending tree, and the goal of transmission reliability is increased. The present invention is suitable for being realized in the application process of data transmission service of group broadcasts by making use of the application layer or the terminal host machine.
Description
Technical field
The present invention relates to data communication technology field, particularly a kind of data reconstruction method that is used for application layer multicast.
Background technology
It is the inexorable trend of network development that group communication service is provided on Next Generation Internet, and the application of this respect comprises video/audio meeting, long-distance education, Web TV, online game or the like.The IP of Ti Chuing (Intemet Protocol) is though multicasting technology can reduce the load that data send the source at first, effectively utilize Internet resources, but, there is not good transmission controlling mechanism and can't configuration on a large scale in network because to need router is each multicast address preservation state.Application layer multicast utilizes end host to support group communication, the management of multicast member, multicast packet duplicate etc. that correlation function all is placed on application layer or end host is finished.It goes without doing any change of existing router, and can utilize existing TCP (Transmission Control Protocol) or UDP (User DatagramProtocol) transmission data, be convenient to dispose and enforcement, therefore probably become the standard of following group communication technology.
It is to be solved that yet application layer multicast also has some problems to have, wherein Zui Da problem is that the application layer multicast change in topology is very frequent, any group membership adds or leaves multicast group and can cause topology change, thereby have influence on the transmission of multicast packet, it is special when the group membership breaks away from multicast group because of system crash, can cause other member to lose multicast packet, therefore how provide restore data just to become problem demanding prompt solution in the application layer multicast to the group membership.The application layer multicast agreement that has proposed at present not can solve the problem of this respect.
Summary of the invention
The object of the present invention is to provide a kind of data reconstruction method that is used for application layer multicast.Step comprises:
During sending in data, for each group membership seeks possible data recovery point, the possible data recovery point that finds is carried out discriminated union select the suitable data recovery point, and occurring under the situation of loss of data, utilize the data recovery point to transmit obliterated data, reach the purpose of reliable transmitting data in network to the group membership of obliterated data.
For each group membership seeks possible data recovery point, it is a kind of random walk in sending tree, each node produces pair of random numbers u and v, at first jump to walking u near the direction of data source, jump to the v that is directed downwards away more subsequently away from data source, can take two kinds of strategies in the time of migration downwards, select one at random as next-hop node from several children, perhaps the slowest child of specific data forwarding speed is as next-hop node.
The node that finds is carried out discriminated union select the suitable data recovery point, utilized overall unique application layer packet sequence number, judge according to requesting node and the sequence number difference that the node that finds receives data, have only when the sequence number difference greater than zero the time, the node that finds just possesses the qualification as recovery nodes, and from can be used as the alternative node of recovery point, several select the method for final recovery point, can choose more suitably recovery point according to the requirement of different business, for the file transfer business, select the point of sequence number difference maximum, the point of sequence number difference minimum is selected in transmission for Streaming Media.
Occurring utilizing the data recovery point to transmit obliterated data under the situation of loss of data to the group membership of obliterated data, can adopt two kinds of different data recovery policies, reduce the redundant data that occurs in the network if desired, then can only allow the child nodes of failure node carry out the data recovery, and by these nodes to other affected nodes transmission restore data, and if accelerate the speed of restore data and improve restore data
The present invention is based upon the network that computer is formed, be to pass through computer network, utilize end host or application layer to carry out the process of point-to-multipoint or multi-multipoint group communication, the group membership who mentions in the invention, node all are computers, and invention is intercomed mutually by these computers and finishes.Invention provides a kind of data reconstruction method that is used for application layer multicast.Purpose is in order to solve during the application layer multicast data send, when some group membership was lost efficacy and the problem of other group membership's obliterated data of causing being correlated with.It is by during transfer of data, judge that each group membership receives the progress of data in group, for each group membership seeks suitable data recovery point, and after perceiving loss of data, send request to the data recovery point rapidly, provide restore data by the data recovery point, thereby solve the data loss problem that occurs in the application layer multicast.
The present invention is by sending in data in the tree to each member seeks potential node as the data recovery point, and occurring utilizing recovery point restore data to be provided and to accomplish to avoid loss of data to the group membership under the situation of loss of data, provides the purpose of transmission reliability.Characteristics of the present invention are, each group membership independently seeks potential data recovery point, the ability of data recovery point is confirmed to search out with enhancing the possibility of data recovery point by the application layer packet sequence number, can select different data recovery points according to the demand of different application, after loss of data occurring, the group membership can be independently from the different recovery points data that are restored, finally reach the purpose that the efficient recovery obliterated data is arranged.
Technical scheme
In order further to set forth innovation part of the present invention, at first introduce the basic conception relevant with the present invention.The member who participates in group communication need utilize data of application layer multicast agreement structure to send tree and send to carry out data, and data source is a root node.Each node (group membership) that sends on the tree has a father node and zero to a plurality of child nodes.There is not the node of child nodes to be called leaf node.Each node receives the data of data source transmission there and data is transmitted to child nodes subsequently from father node.In Fig. 1 (a, b, c), pm is the father node of m, and pn is the father node of n, and m and n are respectively the child nodes of pm and pn, and m and n are leaf nodes.Node in the tree can be done following division according to its role's in invention difference.Can provide the node of obliterated data to be called recovery nodes to other nodes, recovery nodes need have the vacant number of degrees.The node of seeking recovery nodes is called requesting node, and the node that runs in the searching process is an intermediate node, and the node that might be used as recovery nodes is called alternative node.In Fig. 1 (a, b, c), m is a requesting node, and pm and pn are intermediate nodes, and o and n are alternative nodes, and n is a recovery nodes.
The grouping that data source sends has the application layer packet sequence number, can grouping of unique identification in whole group.Can receive the progress (speed) of the application layer sequence number decision node reception data of grouping according to node.
Concrete scheme:
1) utilizes existing application layer multicast protocol, carry out at needs that construction data sends tree in the end host of group communication;
2) form of the controlling packet of the searching data recovery point that determine to need sends, and the form of the controlling packet that the data recovery point is authenticated and selects;
3) revise the application layer multicast agreement, make each node can send and handle the controlling packet of seeking the data recovery point and the controlling packet that the data recovery point is authenticated and selects;
4) revise the application layer multicast agreement, make each node after detecting packet loss, can send request, and receive restore data to the data recovery point.
Concrete grammar step of the present invention is as follows:
The step that need carry out as a requesting node is:
1) requesting node m generation form is the controlling packet of Class1, and this controlling packet is sent to father node; The controlling packet of Class1 comprise pair of random numbers (u, v); U represent from this node along send tree upwards (near data source) need the jumping figure of process, and v be illustrated in recall through the u step after, beginning is the jumping figure of (away from data source) process downwards.
2) after m received the controlling packet of type 2, transmission types was 3 controlling packet, and the characteristics of type 3 controlling packet are to carry the application layer packet sequence number seq1 from data source that current time m receives;
3) m receives from the data recovery nodes of therefrom selecting optimal node as m after the controlling packet of different node type of feedback 4; Two kinds of strategies of selecting recovery nodes are arranged, the first, the node of selecting sequence number difference seq1-seq2 maximum is as recovery nodes, and the recovery nodes of Xuan Zeing provides the ability of restore data the strongest to m like this, is suitable for file transfer; The second, the node of selection sequence number difference seq1-seq2 minimum is recovery nodes the most, and it is the shortest that the recovery nodes of Xuan Zeing provides the time delay of restore data like this, is suitable for the Streaming Media transmission;
4) selected n is as recovery nodes, and m sends heartbeat message to n and sending in the tree and capable recovery nodes as m to guarantee n;
5) if m does not receive the controlling packet of type 4 from any node, perhaps in a period of time, do not receive the heartbeat message that recovery nodes n sends, m restarts from step 2;
6) after m perceives loss of data, the log-on data Restoration Mechanism; Time data recovery mechanism has two kinds of strategies, if expectation reduces the redundant data that occurs in the network, execution in step 7 so, if expect to have the more node data that are restored, execution in step 8 so;
7) if the node m father node operate as normal whether of checking it is its father node operate as normal, then m log-on data Restoration Mechanism not.Have only the child nodes of crashed node to carry out time data recovery mechanism in the whole transmission tree, they send recovery request to recovery nodes separately, after requesting node is received restore data, transmit restore data to child nodes;
8) each perceives the node difference log-on data Restoration Mechanism of loss of data, to recovery nodes request msg separately.After requesting node is received restore data, transmit restore data to child nodes, if certain node is received the restore data of repetition from its father node, then send to father node and suppress message, father node is no longer transmitted restore data to child node after receiving and suppressing message.The step that need carry out as an intermediate node is:
1) child nodes of utilizing the application layer packet sequence number to follow the trail of it receives the progress of data, the child nodes that the recorder data are the slowest;
2) receive the controlling packet of Class1 after, make the following judgment: if u＞0, and this node is not root node, and u subtracts one so, and controlling packet is transmitted to father node; If u=0 or this node have been root nodes, u=0 sends to child nodes to controlling packet so; If u=0, v＞0, and this node is not leaf node, v subtracts one so, and controlling packet is transmitted to child nodes; If u=0, v=0 or this node have been leaf nodes, v equals 0 so, and controlling packet is transmitted end-of-job, arrives node n.Transmit control to child nodes and be surrounded by two kinds of strategies, a kind of strategy is a random fashion, promptly select one at random from all child nodes, as the next-hop node that controlling packet is transmitted, another mode then is the slowest child nodes that controlling packet is transmitted to record in the step 1; The step that need carry out as an alternative node is:
1) alternative node inspection it whether possess necessary condition as the data recovery point, promptly whether it is free remaining number to connect new node.If there are not the vacant number of degrees, node does not remake any work so, if having, node need send the controlling packet that form is a type 2 to m, and the controlling packet of type 2 comprises alternative address of node;
2) after alternative node is received the controlling packet of type 3, relatively its grouping serial number seq2 that receives from data source and the relation of seq1, if seq2＜seq1, so alternative node is 4 controlling packet to the m transmission types, otherwise alternative node is not done anything, and type 4 controlling packet comprise grouping serial number difference seq1-seq2; The step that need carry out as a recovery nodes is:
1) sends heartbeat message to requesting node;
2) receive the data recovery request of requesting node after, send restore data to requesting node;
The present invention has following advantage: alleviated certain group membership's collapse in network at first greatly, and the problem of the offspring group membership obliterated data that causes.Secondly, the task that data are recovered is born by numerous nodes in the transmission tree, the group membership who has avoided all obliterated datas is together to data source request restore data, cause data source to load too greatly and the problem of network congestion, the group membership of the 3rd obliterated data can be independently from the different recovery nodes data that are restored, thereby solved the obliterated data relativity problem, accelerated the speed that obliterated data recovers.At last, algorithm adopts different data recovery policies, can satisfy the different requirements of different application aspect the data recovery.
The present invention relates to and utilize end host or application layer that the muticast data transmission service is provided, is a kind of method that improves the application layer multicast data transmission credibility.Realize in the application that the present invention is adapted at utilizing application layer or end host to carry out the muticast data transmission service.
Description of drawings
Fig. 1 illustrates node m to seek recovery point n and carry out the procedure chart that data are recovered under the situation of obliterated data.
Fig. 1 a signal sends the node m in the tree, sends the procedure chart of random walk controlling packet.
Fig. 1 b signal node m utilizes the application layer packet sequence number node n and node o to be carried out the procedure chart of qualification authentication.
After the father node of Fig. 1 c signal node m lost efficacy, m utilized n to carry out the procedure chart that data are recovered.
The step that the node of different role need be carried out during Fig. 2 had illustrated to invent.
Embodiment
Fig. 1 illustrates to send the node m in the tree, utilizes the method among the present invention to carry out the overall process figure that recovery point is sought and data are recovered
Fig. 1 a represents that node m utilizes the random walk strategy to seek the process of possible recovery nodes n, and node m sends the random walk controlling packet, and (u=2 v=2), arrives node o, and (u=2 v=3), arrives node n to send the random walk controlling packet.
Fig. 1 b represents the process that node m utilizes the application layer packet sequence number that node o and node n are carried out qualification authentication, and promptly node m confirms which node can be as the data recovery point, and the final data recovery point of selecting is n.
After Fig. 1 c represented that the father node of node m lost efficacy, m utilized n to carry out the process that data are recovered.
Fig. 2 has illustrated the node of different role in the invention, requesting node, intermediate node, selected node, the workflow of recovery nodes.
The present invention is a kind of method that improves the application layer multicast data transmission credibility.The present invention by in sending tree for each member seeks potential node as the data recovery point, and occurring utilizing recovery point restore data to be provided and to accomplish to avoid loss of data under the situation of loss of data, the purpose of raising transmission reliability to the group membership.Realize in the application that the present invention is adapted at utilizing application layer or end host to carry out the muticast data transmission service.
Claims (6)
1, a kind of method of the business that adopts end host to carry out group communication being carried out the data recovery, step comprises: during sending in data, for each group membership seeks possible data recovery point, the possible data recovery point that finds is carried out discriminated union select the suitable data recovery point, and occurring under the situation of loss of data, utilize the data recovery point to transmit obliterated data, reach the purpose of reliable transmitting data in network to the group membership of obliterated data;
Describedly seek possible data recovery point for each group membership, it is a kind of mode of random walk in sending tree, each node produces pair of random numbers u and v, at first jump to walking u near the direction of data source, jump to the v that is directed downwards away more subsequently away from data source, can take two kinds of strategies in the time of migration downwards, select one at random as next-hop node from several children, perhaps the slowest child of specific data forwarding speed is as next-hop node;
Describedly the node that finds is carried out discriminated union select the suitable data recovery point, utilized overall unique application layer packet sequence number, judge according to requesting node and the sequence number difference that the node that finds receives data, have only when the sequence number difference greater than zero the time, the node that finds just possesses the qualification as recovery nodes, and from can be used as the alternative node of recovery point, several select the method for final recovery point, can choose more suitably recovery point according to the requirement of different business, for the file transfer business, select the point of sequence number difference maximum, the point of sequence number difference minimum is selected in transmission for Streaming Media;
Describedly occurring utilizing the data recovery point to transmit obliterated data under the situation of loss of data to the group membership of obliterated data, can adopt two kinds of different data recovery policies, reduce the redundant data that occurs in the network if desired, then can only allow the child nodes of failure node carry out the data recovery, and by these nodes to other affected nodes transmission restore data, and if accelerate the speed of restore data and improve the probability of restore data, then can allow each affected node independently carry out the data recovery.
2, the method that the business that adopts end host to carry out group communication is carried out the data recovery according to claim 1, its step is as follows:
1) utilizes existing application layer multicast protocol, carry out at needs that construction data sends tree in the end host of group communication;
2) form of the controlling packet of the searching data recovery point that determine to need sends, and the form of the controlling packet that the data recovery point is authenticated and selects;
3) revise the application layer multicast agreement, make each node can send and handle the controlling packet of seeking the data recovery point and the controlling packet that the data recovery point is authenticated and selects;
4) revise the application layer multicast agreement, make each node after detecting packet loss, can send request, and receive restore data to the data recovery point.
3, the method that the business that adopts end host to carry out group communication is carried out the data recovery according to claim 1, the step that need carry out as a requesting node is:
1) requesting node m generation form is the controlling packet of Class1, and this controlling packet is sent to father node; The controlling packet of Class1 comprise pair of random numbers (u, v);
2) after m received the controlling packet of type 2, transmission types was 3 controlling packet, and the characteristics of type 3 controlling packet are to carry the application layer packet sequence number seq1 from data source that current time m receives;
3) m receives from the data recovery nodes of therefrom selecting optimal node as m after the controlling packet of different node type of feedback 4;
4) selected n is as recovery nodes, and m sends heartbeat message to n and sending in the tree and capable recovery nodes as m to guarantee n;
5) if m does not receive the controlling packet of type 4 from any node, perhaps in a period of time, do not receive the heartbeat message that recovery nodes n sends, m restarts from step 2;
6) after m perceives loss of data, the log-on data Restoration Mechanism; Time data recovery mechanism has two kinds of strategies, if expectation reduces the redundant data that occurs in the network, execution in step 7 so, if expect to have the more node data that are restored, execution in step 8 so;
7) if the node m father node operate as normal whether of checking it is its father node operate as normal, then m log-on data Restoration Mechanism not; Otherwise node is carried out time data recovery mechanism, to recovery nodes transmission recovery request separately, after requesting node is received restore data, transmits restore data to child nodes;
8) each perceives the node difference log-on data Restoration Mechanism of loss of data, to recovery nodes request msg separately, after requesting node is received restore data, transmit restore data to child nodes, if certain node is received the restore data of repetition from its father node, then send to father node and suppress message, father node is no longer transmitted restore data to child node after receiving and suppressing message.
4, the method that the business that adopts end host to carry out group communication is carried out the data recovery according to claim 1, the step that need carry out as an intermediate node is:
1) child nodes of utilizing the application layer packet sequence number to follow the trail of it receives the progress of data, the child nodes that the recorder data are the slowest;
2) receive the controlling packet of Class1 after, make the following judgment: if u＞0, and this node is not root node, and u subtracts one so, and controlling packet is transmitted to father node; If u=0 or this node have been root nodes, u=0 sends to child nodes to controlling packet so; If u=0, v＞0, and this node is not leaf node, v subtracts one so, and controlling packet is transmitted to child nodes; If u=0, v=0 or this node have been leaf nodes, v equals 0 so, controlling packet is transmitted end-of-job, arrives node n, transmits control to child nodes and is surrounded by two kinds of strategies, a kind of strategy is a random fashion, promptly select one at random from all child nodes, as the next-hop node that controlling packet is transmitted, another mode then is the slowest child nodes that controlling packet is transmitted to record in the step 1.
5, the method that the business that adopts end host to carry out group communication is carried out the data recovery according to claim 1, the step that need carry out as an alternative node is:
1) alternative node inspection it whether possess necessary condition as the data recovery point, be whether it is free remaining number to connect new node, if there are not the vacant number of degrees, node does not remake any work so, if have, node need send the controlling packet that form is a type 2 to m, and the controlling packet of type 2 comprises alternative address of node;
2) after alternative node is received the controlling packet of type 3, relatively its grouping serial number seq2 that receives from data source and the relation of seq1, if seq2＜seq1, so alternative node is 4 controlling packet to the m transmission types, otherwise alternative node is not done anything, and type 4 controlling packet comprise grouping serial number difference seq1-seq2.
6, the method that the business that adopts end host to carry out group communication is carried out the data recovery according to claim 1, the step that need carry out as a recovery nodes is:
1) sends heartbeat message to requesting node;
2) receive the data recovery request of requesting node after, send restore data to requesting node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100626026A CN1316783C (en) | 2004-06-30 | 2004-06-30 | Data restoring method for application layer group broadcast |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100626026A CN1316783C (en) | 2004-06-30 | 2004-06-30 | Data restoring method for application layer group broadcast |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1588862A CN1588862A (en) | 2005-03-02 |
| CN1316783C true CN1316783C (en) | 2007-05-16 |
Family
ID=34603736
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100626026A Expired - Fee Related CN1316783C (en) | 2004-06-30 | 2004-06-30 | Data restoring method for application layer group broadcast |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1316783C (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100396161C (en) * | 2006-03-10 | 2008-06-18 | 华为技术有限公司 | Method for realizing broadcast multicast service in mobile communication system |
| CN101192959B (en) * | 2006-11-28 | 2011-04-20 | 中兴通讯股份有限公司 | A recovery method for multicast service connection in automatic switching optical network |
| KR101971623B1 (en) | 2012-05-10 | 2019-04-23 | 삼성전자주식회사 | Method for contents and user's interactions among multiple devices |
| CN103916822B (en) * | 2014-04-11 | 2017-12-22 | 华中师范大学 | The quick reorientation method and system of Mobile solution layer multicast |
| CN106169947A (en) * | 2016-07-11 | 2016-11-30 | 美的集团股份有限公司 | Data transmission method, the first equipment and the second equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030120917A1 (en) * | 2001-12-20 | 2003-06-26 | Nec Corporation | Application layer multicast system and intermediate node therefor |
| US6735201B1 (en) * | 1998-10-07 | 2004-05-11 | Cisco Technology, Inc. | Efficient network multicast switching apparatus and methods |
-
2004
- 2004-06-30 CN CNB2004100626026A patent/CN1316783C/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6735201B1 (en) * | 1998-10-07 | 2004-05-11 | Cisco Technology, Inc. | Efficient network multicast switching apparatus and methods |
| US20030120917A1 (en) * | 2001-12-20 | 2003-06-26 | Nec Corporation | Application layer multicast system and intermediate node therefor |
Non-Patent Citations (1)
| Title |
|---|
| 基于层次结构的可靠组播协议的改进 常潘，张卫，计算机应用，第23卷第12期 2003 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1588862A (en) | 2005-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7355975B2 (en) | Method and apparatus for group communication with end-to-end reliability | |
| US9838166B2 (en) | Data stream division to increase data transmission rates | |
| CN106656784B (en) | Data stream propagation system and method for block chain network | |
| EP4054117B1 (en) | Computer-implemented system and method for propagation and communication of data in a network such as a blockchain network | |
| CN101414949B (en) | Chain data transmission method, node and system | |
| US7920532B2 (en) | Method and apparatus for providing distributed service composition model for ad hoc networks | |
| CN101053211B (en) | Method and apparatus for configuring and managing a robust overlay multicast tree | |
| CN106254410A (en) | Network system and method for establishing data connection | |
| Fei et al. | A proactive tree recovery mechanism for resilient overlay multicast | |
| CN101651620B (en) | Method for reconstructing Overlay multicast tree, multicast tree node and multicast tree system | |
| CN1316783C (en) | Data restoring method for application layer group broadcast | |
| EP1699169A1 (en) | Wireless base station, wireless mobile device, and wireless access network for reducing signalling traffic | |
| US8451847B2 (en) | Intermediate node device, method of controlling intermediate node device, and network system | |
| CN101304359B (en) | Method and apparatus for RRPP looped network link recuperation | |
| US7827243B2 (en) | Method for transmitting file based on multiplex forwarder | |
| CN102244602B (en) | Method, device and system for forwarding data under protocol independent multicast dual join | |
| US8605721B1 (en) | Scalable island multicast for peer-to-peer media delivery | |
| Kostić et al. | High-bandwidth data dissemination for large-scale distributed systems | |
| Jeon et al. | Overlay multicast tree recovery scheme using a proactive approach | |
| CN101958845A (en) | Method for recovering multicast routing tree by proactive reconstruction in overlay network environment | |
| CN101075842B (en) | Method for transmitting multi cast data in shared network | |
| Jin et al. | TCMM: hybrid overlay strategy for P2P live streaming services | |
| Takahashi et al. | Robust network construction method in multiple tree-based application level multicast | |
| Awiphan et al. | A contribution-aware multiple parent overlay network for P2P media streaming | |
| CN117749668A (en) | Heartbeat detection method and device |
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 | ||
| ASS | Succession or assignment of patent right |
Owner name: ZHEJIANG XUNBO INFORMATION ENGINEERING CO., LTD. Free format text: FORMER OWNER: INSTITUTE OF COMPUTING TECHNOLOGY HINESE ACADEMY OF SCIENCES Effective date: 20130105 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100080 HAIDIAN, BEIJING TO: 314300 HANGZHOU, ZHEJIANG PROVINCE |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20130105 Address after: Hangzhou City, Zhejiang province Xiaoshan District 314300 City Center Road No. 72 Tianchen International Plaza 6 Patentee after: Zhejiang Xunbo Information Engineering Co., Ltd. Address before: 100080 No. 6 South Road, Zhongguancun Academy of Sciences, Beijing Patentee before: Institute of Computing Technology, Chinese Academy of Sciences |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070516 Termination date: 20150630 |
|
| EXPY | Termination of patent right or utility model |