Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L12/00—Data switching networks
  • H04L12/02—Details
  • H04L12/16—Arrangements for providing special services to substations
  • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
  • H04L12/1854—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with non-centralised forwarding system, e.g. chaincast
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L45/00—Routing or path finding of packets in data switching networks
  • H04L45/48—Routing tree calculation
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
  • H04L67/1044—Group management mechanisms 
  • H04L67/1053—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
  • H04L67/1087—Peer-to-peer [P2P] networks using cross-functional networking aspects
  • H04L67/1089—Hierarchical topologies

Definitions

• the present invention relates to the field of data transmission technology, and in particular to a method, node and system for link data transmission.
• P2P peer-to-peer
• node-to-node technology is a popular data transmission technique.
• P2P at the same time of receiving data a device may also transmit the received data to other devices.
• the bandwidth available between the destination devices that are otherwise idle can thus be used.
• P2P is employed in the above scenario, the intra-network bandwidth available between the destination devices can be used effectively, potentially reducing the amount of data transmission on the inter-network bandwidth between different network sections and saving the inter-network bandwidth resources.
• each device typically can only control sending from and receiving data to itself (e.g., controlling the sending rate and the receiving rate, and the number of destination devices, etc.), and a unitary control for data transmission of an entire network typically cannot be achieved at a single device using the transmission mechanism of P2P.
• the amount of data transmission is too large, it may overwhelm and paralyze the network.
• FIG. 1 is a schematic diagram of a system for link data transmission in accordance with some embodiments.
• FIG. 2 is a schematic diagram of another system for link data transmission in accordance with some embodiments.
• FIG. 3 is a flowchart of implementing a method in accordance with some embodiments.
• Fig. 4 is a schematic diagram of a node for link data transmission in accordance with some embodiments.
• Fig. 5 is a schematic diagram of another node for link data transmission in accordance with some embodiments.
• Fig. 6 is a schematic diagram of still another node for link data transmission in accordance with some embodiments.
• the invention can be implemented in numerous ways, including as a process; an apparatus; a system; a composition of matter; a computer program product embodied on a computer readable storage medium; and/or a processor, such as a processor configured to execute instructions stored on and/or provided by a memory coupled to the processor.
• these implementations, or any other form that the invention may take, may be referred to as techniques.
• the order of the steps of disclosed processes may be altered within the scope of the invention.
• a component such as a processor or a memory described as being configured to perform a task may be implemented as a general component that is temporarily configured to perform the task at a given time or a specific component that is manufactured to perform the task.
• the term 'processor' refers to one or more devices, circuits, and/or processing cores configured to process data, such as computer program instructions.
• a link copy (LCP) technique is provided herein.
• LCP link copy
• the system includes a data source node and at least one data destination node.
• a tree connection is established between the data source node and the data destination node.
• the data destination node is a child node of the data source node.
• Fig. 1 is a schematic diagram of a system for link data transmission in accordance with some embodiments.
• 101 denotes a data source node
• 111- 114 denote data destination nodes
• the lines between the nodes denote connections established between the nodes.
• a node refers to a computing device capable of transmitting and receiving data. It can be seen that the system is of a two-level tree structure, the source node 101 is a parent node in the tree structure and each of the destination nodes 111-114 is a child node of the node 101.
• the nodes 111-114 have the same parent node 101 and are thus sibling nodes of one another.
• the arrows between the nodes indicate the data transmission occurring in the system. It can be seen that the data source node 101 sends data to a child node (denoted by 111 in Fig. 1) of itself; upon receiving the data, one of the data destination nodes 111-114 sends the received data to a sibling node of itself. To avoid repeated data transmission, the sibling node should be selected as a node that has not obtained the data to be transmitted.
• the data transmission path indicated in the figure is 111— ⁇ 112 ⁇ 113 ⁇ 114. When the node 114 receives the data, all the sibling nodes of it have already received the data to be transmitted. Therefore, the node 114 does not send data to another node and the data transmission is terminated.
• Fig. 2 is a schematic diagram of another system for link data transmission in accordance with some embodiments.
• the system of Fig. 2 differs from that of Fig. 1 in that the system shown in Fig. 2 includes a three-level tree structure.
• the source node 201 is a parent node in the tree structure and each of the destination nodes 211-215 is a child node of node 201.
• Nodes 211-215 are sibling nodes of one another.
• Each of the nodes 212a and 212b is a child node of the node 212.
• Nodes 212a and 212b are sibling nodes of each other.
• Node 214a is a child node of node 214.
• a destination node with a child node may send the received data to a child node in addition to a sibling node.
• node 212 sends the data to 213 of its sibling nodes and 212a of its child nodes
• node 214 sends the data to 215 of its sibling nodes and 214a of its child nodes.
• a data transmission mechanism implemented by each node in a link data transmission system in accordance with some embodiments may be summarized as a flow shown in Fig. 3, which includes the following steps.
• a current node obtains data to be transmitted. If the current node is a data source node, the obtained data is the original data to be transmitted. If the current node is a data destination node, it receives the data to be transmitted that is sent from another node.
• the current node sends the data to be transmitted to one of its child nodes, and one of its sibling nodes that has not obtained the data to be transmitted.
• the current node continues to send the data to two nodes. If the two nodes meeting the above conditions cannot be found, no data is sent correspondingly. According to such a transmission mechanism, after being sent out from the source node, data may be sent to all the destination nodes in a traversed way, and no repeated data transmission will occur between the destination nodes.
• the destination nodes in the same network or subnet is connected with a parent node.
• nodes 211-215 are located in the same network A
• nodes 212a and 212b are located in the same network B
• node 214a is located in the network C.
• data may occupy only one data path when being transmitted between network sections, and most of the data is transmitted between sibling nodes in a unidirectional way, thus effectively taking use of the intra-network bandwidth for data transmission.
• a unitary control for the data transmission of the whole network may be achieved simply by controlling this data path.
• the data transmission rate may be controlled at node 201 or 211.
• the parent node Since the parent node needs to manage the relevant information of the child nodes, it often has a relatively high workload. Therefore, in some embodiments it is selected to control the transmission rate at a child node. For example, the rate at which node 211 receives data from node 201 may be controlled at node 211. Because node 211 is the first and only destination node that obtains data from the source node, the rate of the subsequent data transmission between sibling nodes or between a parent node and a sibling node apparently cannot exceed the limited rate, thereby achieving a unitary control for the data transmission of the whole network.
• the rate at which node 211 sends data to node 212 may also be controlled at node 211 (if node 211 has a child node, the rate in which node 211 sends data to the child node may also be controlled at node 211). Further, the data receiving rate, the data sending rate to a succeeding sibling node and the data sending rate to a child node may be controlled at each destination node, thereby achieving a more precise management to the network.
• the above data transmission mechanism may be modified as follows.
• the source node sends the data to be transmitted to the first child node that is connected with it.
• the first child node that is connected with the source node is the first child node that establishes a connection with the source node.
• a destination node receives the data to be transmitted and sends the received data to be transmitted to the first child node that is connected with it and to the first succeeding node that is connected with the parent node of it.
• the first succeeding node that is connected with the parent node of the source node is the sibling node that establishes a connection with the parent node of the source node. Such a node succeeding is hereinafter referred to as a succeeding sibling node.
• a node x may establish a connection with a node y and thus become a child node of node y by registering with node y. Then, node x may send registration information to node y at a certain time interval (e.g., 1 second time interval) so as to keep the connection with node y.
• a parent node may obtain the connection status of a child node in a timely way by detecting the registration information of the child node periodically. Therefore, when the parent node needs to send or forward data, the parent node may know about which child node will receive the data.
• the parent node may remove the child node from its child node list and adjust the transmission strategy.
• the source node 201 sends data to be transmitted to the first child node 211 that registers with it.
• the destination node 211 receives the data to be transmitted that is sent from node 201, and sends the received data to be transmitted to the succeeding sibling node 212 of it (because node 211 has no child node, no sending to a child node takes place).
• the succeeding sibling node 212 is a first sibling node that establishes a connection with the parent node of the source node, for example by registering with the parent node.
• the destination node 212 receives the data to be transmitted that is sent from node 211, and sends the received data to be transmitted to the succeeding sibling node 213 of it, and to the first child node 212a that registers with it.
• the sending rules for other destination nodes can be derived similarly and are not described here.
• a node fails, the parent node of it may be aware of this status by detecting registration information of the child node periodically and make a corresponding adjustment. If node 211 fails, node 201 may delete the information of node 211 from its child node list. Here, node 212 becomes the first child node that registers with node 201. If node 212 fails, node 201 may delete the information of node 212 from its child node list and inform such status to node 211 that registers prior to node 212. Here, node 213 becomes the succeeding sibling node of node 211. [0036] The failures of other nodes can be treated similarly.
• a failure of a node is substantially equivalent to establishment of a new tree connection (this is also the case if a new node is added into the network).
• Each node remains to receive and send data according to the original transmission mechanism. The only change lies in the objects referred to by "the first child node that is connected with it" and "the succeeding sibling node”.
• data is transferred to a second node from a first node, where the first node is at the same tree level as the second node and the first node registers with a common parent prior to the second node.
• This reflects the rule that a destination node sends data to a sibling node of it which has not obtained any data. Also, to determine the direction of data transmission according to the order in which the nodes register facilitate the management to the data transmission.
• data to be transmitted may be divided into a number of data blocks for transmission at the sender node.
• the receiver node e.g., the destination node
• the receiver node checks whether all the data blocks have been received and if not, only needs to request the sender node to resend the lost data blocks.
• data is transmitted between computers in the form ' of files. Transmission of each file is handled by a separate thread, which is termed as FileTask.
• a FileTask is divided into four phases: OpenFile (starting transmission of file), Blocks (transmitting contents of file), EndFile (ending transmission of file) and RecovFile (recovering lost blocks).
• OpenFile starting transmission of file
• Blocks transmitting contents of file
• EndFile ending transmission of file
• RecovFile recovery lost blocks.
• a file is transmitted in the form of file blocks. The receiver node performs a check when receiving a file block. If a data error occurs, recovery of the erroneous data blocks may be requested separately during the RecovFile phase, and there is no need to retransmit the whole file.
• a FileTask is established first at the sender node, including a task child node list (FileClients) and a task succeeding sibling node list (FileNexts) of the sender node.
• FileClients task child node list
• FileNexts task succeeding sibling node list
• the receiver node may also establish a new FileTask, also including a FileClients and a FileNexts of the receiver node.
• FileTask all the control messages, including OpenFile and EndFile messages, may be sent to all the nodes that are recorded in the FileClients, and the data message Block may be sent to the first node that is recorded in the FileClients and FileNexts.
• the control messages and data message arrive in an order of OpenFile— >Block ⁇ EndFile.
• each node can also handle such status as wrong order, or error in or lose of some data blocks.
• a file data block Block is received before the OpenFile, a FileTask is still established, but a temporary file is opened for writing file data. If the OpenFile is lost, necessary file information may also be obtained from the EndFile. The name of the temporary file may be changed after the file information (for example path of file) is obtained from the OpenFile or EndFile.
• the path of file is updated after the EndFile is received (the receipt will check the path of file if the OpenFile has already been received), the number of Blocks in the FileTask is updated, the reception of the Blocks is checked, and the message RecovBlock is issued to recover blocks. Afterwards, the FileTask still can receive a data block: for the OpenFile, the path of file is checked; for the Block, there is no difference between a normally sent Block and RecovBlock, and the Block is disregarded directly if having been received successfully and is otherwise written into the file.
• the EndFile message contains the number of Blocks. If all the Blocks are received successfully, the FileTask exits the cycle of processing the data blocks.
• an error processing mechanism of a data transmission solution is further introduced.
• data is transmitted between nodes in the form of data blocks, and only erroneous data blocks need to be retransmitted when an error in transmission occurs, thereby effectively saving the transmission time and network bandwidth.
• a node for link data transmission in accordance with some embodiments is provided herein.
• the node is configured to perform the processes described above.
• an example node includes a receiving unit 410 configured to obtain data to be transmitted.
• the receiving unit 410 is configured to obtain original data to be transmitted, and for a destination node, the receiving unit 410 is configured to receive the data to be transmitted that is sent from another node.
• the node additionally includes a sending unit 420 configured to send, when the node for link data transmission has at least one child node, the data to be transmitted that is received by the receiving unit 410 to one of the at least one child node, and send when the node for link data transmission has at least one sibling node that has not obtained the data to be transmitted the data to be transmitted that is received by the receiving unit 410, to one of the at least one sibling node.
• a sending unit 420 configured to send, when the node for link data transmission has at least one child node, the data to be transmitted that is received by the receiving unit 410 to one of the at least one child node, and send when the node for link data transmission has at least one sibling node that has not obtained the data to be transmitted the data to be transmitted that is received by the receiving unit 410, to one of the at least one sibling node.
• the sending unit 420 may include a first sending subunit
• a second sending subunit 422 configured to send the data to be transmitted that is received by the receiving unit to a node that succeeds the node for link data transmission and is the first node connected with the parent node of the node for link data transmission.
• the above two sending subunits substantially represent a further optimization of the sending unit 420.
• data is transferred to a node from the node at the same level that registers previously to it. This reflects the rule that a destination node sends data to a sibling node of it which has not obtained any data. Also, to determine the direction of data transmission according to the order in which the nodes register facilitates the management to the data transmission.
• the node for link data transmission may further include: a rate control unit 430 configured to control the data receiving rate of the receiving unit 410 and/or the data sending rate of the sending unit 420. If the receiving unit receives the data to be transmitted that is sent from another node, the node for link data transmission may further include a data check unit 440 configured to check whether the data to be transmitted that is received by the receiving unit 410 is complete and if not, request the data sending node to resend the lost parts of the data.
• the units described above can be implemented as software components executing on one or more general purpose processors, as hardware such as programmable logic devices and/or Application Specific Integrated Circuits designed to perform certain functions or a combination thereof.
• the sending unit and the receiving unit are implemented as communication interface hardware that execute supporting software and firmware.
• the units can be embodied by a form of software products which can be stored in a nonvolatile storage medium (such as optical disk, flash storage device, mobile hard disk, etc.), including a number of instructions for making a computer device (such as personal computers, servers, network equipments, etc.) implement the methods described in the embodiments of the present invention.
• the units may be implemented on a single device or distributed across multiple devices. The functions of the units may be merged into one another or further split into multiple sub-units.
• the description of the device embodiments that substantially correspond to the method embodiments is relatively brief and reference may be made to the passages for the method embodiments for the details.
• the device embodiments described above are merely illustrative, where the units that are described as separate components may be or may not be physically separate from each other, and the components indicated as units may be or may not be physical units, and may be disposed at the same site, or distributed over multiple network elements. Parts or all of the modules may be selected as required to achieve the objects of the embodiments according to the present invention, which can be understood and implemented by those skilled in the art without inventive effort.
• the device includes one or more processors and one or more memory for providing the processors) with instructions. The processors) are configured to perform the functions of the one or more units described above.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Computing Systems (AREA)
• Physics & Mathematics (AREA)
• Mathematical Physics (AREA)
• Theoretical Computer Science (AREA)
• Computer And Data Communications (AREA)
• Small-Scale Networks (AREA)

Priority Applications (2)

Applications Claiming Priority (4)

Publications (1)

Family

ID=40595274

Family Applications (1)

Country Status (5)

Families Citing this family (16)

Citations (4)

Family Cites Families (13)

• 2008
  • 2008-11-28 CN CN200810180167.5A patent/CN101414949B/zh not_active Expired - Fee Related
• 2009
  • 2009-11-23 US US12/592,342 patent/US8379645B2/en active Active
  • 2009-11-24 WO PCT/US2009/006264 patent/WO2010062384A1/en not_active Ceased
  • 2009-11-24 JP JP2011538600A patent/JP5274669B2/ja active Active
  • 2009-11-24 EP EP09829470.5A patent/EP2356753B1/en active Active
• 2013
  • 2013-01-14 US US13/740,750 patent/US8743881B2/en active Active

Patent Citations (4)

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events