CN1937553B - Reciprocal network data dispatching method based on flow media data frame - Google Patents
Reciprocal network data dispatching method based on flow media data frame Download PDFInfo
- Publication number
- CN1937553B CN1937553B CN200610078853A CN200610078853A CN1937553B CN 1937553 B CN1937553 B CN 1937553B CN 200610078853 A CN200610078853 A CN 200610078853A CN 200610078853 A CN200610078853 A CN 200610078853A CN 1937553 B CN1937553 B CN 1937553B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- message
- index information
- 32bit
- 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.)
- Active
Links
Abstract
The invention is a peer-to-peer network data scheduling method based on streaming media data frame, belonging to network technical field, characterized in that it divides all client-end nodes of a system into three classes through member management method: preferred node, backup node and common node, where the preferred node directly obtains data from streaming media server, and the backup and common nodes obtain data from adjacent nodes, but when the preferred node exits, the backup node can be upgraded into a preferred node; data transmission between nodes adopts user datagram protocol (UDP), basic granularity of transmission is UDP data message divided on the basis of streaming data frame; the interaction between adjacent nodes via data buffer area index information and periodical datascheduling operation succeed in implementing the method, reliable, high-efficiency and low-delay.
Description
Technical field
The invention belongs to networking technology area.
Background technology
Peer-to-peer network (Peer-to-Peer is called for short P2P) technology is a focus of present next generation internet technical research, obtains the extensive concern of domestic and international academia and industrial quarters.The Fortune of the U.S. more is referred to as one of four big new technologies that change the internet development.
What the realization of traditional distributed system was mainly taked is the client-server pattern, and the peer-to-peer network technology has fundamentally changed this pattern.In the distributed system that adopts the peer-to-peer network technology to realize, each node promptly serves as client and serves as server again, and the service that enjoying other node provides also provides service for other node simultaneously.Accompanying drawing 1 has provided the basic contrast of client-server pattern and peer-to-peer network pattern.
The peer-to-peer network technology has the distinguishing feature of the following aspects:
(1) decentralization: resource in the system and service are dispersed on each node, and the transmission of information and the realization of service are all directly carried out between node, can need not the intervention of intermediate link and server, have avoided the bottleneck that may exist.Decentralization is the basic characteristics of peer-to-peer network technology, has brought its advantage at aspects such as extensibility, robustnesses thus.
(2) extensibility: in peer-to-peer network, along with the increase of number of users, the increase in demand of service, but the resource of simultaneity factor integral body and service ability also obtain expansion, can easier satisfy user's demand all the time, and whole system is full the distribution, does not have bottleneck.In theory its extensibility almost can think unlimited.
(3) robustness: because the service of peer-to-peer network is dispersed on each node, part node or network are destroyed the influence of other parts very little.Peer-to-peer network is normally set up in the mode of self-organizing, and the permission node adds freely and leaves, and generally can recover automatically when the part node fails, has anti-attack, high fault-tolerant advantage.
(4) high performance-price ratio: adopt the peer-to-peer network framework can effectively utilize calculating, storage, the Internet resources of a large amount of common node of scattering in the Internet, thereby reduce cost.
(5) load balancing: under the peer to peer environment each node be server be again client, reduced requirement to abilities such as server calculating, storage in conventional client-server architecture, because resource distribution at each node, has better realized the load balancing of whole network.
Compare with traditional distributed system, the peer-to-peer network technology has incomparable advantage, has broad application prospects.Various peer-to-peer network application software emerge in an endless stream on the Internet, and number of users sharply increases.The peer-to-peer network technology just constantly is applied to fields such as military field, commercial field, government information, communication.Different according to concrete application, can be divided into following these types to peer-to-peer network:
The peer-to-peer network that provides file and other content to share, for example Napster, Gnutella, eDonkey, emule, BitTorrent etc.;
Excavate peer-to-peer network equity computing capability and storage and share ability, for example Avaki, Popular Power etc.;
Associated treatment and service shared platform, for example JXTA, Magi, Groove .NET My Service etc. based on the peer-to-peer network mode;
Instant messaging exchanges, and comprises ICQ, OICQ, Yahoo Messenger etc.;
The peer-to-peer network communication and the information sharing of safety, for example Skype, Crowds, Onion Routing etc.
The peer-to-peer network technology has obtained the development of high speed like this in recent years, especially itself and the development that will promote the peer-to-peer network technology more that combines of network flow-medium service also will drive developing rapidly of network flow-medium service.
The peer-to-peer network technology is applied to the live streaming media service, and the two big major issues that need to solve are: the foundation of topological structure is the data dispatching method between member's management method and the node.The flow medium live system that exists at present with the realization of peer-to-peer network technology, as DoNet, GridMedia etc., the realization of the data dispatching method between its node, mostly the scheduling granularity is with the second to be that unit splits stream medium data, carries out data dispatch then.Such method exists some weakness, and is low as retransmission efficiency: if the data partial loss in the second, the data of this second must all retransmit so, have wasted a lot of network bandwidths; Efficiency of service is low: after the data that each node must be waited for a second are complete, could provide the data of this second for other node.In order to remedy these weakness, need to realize the peer-to-peer network data dispatching method based on the stream medium data frame efficient, reliable, low time delay.
Summary of the invention
The present invention is in order better to support the large scale network flow medium live system, summed up existing peer-to-peer network technology, and carried out detailed design and optimization, realized the peer-to-peer network data dispatching method based on the stream medium data frame reliable, efficient, low time delay.
The invention is characterized in that this method is divided three classes by member management method each client node with system: first-selected node, standby node, common node; Wherein, first-selected node directly obtains data from streaming media server, and standby node and common node are to obtain data from neighborhood of nodes, but when first-selected node withdrawed from, standby node can upgrade to first-selected node; That the transmission of data is adopted between each node is User Datagram Protoco (UDP) (UDP), and the basic granularity of transmission is to serve as the UDP message message of basis division with the stream medium data frame; Mutual by the data buffer zone index information between the neighborhood of nodes, and the successful realization of periodic data dispatch operation reliable, high efficiency, hang down the peer-to-peer network data dispatching method based on the stream medium data frame of time delay.
Below, will elaborate the workflow of client node in the system.
Step 1, client login system, finish member management method:
Step 1.1, obtain the overall unique number of this node;
Step 1.2, determine the node type of this node: first-selected node, standby node, common node;
Step 1.3, safeguard the data source node tabulation of this node;
Step 1.4 is if first-selected node is seen step 2;
Step 1.5 is if standby node or common node are seen step 3;
The data dispatching method of step 2, first-selected node, accompanying drawing 1 have provided the data dispatch flow chart of first-selected node, are the detailed operation flow process below:
Step 2.1, wait streaming media server send to the data of this node;
Step 2.2, receive the data that streaming media server sends, put into own corresponding data buffer zone;
In step 2.3, the judgment data buffering area whether the data message of losing is arranged;
If step 2.3.1 has, then send the data re-transmission request message to streaming media server, change 2.1 over to;
The data re-transmission request message: the data message numbered list that the overall unique number (32bit) of＜this node, type of message (16bit), reserved word (16bit), the data message that needs to retransmit count m (32bit), need to retransmit (m * 32bit) 〉;
If step 2.3.2 does not have, change 2.1 over to;
The data dispatching method of step 3, standby node and common node is finished dealing with by the reception of periodic operation and message, data, and accompanying drawing 2 has provided the data dispatch flow chart of common node, is the detailed operation flow process below:
Step 3.1, every all period interval (1 second) of a setting, carry out the operation of following steps:
Step 3.1.1, the data buffer zone of searching this node, acquisition does not obtain the frame number FID and the required frame number N of next data dispatch of the start frame of data as yet;
All nodes during step 3.1.2, transmission data buffer zone index information request message are tabulated to the data source node;
Step 3.2, receive and the data buffer zone index information request message of other node carry out Message Processing, have following steps:
Step 3.2.1, return bandwidth measurement message to other node that sends this data buffer zone index information request message, wherein reserved word Z generates at random;
The composition of bandwidth measurement message: the overall unique number (32bit) of＜this node, type of message (16bit), reserved word Z (16bit) 〉;
Step 3.2.2, to other node return data buffering area index information request feedback message that sends this data buffer zone index information request message, wherein reserved word Z is identical with step 3.2.1;
The composition of data buffer zone index information request feedback message: the local data buffering area index information of the overall unique number (32bit) of＜this node, type of message (16bit), reserved word Z (16bit), the N continuous frame that begins with frame number FID 〉;
Step 3.3, receive the bandwidth measurement message of other node A, carry out Message Processing, have following steps:
The reserved word of step 3.3.1, record node A is the time T 1 that the bandwidth measurement message of Z arrives, and is accurate to millisecond;
Step 3.4, receive and the data buffer zone index information request feedback message of other node A carry out Message Processing, have following steps:
Step 3.4.1, upgrade the buffering area index information of this node A in the tabulation of the data source node of this node;
Step 3.4.2, the reserved word of receiving node A are that the time of this message of Z is T2, are accurate to millisecond;
Step 3.4.3, calculating A arrive the bandwidth of this node: Band=message-length/(T2-T1), the bandwidth value of node A in the data source node tabulation of this node upgraded;
Step 3.5, every all period interval (1 second) of a setting, carry out the operation of following steps:
Step 3.5.1, obtain do not obtain as yet in the own buffering area data, the 1 data message numbered list that second, data and needing retransmitted that needs of dispatching office this time, list item be＜data message numbering (32bit), possible data source node overall situation numbering set, the selected data set provider node overall situation number (32bit);
Step 3.5.2, in data source node tabulation, be each data message in the step 3.5.1 tabulation, according to the buffering area index information, seek possible data source, if this node has the data of this message numbering, then this node is joined in the set of the corresponding possible data source node overall situation of step 3.5.1 numbering, finish up to whole list search;
Step 3.5.3, the tabulation of step 3.5.1 is sorted from small to large according to what of each possible data source node of being had of numbering;
Step 3.5.4, be each the message numbering specified data supplier in the sorted tabulation;
Step 3.5.4.1, the set of the overall situation of data source node if possible numbering have only a node, and then this node is the data set provider of this message;
If step 3.5.4.2 set has a plurality of nodes simultaneously, select in these nodes that the node of bandwidth value maximum is the data set provider of this message in the tabulation of data source node, simultaneously the bandwidth value of this node is deducted the length of a message;
Step 3.5.5, send data request information to each data set provider node of choosing, the data message that wherein needs is counted m and is and selects the data message number of this node as own data set provider among the step 3.5.4;
The composition of data request information: the data message numbered list that the overall unique number (32bit) of＜this node, type of message (16bit), reserved word (16bit), the data message that needs count m (32bit), need (m * 32bit) 〉;
Step 3.6, receive the data request information of other node, carry out Message Processing, have following steps:
Step 3.6.1, from message, obtain the data message numbered list that needs;
Step 3.6.2, to the tabulation in each message numbering in the buffering area of this node, seek data one by one;
If step 3.6.2.1 has data, then this data message is sent to data requester;
Step 3.7, receive the data message that other node sends, put into own corresponding data buffer zone;
Description of drawings
Fig. 1 has provided the data dispatch basic flow sheet of first-selected node;
Fig. 2 has provided the data dispatch basic flow sheet of common node;
Claims (1)
1. based on the peer-to-peer network data dispatching method of stream medium data frame, it is characterized in that this method is divided three classes by member management method each client node with system: first-selected node, standby node, common node; Wherein, first-selected node directly obtains data from streaming media server, and standby node and common node are to obtain data from neighborhood of nodes, but when first-selected node withdrawed from, standby node upgraded to first-selected node; That the transmission of data is adopted between each node is User Datagram Protoco (UDP) UDP, and the basic granularity of transmission is to serve as the UDP message message of basis division with the stream medium data frame; Mutual by the data buffer zone index information between the neighborhood of nodes, and the successful realization of periodic data dispatch operation reliable, high efficiency, hang down the peer-to-peer network data dispatching method based on the stream medium data frame of time delay; Be the groundwork step of client node below:
Step 1, client login system, finish member management method:
Step 1.1, obtain the overall unique number of this node;
Step 1.2, determine the node type of this node: first-selected node, standby node, common node;
Step 1.3, safeguard the data source node tabulation of this node;
Step 1.4 is if first-selected node is seen step 2;
Step 1.5 is if standby node or common node are seen step 3;
The data dispatching method of step 2, first-selected node:
Step 2.1, wait streaming media server send to the data of this node;
Step 2.2, receive the data that streaming media server sends, put into own corresponding data buffer zone;
In step 2.3, the judgment data buffering area whether the data message of losing is arranged;
If step 2.3.1 has, then send the data re-transmission request message to streaming media server, change 2.1 over to;
The data re-transmission request message: the data message that the overall unique number 32bit of＜this node, type of message 16bit, reserved word 16bit, needs retransmit is counted m 32bit, is needed the data message numbered list m * 32bit of re-transmission 〉;
If step 2.3.2 does not have, change 2.1 over to;
The data dispatching method of step 3, standby node and common node, finish dealing with by the reception of periodic operation and message, data:
Step 3.1, every all period interval in 1 second, carry out the operation of following steps:
Step 3.1.1, the data buffer zone of searching this node, acquisition does not obtain the frame number FID and the required frame number N of next data dispatch of the start frame of data as yet;
All nodes during step 3.1.2, transmission data buffer zone index information request message are tabulated to the data source node;
Step 3.2, receive and the data buffer zone index information request message of other node carry out Message Processing, have following steps:
Step 3.2.1, return bandwidth measurement message to other node that sends this data buffer zone index information request message, wherein reserved word Z generates at random;
The composition of bandwidth measurement message: the overall unique number 32bit of＜this node, type of message 16bit, reserved word Z16bit 〉;
Step 3.2.2, to other node return data buffering area index information request feedback message that sends this data buffer zone index information request message, wherein reserved word Z is identical with step 3.2.1;
The composition of data buffer zone index information request feedback message: the local data buffering area index information of the overall unique number 32bit of＜this node, type of message 16bit, reserved word Z16bit, the N continuous frame that begins with frame number FID 〉;
Step 3.3, receive the bandwidth measurement message of other node A, carry out Message Processing, have following steps:
The reserved word of step 3.3.1, record node A is the time T 1 that the bandwidth measurement message of Z arrives, and is accurate to millisecond;
Step 3.4, receive and the data buffer zone index information request feedback message of other node A carry out Message Processing, have following steps:
Step 3.4.1, upgrade the buffering area index information of this node A in the tabulation of the data source node of this node;
Step 3.4.2, the reserved word of receiving node A are that the time of this message of Z is T2, are accurate to millisecond;
Step 3.4.3, calculating A arrive the bandwidth of this node: Band=message-length/(T2-T1), the bandwidth value of node A in the data source node tabulation of this node upgraded;
Step 3.5, every all period interval in 1 second, carry out the operation of following steps:
Step 3.5.1, obtain do not obtain as yet in the own buffering area data, the 1 data message numbered list that second, data and needing retransmitted that needs of dispatching office this time, list item be＜data message numbering 32bit, possible data source node overall situation numbering set, the selected data set provider node overall situation number 32bit;
Step 3.5.2, in data source node tabulation, be each data message in the step 3.5.1 tabulation, according to the buffering area index information, seek possible data source, if this node has the data of this message numbering, then this node is joined in the set of the corresponding possible data source node overall situation of step 3.5.1 numbering, finish up to whole list search;
Step 3.5.3, the tabulation of step 3.5.1 is sorted from small to large according to what of each possible data source node of being had of numbering;
Step 3.5.4, be each the message numbering specified data supplier in the sorted tabulation;
Step 3.5.4.1, the set of the overall situation of data source node if possible numbering have only a node, and then this node is the data set provider of this message;
If step 3.5.4.2 set has a plurality of nodes simultaneously, select in these nodes that the node of bandwidth value maximum is the data set provider of this message in the tabulation of data source node, simultaneously the bandwidth value of this node is deducted the length of a message;
Step 3.5.5, send data request information to each data set provider node of choosing, the data message that wherein needs is counted m and is and selects the data message number of this node as own data set provider among the step 3.5.4;
The composition of data request information: data message numbered list m * 32bit that the data message of the overall unique number 32bit of＜this node, type of message 16bit, reserved word 16bit, needs is counted m 32bit, needed 〉;
Step 3.6, receive the data request information of other node, carry out Message Processing, have following steps:
Step 3.6.1, from message, obtain the data message numbered list that needs;
Step 3.6.2, to the tabulation in each message numbering in the buffering area of this node, seek data one by one;
If step 3.6.2.1 has data, then this data message is sent to data requester;
Step 3.7, receive the data message that other node sends, put into own corresponding data buffer zone.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610078853A CN1937553B (en) | 2006-05-11 | 2006-05-11 | Reciprocal network data dispatching method based on flow media data frame |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610078853A CN1937553B (en) | 2006-05-11 | 2006-05-11 | Reciprocal network data dispatching method based on flow media data frame |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1937553A CN1937553A (en) | 2007-03-28 |
| CN1937553B true CN1937553B (en) | 2010-05-12 |
Family
ID=37954833
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200610078853A Active CN1937553B (en) | 2006-05-11 | 2006-05-11 | Reciprocal network data dispatching method based on flow media data frame |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1937553B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5047607B2 (en) * | 2006-12-26 | 2012-10-10 | パナソニック株式会社 | Stream recording apparatus, stream recording method, recording system, and recording / reproducing system |
| CN101170506B (en) * | 2007-12-06 | 2010-06-02 | 北京广视通达网络技术有限公司 | A P2P stream media data dispatching method based on response drive |
| CN101815077B (en) * | 2009-02-20 | 2013-01-23 | 中国电信股份有限公司 | Data transmission method and system in P2P live streaming |
| EP3096496B1 (en) | 2009-12-17 | 2018-03-14 | Intel Corporation | Method and system for facilitating one-to-many data transmissions with reduced network overhead |
| CN104038492A (en) * | 2014-06-10 | 2014-09-10 | 四川长虹电器股份有限公司 | P2P (Peer To Peer) technology based streaming media distribution method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6850981B1 (en) * | 2000-07-14 | 2005-02-01 | At&T Corp. | System and method of frame scheduling for QoS-driven wireless local area network (WLAN) |
| US20050033640A1 (en) * | 2003-08-07 | 2005-02-10 | Abb Technology Flb Ab | Peer-to-peer computing system |
| CN1604569A (en) * | 2004-10-29 | 2005-04-06 | 清华大学 | A robust point to point based stream scheduling method |
-
2006
- 2006-05-11 CN CN200610078853A patent/CN1937553B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6850981B1 (en) * | 2000-07-14 | 2005-02-01 | At&T Corp. | System and method of frame scheduling for QoS-driven wireless local area network (WLAN) |
| US20050033640A1 (en) * | 2003-08-07 | 2005-02-10 | Abb Technology Flb Ab | Peer-to-peer computing system |
| CN1604569A (en) * | 2004-10-29 | 2005-04-06 | 清华大学 | A robust point to point based stream scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1937553A (en) | 2007-03-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chockler et al. | Spidercast: a scalable interest-aware overlay for topic-based pub/sub communication | |
| Ren et al. | On reducing mesh delay for peer-to-peer live streaming | |
| CN1937553B (en) | Reciprocal network data dispatching method based on flow media data frame | |
| CN102420864B (en) | Massive data-oriented data exchange method | |
| Spaho et al. | P2P solutions to efficient mobile peer collaboration in MANETs | |
| CN101645918B (en) | Internode collaboration method in P2P system | |
| CN101873345A (en) | Integrated block switching P2P shared-file system and method for motivating seed-providing for other nodes thereof | |
| CN101494664B (en) | P2P push type network storage method based on JXTA | |
| Kuo et al. | Advanced bootstrap and adjusted bandwidth for content distribution in peer-to-peer live streaming | |
| Jiang et al. | A replica placement algorithm for hybrid CDN-P2P architecture | |
| CN100433657C (en) | Peer-to-peer network member managing method for large-scale stream media live sysetm | |
| Miguel et al. | Resource-constrained P2P streaming overlay construction for efficient joining under flash crowds | |
| Caviglione et al. | Design of a peer-to-peer system for optimized content replication | |
| Hsu et al. | Message transmission techniques for low traffic P2P services | |
| CN101510198A (en) | Flooding file search method covering whole web | |
| Hoong et al. | A Two-layer Super-Peer based P2P Live Media Streaming System. | |
| Filep | Challenges and Decisions in WOBCompute Design, a P2P Computing System Architecture | |
| Wu et al. | Time-critical data dissemination in cooperative peer-to-peer systems | |
| Xu et al. | Improving QoS in peer-to-peer streaming media system | |
| Hua et al. | A P2P architecture for supporting group communication in CSCW systems | |
| Ktari et al. | Empowering chord DHT overlays | |
| Chen et al. | Parallel downloading algorithm for large-volume file distribution | |
| Schiely et al. | Tit-for-tat revisited: Trading bandwidth for reliability in P2P media streaming | |
| Darlagiannis et al. | Sampling cluster endurance for peer-to-peer based content distribution networks | |
| Merz et al. | On the Construction of a Super-Peer Topology underneath Middleware for Distributed Computing |
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 |