CN103441904A - Communication scheduling simulation method based on time limit - Google Patents

Abstract

The invention provides a communication scheduling simulation method based on a time limit. According to the communication scheduling simulation method based on the time limit, simulation network node communication is generated in a topology network through random numbers, the randomness of simulation network communication is highlighted, meanwhile, on the basis that communication is started at the latest start time, a communication port is distributed to a communication node according to the rule that a task is fulfilled most quickly, and the efficiency of communication simulation is improved.

Description

A kind of communication scheduling analogy method of time-based restriction

(1) technical field

What the present invention relates to is a kind of communication scheduling analogy method of time-based restriction.

(2) background technology

In modern society, communications network system is a typical complex networks system, not only itself there are the characteristics such as system complexity, self-organization, criticality, and and other critical infrastructures system between and exist complicated dependence between user crowd.The imitation technology of communication system is that computer is tested model of communication system, can make the user set up in a short period of time whole model of communication system, has economy, safety, short characteristics of cycle.

In all communication systems, the Random Effects such as interchannel noise, interference and decline can cause damage to the transmission of information.Want accurately simulation communication system, at first will set up model accurately to these impacts, signal of communication is the basis of communication system, so it is significant in modern communication technology to develop an efficient signal of communication analog simulation environment.

For above situation, we have proposed a kind of concurrent network traffics analogy method based on pseudo random number and have realized network service emulation: at first all nodes of network are numbered, if total N node, then generate random number M, L and mean that following expression node M will communicate with other L network node, finally generate L three-number set and mean respectively communication nodes, communicate by letter at the latest time started and communication time.According to generated random number, communication task is arranged to the communication port to node M guaranteeing on the basis of late start time take to finish the work the soonest as principle.

(3) summary of the invention

The object of the present invention is to provide a kind of concurrent network traffics analogy method based on pseudo random number.The method is used random number to generate the communication of analog network node in topological network, the randomness of outstanding analog network communication, on the basis of time started that guarantees to communicate by letter at the latest, take finishes the work as principle simultaneously the soonest arranges the communication port to communication nodes, improves the efficiency of communication simulation.

The object of the present invention is achieved like this:

If from the M node, will communicate with other network nodes in network topology, amount of communications is L; If node M has P communication interface, usage data form Port _i?<Q ₁, R ₁, S ₁], [Q _i, R _i, S _i] ..:TOTAL _imean that node passes through port P _ineed successively to network node Q ₁, Q ₂serially-transmitted data, [Q _i, R _i, S _i] mean that node M is to network node Q _isend data at the latest at S _iconstantly start, the data transmission period needed is R _i,, TOTAL _imean communication port P _icomplete the total time that all transmission required by task are wanted;

Generate L and organize different ternary random number { Q ₁, R ₁, S ₁... { Q _i, R _i, S _i... { Q _l, R _l, S _lmean communication task, wherein Q _i≠ M; For guaranteeing communication task, can before starting at the latest, carry out, and guarantee that all communication tasks complete with the fastest speed, use following mode to communicate: at first communication task to be carried out to ascending sort according to the size of late start time, formed like this L orderly transmission task list, then a front P communication task is distributed to P communication port, P the concurrent execution of transmission task before guaranteeing, form task list PortList:Port ₁?<[Q ₁, R ₁, 0]: TOTAL ₁..., Port _p?<[Q _p, R _p, 0]: TOTAL _p; TOTAL _i=R _i; Make to guarantee with the following method that a L-P task in back completes within the shortest time: get communication task Qi, Ri, Si}, i>P, if TOTAL ₁early than S _i, make TOTAL ₁+ R _i, will send task { Q _i, R _i, S _idirectly put into Port ₁the task list that middle formation is new, otherwise, from Port ₁start, check successively each communication task in other port task list; If at port P _iin insert { Q before arranged N task _i, R _i, S _i, can guarantee P _iin before deadline of N-1 task be less than S _i, and { Q _i, R _i, S _itask insert and can not cause port P _iin N be greater than its late start time to time started of last task, by task { Q _i, R _i, S _ibe inserted into P _iin N position, and by task list according to TOTAL _isize again ascending sort be Port ₁, Port ₂if the task list at other port does not find suitable position, give up this communication task; Complete successively the arrangement of L transmission task, just formed complete transmission Task-list PortList; Each port of node M only needs to carry out according to the record of PortList the communication scheduling analogy method that the data transmission just can simulate the time-based restriction;

Concrete steps are:

(1) generate random number M, L, mean that network node M will carry out communicating by letter for L time with other network node, and initialization RList, PortList are empty;

(2) communication port of random generating network node M is counted P, port numbering num=1,2 ... P;

(3) i=1 is set;

(4) generate random number { Q _i, R _i, S _i;

(5) if satisfy condition Q _i≠ M, execution step (6); Otherwise execution step (4);

(6) initialization j=1;

(7) if i > 1 execution step (8), otherwise execution step (11);

(8) take out Qj from RList, if Qi=Qj execution step (9), otherwise execution step (10);

(9) if S _i=S _j, execution step (4), otherwise execution step (10);

(10) j+1; If j=i; Execution step (11), otherwise execution step (8);

(11) by { Q _i, R _i, S _iadd RList, i+1;

(12) if i > L performs step (13); Otherwise execution step (4);

(13) by the task in RList according to ascending sort;

(14) i=1 is set;

(15) if i<=P performs step 16, otherwise perform step 17;

(16) take out an element { Q from RList _i, R _i, S _i, make TOTAL _i=R _iformation task Port _i?<[Q _i, R _i, S _i]: TOTAL _iand add data list PortList, perform step 29;

(17) by element in PortList according to port TOTAL value ascending sort again;

(18) take out an element { Q from RList _i, R _i, S _i, if TOTAL ₁<=S _iexecution step 19, otherwise perform step 20;

(19) by { Q _i, R _i, S _iform communication task and give port P ₁, TOTAL is set ₁=TOTAL ₁+ R _i; The renewal task list is Port ₁?<[Q ₁, R ₁, S ₁] ... [Q _i, R _i, S _i]: TOTAL ₁, perform step 29;

(20) initialization s=1;

(21) initialization m is Port _sin arranged the number of task;

(22) if Port _sin before m-1 task deadline be less than S _iperform step 23, otherwise perform step 27;

(23) initialization n=m;

(24) if deadline of a front n-1 task and add R _ibe less than S _n, perform step 25, otherwise perform step 28;

(25) value of N adds 1, if n is greater than Port _sthe number of middle task, perform step 26, otherwise perform step 24;

(26) take out an element { Q from RList _i, R _i, S _i, form communication task and insert port Port _sm position, TOTAL is set _s=TOTAL _s+ R _i; Execution step 29;

(27) value of m subtracts 1, if m > 0, perform step 22, otherwise perform step 28;

(28) value of s adds 1, if s<=P performs step 21; Otherwise give up this task, perform step 29;

(29) value of i adds 1, if i<=L execution step 15, otherwise EP (end of program);

Key of the present invention is to improve simulation efficiency on the basis of analog network communication randomness and concurrency.For this reason, on the basis that guarantees the communication late start time, take finishes the work the soonest as principle arranges the communication port to network node, on the basis that guarantees the random concurrent communication of network node, also makes the efficiency of analog communication environment be improved.

Its main feature is as follows:

1, determine communication nodes and the call duration time in network with random digit generation method, each communication nodes and call duration time produced all is not quite similar, make the network communications environment generated have more generality;

2, take to finish the work the soonest as principle on the basis that guarantees the communication time started communication task is arranged to the communication port to network node, and use simple list to complete the record of Random Communication environment, improved the efficiency of analog communication environment.

(4) accompanying drawing explanation

Fig. 1: a kind of communication scheduling analogy method of time-based restriction

(5) concrete execution mode

For a more detailed description to the present invention below in conjunction with accompanying drawing:

The method of the invention is characterised in that:

If from the M node, will communicate with other network nodes in network topology, amount of communications is L; If node M has P communication interface, usage data form Port _i?<Q ₁, R ₁, S ₁], [Q _i, R _i, S _i] ..:TOTAL _imean that node passes through port P _ineed successively to network node Q ₁, Q ₂serially-transmitted data, [Q _i, R _i, S _i] mean that node M is to network node Q _isend data at the latest at S _iconstantly start, the data transmission period needed is R _i,, TOTAL _imean communication port P _icomplete the total time that all transmission required by task are wanted;

Generate L and organize different ternary random number { Q ₁, R ₁, S ₁... { Q _i, R _i, S _i... { Q _l, R _l, S _lmean communication task, wherein Q _i≠ M; For guaranteeing communication task, can before starting at the latest, carry out, and guarantee that all communication tasks complete with the fastest speed, use following mode to communicate: at first communication task to be carried out to ascending sort according to the size of late start time, formed like this L orderly transmission task list, then a front P communication task is distributed to P communication port, P the concurrent execution of transmission task before guaranteeing, form task list PortList:Port ₁?<[Q ₁, R ₁, 0]: TOTAL ₁..., Port _p?<[Q _p, R _p, 0]: TOTAL _p; TOTAL _i=R _i; Make to guarantee with the following method that a L-P task in back completes within the shortest time: get communication task Qi, Ri, Si}, i>P, if TOTAL ₁early than S _i, make TOTAL ₁+ R _i, will send task { Q _i, R _i, S _idirectly put into Port ₁the task list that middle formation is new, otherwise, from Port ₁start, check successively each communication task in other port task list; If at port P _iin insert { Q before arranged N task _i, R _i, S _i, can guarantee P _iin before deadline of N-1 task be less than S _i, and { Q _i, R _i, S _itask insert and can not cause port P _iin N be greater than its late start time to time started of last task, by task { Q _i, R _i, S _ibe inserted into P _iin N position, and by task list according to TOTAL _isize again ascending sort be Port ₁, Port ₂if the task list at other port does not find suitable position, give up this communication task; Complete successively the arrangement of L transmission task, just formed complete transmission Task-list PortList; Each port of node M only needs to carry out according to the record of PortList the communication scheduling analogy method that the data transmission just can simulate the time-based restriction;

Concrete steps are:

(1) generate random number M, L, mean that network node M will carry out communicating by letter for L time with other network node, and initialization RList, PortList are empty;

(2) communication port of random generating network node M is counted P, port numbering num=1,2 ... P;

(3) i=1 is set;

(4) generate random number { Qi, Ri, Si};

(5) if satisfy condition Q _i≠ M, execution step (6); Otherwise execution step (4);

(6) initialization j=1;

(7) if i > 1 execution step (8), otherwise execution step (11);

(8) take out Qj from RList, if Qi=Qj execution step (9), otherwise execution step (10);

(9) if Si=Sj performs step (4), otherwise execution step (10);

(10) j+1; If j=i; Execution step (11), otherwise execution step (8);

(11) by { Si} adds RList for Qi, Ri, i+1;

(12) if i > L performs step (13); Otherwise execution step (4);

(13) by the task in RList according to ascending sort;

(14) i=1 is set;

(15) if i<=P performs step 16, otherwise perform step 17;

(16) from RList, take out an element Si}, make TOTALi=Ri form task Porti{[Qi, Ri, Si for Qi, Ri]: TOTALi} also adds data list PortList, performs step 29;

(17) by element in PortList according to port TOTAL value ascending sort again;

(18) { Si}, if TOTAL1<=Si performs step 19, otherwise perform step 20 for Qi, Ri to take out an element from RList;

(19) by { Si} forms communication task and gives port P1, and TOTAL1=TOTAL1+Ri is set for Qi, Ri; The renewal task list is Port1{[Q1, R1, S1] ... [Qi, Ri, Si]: TOTAL1} performs step 29;

(20) initialization s=1;

(21) initialization m has arranged the number of task in Ports;

(22) if before in Ports the deadline of m-1 task be less than Si perform step 23, otherwise perform step 27;

(23) initialization n=m;

(24) if deadline of a front n-1 task and add that Ri is less than Sn perform step 25, otherwise perform step 28;

(25) value of N adds 1, if n is greater than the number of task in Ports, performs step 26, otherwise performs step 24;

(26) { Si}, form m the position that communication task is inserted port Ports, and TOTALs=TOTALs+Ri is set for Qi, Ri to take out an element from RList; Execution step 29;

(27) value of m subtracts 1, if m > 0, perform step 22, otherwise perform step 28;

(28) value of s adds 1, if s<=P performs step 21; Otherwise give up this task, perform step 29;

(29) value of i adds 1, if i<=L execution step 15, otherwise EP (end of program);

Its concrete Implementation Modes is such:

At first the network node in network topology is numbered, then generates node and the amount of communications that will communicate by letter, according to amount of communications, generate node, late start time and the call duration time of each communication; Communication task is sorted according to late start time, then each port that is communication nodes arranges a communication task, the task deadline by remaining communication task according to port, select the shortest and port task concluding time task time to be less than the port of new task late start time as transmit port; The task of each port has just formed a task list by the array record like this, only needs once to communicate by letter with communication nodes according to the time started of list records, has just simulated a kind of flow based on pseudo random number concurrent.

Claims (1)

1. the communication scheduling analogy method of time-based restriction, it is characterized in that: the object of the present invention is achieved like this: establish in network topology from the M node, will communicate with other network nodes, amount of communications is L; If node M has P communication interface, usage data form Port _i?<Q ₁, R ₁, S ₁], [Q _i, R _i, S _i] ..:TOTAL _imean that node passes through port P _ineed successively to network node Q ₁, Q ₂serially-transmitted data, [Q _i, R _i, S _i] mean that node M is to network node Q _isend data at the latest at S _iconstantly start, the data transmission period needed is R _i,, TOTAL _imean communication port P _icomplete the total time that all transmission required by task are wanted;

Generate L and organize different ternary random number { Q ₁, R ₁, S ₁... { Q _i, R _i, S _i... { Q _l, R _l, S _lmean communication task, wherein Q _i≠ M; For guaranteeing communication task, can before starting at the latest, carry out, and guarantee that all communication tasks complete with the fastest speed, use following mode to communicate: at first communication task to be carried out to ascending sort according to the size of late start time, formed like this L orderly transmission task list, then a front P communication task is distributed to P communication port, P the concurrent execution of transmission task before guaranteeing, form task list PortList:Port ₁?<[Q ₁, R ₁, 0]: TOTAL ₁..., Port _p?<[Q _p, R _p, 0]: TOTAL _p; TOTAL _i=R _i; Make to guarantee with the following method that a L-P task in back completes within the shortest time: get communication task Qi, Ri, Si}, i>P, if TOTAL ₁early than S _i, make TOTAL ₁+ R _i, will send task { Q _i, R _i, S _idirectly put into Port ₁the task list that middle formation is new, otherwise, from Port ₁start, check successively each communication task in other port task list; If at port P _iin insert { Q before arranged N task _i, R _i, S _i, can guarantee P _iin before deadline of N-1 task be less than S _i, and { Q _i, R _i, S _itask insert and can not cause port P _iin N be greater than its late start time to time started of last task, by task { Q _i, R _i, S _ibe inserted into P _iin N position, and by task list according to TOTAL _isize again ascending sort be Port ₁, Port ₂if the task list at other port does not find suitable position, give up this communication task; Complete successively the arrangement of L transmission task, just formed complete transmission Task-list PortList; Each port of node M only needs to carry out according to the record of PortList the communication scheduling analogy method that the data transmission just can simulate the time-based restriction;

Concrete steps are:

(1) generate random number M, L, mean that network node M will carry out communicating by letter for L time with other network node, and initialization RList, PortList are empty;

(2) communication port of random generating network node M is counted P, port numbering num=1,2 ... P;

(3) i=1 is set;

(4) generate random number { Q _i, R _i, S _i;

(5) if satisfy condition Q _i≠ M, execution step (6); Otherwise execution step (4);

(6) initialization j=1;

(7) if i > 1 execution step (8), otherwise execution step (11);

(8) take out Qj from RList, if Qi=Qj execution step (9), otherwise execution step (10);

(9) if S _i=S _j, execution step (4), otherwise execution step (10);

(10) j+1; If j=i; Execution step (11), otherwise execution step (8);

(11) by { Q _i, R _i, S _iadd RList, i+1;

(12) if i > L performs step (13); Otherwise execution step (4);

(13) by the task in RList according to ascending sort;

(14) i=1 is set;

(15) if i<=P performs step 16, otherwise perform step 17;

(16) take out an element { Q from RList _i, R _i, S _i, make TOTAL _i=R _iformation task Port _i?<[Q _i, R _i, S _i]: TOTAL _iand add data list PortList, perform step 29;

(17) by element in PortList according to port TOTAL value ascending sort again;

(18) take out an element { Q from RList _i, R _i, S _i, if TOTAL ₁<=S _iexecution step 19, otherwise perform step 20;

(19) by { Q _i, R _i, S _iform communication task and give port P ₁, TOTAL is set ₁=TOTAL ₁+ R _i; The renewal task list is Port ₁?<[Q ₁, R ₁, S ₁] ... [Q _i, R _i, S _i]: TOTAL ₁, perform step 29;

(20) initialization s=1;

(21) initialization m is Port _sin arranged the number of task;

(22) if Port _sin before m-1 task deadline be less than S _iperform step 23, otherwise perform step 27;

(23) initialization n=m;

(24) if deadline of a front n-1 task and add R _ibe less than S _n, perform step 25, otherwise perform step 28;

(25) value of N adds 1, if n is greater than Port _sthe number of middle task, perform step 26, otherwise perform step 24;

(26) take out an element { Q from RList _i, R _i, S _i, form communication task and insert port Port _sm position, TOTAL is set _s=TOTAL _s+ R _i; Execution step 29;

(27) value of m subtracts 1, if m > 0, perform step 22, otherwise perform step 28;

(28) value of s adds 1, if s<=P performs step 21; Otherwise give up this task, perform step 29;

(29) value of i adds 1, if i<=L execution step 15, otherwise EP (end of program).

Images