CN102724121A - Distributed network data transmission method for LAN - Google Patents

Abstract

The invention relates to the field of an electric digital data processing method with combination of two or a plurality of digital computers, in particular to a distributed network data transmission method for a LAN (Local Area Network). The method adopts an initial sender (11) to send data to each final receiving party (12) through the LAN (2). The method is characterized by comprising the following steps sequentially: a. grouping; b. transmitting; c. judging; and d. grading. The method has the advantages of high data transmission speed, transmission efficiency, accuracy and equipment utilization rate at network terminal.

Description

The distributed network data transmission method that is used for local area network (LAN)

Technical field

The present invention relates to adopt the electric digital data processing method field of the combination of two or more digital computers, be specially a kind of distributed network data transmission method that is used for local area network (LAN).

Background technology

Local area network (LAN) is made up of by certain topological structure many computers; Often need the transmission Various types of data in the local area network (LAN); The traditional data transmission method is as shown in Figure 1, andinitialization side 11 andrecipient 12 all are the computers that is connected in the same local area network (LAN) 2, directly send data to eachrecipient 12 through network 2 byinitialization side 11; That is to say that all transmission tasks are all accomplished byinitialization side 11 1 sides.This method; Whenrecipient 12 has when a plurality of,initialization side 11 needs one by one to each reciever 12 transmission data, when recipient's 12 quantity very for a long time; Can increase the transmission pressure ofinitialization side 11 and the transmission pressure on network 2 buses, and then influence the system transmissions speed of network 2.

Summary of the invention

In order to overcome the defective of prior art, the electric digital data processing method that a kind of transmission speed is fast, accuracy rate is high is provided, the invention discloses a kind of distributed network data transmission method that is used for local area network (LAN).

The present invention reaches goal of the invention through following technical scheme:

A kind of distributed network data transmission method that is used for local area network (LAN); Send data to each final receiver through local area network (LAN) by initialization side; Initialization side all is the computer that is connected in the same local area network (LAN) with final receiver; Initialization side all comprises central processing unit, internal storage, external memory storage, input equipment, output equipment and communication module with final receiver, and the built-in communication protocol of local area network (LAN) is characterized in that: carry out successively as follows:

With initialization side as the sender, with final receiver as the recipient,

A. divide into groups: establishing the sender need be with transfer of data to K recipient, and K is a positive integer, establishes the t of being theoretical consuming time of the single piece of data of transmission, then accomplishes the maximum theoretical TC of transfer of data TC value consuming time_Max=K t;

If i recipient's load is weighted to W_i, i is [1, K] interval interior positive integer, the load weighting here is meant certain recipient because of processor is busy, I/O postpones or the delay that causes is waited in design, and in a data transfer, W_iConstant can be thought and by manual work input, under unknown recipient loads the situation of weighting, W can be established earlier_i=0, promptly wouldn't calculate load weighting and adjusting in afterwards the practical operation of recipient;

K recipient is divided into the L level, and L is [1, K] positive integer in interval, establishes the total individual recipient of N (j) of j level, and 1≤L≤K and 1≤N (j)≤K is obviously arranged, at different levels in each recipient's load weighting following:

The 1st grade: W₁～W_{N (1)}, W here₁～W_{N (1)}Represent W successively₁, W₂..., W_{N (1)}The individual numerical value of this N (1), down together;

The 2nd grade: W_{N (1)+1}～W_{N (1)+N (2)}, W here_{N (1)+1}～W_{N (1)+N (2)}Represent W successively_{N (1)+1}, W_{N (1)+2}..., W_{N (1)+N (2)}The individual numerical value of this N (2), down together;

……；

J level: W_{N (1)+N (2)+... + N (j-1)+1}～W_{N (1)+N (2)+... + N (j)}, W here_{N (1)+N (2)+... + N (j-1)+1}～W_{N (1)+N (2)+... + N (j)}Represent W successively_{N (1)+N (2)+... + N (j-1)+1}, WN (1)+N (2)+... + N (j-1)+2 ..., W_{N (1)+N (2)+... + N (j)}The individual numerical value of this N (j), down together;

……；

L level: W_{N (1)+N (2)+... + N (L-1)+1}～W_K, W here_{N (1)+N (2)+... + N (L-1)+1}～W_KRepresent W successively_{N (1)+N (2)+... + N (L-1)+1}, W_{N (1)+N (2)+... + N (L-1)+2}..., W_KThe individual numerical value of this N (L), down together;

The transfer of data of j level is consuming time to be T_j, then have:

T_j=N_j?t+Max[W_{N(1)+N(2)+…+N?(j-1)+1},W_{N(1)+N(2)+…+N?(j)}]，

In the following formula, Max [W_{N (1)+N (2)+... + N (j-1)+1}, W_{N (1)+N (2)+... + N (j)}] be meant W_{N (1)+N (2)+... + N (j-1)+1}, W_{N (1)+N (2)+... + N (j-1)+2}..., W_{N (1)+N (2)+... + N (j)}In the maximum;

Reality

always consuming time;

As I>=TC_MaxThe time, be direct recipient, i.e. L=1 with whole recipients;

As I＜TC_MaxThe time, the sender with n recipient be divided into L the level, the j level have the individual recipient of N (j) and

The sender obtains optimally sized several L through enumeration methodology, and calculates transfer of data at different levels T consuming time_j

B. transmission: the sender is one by one transmitted data to each direct recipient;

Finish if data all receive, then directly the recipient feeds back the load weighting that receives information of successful and current direct recipient to the sender after accomplishing the reception data;

If Data Receiving has mistake or by aborted, then directly the recipient feeds back the information of makeing mistakes that receives to the sender;

If Data Receiving does not start, then direct recipient is not to sender's feedback information;

C. judge: after the sender receives direct recipient's feedback information,

If feedback information is for to receive successfully,

If the sender is initialization side, then the sender gives record with feedback information;

If the sender is not initialization side, then the sender is with the upper level data sender of transmission of feedback information to sender at the corresponding levels;

If feedback information is made mistakes for acceptance or the sender does not receive feedback information, then the sender sends data to the recipient again;

D. classification: whether the initialization root is successfully received by all final receiver according to the feedback information judgment data,

If data are successfully received by all final receiver, then end data transmission;

If data are not successfully received by all final receiver, then continue to distribute subordinate's transformation task, and return b step transmitting step to the recipient.

The described distributed network data transmission method that is used for local area network (LAN); It is characterized in that: the communication module of initialization side and final receiver is all selected at least a in RJ-45 interface module, bnc interface module, AUI interface module, fddi interface module, atm interface module and the wifi module for use; It (is NetBIOS Extend User Interface that the built-in communication protocol of local area network (LAN) is selected user's expansion interface for use; Abbreviation NetBEUI) agreement, internet packet switch/order packet switch (are Internetwork Packet Exchange/Sequences Packet Exchange; Be called for short IPX/SPX) at least a in agreement and transmission control protocol/internet (being Transmission Control Protocol/Internet Protocol, abbreviation TCP/IP) agreement.

The present invention proposes a kind of many personal data transmission method,, improved efficiency of transmission, make list carry out more glibly many data transmissions through distributing Delamination Transmission structure based on local area network (LAN).When the present invention uses; When a plurality of targets are sent same data; Data transfer task can be assigned to a plurality of final receiver by initialization side; The final receiver that receives data transfer task is optionally distributed one or more data and task then according to self work tight situation and task indication; Reciprocal with this, all receive the data of being transmitted until all final recievers.Adopt when of the present invention, the integrality of data is managed respectively by the sender, and initialization side only need be concerned about the integrality when self sends data.When a certain sender accomplishes data transfer task, then this sender will receive the Data Receiving information of successful and feed back to the higher level sender; In case the situation that data are sent failure occurs, this sender is promptly to higher level sender feedback error information, thereby initialization can be learned whole transmission reception results, can send data once more to the recipient of failure.

For the processing of error message, also be to adopt to handle step by step and the principle that reports step by step.If the error message that can dispose the sender then no longer reports; If the sender can't handle this error message, then report to the higher level sender.Each sender safeguards a best distribution principle, and follow-up distribution is then with reference to this distribution principle, to quicken distribution and transmission.The optimal allocation principle here is meant through after the communication repeatedly, arrives the principle that situation and the comprehensive assessment of device busy degree are come out according to the equipment in the network of being distributed in, and in brief, is exactly the principle of selecting the best qualified of time and efficient.

The invention has the beneficial effects as follows: data transmission bauds is fast, and efficiency of transmission is high, and accuracy rate is high, and the network-termination device utilance is high.

Description of drawings

Fig. 1 is the sketch map of prior art transfer of data;

Fig. 2 is the sketch map of transfer of data of the present invention.

Embodiment

Below further specify the present invention through specific embodiment.

Embodiment 1

A kind of distributed network data transmission method that is used for local area network (LAN); As shown in Figure 2; Send data to eachfinal receiver 12 through local area network (LAN) 2 byinitialization side 11;Initialization side 11 all is the computer that is connected in the same local area network (LAN) 2 withfinal receiver 12, andinitialization side 11 all comprises central processing unit, internal storage, external memory storage, input equipment, output equipment and communication module, the built-in communication protocol of local area network (LAN) with final receiver 12.The communication module ofinitialization side 11 andfinal receiver 12 is all selected at least a in RJ-45 interface module, bnc interface module, AUI interface module, fddi interface module, atm interface module and the wifi module for use; It (is NetBIOS Extend User Interface that local area network (LAN) 1 built-in communication protocol is selected user's expansion interface for use; Abbreviation NetBEUI) agreement, internet packet switch/order packet switch (are Internetwork Packet Exchange/Sequences Packet Exchange; Be called for short IPX/SPX) at least a in agreement and transmission control protocol/internet (being Transmission Control Protocol/Internet Protocol, abbreviation TCP/IP) agreement.

The abbreviation explanation:

RJ-45: full name Registered Jack 45; Be registered jack 45 joints; Refer to that (IEC refers to International Electrotechnical Commission by " IEC 60603-7 " standardization; Be International Electrotechnical Commission), use modular jack or plug by 8 positions (8 pin) of international connector standard definition;

BNC: full name Bayonet Nut Connector, i.e. bayonet nut connector, being adapted to the thin coaxial cable is the Ethernet or the Token Ring of transmission medium;

AUI: full name Attachment Unit Interface, i.e. Attachment Unit Interface, being adapted to the thick coaxial cable is the Ethernet or the Token Ring of transmission medium;

FDDI: full name Fiber Distributed Data Interface, promptly Fiber Distributed Data Interface is adapted in the network of FDDI;

ATM: full name Asymmetrical Transmission Mode, promptly asynchronous transfer mode is adapted in the optical fiber or twisted-pair wire net of asynchronous transfer mode;

Wifi: full name Wireless Fidelity, promptly Wireless Fidelity is adapted to wireless network.

As the sender, as the recipient, transmitting step is described below present embodiment withfinal receiver 12 with initialization side 11:

A. divide into groups: establishing the sender need be with transfer of data to K recipient, and K is a positive integer, establishes the t of being theoretical consuming time of the single piece of data of transmission, then accomplishes the maximum theoretical TC of transfer of data TC value consuming time_Max=K t;

If i recipient's load is weighted to W_i, i is [1, K] interval interior positive integer, the load weighting here is meant certain recipient because of processor is busy, I/O postpones or the delay that causes is waited in design, and in a data transfer, W_iConstant can be thought and by manual work input, under unknown recipient loads the situation of weighting, W can be established earlier_i=0, promptly wouldn't calculate load weighting and adjusting in afterwards the practical operation of recipient;

K recipient is divided into the L level, and L is [1, K] positive integer in interval, establishes the total individual recipient of N (j) of j level, and 1≤L≤K and 1≤N (j)≤K is obviously arranged, at different levels in each recipient's load weighting following:

The 1st grade: W₁～W_{N (1)}, W here₁～W_{N (1)}Represent W successively₁, W₂..., W_{N (1)}The individual numerical value of this N (1), down together;

The 2nd grade: W_{N (1)+1}～W_{N (1)+N (2)}, W here_{N (1)+1}～W_{N (1)+N (2)}Represent W successively_{N (1)+1}, W_{N (1)+2}..., W_{N (1)+N (2)}The individual numerical value of this N (2), down together;

……；

J level: W_{N (1)+N (2)+... + N (j-1)+1}～W_{N (1)+N (2)+... + N (j)}, W here_{N (1)+N (2)+... + N (j-1)+1}～W_{N (1)+N (2)+... + N (j)}Represent W successively_{N (1)+N (2)+... + N (j-1)+1}, WN (1)+N (2)+... + N (j-1)+2 ..., W_{N (1)+N (2)+... + N (j)}The individual numerical value of this N (j), down together;

……；

L level: W_{N (1)+N (2)+... + N (L-1)+1}～W_K, W here_{N (1)+N (2)+... + N (L-1)+1}～W_KRepresent W successively_{N (1)+N (2)+... + N (L-1)+1}, W_{N (1)+N (2)+... + N (L-1)+2}..., W_KThe individual numerical value of this N (L), down together;

The transfer of data of j level is consuming time to be T_j, then have:

T_j=N_j?t+Max[W_{N(1)+N(2)+…+N(j-1)}+1,W_{N(1)+N(2)+…+N(j)}]，

In the following formula, Max [W_{N (1)+N (2)+... + N (j-1)+1}, W_{N (1)+N (2)+... + N (j)}] be meant W_{N (1)+N (2)+... + N (j-1)+1}, W_{N (1)+N (2)+... + N (j-1)+2}..., W_{N (1)+N (2)+... + N (j)}In the maximum;

Reality

always consuming time;

As I>=TC_MaxThe time, be direct recipient, i.e. L=1 with whole recipients;

As I＜TC_MaxThe time, the sender with n recipient be divided into L the level, the j level have the individual recipient of N (j) and

The sender obtains optimally sized several L through enumeration methodology, and calculates transfer of data at different levels T consuming time_j

B. transmission: the sender is one by one transmitted data to each direct recipient;

Finish if data all receive, then directly the recipient feeds back the load weighting that receives information of successful and current direct recipient to the sender after accomplishing the reception data;

If Data Receiving has mistake or by aborted, then directly the recipient feeds back the information of makeing mistakes that receives to the sender;

If Data Receiving does not start, then direct recipient is not to sender's feedback information;

C. judge: after the sender receives direct recipient's feedback information,

If feedback information is for to receive successfully,

If the sender isinitialization side 11, then the sender gives record with feedback information;

If the sender is not initializationside 11, then the sender is with the upper level data sender of transmission of feedback information to sender at the corresponding levels;

If feedback information is made mistakes for acceptance or the sender does not receive feedback information, then the sender sends data to the recipient again;

D. classification: whetherinitialization side 11 is successfully received by allfinal receiver 12 according to the feedback information judgment data,

If data are successfully received by allfinal receiver 12, then end data transmission;

If data are not successfully received by allfinal receiver 12, then continue to distribute subordinate's transformation task, and return b step transmitting step to the recipient.

For instance, as shown in Figure 2, carry out successively as follows:

Withinitialization side 11 as the sender, withfinal receiver 12 as the recipient,

A. divide into groups: presentembodiment initialization side 11 is 1, andfinal receiver 12 is 7, and promptly the sender needs transfer of data to 7 recipient, existing I＜TC_Max, calculate according to enumerative technique, 7 recipients are divided into two groups, one group is 2 direct recipients, is respectivelydirect recipient 121 anddirect recipient 122, another group is 5 indirect recipients, is respectivelyindirect recipient 123～indirect recipient 127;

B. transmission:initialization side 11 is one by one to directrecipient 121 and direct recipient's 122 transmission data;

Finish as if whole reception of data, then directlyrecipient 121 receives information of successful to initialization side's 11 feedbacks after receiving data with direct recipient's 122 completion;

If Data Receiving has mistake or by aborted, then directlyrecipient 121 ordirect recipient 122 receive the information of makeing mistakes to initialization side's 11 feedbacks;

If Data Receiving does not start, thendirect recipient 121 ordirect recipient 122 be not to initialization side's 11 feedback informations;

C. judge: after the sender receives direct recipient's feedback information,

If feedback information is for to receive successfully,

If the sender isinitialization side 11, then the sender gives record with feedback information;

If the sender is not initializationside 11, then the sender is with the upper level data sender of transmission of feedback information to sender at the corresponding levels;

If feedback information is made mistakes for acceptance or the sender does not receive feedback information, then the sender sends data to the recipient again;

Existingdirect recipient 121 is with directlyrecipient 122 is to initialization side's 11 feedback reception information of successful, andinitialization side 11 will receive successful feedback information and give record;

D. classification: whetherinitialization side 11 is successfully received by allfinal receiver 12 according to the feedback information judgment data,

If data are successfully received by allfinal receiver 12, then end data transmission;

If data successfully do not receive by allfinal receiver 12, then with the direct recipient of output bandwidth maximum as the sender,, divide into groups as the recipient with all indirect recipients of not receiving data with continued;

E. continue to divide into groups: existing still have 5 indirect receptors not accomplish the reception data; Is the sender withdirect recipient 121 withdirect recipient 122; Withindirect recipient 123 and the direct recipient ofindirect recipient 124, with the direct recipient ofindirect recipient 125 asdirect recipient 122 asdirect recipient 121; The sender sends data to separately direct recipient respectively; After the Data Receiving success;Recipient 123 receives information of successful to direct recipient's 121 feedbacks respectively withindirect recipient 124 indirectly; Directlyrecipient 121 feeds back toinitialization side 11 with this reception information of successful again;Recipient 125 receives information of successful to direct recipient's 122 feedbacks indirectly, and directlyrecipient 122 feeds back toinitialization side 11 with this reception information of successful again;

At this moment, still having 2 indirect receptors not accomplish the reception data, is the sender withindirect recipient 124, and withrecipient 127 is as indirect recipient's 124 direct recipient indirectly, the sender sends data to direct recipient withindirect recipient 126; After Data Receiving was successful,recipient 126 fed back the reception information of successful toindirect recipient 124 respectively withindirect recipient 127 indirectly, and this receives information of successful and feeds back toinitialization side 11 throughindirect recipient 124 anddirect recipient 121 successively again.

So far, data are successfully received by allfinal receiver 12, the end data transmission.

Claims (2)

1. distributed network data transmission method that is used for local area network (LAN); Send data to each final receiver (12) through local area network (LAN) (2) by initialization side (11); Initialization side (11) and final receiver (12) all are the computers that is connected in the same local area network (LAN) (2); Initialization side (11) and final receiver (12) all comprise central processing unit, internal storage, external memory storage, input equipment, output equipment and communication module; The built-in communication protocol of local area network (LAN) is characterized in that: carry out successively as follows:

With initialization side (11) as the sender, with final receiver (12) as the recipient,

A. divide into groups: establishing the sender need be with transfer of data to K recipient, and K is a positive integer, establishes the t of being theoretical consuming time of the single piece of data of transmission, then accomplishes the maximum theoretical TC of transfer of data TC value consuming time_Max=K t;

If i recipient's load is weighted to W_i, i is [1, K] interval interior positive integer;

K recipient is divided into the L level, and L is [1, K] positive integer in interval, establishes the total individual recipient of N (j) of j level, and 1≤L≤K and 1≤N (j)≤K is obviously arranged, at different levels in each recipient's load weighting following:

The 1st grade: W₁～W_{N (1)}, W here₁～W_{N (1)}Represent W successively₁, W₂..., W_{N (1)}The individual numerical value of this N (1), down together;

The 2nd grade: W_{N (1)+1}～W_{N (1)+N (2)}, W here_{N (1)+1}～W_{N (1)+N (2)}Represent W successively_{N (1)+1}, W_{N (1)+2}..., W_{N (1)+N (2)}The individual numerical value of this N (2), down together;

……；

J level: W_{N (1)+N (2)+... + N (j-1)+1}～W_{N (1)+N (2)+... + N (j)}, W here_{N (1)+N (2)+... + N (j-1)+1}～W_{N (1)+N (2)+... + N (j)}Represent W successively_{N (1)+N (2)+... + N (j-1)+1}, W_{N (1)+N (2)+... + N (j-1)+2}..., W_{N (1)+N (2)+... + N (j)}The individual numerical value of this N (j), down together;

……；

L level: W_{N (1)+N (2)+... + N (L-1)+1}～W_K, W here_{N (1)+N (2)+... + N (L-1)+1}～W_KRepresent W successively_{N (1)+N (2)+... + N (L-1)+1}, W_{N (1)+N (2)+... + N (L-1)+2}..., W_KThe individual numerical value of this N (L), down together;

The transfer of data of j level is consuming time to be T_j, then have:

T_j=N_j?t+Max[W_{N(1)+N(2)+…+N(j-1)+1},W_{N(1)+N(2)+…+N(j)}]，

In the following formula, Max [W_{N (1)+N (2)+... + N (j-1)+1}, W_{N (1)+N (2)+... + N (j)}] be meant W_{N (1)+N (2)+... + N (j-1)+1}, W_{N (1)+N (2)+... + N (j-1)+2}..., W_{N (1)+N (2)+... + N (j)}In the maximum;

Reality

always consuming time;

As I>=TC_MaxThe time, be direct recipient, i.e. L=1 with whole recipients;

As I＜TC_MaxThe time, the sender with n recipient be divided into L the level, the j level have the individual recipient of N (j) and

The sender obtains optimally sized several L through enumeration methodology, and calculates transfer of data at different levels T consuming time_j

B. transmission: the sender is one by one transmitted data to each direct recipient;

Finish if data all receive, then directly the recipient feeds back the load weighting that receives information of successful and current direct recipient to the sender after accomplishing the reception data;

If Data Receiving has mistake or by aborted, then directly the recipient feeds back the information of makeing mistakes that receives to the sender;

If Data Receiving does not start, then direct recipient is not to sender's feedback information;

C. judge: after the sender receives direct recipient's feedback information,

If feedback information is for to receive successfully,

If the sender is initialization side (11), then the sender gives record with feedback information;

If the sender is not initialization side (11), then the sender is with the upper level data sender of transmission of feedback information to sender at the corresponding levels;

If feedback information is made mistakes for acceptance or the sender does not receive feedback information, then the sender sends data to the recipient again;

D. classification: whether initialization side (11) are successfully received by all final receiver (12) according to the feedback information judgment data,

If data are successfully received by all final receiver (12), then end data transmission;

If data are not successfully received by all final receiver (12), then continue to distribute subordinate's transformation task, and return b step transmitting step to the recipient.

2. the distributed network data transmission method that is used for local area network (LAN) as claimed in claim 1; It is characterized in that: the communication module of initialization side (11) and final receiver (12) all selects for use at least a in RJ-45 interface module, bnc interface module, AUI interface module, fddi interface module, atm interface module and the wifi module, the built-in communication protocol of local area network (LAN) (1) to select at least a in user's expansion interface agreement, internet packet switch/sequenced packet exchange and the TCP for use.

Images