CN101064640A - Method, system and node for transmitting data in distributed non-collaboration grid network - Google Patents

Abstract

The invention discloses a data transmission method, system and node in distributed un-cooperated gridding network. The method includes: A. the first node sends bandwidth requirement to obtain data sending right; B. assuring current network resource using condition based on result of comparing, and assuring the bandwidth used this time based on said network resource using condition; C. the first node sends data to the second node based on said bandwidth. The invention judges the using condition of current network resource after applying data transmission right, setting bandwidth used when node sends data flexibly to use resource reasonably, it can avoid some nodes occupy channel that other nodes can not obtain bandwidth in time to increase delay, the equitableness of node is increased.

Description

Data transmission method for uplink, system and node in a kind of distributed non-collaboration grid network

Technical field

The present invention relates to the communications field, relate in particular to data transmission method for uplink, system and node in a kind of distributed non-collaboration grid network.

Background technology

IEEE 802.16 standards are the air interface protocols at bandwidth wireless access metropolitan area network (BWA-MAN, BroadbandWireless Access Metropolitan Area Network).It has carried out standard to media access control layer and the physical layer of putting the multipoint broadband wireless connecting system, and the ability of transmission data, video and voice service is provided.The standard code physical layer adopts OFDM (OFDM) or single carrier (SC) mechanism, can support 134Mbit/s message transmission rate on the 28MHz channel.

802.16 medium access control (MAC) layer is supported two kinds of network schemers: put multiple spot (PMP, Point to Multi Point) pattern and multiple spot to multiple spot (Mesh, multipoint-to-multipoint) pattern.In the PMP pattern, the tissue of node is similar to cellular network architecture, comprises a base station (BS) and user node (SS).Can not directly transmit data between the SS, must transmit by BS.In the Mesh pattern, all nodes are equal, direct multi-hop transmission data between the SS, and each SS not only can the transceive data bag, can also be as the packet of relay transmission neighbours SS.The Mesh network occurs with the form of mobile Ad hoc peer-to-peer network, satisfy in the military communication for broadband data transmission, support end-to-end IP, support voice and video information, support not to adopt global positioning system (GPS, Global PositioningSystems) but can reach the positioning requirements of corresponding accuracy equally.

In the Mesh pattern, there is not the up connection of clear and definite differentiation to be connected with descending, each SS can create with other SS and directly communicate to connect.IEEE 802.16 has stipulated two kinds of data packet transmission scheduling mechanisms: centralized dispatching and distributed scheduling.In the centralized dispatching mechanism, the BS of a similar bunch of head is arranged, management SS is shared channel in different time-gap how.Its function class is similar to the BS in the PMP pattern, and main difference is in the Mesh pattern, and all SS can set up with other SS and directly be connected, and need set up the direct connection between SS and the BS.All communications in the connection are managed concentratedly by BS.

In the distributed scheduling mechanism, be not similar to the centralized dispatching control of BS, each SS sends own schedule information to neighbor node, and selects the bandwidth access channel by the schedule information of self double bounce scope interior nodes, realizes that the data without collision transmits.Distributed scheduling is divided into cooperation mode and non tie up system again.In the cooperation mode, node transmits the schedule information of oneself by using one section or whole control section in each frame regular, uncontestedly.In the non tie up system, node need send schedule information by competitive way, thereby realizes the collisionless transmission of data.

The textural classification of IEEE 802.16 networks as shown in Figure 1.

What the MAC layer of IEEE 802.16 distributed non-cooperation Mesh networks adopted is time division multiple access (TDMA) mode, time division duplex (TDD) pattern, and the transmission of all control signalings and packet is all pressed time slot and is sent.This multi-access mode can guarantee propagation delay time, supports connection-oriented service, also is the basis that system provides the dynamic assignment of service quality (QoS) and differentiated service, bandwidth.

In the IEEE 802.16 distributed non-cooperation Mesh networks in the dispatching method of standard, the transmission of control messages and packet is distributed in different time slot sections and carries out, the distribution of packet sending time slots must be determined by the exchange of control messages, can avoid the collision of packet like this.

The Mesh frame structure is divided into control subframe and data burst two parts, and frame structure as shown in Figure 2.Two kinds of control subframe subnetwork control subframe and scheduling controlling subframes.The former is responsible for creating and keep the combination between the different system, and the latter is responsible for the scheduling of collaboration data transmission.Data burst is closelyed follow in control subframe back, and is divided into many time slot bandwidth.Standard is defined as MSH-DSCH with scheduling message, and the allocated bandwidth situation of all dispatching commands and neighbor node all sends in MSH-DSCH message.

In distributed non-cooperation Mesh network owing to lack the center control of BS, so each SS that will send packet must transmit control message by competing earlier, thereby obtain the concrete sending time slots of packet.If certain SS competition is won, just can broadcast its control messages at current time slot; If failure must wait until that then next transmission time slot continues to participate in the competition.This scheme has adopted " request/mandate/affirmation " three-way handshake process to finish establishment of connection, and Handshake Protocol as shown in Figure 3.

" request information is given receiving node B; after B receives message; return " mandate " message; this message comprises all or part of vacant bandwidth time slot that Node B can provide; because message is to send with the forms of broadcasting; the neighbor node of Node B can both be received this request, and thinks that these bandwidth time slots of B are occupied in requesting node A transmission.After node A receives " mandate " message, promptly obtained the concrete bandwidth time slot that data send, also will broadcast " affirmation " message then, comprise the copy of " mandate " message in this message, the neighbor node of informing all A can not take the bandwidth time slot that A has distributed.In this way, can both upgrade in time the assignment information of data burst of the neighbor node of all A and B is avoided recycling, and the conflict of also just having avoided packet to send realizes that the packet without collision sends and receives.

In the such scheme, all requests, mandate and acknowledge message are included in the MSH-DSCH message and send.Therefore each SS need send the MSH-DSCH bag by competition, then by the three-way handshake agreement, reach the concrete time slot bandwidth that packet sends with destination node, and inform that neighbor node must not take distributed time slot bandwidth, realize that without collision sends reception.

In the such scheme, for bandwidth request, when SS competes time slot transmission MSH-DSCH message, do not judge the load condition of network, and managed network not the free time or busy, all attempt to ask actual just maximum bandwidth time slot to send packet usually, like this, when channel ratio was busier, the SS that obtains bandwidth can easy " for a long time " forcibly occupy channel, so just might cause the fairness of node acquisition bandwidth very poor.

Summary of the invention

The invention provides data transmission method for uplink, system and node in a kind of distributed non-collaboration grid network, in order to solve exist in the prior art in node data sends, data transmission bandwidth is fixed, and causes the problem of system resource waste.

The inventive method comprises:

Data transmission method for uplink in a kind of distributed non-collaboration grid network comprises:

A, first node send bandwidth request, obtain the data transmission route;

B, basis are determined the current network resources behaviour in service with the threshold value comparative result, and confirm that according to described Internet resources behaviour in service this secondary data sends utilized bandwidth;

C, first node are sent to Section Point according to described bandwidth with data.

Described step B further comprises:

This first node is obtained the used request number of times of data transmission route and first node to be obtained the used average time of data transmission route and makes comparisons, if both ratios are less than first threshold, then distribute first bandwidth for described first node, if both ratios then distribute second bandwidth for described first node greater than second threshold value.

Described step B further comprises:

Described first threshold is 50%, and described first bandwidth is for distributing the maximum of bandwidth;

Described second threshold value is 150%, and described second bandwidth is for distributing the minimum value of bandwidth.

Described step B, adopting following formula is that first node distributes bandwidth:

$B=\left\{\begin{array}{cc}{B}_{\max }& n/n^{\&prime;}\&le;0.5\\ (B_{\max }+B_{\min })/2& 0.5<n/n^{\&prime;}<1.5\\ B_{\min }& n/n^{\&prime;}\&GreaterEqual;1.5\end{array}\right.$

Wherein, B is that this is the bandwidth that described first node distributes, B _MaxFor distributing the maximum of bandwidth, B _MinFor distributing the minimum value of bandwidth, n obtains the used request number of times of data transmission route for this first node, and n ' obtains the used average time of data transmission route for first node.

Described step B, adopting following formula is that first node distributes bandwidth:

$B=\left\{\begin{array}{cc}{B}_{\max }& n/n^{\&prime;}\&le;0.5\\ B_{\min }+(B_{\max }-B_{\min })(1.5-n/n^{\&prime;})& 0.5<n/n^{\&prime;}<1.5\\ B_{\min }& n/n^{\&prime;}\&GreaterEqual;1.5\end{array}\right.$

Wherein, B is that this is the bandwidth that described first node distributes, B _MaxFor distributing the maximum of bandwidth, B _MinFor distributing the minimum value of bandwidth, n obtains the used request number of times of data transmission route for this first node, and n ' obtains the used average time of data transmission route for first node.

System of the present invention comprises:

Data Transmission system in a kind of distributed non-collaboration grid network comprises first node and Section Point, and described first node sends data to Section Point, also comprises:

The bandwidth request transmitting element is positioned at described first node, is used to send bandwidth request;

Internet resources behaviour in service confirmation unit is positioned at described first node, according to determining the current network resources behaviour in service with the threshold value comparative result;

The utilized bandwidth confirmation unit is positioned at described first node, is used for the affirmation result according to described Internet resources behaviour in service confirmation unit, confirms that this secondary data sends utilized bandwidth;

Data transmission unit is positioned at described first node, is used for this secondary data transmission utilized bandwidth according to the affirmation of described utilized bandwidth confirmation unit, and data are sent to Section Point.

Described system also comprises:

Comparing unit is positioned at described Internet resources behaviour in service confirmation unit, is used for that this first node is obtained the used request number of times of data transmission route and first node and obtains the used average time of data transmission route and make comparisons, and confirms the current network resources behaviour in service;

If both ratios are less than first threshold, described utilized bandwidth confirmation unit is that described first node distributes first bandwidth, if both ratios greater than second threshold value, then described utilized bandwidth confirmation unit is that described first node distributes second bandwidth.

Node of the present invention comprises:

Data transmitting node in a kind of distributed non-collaboration grid network comprises:

The bandwidth request transmitting element is used to send bandwidth request;

Internet resources behaviour in service confirmation unit is according to determining the current network resources behaviour in service with the threshold value comparative result;

The utilized bandwidth confirmation unit is used for the affirmation result according to described Internet resources behaviour in service confirmation unit, confirms that this secondary data sends utilized bandwidth;

Data transmission unit is used for this secondary data transmission utilized bandwidth according to the affirmation of described utilized bandwidth confirmation unit, and data are sent to other nodes.

Described node also comprises:

Comparing unit is positioned at described Internet resources behaviour in service confirmation unit, is used for that this minor node is obtained the used request number of times of data transmission route and node and obtains the used average time of data transmission route and make comparisons, and confirms the current network resources behaviour in service;

If both ratios are less than first threshold, described utilized bandwidth confirmation unit is that described node distributes first bandwidth, if both ratios greater than second threshold value, then described utilized bandwidth confirmation unit is that described node distributes second bandwidth.

Beneficial effect of the present invention is as follows:

The present invention is by after the transmission route of node request for data, the current network resources behaviour in service is judged, according to the result who judges the bandwidth of using when node sends data can be set flexibly, rationally utilize system resource, prevent that some node from forcibly occupying channel and causing other nodes in time to obtain bandwidth and increase delay, increase the fairness of node access channel.

Description of drawings

Fig. 1 is the textural classification figure of IEEE 802.16 networks in the prior art;

Fig. 2 is the frame structure schematic diagram that the Mesh network uses in the prior art;

Fig. 3 is the three-way handshake agreement schematic diagram that node sends data in the prior art;

Fig. 4 is a schematic flow sheet of the present invention;

Fig. 5 is the schematic flow sheet of allocated bandwidth of the present invention;

Fig. 6 is the network topological diagram of the embodiment of the invention;

Fig. 7 is embodiment of the invention node A sends a schematic diagram from data to node D;

Fig. 8 is embodiment of the invention node A, B send data simultaneously to node D a schematic diagram;

Fig. 9 is embodiment of the invention node A, B, C send data simultaneously to node D a schematic diagram;

Figure 10 is data Transmission system structural representation in the distributed non-collaboration grid network of the present invention.

Embodiment

Below in conjunction with Figure of description the specific embodiment of the present invention is described.

The present invention is directed to distributed non-cooperation Mesh network,, proposed new data transmission method for uplink, prevent that some node from forcibly occupying channel and causing other nodes in time to obtain bandwidth and increase delay, increase the fairness of node access channel based on the contention requests pattern.

As shown in Figure 4, be schematic flow sheet of the present invention, as seen from the figure, mainly may further comprise the steps:

S401, first node send bandwidth request, obtain the data transmission route;

Want when Section Point sends data when first node, first node need send bandwidth request to obtain the data transmission route to system.Owing to there is competition mechanism, may there be a plurality of nodes to compete this data transmission route simultaneously, therefore, it may not be that bandwidth request of transmission just can be successful that first node obtains the data transmission route, might send repeatedly bandwidth request and just obtain this data transmission route.

S402, basis are determined the current network resources behaviour in service with the threshold value comparative result, and confirm that according to described Internet resources behaviour in service this secondary data sends utilized bandwidth;

At first confirming the current network resources behaviour in service in this step, is that first node distributes the corresponding data utilized bandwidth that sends according to this behaviour in service then.

Consider that a node sends the frequency of failure of bandwidth request, has reflected the busy situation of channel, i.e. the load condition of network to a certain extent.Estimate that for node being obtained bandwidth time slot situation the present invention program can adopt the method that the node competition frequency of failure is counted.By statistics, determine the busy situation of network, thereby dynamically adjust the size of request time slot bandwidth the node bandwidth on demand frequency of failure.

When the first node bandwidth on demand, its bandwidth on demand frequency of failure is added up, from initiating bandwidth request to obtaining the data transmission route, the bandwidth request number of times of Fa Qiing is designated as the number of times of this time bandwidth request altogether.Compare by this time bandwidth request number of times and average bandwidth request number of times, come estimation network busy situation at that time,, think that then network is busy if this time request number of times is higher than certain threshold value with average request number of times ratio; If this time request number of times is lower than certain threshold value with average request number of times ratio, then think the network free time.

When channel ratio was idle, node can once be asked more bandwidth time slot; When channel competition was relatively fiercer, node can once be asked less bandwidth time slot.

The bandwidth request message average of a node in all previous competing cycle is designated as n ', bandwidth request message number scale in this competing cycle is n, the maximum value bandwidth of primary distribution is designated as Bmax, minimum value is designated as Bmin, n ' initial value gets 1, can provide all previous competition failure average bandwidth request number of times statistics formula of calculating:

n′←(n′+n)/2 (1)

Analyze n ', n channel is made estimation, when n/n '＞1.5, the current period bandwidth request message frequency of failure exceeds 50% than the bandwidth request message average in all previous competing cycle, and it is busy to think that channel changes over to; Work as n/n '＜0.5, the current period bandwidth request message frequency of failure reduces by 50% than the bandwidth request message average in all previous competing cycle, can think that channel changes the free time over to.

According to current channel busy state, dynamic assignment node single sends the time slot bandwidth of data, can use following formula:

$B=\left\{\begin{array}{cc}{B}_{\max }& n/n^{\&prime;}\&le;0.5\\ (B_{\max }+B_{\min })/2& 0.5<n/n^{\&prime;}<1.5\\ B_{\min }& n/n^{\&prime;}\&GreaterEqual;1.5\end{array}\right.---\left(2\right)$

Formula (2) has been explained after once successfully obtaining to distribute the chance of bandwidth, if channel transfers the free time to, then distributes to maximum bandwidth; If channel transfers to busy, then allocated bandwidth is selected minimum value, i.e. 1 time slot unit; Otherwise, select a median.

Can also use following formula:

$B=\left\{\begin{array}{cc}{B}_{\max }& n/n^{\&prime;}\&le;0.5\\ B_{\min }+(B_{\max }+B_{\min })(1.5-n/n^{\&prime;})& 0.5<n/n^{\&prime;}<1.5\\ B_{\min }& n/n^{\&prime;}\&GreaterEqual;1.5\end{array}\right.---\left(3\right)$

Formula (3) has been explained after successfully obtaining to distribute the chance of bandwidth, according to current channel busy state, dynamically adjusts the bandwidth of distributing.Promptly in the competing cycle of a success, during channel idle, the bandwidth that primary distribution is bigger, during channel busy, the bandwidth that primary distribution is less helps the fair busy channel of other nodes like this.

In above-mentioned formula (2) and the formula (3), employed each threshold value not necessarily is confined to givenly 50% and 150%, can decide according to the concrete condition of system, such as being 40% and 160% etc., can set flexibly.

S403, first node use described bandwidth, and data are sent to Section Point.

First node sends the data utilized bandwidth according to this that confirm among the step S402, carries out data and sends.

By such scheme, the bandwidth of using when node sends data can be set flexibly, rationally utilize system resource, prevent that some node from forcibly occupying channel and causing other nodes in time to obtain bandwidth and increase delay, increase the fairness of node access channel.

As shown in Figure 5, be the schematic flow sheet of an allocated bandwidth.As seen from the figure, by the statistics node bandwidth request frequency of failure, judge the current resource behaviour in service of network in this flow process, and according to the current resource behaviour in service of network, for this node distributes corresponding bandwidth, with reasonable using system resource, the mitigation system burden.

See a specific embodiment below, in based on 802.16 distributed non-cooperation Mesh networks, for ease of analyzing, we do following simplification to network:

(1) supposition has network topology 4 node A, B, C, D as shown in Figure 6, and each node all in the transmission range of other nodes, promptly can only have a node to send data in 4 nodes of synchronization.4 nodes send data each other, need be by competing the time slot that obtains to send control information.

(2) every frame has 1 control time slot, 4 data time slots.

(3) the maximum application of each node 8 time slot bandwidth, i.e. Bmax=8; Minimum application 1 time slot bandwidth, i.e. Bmin=1.

(4) 4 mutual equalitys of node, the competitive opportunity equalization.

When node sends data, be divided into following situation:

(1) node A sends data to node D:

As shown in Figure 7, when having only node A when node D request sends data, A initiates request constantly at t1, owing to have only a node contention requests, therefore compete successfully, be nA=0, nA '=(0+1)/and 2=0.5, nA/nA '=0＜0.5, according to the scheme that provides among the step S402, request maximum bandwidth BA=Bmax=8, A and D carry out sending data constantly at t3 after the three-way handshake process, after this continue contention requests.

(2) node A, B send data to node D simultaneously:

As shown in Figure 8, when node A, B simultaneously when D sends data, A and B are in t1 contention requests constantly, by competition, A wins, and initiates bandwidth request, nA=0, and nA '=(0+1)/2=0.5, nA/nA '=0＜0.5, according to this method, request maximum bandwidth BA=Bmax=8.Since B competition failure, nB=1.By three-way handshake process, A sends data constantly at t3.

At t4 constantly, Node B is competed the control time slot, initiates bandwidth request, nB=1, and nB '=(1+1)/and 2=1,0.5＜nB/nB '=1＜1.5, according to the scheme that provides among the top step S402, bandwidth on demand BB=(Bmax+Bmin)/2=4.5 gets BB=4.By three-way handshake process, Node B sends data constantly at t6.

At t7 constantly, node A and B initiate contention requests simultaneously again, continue data and send.

(3) node A, B, C send data to node D simultaneously:

As shown in Figure 9, when D sent data, A, B and C were in t1 moment contention requests, by competition simultaneously for node A, B and C, A wins, and initiates bandwidth request, nA=0, and nA '=(0+1)/2=0.5, nA/nA '=0＜0.5, according to this method, request maximum bandwidth BA=Bmax=8.B and C competition failure, nB=nC=1.By three-way handshake process, A sends data constantly at t3.

At t4 constantly, Node B and C continue competition control time slot, and the Node B competition is won, and initiates bandwidth request, nB=1, and nB '=(1+1)/and 2=1,0.5＜nB/nB '=1＜1.5, according to this method, bandwidth on demand BB=Bmax/2=4.By three-way handshake process, Node B sends data constantly at t6.Node C competes failure, nC=2.

At t6 constantly, node A and B send data, continue and C competition control time slot, and by competition, Node B is won, and initiates bandwidth request, nB=0, and nB '=(0+1)/and 2=0.5, nB/nB '=0＜0.5, according to this method, bandwidth on demand BB=Bmax=8.By three-way handshake process, Node B sends data constantly at t9.Node A and C competition failure, nA=1, nC=3.

At t10 constantly, node A and C competition control time slot, node C competes triumph, initiates bandwidth request, nC=3, nB '=(3+1)/and 2=2, nC/nC '=1.5 〉=1.5, according to this method, the bandwidth B B=Bmin=1 that request is minimum.By three-way handshake process, node C sends data constantly at t12.Node A competes failure, and after this nA=2 continues back and forth to carry out.

As shown in figure 10, be the structural representation of data Transmission system in a kind of distributed non-collaboration grid network of the present invention, as seen from the figure, this system comprises first node 110 and Section Point 120, described first node 110 sends data to Section Point 120, and this system also comprises:

Bandwidth request transmitting element 111 is positioned at described first node 110, is used to send bandwidth request;

Internet resources behaviour in service confirmation unit 112 is positioned at described first node 110, according to determining the current network resources behaviour in service with the threshold value comparative result;

Utilized bandwidth confirmation unit 113 is positioned at described first node 110, is used for the affirmation result according to described Internet resources behaviour in service confirmation unit, confirms that this secondary data sends utilized bandwidth;

Data transmission unit 114 is positioned at described first node 110, is used for this secondary data transmission utilized bandwidth according to the affirmation of described utilized bandwidth confirmation unit, and data are sent to Section Point 120.

The Internet resources behaviour in service confirmation unit of said system also comprises comparing unit 1121, be positioned at described Internet resources behaviour in service confirmation unit 112, be used for that this first node 110 is obtained the used request number of times of data transmission route and first node 110 and obtain the used average time of data transmission route and make comparisons, confirm the current network resources behaviour in service; If both ratios are less than first threshold, described utilized bandwidth confirmation unit 113 is that described first node 110 distributes first bandwidth, if both ratios greater than second threshold value, then described utilized bandwidth confirmation unit 113 be described first node 110 distribution second bandwidth.

Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, if of the present invention these are revised and modification belongs within the scope of claim of the present invention and equivalent technologies thereof, then the present invention also is intended to comprise these changes and modification interior.

Claims (9)

1, data transmission method for uplink in a kind of distributed non-collaboration grid network is characterized in that, comprising:

A, first node send bandwidth request, obtain the data transmission route;

B, basis are determined the current network resources behaviour in service with the threshold value comparative result, and confirm that according to described Internet resources behaviour in service this secondary data sends utilized bandwidth;

C, first node are sent to Section Point according to described bandwidth with data.

2, the method for claim 1 is characterized in that, described step B further comprises:

This first node is obtained the used request number of times of data transmission route and first node to be obtained the used average time of data transmission route and makes comparisons, if both ratios are less than first threshold, then distribute first bandwidth for described first node, if both ratios then distribute second bandwidth for described first node greater than second threshold value.

3, method as claimed in claim 2 is characterized in that, described step B further comprises:

Described first threshold is 50%, and described first bandwidth is for distributing the maximum of bandwidth;

Described second threshold value is 150%, and described second bandwidth is for distributing the minimum value of bandwidth.

4, as claim 1,2 or 3 described methods, it is characterized in that, described step B, adopting following formula is that first node distributes bandwidth:

$B=\left\{\begin{array}{cc}{B}_{\max }& n/n^{\&prime;}\&le;0.5\\ (B_{\max }+B_{\min })/2& 0.5<n/n^{\&prime;}<1.5\\ B_{\min }& n/n^{\&prime;}\&GreaterEqual;1.5\end{array}\right.$

Wherein, B is that this is the bandwidth that described first node distributes, B _MaxFor distributing the maximum of bandwidth, B _MinFor distributing the minimum value of bandwidth, n obtains the used request number of times of data transmission route for this first node, and n ' obtains the used average time of data transmission route for first node.

5, as claim 1,2 or 3 described methods, it is characterized in that, described step B, adopting following formula is that first node distributes bandwidth:

$B=\left\{\begin{array}{cc}{B}_{\max }& n/n^{\&prime;}\&le;0.5\\ B_{\min }+(B_{\max }-B_{\min })(1.5-n/n^{\&prime;})& 0.5<n/n^{\&prime;}<1.5\\ B_{\min }& n/n^{\&prime;}\&GreaterEqual;1.5\end{array}\right.$

Wherein, B is that this is the bandwidth that described first node distributes, B _MaxFor distributing the maximum of bandwidth, B _MinFor distributing the minimum value of bandwidth, n obtains the used request number of times of data transmission route for this first node, and n ' obtains the used average time of data transmission route for first node.

6, data Transmission system in a kind of distributed non-collaboration grid network comprises first node and Section Point, and described first node sends data to Section Point, it is characterized in that, also comprises:

The bandwidth request transmitting element is positioned at described first node, is used to send bandwidth request;

Internet resources behaviour in service confirmation unit is positioned at described first node, according to determining the current network resources behaviour in service with the threshold value comparative result;

The utilized bandwidth confirmation unit is positioned at described first node, is used for the affirmation result according to described Internet resources behaviour in service confirmation unit, confirms that this secondary data sends utilized bandwidth;

Data transmission unit is positioned at described first node, is used for this secondary data transmission utilized bandwidth according to the affirmation of described utilized bandwidth confirmation unit, and data are sent to Section Point.

7, system as claimed in claim 6 is characterized in that, also comprises:

Comparing unit is positioned at described Internet resources behaviour in service confirmation unit, is used for that this first node is obtained the used request number of times of data transmission route and first node and obtains the used average time of data transmission route and make comparisons, and confirms the current network resources behaviour in service;

If both ratios are less than first threshold, described utilized bandwidth confirmation unit is that described first node distributes first bandwidth, if both ratios greater than second threshold value, then described utilized bandwidth confirmation unit is that described first node distributes second bandwidth.

8, data transmitting node in a kind of distributed non-collaboration grid network is characterized in that, comprising:

The bandwidth request transmitting element is used to send bandwidth request;

Internet resources behaviour in service confirmation unit is according to determining the current network resources behaviour in service with the threshold value comparative result;

The utilized bandwidth confirmation unit is used for the affirmation result according to described Internet resources behaviour in service confirmation unit, confirms that this secondary data sends utilized bandwidth;

Data transmission unit is used for this secondary data transmission utilized bandwidth according to the affirmation of described utilized bandwidth confirmation unit, and data are sent to other nodes.

9, node as claimed in claim 8 is characterized in that, also comprises:

Comparing unit is positioned at described Internet resources behaviour in service confirmation unit, is used for that this minor node is obtained the used request number of times of data transmission route and node and obtains the used average time of data transmission route and make comparisons, and confirms the current network resources behaviour in service;

If both ratios are less than first threshold, described utilized bandwidth confirmation unit is that described node distributes first bandwidth, if both ratios greater than second threshold value, then described utilized bandwidth confirmation unit is that described node distributes second bandwidth.

Images