CN102387072B - Application layer multicasting method supporting heterogeneous terminal and heterogeneous network environment - Google Patents
Application layer multicasting method supporting heterogeneous terminal and heterogeneous network environment Download PDFInfo
- Publication number
- CN102387072B CN102387072B CN201110312787.1A CN201110312787A CN102387072B CN 102387072 B CN102387072 B CN 102387072B CN 201110312787 A CN201110312787 A CN 201110312787A CN 102387072 B CN102387072 B CN 102387072B
- Authority
- CN
- China
- Prior art keywords
- node
- layer
- dtu
- service centre
- user
- 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 invention discloses an application layer multicasting method supporting a heterogeneous terminal and a heterogeneous network environment, which is characterized in that a tree-type layering network framework based on a service covering network and a P2P (peer-peer) covering network realizes a media data transmitting method which comprehensively considers the heterogeneous terminal and the heterogeneous network environment. Firstly, the tree-type layering network framework based on the service covering network and the P2P covering network comprehensively considers heterogeneous network environments of different ISP networks and inner and outer networks, and realizes media data transmission supporting heterogeneous networks; and secondly, a media data transmitting layering network framework based on the heterogeneous networks comprehensively considers terminal heterogeneous factors such as network types, network band width, online time and resolution ratio of user nodes, so that the media data transmitting method supporting the heterogeneous terminal is realized.
Description
Technical field
The present invention relates to multi-media network transmission technology, particularly a kind of network real-time multimedia live broadcasting method.
Background technology
The growth at full speed of the universal and network bandwidth of the development of computer technology, Internet, makes once on Internet, can only carry out simple written communication and turns to gradually as the real-time network-multimedia application such as video and audio interchange as modes such as Email.Current, the application that the multimedia technologies such as live, the program request of Streaming Media are relevant is day by day fiery, and multi-media network transmission technology is had higher requirement as multimedia coding, multicasting technology etc.How high-quality, large-scale real-time multimedia service are provided, have become research and focus and the difficult point applied.
Multimedia direct seeding technique based on service coverage network can provide better services quality to user, but lower deployment cost is higher, application small scale.Adopt P2P (point-to-point) overlay network multimedia transmission technology can make full use of node resource, make can carry out exchanges data between node, reduce bandwidth consumption, be conducive to large-scale application deployment.Yet under actual heterogeneous network environment, P2P cover network multicasting technology has some limitations.Such as, the transmission speed of different I SP (ISP) intermediate node may be subject to the restriction of ISP, causes live quality to reduce and even can not carry out, and is difficult to carry out data retransmission between Intranet node.In addition, due to the isomerism of terminal in reality, P2P multicast performance is subject to the impact of the many factors such as access bandwidth, online hours and terminal resolution isomery of access node, causes terminal heterogeneous property also to become the problem of restriction P2P technical development.Applicant is new through looking into, and retrieves the following several pieces of related to the present invention patents that belong to application layer multicast field, they respectively:
1. towards the two-stage distributed application layer group broadcasting method (application number 200710035300) of MSVMT problem.
2. heterogeneous network information broadcasting method and the system (application number 201010173194) of based on connatural grid, dividing into groups.
3. realize the system and method (application number 200910090613) that end-to-end service of heterogeneous network QoS controls for one kind.
In above-mentioned patent 1, inventor has proposed the two-stage distributed application layer group broadcasting method towards MSVMT problem, adopt and keep the node of load balance to add method, adopt and can select the PPAF of comprehensive balance delay and out-degree heuristic, adopt the tree precedence partition formula application layer multicast construction method of the trunk topological construction method based on triangle rule.
In above-mentioned patent 2, inventor discloses a kind of heterogeneous network information broadcasting method and system based on connatural grid grouping, according to the frequency of described each point, take the frequency that situation obtains each grid in this heterogeneous network and take situation, frequency is taken to the synthetic connatural grid region of grid sets that situation is identical; Take each connatural grid region as one group, the information of each group is encapsulated respectively to framing, then each frame is sent respectively.
In above-mentioned patent 3, a kind of system and method for realizing end-to-end service of heterogeneous network QoS control of inventor.Wherein this system comprises operation layer, key-course and transport layer.Transport layer is connected with described key-course solid element, and the strategy that is converted to end-to-end service of heterogeneous network for the strategic decision-making that described key-course solid element is issued is implemented, and implements described end-to-end service of heterogeneous network to operate according to this strategy.
According to above-mentioned, look into newly, the existing problem of prior art is, all do not consider heterogeneous terminals and heterogeneous network environment, causes the network coverage low, network bandwidth load weight.
Summary of the invention
The object of this invention is to provide a kind of media data transfer approach that considers heterogeneous terminals and heterogeneous network environment, the tree type layered network architecture based on service coverage network and P2P overlay network.
For reaching above object, the present invention takes following technical scheme to be achieved:
A kind of application layer group broadcasting method of supporting heterogeneous terminals and heterogeneous network environment, it is characterized in that, build the tree type layered network architecture based on service coverage network and P2P overlay network, this network architecture is divided into trunk Ceng He branch layer, the tree type service coverage network of trunk layer for building, the tree type P2P overlay network of branch's layer for building, media data is transmitted to branch's node layer by trunk node layer; Trunk layer consists of DTU (data retransmission unit) node and service centre's node, and trunk layer is divided into two-layer from function, and ground floor is responsible for multichannel data retransmission, and realizes the transfer of data between different I SP by operating in the DTU node of two ISP; The second layer is responsible for monophonic data retransmission, except DTU node, every layer of service centre's node that all promising this layer of DTU serves, the DTU node of service centre's this layer of node administration of trunk layer ground floor, and the request of DTU node or user node is redirected to the second layer service centre with this node with identical ISP; The service centre of the trunk layer second layer is responsible for that this layer of DTU multicast tree built and the building of branch's layer tree type P2P multicast tree; Branch's layer consists of user node, according to network type, the network bandwidth, online hours and the resolution of user node, build P2P tree type framework, user node receives media data from the father node of P2P tree type framework, be stored in the data buffer zone of user node, the decoder module of invoke user node is to decoding data, and playback demonstration, the data dispatch module searches forward node list of user node simultaneously, the child node by the data retransmission of data buffer zone to P2P tree type framework.
In such scheme, the described request by DTU node or user node is redirected to that to have the concrete steps of second layer service centre of identical ISP as follows with this node:
First, provide concept and the definition of in algorithm steps, using, the S of ground floor service centre is safeguarding the DTU information list D of this layer
f[1-n], the list S of second layer service centre
n[1-n] with and corresponding root DTU list D
sr[1-n] and direct broadcast band list C < N, Source, T[n
i] >, in channel list, N represents channel n
1, n
2... n
i, Source represents source node information, T[n
i] represent to add channel n
idTU node listing;
Step1:DTU node or user node Node
iconnect the S of ground floor service centre, request adds direct broadcast band n
i, the S of service centre is according to this node IP address judgement Node
iplace ISP, and search current channel list C < N, Source, T[n
i] N=n in >
idTU list T[n
i], find and Node
iin the second layer root DTU of same ISP node D
sr[k], carries out Step4, if can not find, carries out Step2;
Step2: the S of service centre is by the root DTU list D of the second layer
srin [1-n] with Node
ilist D in identical ISP
sr[i-j] (1 <=i <=j <=n) information sends to Node
i, Node
itest and D
srthe RTT time of all DTU nodes in [i-j], obtain with its RTT and postpone minimum DTU node D
sr[k] (i <=k <=j);
Step3: the S of service centre adds D
sr[k] is to T[n
i], if D
sr[k] and T[n
i] in root node not at same ISP, need to be from D
fin [1-n], find out a transit node D
f[f] (1 <=f <=n) makes it to become T[n
i] child nodes of root node, find out and D simultaneously
sr[k] same ISP and postpone the DTU node D of minimum ground floor
f[g] (1 <=g <=n) is as D
fthe child nodes of [f] and D
srthe father node of [k];
Step4: the S of service centre is by the list S of second layer service centre
nin [1-n] with D
srthe S of service centre that [k] is corresponding
nthe information of [k] sends to Node
i, Node
ireconnect the S of second layer service centre
n[k];
It is as follows that the service centre of the described trunk layer second layer is responsible for the concrete steps that this layer of DTU multicast tree build:
First, provide concept and the definition of in algorithm steps, using, second layer service centre safeguards DTU node listing DTU < id, d_degree, u_degree, level >, wherein id is the unique identifier of DTU node, d_degree can connect the quantity of DTU node for this node, and u_degree can connect the quantity of user node for this node, and level is the number of plies at this node place;
DTU multicast tree to build concrete steps as follows:
Step1:DTU node D
iconnect the S of ground floor service centre, request adds direct broadcast band n
i, S is redirected algorithm by its corresponding S of second layer service centre according to node request
n[k] information sends to D
i;
Step2:DTU node D
iconnect the S of second layer service centre
n[k], the S of service centre
n[k] judges this node network type of living in, and juxtaposition current search layer N is 1;
Step3: if D
iin outer net, the S of service centre
n[k] adopts BFS mode to travel through N layer, searches first DTU node D that current access DTU node number is less than d_degree
k, by D
ias D
kchild node, if D
iin Intranet, the S of service centre
n[k] adopts BFS mode to travel through N layer, searches first DTU node D that current access DTU node number is less than d_degree and is positioned at outer net
k, by D
ias D
kchild node, if found, exit, otherwise N=N+1, continue to carry out Step3;
The building of the described layer tree type P2P of branch multicast tree comprises to be supported the user node based on relative importance value of intranet and extranet to add and exits algorithm;
1) user node adds algorithm steps:
The user node list USER[id that second layer service centre safeguards, ip, resolution, degree, father_id, father_ip], wherein, id is the unique identification of user node, ip is the IP address of user node, and resolution represents the resolution of user node, and degree represents that user node can be accessed by node number, father_id represents the id of the father node of user node, and father_ip is the IP address of user node father node;
Concrete steps are as follows:
Step1: user node connects the S of ground floor service centre, request adds direct broadcast band n
i, S is redirected algorithm by its corresponding S of second layer service centre according to node request
n[k] information sends to U
i;
Step2: user node U
iconnect the S of second layer service centre
n[k], the S of service centre
n[k] judges this node network type of living in, and juxtaposition current search layer N is 1, and both candidate nodes set set (n) is initialized as sky, and candidate parent node set set (fn) is initialized as sky;
Step3: if this node in outer net, the S of service centre
n[i] adopts BFS mode to travel through N layer, by this layer with ask to add user node and the DTU node that ingress has equal resolution and add both candidate nodes set set (n), if this node in Intranet, the S of service centre
n[i] adopts BFS mode to travel through N layer, by this layer with ask to add ingress and there is equal resolution and the user node in outer net and DTU node and add both candidate nodes set set (n);
Step4: traversal set (n), using the node that wherein access user number of nodes is less than degree as candidate parent node set (fn), if | set (fn) |=0, put N=N+1, jump to Step3, if | set (fn) | > 0, carries out Step5;
Step5: the relative importance value π that calculates each node in set (fn)
i, the node of selection relative importance value maximum, using this node as newly added node U
ifather node, if the relative importance value of node is identical in set (fn), node of random choose is as the father node of new node, wherein node U
irelative importance value π
icomputational methods as follows:
In formula:
T
i---the online hours of node i;
C
i---the network bandwidth of node i;
B---the shared bandwidth of a road multi-medium data;
K
i---the child node number of node i;
T
j---the online hours of the child node j of node i;
C
j---the network bandwidth of the downstream site j of node i;
K
j---the child node number of node j;
2) to exit algorithm steps as follows for user node:
Step1: user node U
igive the S of second layer service centre of its current connection
n[i] sends an exit message;
Step2: the S of service centre
n[i] receives after message, according to U
iid find its father node f
n, give f
nsend this node exit message;
Step3: the S of service centre
n[i] calculates U
icurrent out-degree D (n) and its father node f
nresidue out-degree D (f
n), if D (n)≤D (f
n), by U
idownstream site receive node f
nunder, and jump to Step5, otherwise forward Step4 to;
Step4: from exiting node U
ichild node set set (C
n) middle m the node hildren (i) that selects relative importance value maximum, make
then by node f
nand children (i) is as residue node set (C
nthe candidate parent node of)-children (i), residue node downstream site structure is constant, adopts user node to add algorithm to join in system, then forwards Step5 to;
Step5: exit node U
idownstream site all join after system, node U
ilog off.
Compared with prior art, advantage of the present invention is: adopt the tree type layered network architecture based on service coverage network and P2P overlay network, considered the heterogeneous network environment of different I SP network and intranet and extranet, and the heterogeneous terminals factor of the network type of user node, the network bandwidth, online hours and resolution, realized support heterogeneous network and heterogeneous terminals media data efficiently, transmit fast.
Accompanying drawing explanation
Fig. 1 is heterogeneous network lower leaf mixing overlay network configuration topological diagram of the present invention.
Fig. 2 is trunk layer DTU node deployment figure in Fig. 1.
Fig. 3 is the network type schematic diagram of known decision node.
Fig. 4 is known breadth First and breadth-first topology schematic diagram.
Fig. 5 is the mixed figure that take of the DTU multicast tree intranet and extranet of the trunk layer second layer in Fig. 1.
Fig. 6 is the present invention's total bandwidth comparison diagram that resolution terminal multicast tree takies unlike the prior art.Wherein Fig. 6 (a) is prior art, and Fig. 6 (b) is of the present invention.
The heterogeneous terminals node of Tu7Wei Fig. 1 branch layer adds first search illustraton of model.
The heterogeneous terminals node of Tu8Wei Fig. 1 branch layer exits schematic diagram, wherein Fig. 8 (a) for terminal node exits front schematic diagram; Fig. 8 (b) is rear schematic diagram for terminal node exits.
Embodiment
For a more clear understanding of the present invention, below in conjunction with accompanying drawing, the present invention is described in further detail.
1, the tree type layered network architecture based on service coverage network and P2P overlay network
Tree type layered network architecture topological diagram based on service coverage network and P2P overlay network in the present invention as shown in Figure 1.
As shown in Figure 1, the node relating in tree type layered network architecture based on service coverage network and P2P overlay network is divided into four classes: source node, service centre's node, DTU node and user node, wherein source node is the source Nodes of multi-medium data, service centre's node is in charge of DTU node and user node, build and safeguard overlay topology, DTU node is responsible for repeating multimedia data, and user node receives live multi-medium data, and shows in this locality.
As shown in Figure 1, tree type layered network architecture based on service coverage network and P2P overlay network is divided into trunk Ceng He branch layer, the tree type service coverage network of trunk layer for building, the tree type P2P overlay network of branch's layer for building, media data is transmitted to branch's node layer by trunk node layer;
Trunk layer is divided into again two-layer function, ground floor is responsible for multichannel data retransmission, and realize two transfer of data between different I SP by may operate in the DTU node of two ISP, the second layer is responsible for monophonic data retransmission, except DTU node, every layer of service centre's node that all promising this layer of DTU serves, the DTU node of service centre's this layer of node administration of ground floor, and the request of DTU node or user node is redirected to the second layer service centre with this node with identical ISP; The service centre of the second layer is responsible for that this layer of DTU multicast tree built and the building of branch's layer tree type P2P overlay network.
The Shu Xing branch layer of branch's layer for building, by user node, formed, and build P2P tree type framework according to network type, the network bandwidth, online hours and the resolution of user node, user node receives media data from the father node of P2P tree type framework, be stored in the data buffer zone of user node, the decoder module of invoke user node is to decoding data, and playback shows, the data dispatch module searches forward node list of user node simultaneously, the child node by the data retransmission of data buffer zone to P2P tree type framework.
Trunk layer DTU node deployment figure is as accompanying drawing 2, and ground floor DTU node is divided according to ISP, wherein has DTU node to operate between different I SP simultaneously, is responsible for the data retransmission between two DTU nodes of different I SP.The second layer consists of DTU multicast tree, and the root DTU of multicast tree is connected with the DTU node of ground floor according to the difference of ISP.The service centre of ground floor has the function of differentiating node place ISP, and the service centre of the second layer has the function that decision node type is outer net or Intranet, differentiates thus the network environment of node, realizes the media data transfer approach of supporting heterogeneous network.
2, the request of DTU node or user node is redirected to the second layer service centre algorithm with this node with identical ISP
Ground floor service centre is safeguarding the DTU information list D of this layer
f[1-n], the list S of second layer service centre
n[1-n] with and corresponding root DTU list D
sr[1-n] and direct broadcast band list C < N, Source, T[n
i] >, in channel list, N represents channel n
1, n
2... n
i, Source represents source node information, T[n
i] represent to add channel n
idTU node listing.
The Maintenance Point list Node < id of second layer service centre, d_degree, u_degree, level >, wherein id is the unique identifier of DTU node and user node, and d_degree, for this node can connect the quantity of DTU node, is 0 concerning user node, u_degree can connect the quantity of user node for this node, and level is the number of plies at this node place.
The service centre of ground floor has the function of the ISP that differentiates node place; The type that the service centre of the second layer has decision node is the function of outer net or Intranet.
1) method of discrimination of DTU node or user node ISP of living in
According to the IP address lookup IP address database of node, can judge place ISP.When having new node request to arrive, ground floor service centre obtains after the real IP address of node, by string searching and with the ISP of the method for calculating subnet mask under IP address database is found this IP address.Then the service centre of ground floor returns to node by the IP of service centre address and the port of the second layer with the identical ISP of this node, and node just can go to connect the service centre of the suitable second layer like this.
When using the computer access Gmail mailbox of education network IP address of 202.117.10.76, the shown IP address of mailbox is 117.32.153.161.If the computer deploy Yi Ge service centre that is 202.117.10.75 in an IP address of the education network that coexists, then goes to connect this service centre with this computer, the IP address that this service centre gets so should be 202.117.10.76.By the socket of the access node of coming, can obtain the IP address of node, the IP address of Gmail mailbox is globally unique IP address, and accessing its accessed IP address must be node real IP address information.And this IP address of 202.117.10.76 should be distributed by NAT mode.So the service centre of ground floor must be deployed in backbone network, it could obtain the real IP of node address like this, just can pass through the correct decision node of IP address base place ISP.
2) request of DTU node or user node is redirected to that to have the second layer service centre algorithm concrete steps of identical ISP as follows with this node:
As node Node
irequest adds direct broadcast band n
itime, first connecting ground floor service centre, ground floor service centre is according to Node
iiP address judgement Node
ithe ISP at place, according to channel n
iwith ISP at current channel list C < N, Source, T[n
i] search in > and whether have and Node
iin the second layer root DTU of same ISP node, if having, ground floor service centre is by the list S of second layer service centre
nin [1-n] with D
srthe S of service centre that [k] is corresponding
nthe information of [k] sends to Node
i, Node
ireconnect the S of second layer service centre
n[k].
If do not find DTU node in current channel list, ground floor service centre is by the root DTU list D of the second layer
srin [1-n] with Node
ilist D in identical ISP
sr[i-j] (1 <=i <=j <=n) information sends to Node
i, Node
itoward D
srin [i-j], all DTU nodes send PING bag, from the ACK bag of receiving, obtain RTT time delay, select the DTU node D of RTT time delay minimum
sr[k] (i <=k <=j);
Ground floor service centre adds D
sr[k] is to T[n
i], if D
sr[k] and T[n
i] in root node not at same ISP, need to be from D
fin [1-n], find out a transit node D
f[f] (1 <=f <=n) makes it to become T[n] child nodes of root node, find out and D simultaneously
srthe DTU node D of the ground floor of [k] same ISP and RTT time delay minimum
f[g] (1 <=g <=n) is as D
fthe child nodes of [f] and D
srthe father node of [k];
The S of ground floor service centre is by the list S of second layer service centre
nin [1-n] with D
srthe S of service centre that [k] is corresponding
nthe information of [k] sends to Node
i, Node
ireconnect the S of second layer service centre
n[k];
3, DTU multicast tree builds algorithm
1) method of the network type of decision node
As shown in Figure 3, IP address is the inner net computer of 192.168.1.20, use 2000 ports to remove to access the server of outer net, when by NAT gateway, it is different from himself IP address that its IP address and port are converted into NAT gateway address 202.117.10.76:7678 automatically.So differentiate the method for node network type of living in, be: node is when connecting the service centre of outer net deployment, the local ip address that oneself is obtained is packaged into message and sends to service centre, IP address the message of the IP address that service centre relatively obtains from socket and the transmission of node, identical is outer net node, otherwise is Intranet node.
2) DTU multicast tree builds
The building method of multicast tree has two kinds: breadth First (BFS-Breadth First Search) and depth-first (DFS-Depth First Search) method.As shown in accompanying drawing 4 (1), in the multicast tree building according to breadth first method, D6 is in ground floor, shown in accompanying drawing 4 (2), in the multicast tree building according to depth first method, D6 node is in the 3rd layer, suppose that transmitting procedure postpones all identical, in breadth First multicast tree, the transfer of data number of plies is few so, and D6 transmission delay is also just low than the D6 in depth-first multicast tree.Therefore the present invention adopts breadth first method from left to right to build second layer DTU multicast tree.
When building DTU tree in heterogeneous network environment, be faced with as the problem of Intranet DTU node service and the problem of utilizing Intranet DTU node bandwidth to increase network utilization.Because penetrating between two Intranet nodes is difficult to realize, therefore the present invention is based on breadth first method, the mixed multicast tree building method of taking of intranet and extranet has been proposed.
The primitive rule that multicast tree is built is as follows:
The father node of a.DTU node can only be DTU node, and it is that d_degree connects DTU node that each DTU node distributes out-degree quota, and out-degree quota is that u_degree connects user node;
B.DTU tree is breadth First tree, and when the DTU out-degree quota of high one deck does not use, the DTU node of low one deck can not be as the alternative father node that newly adds live node;
C. in the DTU of Intranet node, can only be using the DTU node of outer net as father node, its child nodes can only be also outer net node;
The concrete steps that DTU multicast tree is built are as follows:
DTU node D
iconnect the S of ground floor service centre, request adds direct broadcast band n
i, S according to node locating algorithm by its corresponding S of second layer service centre
n[k] information sends to D
i; DTU node D
iconnect the S of second layer service centre
n[k], the S of service centre
n[k] is according to D
iiP address judge this node D
inetwork type of living in, juxtaposition current search layer N is 1; If D
iin outer net, the S of service centre
n[k] adopts BFS mode from left to right to travel through N layer, searches first DTU node D that current access DTU node number is less than d_degree
k, by D
ias D
kchild node; If D
iin Intranet, the S of service centre
n[k] same BFS mode from left to right that adopts travels through N layer, searches first DTU node D that current access DTU node number is less than d_degree and is positioned at outer net
k, by D
ias D
kchild node; If found, exit, otherwise N=N+1 continues traversal and searches;
The DTU multicast tree building according to the mixed method of taking of intranet and extranet as shown in Figure 5.
3, branch's layer tree type P2P multicast tree builds
The building of the layer tree type P2P of branch multicast tree comprises to be supported the user node based on relative importance value of intranet and extranet to add and exits algorithm.
1) user node adds algorithm
After DTU multicast tree has built, in the layer tree type P2P of branch multicast tree, add user node will consider the accessing terminal to network type of user node, the network bandwidth, online hours and resolution isomerism.
Wherein terminal resolution has larger impact to multicast bandwidth: on market, each Terminal Type resolution has tens kinds, the display effect that sends to terminal through the data of the different resolution in source node collection, sends the demonstration that a kind of size of data can be suitable for a segment resolution.The data that for example send 480*320 are that 320*240 can reach satisfied effect on the terminal of 640*480 in resolution.Use 320*480,800*600, these three kinds of big or small data of 1024*768 substantially can meet the demonstration demand of current all terminals.Accompanying drawing 6 has shown that the resolution of different receiving terminals is respectively 1024*768,800*600 and 480*320, receive respectively 3 layers, 2 layers and level 1 data volume, from accompanying drawing 6, can find out, change the position of two nodes, allow total bandwidth drop to 37.8 from 41.8, as can be seen here, node is preferentially received have below equal resolution node and can be reduced bandwidth consumption.
In the present invention, support the method for resolution isomery to need the newly-built first search array that comprises N node of trunk layer second layer service centre, be used for recording the information that has added ingress, nodal information form is:
USER[id，ip，resolution，degree，father_id，father_ip]
Id: the unique identification of node;
Ip: the IP address of node;
Resolution: the resolution of node;
Degree: the out-degree of node;
Father_id: the title of the father node of node, as the unique identification of this node;
Father_ip: the IP address of node father node;
Support the user based on relative importance value of intranet and extranet to add algorithm to be implemented as follows:
User node U
iadd fashionablely, first connect the S of ground floor service centre, request adds direct broadcast band n
i, S according to node locating algorithm by its corresponding S of second layer service centre
n[k] information sends to U
i; U
iconnect the S of second layer service centre
n[k], S
n[k] is according to U
iiP address judge this node network type of living in, juxtaposition current search layer N is 1, both candidate nodes set set (n) is initialized as sky, candidate parent node set set (fn) is also initialized as sky;
If user node U
iin outer net, the S of service centre
n[k] adopts BFS method layering traversal multicast tree N layer from left to right, and node identical with the terminal resolution that adds user node in resolution current layer is added to both candidate nodes set set (n); If user node U
iin Intranet, the S of service centre
n[k] adopts BFS method layering traversal multicast tree N layer from left to right, and node identical with the terminal resolution that adds user node in resolution current layer and in outer net is added to both candidate nodes set set (n);
The node that choose both candidate nodes in set set (n) in, access user number of nodes is less than degree is as candidate parent node set set (fn), if | set (fn) |=0, put N=N+1, continue the lower one deck of traversal, if | set (fn) | > 0, calculate the relative importance value of all candidate parent nodes, select the node of relative importance value maximum as father node, if there is the relative importance value of a plurality of candidate parent nodes identical, choose at random a node as father node.Accompanying drawing 7 has provided BFS model.
Wherein, the relative importance value π of node i
icomputational methods as follows:
In formula:
T
i---the online hours of node i;
C
i---the network bandwidth of node i;
B---the shared bandwidth of a road multi-medium data;
K
i---the child node number of node i;
T
j---the online hours of the child node j of node i;
C
j---the network bandwidth of the downstream site j of node i;
K
j---the child node number of node j;
2) user node exits algorithm
When user node exits P2P multicast tree, need to notify the interdependent nodes such as its father node, child node and service centre, complete the Partial Reconstruction of multicast tree.According to exiting node residing position in multicast tree, need to investigate two kinds of situations: exit node U
ifor leaf node, exit node U
ifor forward node.
A. exit node U
ifor leaf node, work as U
iexit Shi Gei service centre and send exit message, after the exit message of user node is received by service centre, according to the id that exits node, find its father node, send the message that this node exits then to its father node, after its father node is received this message, from forwarding list, delete this node, stop the data retransmission to this node;
B. exit node U
ifor forward node, as node U
iwhile exiting, because it has downstream site, so this node exits, system is had to locality impact.If its downstream site all adds algorithm to add according to user node again, this process need takies the more time, and it is by node U that the present invention adopts strategy
ifather node and larger m the children (i) of relative importance value, make
then by node f
nand children (i) is as the candidate parent node of residue node, remains node downstream site structure constant, adopts user node to add algorithm to join in system;
Specifically exit step:
Exit node U
igive the S of second layer service centre of its current connection
n[i] sends an exit message; As the S of service centre
n[i] receives after node exit message, according to U
iid find its father node f
n, give f
nsend this node exit message; Then the S of service centre
n[i] calculates U
icurrent out-degree D (n) and its father node f
nresidue out-degree D (f
n), if D (n)≤D (f
n), by U
idownstream site receive node f
nunder, node U
ilog off; Otherwise, from exiting node U
ichild node set set (C
n) middle m the node children (i) that selects relative importance value maximum, make
then by node f
nand children (i) is as residue node set (C
nthe candidate parent node of)-children (i), residue node downstream site structure is constant, adopts user node to add algorithm to join in system, will exit node U
idownstream site all join system, node U
ilog off.
Accompanying drawing 8 has been illustrated said process, suppose that all node online hours are identical, node c exits, first calculating a remaining degree is 2, and the son node number of c is 3, can not all receive under a node, then from the child node of c, choose m node until meet such condition: the redundancy of this m node and the redundancy sum of a can meet adding of residue node.Here choose node f and just can satisfy condition, then allow node a and node f as the candidate parent node of residue node g and h, according to user node, add algorithm to join in multicast tree, because the relative importance value of f is higher than a, all node g and node h receive under node f.
Claims (1)
1. an application layer group broadcasting method of supporting heterogeneous terminals and heterogeneous network environment, it is characterized in that, build the tree type layered network architecture based on service coverage network and P2P overlay network, this network architecture is divided into trunk Ceng He branch layer, the tree type service coverage network of trunk layer for building, the tree type P2P overlay network of branch's layer for building, media data is transmitted to branch's node layer by trunk node layer; Trunk layer consists of data retransmission cells D TU node and service centre's node, trunk layer is divided into two-layer from function, ground floor is responsible for multichannel data retransmission, and realizes the transfer of data between different I SP by operating in the DTU node of the ISP of Liang Ge ISP; The second layer is responsible for monophonic data retransmission, except DTU node, every layer of service centre's node that all promising this layer of DTU serves, the node S of service centre of trunk layer ground floor manages the DTU node of this layer, and the request of DTU node or user node is redirected to the node S of second layer service centre with this node with identical ISP
n[k]; Service centre's node of the trunk layer second layer is responsible for that this layer of DTU multicast tree built and the building of branch's layer tree type P2P multicast tree; Branch's layer consists of user node, according to network type, the network bandwidth, online hours and the resolution of user node, build P2P tree type framework, user node receives media data from the father node of P2P tree type framework, be stored in the data buffer zone of user node, the decoder module of invoke user node is to decoding data, and playback demonstration, the data dispatch module searches forward node list of user node simultaneously, the child node by the data retransmission of data buffer zone to P2P tree type framework;
In such scheme, the described request by DTU node or user node is redirected to that to have the concrete steps of second layer service centre node of identical ISP as follows with this node:
First, provide concept and the definition of in algorithm steps, using, ground floor service centre node maintenance the DTU information list D of this layer
f[1-n], the node listing S of second layer service centre
n[1-n] with and corresponding root DTU list D
sr[1-n] and direct broadcast band list C<N, Source, T[n
i] >, in channel list, N represents channel n
1, n
2... n
i, Source represents source node information, T[n
i] represent to add channel n
idTU node listing;
Step1:DTU node or user node Node
iconnect ground floor service centre node, request adds direct broadcast band n
i, service centre's node is according to this node IP address judgement Node
iplace ISP, and search current channel list C<N, Source, T[n
i] N=n in >
idTU list T[n
i], find and Node
iin the second layer root DTU of same ISP node D
sr[k], carries out Step4, if can not find, carries out Step2;
Step2: service centre's node is by the root DTU list D of the second layer
srin [1-n] with Node
ilist D in identical ISP
sr[i-j] (1<=i<=j<=n) information sends to Node
i, Node
itest and D
srrTT two-way time of all DTU nodes in [i-j], obtains with its RTT and postpones minimum DTU node D
sr[k] (i<=k<=j);
Step3: service centre's node adds D
sr[k] is to T[n
i], if D
sr[k] and T[n
i] in root node not at same ISP, need to be from D
fin [1-n], find out a transit node D
f[f] (1<=f<=n) makes it to become T[n
i] child nodes of root node, find out and D simultaneously
sr[k] same ISP and postpone the DTU node D of minimum ground floor
f[g] is (1<=g<=n) as D
fthe child nodes of [f] and D
srthe father node of [k];
Step4: service centre's node is by the list S of second layer service centre
nin [1-n] with D
srthe node S of second layer service centre that [k] is corresponding
nthe information of [k] sends to Node
i, Node
ireconnect the node S of second layer service centre
n[k];
It is as follows that service centre's node of the described trunk layer second layer is responsible for the concrete steps that this layer of DTU multicast tree build:
First, provide concept and the definition of in algorithm steps, using, the node maintenance DTU of second layer service centre node listing DTU<id, d_degree, u_degree, level>, wherein id is the unique identifier of DTU node, d_de
gree can connect the quantity of DTU node for this node, and u_degree can connect the quantity of user node for this node, and level is the number of plies at this node place;
DTU multicast tree to build concrete steps as follows:
Step1:DTU node D
iconnect ground floor service centre node, request adds direct broadcast band n
i, S is redirected algorithm by its corresponding node S of second layer service centre according to node request
n[k] information sends to D
i;
Step2:DTU node D
iconnect the node S of second layer service centre
n[k], the node S of service centre
n[k] judges this node network type of living in, and juxtaposition current search layer N is 1;
Step3: if D
iin outer net, the node S of second layer service centre
n[k] adopts BFS mode to travel through N layer, searches first DTU node D that current access DTU node number is less than d_degree
k, by D
ias D
kchild node, if D
iin Intranet, the node S of second layer service centre
n[k] adopts BFS mode to travel through N layer, searches first DTU node D that current access DTU node number is less than d_degree and is positioned at outer net
k, by D
ias D
kchild node, if found, exit, otherwise N=N+1, continue to carry out Step3;
The building of the described layer tree type P2P of branch multicast tree comprises to be supported the user node based on relative importance value of intranet and extranet to add and exits algorithm;
1) user node adds algorithm steps:
The user node list USER[id of second layer service centre node maintenance, ip, resolution, degree, father_id, father_ip], wherein, id is the unique identification of user node, ip is the IP address of user node, and resolution represents the resolution of user node, and degree represents that user node can be accessed by node number, father_id represents the id of the father node of user node, and father_ip is the IP address of user node father node;
Concrete steps are as follows:
Step1: user node connects the node S of ground floor service centre, request adds direct broadcast band n
i, S is redirected algorithm by its corresponding node S of second layer service centre according to node request
n[k] information sends to U
i;
Step2: user node U
iconnect the node S of second layer service centre
n[k], the node S of service centre
n[k] judges this node network type of living in, and juxtaposition current search layer N is 1, and both candidate nodes set set (n) is initialized as sky, candidate parent node set set (f
n) be initialized as sky;
Step3: if this node is in outer net, service centre's node adopts BFS mode to travel through N layer, this layer and request are added to user node and the DTU node that ingress has equal resolution and add both candidate nodes set set (n), if this node is in Intranet, service centre node adopts BFS mode to travel through N layer, by this layer with ask to add ingress and there is equal resolution and the user node in outer net and DTU node and add both candidate nodes set set (n);
Step4: traversal set (n), using the node that wherein access user number of nodes is less than degree as candidate parent node set (f
n), if | set (f
n) |=0, put N=N+1, jump to Step3, if | set (f
n) | >0, carries out Step5;
Step5: calculate set (f
n) in the relative importance value π i of each node, select the node of relative importance value maximum, using this node as newly added node U
ifather node, if set (f
n) in the relative importance value of node identical, node of random choose is as the father node of new node;
2) to exit algorithm steps as follows for user node:
Step1: user node U
isend an exit message to the second layer service centre node of its current connection;
Step2: service centre's node is received after message, according to U
iid find its father node f
n, give f
nsend this node exit message;
Step3: service centre's node calculates U
icurrent out-degree D (n) and its father node f
nresidue out-degree D (f
n), if D (n)≤D (f
n), by U
idownstream site receive node f
nunder, and jump to Step5, otherwise forward Step4 to;
Step4: from exiting node U
ichild node set set (C
n) middle m node selecting relative importance value maximum
Step5: exit node U
idownstream site all join after system, node U
ilog off.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110312787.1A CN102387072B (en) | 2011-10-15 | 2011-10-15 | Application layer multicasting method supporting heterogeneous terminal and heterogeneous network environment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110312787.1A CN102387072B (en) | 2011-10-15 | 2011-10-15 | Application layer multicasting method supporting heterogeneous terminal and heterogeneous network environment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102387072A CN102387072A (en) | 2012-03-21 |
| CN102387072B true CN102387072B (en) | 2014-04-23 |
Family
ID=45826068
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110312787.1A Expired - Fee Related CN102387072B (en) | 2011-10-15 | 2011-10-15 | Application layer multicasting method supporting heterogeneous terminal and heterogeneous network environment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102387072B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9002991B2 (en) * | 2013-04-06 | 2015-04-07 | Miranda Technologies Partnership | System and methods for cloud-based media play out |
| CN103368770B (en) * | 2013-06-18 | 2017-09-29 | 华中师范大学 | Adaptive ALM overlay networks based on gateway-level topology are built and maintenance system |
| CN103997527B (en) * | 2014-05-23 | 2019-05-31 | 中国人民解放军理工大学 | A kind of meteorological model information distribution system based on heterogeneous network |
| CN105743727B (en) * | 2014-12-10 | 2019-11-05 | 南京中兴新软件有限责任公司 | Detection processing method and device |
| CN108924609B (en) * | 2018-07-13 | 2021-06-29 | 广州虎牙信息科技有限公司 | Streaming media data transmission method, electronic equipment, device and storage medium |
| CN113993166B (en) * | 2021-11-03 | 2023-08-04 | 嘉兴国电通新能源科技有限公司 | Heterogeneous D2D network-oriented small base station jitter load balancing avoiding method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953413A (en) * | 2006-09-13 | 2007-04-25 | 华中科技大学 | An organization method for tree network of control stream in the stream media living broadcast system |
| CN101924678A (en) * | 2009-06-09 | 2010-12-22 | 华为技术有限公司 | Flow localizing method and device in P2P (Point-to-Point) direct broadcasting system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7457288B2 (en) * | 2003-12-26 | 2008-11-25 | Electronics And Telecommunications Research Institute | Relay multicast system and method for providing efficient group communication service |
-
2011
- 2011-10-15 CN CN201110312787.1A patent/CN102387072B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953413A (en) * | 2006-09-13 | 2007-04-25 | 华中科技大学 | An organization method for tree network of control stream in the stream media living broadcast system |
| CN101924678A (en) * | 2009-06-09 | 2010-12-22 | 华为技术有限公司 | Flow localizing method and device in P2P (Point-to-Point) direct broadcasting system |
Non-Patent Citations (4)
| Title |
|---|
| DiffStream: A Multi-Channel Multimedia Content Dissemination Strategy using MDC;Shan Jiang等;《2009 Eighth International Conference on Grid and Cooperative Computing》;20090829;9-15 * |
| Shan Jiang等.DiffStream: A Multi-Channel Multimedia Content Dissemination Strategy using MDC.《2009 Eighth International Conference on Grid and Cooperative Computing》.2009,9-15. |
| 多P2P覆盖网络的贷款分配方法;张未展;《西安交通大学学报》;20100430;第44卷(第4期);5-8 * |
| 张未展.多P2P覆盖网络的贷款分配方法.《西安交通大学学报》.2010,第44卷(第4期),5-8. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102387072A (en) | 2012-03-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102387072B (en) | Application layer multicasting method supporting heterogeneous terminal and heterogeneous network environment | |
| Liao et al. | Anysee: Peer-to-peer live streaming | |
| US20130044642A1 (en) | Methods and systems to store and forward multicast traffic | |
| CN103096177B (en) | A kind of VOD method, system, agent node and media server | |
| US7596595B2 (en) | Efficient unicast-based multicast tree construction and maintenance for multimedia transmission | |
| CN1483266A (en) | Multicast route in AD-HOC network | |
| US9591069B2 (en) | Peer-to-peer assist for live media streaming | |
| CN101651708A (en) | Topological construction method of P2P streaming media network | |
| CN101123526B (en) | An implementation method for large-scale stream media transmission structure | |
| CN103368770B (en) | Adaptive ALM overlay networks based on gateway-level topology are built and maintenance system | |
| Rajadurai et al. | Optimization of multicast ad hoc on-demand routing protocol based on genetic algorithm with backup paths in MANET | |
| CN1819556A (en) | Multi-routing broadcasting method with dynamic delay constraining based on minimal generating tree and greedy algorithm | |
| CN101442422B (en) | Data transmission method, system and device | |
| Zheng et al. | Optimal peer-to-peer technique for massive content distribution | |
| Navda et al. | Real-time video stream aggregation in wireless mesh network | |
| CN106034106B (en) | Network-building method, networking management method and device and system | |
| CN102035894B (en) | Distance-based state synchronization method | |
| CN101616465B (en) | Ad hoc network hierarchical routing method | |
| CN103220553B (en) | A kind of video based on IPQAM, P2P and IPTV is broadcast and is optimized system and method | |
| Giacomazzi et al. | Push-pull techniques in peer-to-peer video streaming systems with tree/forest topology | |
| Nari et al. | An efficient algorithm for overlay multicast routing in videoconferencing applications | |
| Maheswari et al. | Location-aware resilient hybrid overlay structures for peer-to-peer video streaming | |
| Ahmed et al. | Supporting large-scale networked virtual environments | |
| CN106851178A (en) | A kind of method of the intercom access network audio/video conference with redundancy ability | |
| Huang et al. | Trading bandwidth for playback lag: Can active peers help? |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140423 Termination date: 20171015 |