Analysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer

Transcription

1 International Reearch Journal of Applied and Baic Science 218 Available online at ISSN X / Vol, 12 (1): Science Explorer Publication Analyi of the reult of analytical and imulation With the network model and dynamic priority Unchecked Buffer Fathollah Dadgar Arablou 1, Aliyev alakbar 2 1. Baku tate Univerity, AZ 1148, Baku, Av. Academy of Z. Khalilova Baku tate univerity,az 1148,Baku,Av,Academy of Z.Khalilova Correponding Author Dadgar_52@yahoo.com ABSTRACT: The problem of chooing optimal parameter for dynamic prioritie in the cae of the variou type of ervice reuet with linearly decreaing function of prioritie, The reult of analytical and imulation model of ditributed computer network with dynamic prioritie and unlimited buffer reidence time reuirement of the network i limited. The network contraint violation reult in a lo reuirement. In thi paper A comparative analyi of the reult of analytical and imulation model are conducted with the purpoe to verify the adeuacy of the analytical model. General Term: Dynamic Analyi, Priority in the Service, Unchecked Buffer Keyword: Service, dynamic prioritie, Unchecked Buffer, unlimited buffer, Priority. INTRODUCTION The procee for managing ditributed computer network with dynamic reuirement and prioritie unchecked buffer. Such ervice are ued in the ervice ytem, in which ubcriber are in moving vehicle. Under the ervice i undertood pretreatment coordinate information and vehicle peed. The time between the arrival of the reuirement of the ytem and the end of the ervice i limited to a certain value, and if thi time exceed thi value, the reuirement will be lot. Thi information received too late for the conumer, o it i uele [1-3]. In [4] tudied the proce of managing ditributed computer network with dynamic prioritie, reuirement and unlimited buffer, and it i hown that the lower limit of total loe achieved with a finite value of the ueue length. Uing thee reult olved the problem of determining the optimal characteritic of the ervice proce in a ditributed computer network, and often it i to ome extent complicate the operating ytem. However, the development of more advanced algorithm for the organization of the ervice proce may allow to reduce the lo of reuirement, accompanied by the growth performance of the network ervice. A feature of the algorithmic approach i to minimize the lo of the reuirement by removing the preventive part of them, without waiting for the ervice.a feature of thee network i to minimize the lo of claim due to the preventive removal of ome of them, without waiting for the ervice. In order to tudy the functioning of uch a network, it can be conidered a model of ueuing ytem (QS).It i neceary to olve the problem of optimization of parameter determining the nature of the preventive removal reuirement, reulting in minimizing their loe. It hould be noted that in order to confirm adekvtnoti analytical model developed in [5], it i neceary to develop imulation model of uch network and ervice to compare the reult of both model. 1 2 N Figure.1. QS with unlimited ueue

2 Intl. Re. J. Appl. Baic. Sci. Vol., 12 (1), 49-53, 218 Solution of the problem The input tage of the QS (Figure. 1) enter the flow reuirement. Becaue of the reuirement of the ueue defined by ome rule, come with eual probability for all erviceable and free from computer maintenance. After leaving the ervice reuirement of the ytem. Service aume a uniform input tream with the reuirement of eual a priori prioritie. In the proce of dynamic priority ervice reuirement may vary depending on the ituation. The ervice time of all claim ditributed according to the ame law. The network operation i poible if the ituation change in two place: in the ueue and ervice. Stay reuirement ytem conit of two phae: the expectation and ervice, and the total reidence time reuirement of the ytem mut not exceed the maximum allowable value, ie. After leaving the ervice reuirement of the ytem. Service aume a uniform input tream with the reuirement of eual a priori prioritie. In the proce of dynamic priority ervice reuirement may vary depending on the ituation. The ervice time of all claim ditributed according to the ame law. The network operation i poible if the ituation change in two place: in the ueue and ervice. Stay reuirement ytem conit of two phae: the expectation and ervice, and the total reidence time reuirement of the ytem mut not exceed the maximum allowable value, ie. On tandby phae reuirement i not atifying thi condition and can be removed from the ytem via a certain rule, and therefore there are loe in the firt-order In the maintenance phae (or immediately after it completion) reuirement can be removed from the ytem, if it tay in the ytem exceed, and thee reuirement are the loe of the econd kind p 2 p 1,In general, the purpoe of thi rule i to chooe a removal pending and erved the reuirement under which minimize the mathematical expectation value of the total lo of both Kind, that i; M 1 min (1) [ P( p, p2)] Where L m (2), L, m, value reidence time reuirement of the ytem, ueue length, the maximum value of the reidence time reuirement of the ytem, the maximum value of the number of eat in the waiting ueue. Optimal ueuing and ervice to achieve maximum efficiency of the ytem by removing from the ytem before or during maintenance of thoe reuirement which do not fulfill the condition of. For the organization of ervice ytem in thi paper baed on the following two verion of the algorithm of interaction of ueuing and ervice received reult of analytical and imulation model, in which can be ued for oftware development of uch ytem for variou purpoe: - The line i not limited to L, and optionally meauring the reidence time reuirement of the ytem. The ytem ha the ability to meaure the reidence time reuirement of the ytem, and when ervicing i not. Therefore, in the algorithm we et limit on the waiting time in the ueue, and the fact of exceeding the allowable reidence time reuirement of the ytem in the algorithm jut a in the firt embodiment may be detected after the maintenance. - The line i not limited to L and in both phae i poible to meaure the reidence time reuirement of the ytem. Therefore, the fact of exceeding the acceptable reidence time reuirement of the ytem For an exponential ervice time value detected at either of the two phae, i.e. at the time of it occurrence. L can be defined a follow [4]: L P /( N ) In thi formula, depending on the nature of the object, you can ue the ytem to allow the following approximation: N In 1 1 / N 2 L In / N 1 L /( N ) When famou L can alo be defined latency reuirement in the ueue, the reidence time reuirement in the,the expected number of claim in the ytem

3 Intl. Re. J. Appl. Baic. Sci. Vol., 12 (1), 49-53, 218 L : L / / ; L ; / N 1 ; L L It hould be noted that the conidered option for interaction and ueuing ervice correpond to different technical ytem and they decribe different in term of effectivene and poible interaction ueuing and ervicing hould be noted that if the maintenance reuirement and check the condition of produced in different computer (the firt option) then there i no poibility to top ervice reuirement, even if the condition i violated )..Thi i the cae in the firt verion of the algorithm (in the ervice ha no way of meauring time In the cae of ervice reuirement and check the condition of home computer, demand detained and ytem longer than produced in the ame network i removed from it, without waiting for the ervice. Thi ituation occur in the econd embodiment (of ervice i poible to meaure the time ).Thee variant of the algorithm have unlimited number of location al the ueue i made by the criterion of the reidence time in dimenion Feeder L and removing them from (it i poible to maintain the time ).An option that allow you to exclude from the ytem of "hopele" reuirement before another coure i more efficient and "intelligent." Furthermore, it hould be noted that each embodiment interaction ueuing and ervice depending on the level of degradation of the ytem mut be adjuted delete rule. m and (.1.5,,.22).1, 9 For the,conducted voluminou computational experiment and numerical reult are obtained. On the bai of thee reult the following were built according to L ( LS ) f ( ), ( S ) f ( ) P f (N) hown in Fig L ( L S ) ( S ) Figure.2. Dependencie L ( L ) f ( ) S

4 Intl. Re. J. Appl. Baic. Sci. Vol., 12 (1), 49-53, 218 P Figure.3. Dependencie ( ) f ( ) S Figure 4. Dependence P f (N) N The analyi of thee dependence how that the value of the ueue length and the number of cutomer in the ytem are reduced at.3 The value of the waiting time in the ueue reuirement, the reidence time reuirement in the reach it minimum value at. 4, and hence the minimum value of total data lo i achieved with N 3. A already noted, in order to confirm the adeuacy of the analytical (A) model of the language GPSS (General purpoe imulation ytem) developed model (I), run the imulation model with the following reult [ ]. GPSS World Simulation Report - Untitled Model START TIME END TIME BLOCKS FACILITIES STORAGES FACILITY ENTRIES UTIL. AVE. TIME AVAIL. OWNER PEND INTER RETRY DELAY SYSTEM USER CHAIN SIZE RETRY AVE.CONT ENTRIES MAX AVE.TIME LINE CEC XN PRI M1 ASSEM CURRENT NEXT PARAMETER VALUE TSRV FEC XN PRI BDT ASSEM CURRENT NEXT PARAMETER VALUE The reult of thi model how that the utilization rate of the ervice channel i.957, the average ueue length i.12, taking into account all TRANSACT average waiting time of.21. Baed on the reult of both model and compare the reult baed on a formula determined by İ A A. / Deviation of thee reult. The reult revealed that the deviation of thee reult i that confirm the adeuacy of the analytical model. It hould be noted that thee reult can be ued in the contruction of ditributed ervice network for variou purpoe. CONCLUSION Thi paper analyze the reult of analytical and imulation model of ditributed network with dynamic prioritie and unlimited buffer reidence time reuirement of the network i limited. The network contraint violation reult in a lo reuirement. Comparative analyi of the reult of analytical and imulation method for the problem of minimizing the lo of claim due to the preventive removal of ome of them, without waiting for the ervice adeuacy of the analytical reult.thee model cover a wide cla of advanced 52

5 Intl. Re. J. Appl. Baic. Sci. Vol., 12 (1), 49-53, 218 network for different purpoe. I i hown that the length of the cla i alway adviable to forcibly remove ome of the reuirement of the pending ueue, thu reducing the load on the erving euipment, and ultimately minimizing the total lo of both Kind. REFERENCES Bulletin BSU, a erie of phyical and mathematical cience, 3,214, Chao H.J., Peckan I.H. Queue management with multiple delay and lo prioritie for ATM witche // Proc. ICC'94,1994.-pp Communication eti.- Kleinrock L. M.: Science, 197, c.256. Imaylov BG, FA Dadgar Analyi of the characteritic of the network with dynamic prioritie and unlimited buffer. vol.18,no ,pp Imaylov BG, FA Dadgar Analyi of the characteritic of the network with dynamic prioritie and a limited buffer. Information tehnologiimodelirovaniya and management. Voronezh, 3 (81) Kelton W. Lowe A.Imitationnoe imulation. Claic S.S. The 3rd edition of St. Peterburg.: Peter, Kiev: BHV Publihing Group, 24 to Kelton W. Lowe A.Imitationnoe imulation. Claic S.S. The 3rd edition of St. Peterburg.: Peter, Kiev: BHV Publihing Group, 24 to Kim C.S., Melikov A.Z., Ponomarenko L.A. Approximation method for performance analyi of ueuing ytem with multimedia traffic // Applied and Comput. Math.27.-vol.6, no.2.- pp Kim Ji Song, A.Z.Melikov, BG Imailov Optimal dynamic aignment of prioritie in ueuing ytem with two type of application and Riga. AVT 6,28, Kleinrock L. ueuing theory. M.: Mechanical Engineering, vol.18,no ,pp Lee Y., Choi BDQueueing ytem with multiple delay and lo prioritie for ATM network // Information ytem.21.- vol pp Mammadli EM, Slipchenko AI, Huidman V.B.Modeli organization dipatch many CPU computing real-time ytem. Automation and Remote Control, M.: Mammadli EM, Slipchenko AI, Huidman V.B.Modeli organization dipatch many CPU computing real-time ytem. Automation and Remote Control, M.: vol pp