Method of controlling access to intellectual switching nodes of telecommunication networks and systems

Transcription

1 ISSN (e): Volume 05 Issue 05 ay 2015 Intenational Jounal of Computational Engineeing eseach (IJCE) ethod of contolling access to intellectual switching nodes of telecommunication netwoks and systems Alexey Sminov 1 ohamad Abou Taam 2 Segey Sminov 2 1 The head of the Depatment of Softwae Kiovohad National Technical Univesity Kiovohad Ukaine 2 Gaduate student in the Depatment of Softwae Kiovohad National Technical Univesity Kiovohad Ukaine ABSTACT: The developed method of contolling access to intellectual switching nodes includes a mathematical model of intellectual switching nodes with sevice infomation packets of diffeent pioity and an impoved algoithm to contol access to the cloud "of telecommunications esouces. Based on multichannel model (CO) as well as developed GET model of intellectual switching V K nodes caied out the study of functioning infomation and telecommunication netwok. The Equivalent Wfunction distibution function and density distibution of sevice time infomation packets of metadata in intelligent switching nodes when they ae tansfeed to the cloud antivius systems it is detemined that an additional citeion fo attibution infomation packet "efeence" pioity can be the value of the pobability of assigning pioity. KEYWODS: Infomation and Telecommunications Netwok GETmodel access contol intellectual switching nodes. I. DEFINITION OF POBLE In cuent conditions of dynamic development of vaious appoaches of the analysis and synthesis of the telecommunication netwoks integated into infomation and telecommunication technology [15] thee ae questions of elaboation and application of the geneal methods of ensuing sevice quality based on allocation of sepaate classes of quality and ealization of managing algoithms such as pioitization of infomation packages esevation of telecommunication esouces oganization of queuing in switching nodes etc. The manifestation of new destabilizing factos associated with the influence of the malicious softwae on the pocess of the functioning of infomation and telecommunication netwoks obliges to evise the geneal capabilities of the existing mechanisms fo managing the sevice quality and putting suggestions (algoithms) and adapting them with possible wongful action of paticipants of telecommunications exchange. Thus thee is a need to develop netwoking and communications technologies and to elaboate the methods of managing netwok esouces that could povide: sevice quality and infomation secuity at the joint tansfe of heteogeneous taffic taking into account the constaint of netwok esouces the eal eliability of telecommunications equipment and possible extenal influence malicious o othe chaacte ; Safety of functioning of individual nodes of infomation and telecommunication system fom the effect of malicious softwae; Stability (eliability suvivability functional safety) is functioning unde the above conditions etc. One of effective mechanisms that face malicious softwae is the use of antivius esouces cloud. Studies of main pocedues of data exchange in infomationtelecommunication systems have shown that one of key oles at ensuing delivey timeliness of metadata (signatues) in "cloud" antivius systems plays a ole of tansmission contol mechanism. Thus thei basic algoithms ae ealized specifically in switching nodes. The given fact has allowed coming to the conclusion about the need to develop a method fo managing netwok esouces taking into account the advanced pocedues of the oganization and queue scheduling. Open Access Jounal Page 1

2 ethod of contolling access to intellectual switching nodes of II. GENEAL DEFINITION OF POBLE AND DESCIPTION OF SWITCHING NODES FUNCTIONING Accoding to data mentioned in [15] stuctual and functional stuctue ITS of next geneation netwok (NGN) is heteogeneous. This facto is especially mentioned in the ealy stages of ITS stuctue. It should be noted that only when combining low speed taffic thee ae peconditions fo the use of models of simplest packets [1]. This is because the lage numbe of small independent odinay stationay (nonstationay) steams with diffeent afteeffect (Khinchin's theoem) [1.2] as well as the tansfomation of steams in netwok (summation sceening) [1.2] in limit gives the steam that is close to the simplest packet: а а ( t ) 1 e ( t ) 0 t 0 (1) the paamete of steam tansfeed to paametes of tansmission by using this equation: с ) q ( ) ( c q ( ) t сегм L ( ) прд ( ) L пак intensity of eceived messages; 1 c ( ) t сегм ( ) the aveage numbe of packets in the message го pioity; L ( ) ( ) ( ) прд the aveage time of packet segmentation го pioity; the length of the infomation potion of packet го pioity; L пак ( ) speed of sending(pocessing) infomation го pioity; L ( ) ( ) ovehead on packet convesion ; the length of the packet го pioity; Pioity packets fom diffeent classes as soon as they access to ITs ae divided into packets of diffeent length while limiting thei maximum size. This assumption allows dawing a conclusion on the possibility of use while ceating such netwoks in the appopiate calculations and a demonstation law of distibution of the andom vaiable duation of thei sevice in switching nodes [13]. In this case the duation of sevice packet pioities 1 of the andom vaiable with distibution function [1.2] is: B t 1 e t (2) b t 0 b 0 And the end of the fist two moments is: b tdb b 0 0 t 1 t ср ( 2 ) 2 2 t 1 db v L прд пак (3) 2 ср (4) (5) aveage intensity of sevice packets ср Open Access Jounal Page 2

3 ethod of contolling access to intellectual switching nodes of In the example mentioned above switching node is ealized in the next sevice discipline. If at the time of access of packet with any pioity 0 i V 1 ) so it (packet) immediately access to the sevice. 1 thee ae fee channels (switching node status b) in the case of occupancy of all channels (switching node status V i V K ) the eceived packet го pioity is queued and it is accepted fo sevice befoe the packet of j го pioity if j : If at the time of access of the packet of pioity in queues thee wee K packets (the buffe is filled completely) so the eceived packet is : Accepted in queue unde conditions that thee ae packets with lowpioity j the latte packet with low pioity is ousted fom the system and late does not have any impact on it (system); The packet Is Lost given that in a queue thee ae only packets with highe o equal j м pioity. b) Fo packets (equal) pioities that ae in the queue FIFO system is ealized As shown in the discipline of sevice in switching node when packets set in the queue and queue is managed the absolute pioity functions while in the sevice the elative pioity functions. The use of absolute pioity queue management only povides sevice packets without inteuption but at the same time the losses and the aveage waiting time pioity packet ae minimized. At the same time this discipline mentioned above has a numbe of disadvantages associated with the lack of malicious factos o othe extenal influences on ITS. Theefoe in the conditions of destuctive extenal influences and the fequent failue of telecommunications equipment using this model in the ceation of ITS influence negatively on the pocess of ensuing the quality of sevice indicatos such as infomation and functional secuity eliability. Studies have shown that in ode to eliminate these disadvantages it is advisable to use a mathematical model of switching node type with elative pioities esouce esevation and taking into consideation the eal eliability of seving devices. V K odel of switching node and its elative pioities esevations esouces and eal eliability of seving devices. The assumptions listed above (concening: appoximation of packet steam class : 1 ; with the chaacteistics of a Poisson distibution law; sevice with elative pioities 1 class of sevice quality taking into account the categoies of uses and the subsystems; pesence of V seving devices with the ultimate eliability of the vaiablelength packets; chaacteized by the exponential distibution function (2) with paamete defined by equation (5)) aim at managing taffic and ensuing the specified quality of sevice indicatos (including infomational and functional safety)unde conditions of limited esouces ITS possible malicious o othe effects a discipline sevice and thei elative pioities of patial switching channel 1 V and a joint (sepaate) use of dives K could be applied. This will ensue the backup of telecommunication esouces fo highpioity taffic (especially metadata in cloud antivius systems) [3.5]. The analysis of basic algoithms management queue in ITS communications equipment showed that cuently thee ae seveal types of disciplines (ways) of sevice queues that ealize the esevation of esouces: (Fai Queuing FQ); (Pioity Queuing (PQ)); (Custom Queuing CQ); (WFQ Fai Queuing Weighted); (Class Based Weighted Fai Queuing CBWFQ) etc. [35]. Open Access Jounal Page 3

4 ethod of contolling access to intellectual switching nodes of Compaative studies of these algoithms have shown that the most effective in tems of ensuing quality of sevice is the algoithms of WFQ CBWFQ deived algoithms CQ. Theefoe futhe eseach is based on the management of WFQ and CBWFQ queue. Let s pesent a telecommunication system in which the sevices ae divided into seveal classes quality of sevice (QoS) with appopiate pioities fo latency and packet loss (fo example tansfe of infomation and measuement of monitoing data telephony postal infomation tansfe video confeencing etc.). The total numbe of pioities fo the types of sevices uses and subsystems is Let s conside that at the entance intellectual switching node eceives the simplest packets steam s pioity classes { } which ae numbeed in ode of pioity. Each pioity class is chaacteized by the а 1... а... a intensity of packets : 0 In the paticula case pioities ae gouped in thee goups 1 sevices: J J taffic of metadata fo tansmission in the cloud antivius system; 3 coesponding to the 2 2 J taffic of eal time citical to netwok delays (telephony videoconfeencing data objective contol etc.); 3 J 1 Taffic of data citical to losses and not citical to netwok delays including steam of taffic (audio video on demand etc..) and elastic taffic ( webapplications etc..). In this case the highest pioity is using metadata fo tansmission to the cloud antivius system. Theefoe In the switching nodes of infomation and telecommunication systems pesented diffeent smat devices (contolles gateways switches outes gateways etc.) tanspot netwok uses of diffeent categoies and subsystems steam eceived message of diffeent classes. The intensity of eceived and sevice messages is chaacteized by paametes c и c 1 and in accodance with the speed of eceived message (tansfe ). The eceived messages in the switching nodes ae conveted into a packet fom and fom an v прд independent packet steam а... а... with intensities... 1 a The intellectual switching nodes ITS consists of 0 V seving devices with identical tacticaltechnical chaacteistics depending on capabilities of manufactues of telecommunication equipment and the buffe memoy capacity 0 К. In switching nodes estictions ae imposed on seving devices esouces V V and memoy buffe size К К packet of diffeent pioity classes. In this case the packet with pioity accesses to all seving devices and allocates a potion of buffe of the total volume of the buffe detemines in accodance with the advanced algoithm to contol access to "cloud" telecommunications esouces descibed below. Fo packet of pioities 2 2 J the available pat V V of the device sevice is not in use at the moment of metadata packet pioity detemines the impoved algoithm to contol access to cloud telecommunications esouces and allocates a pat of buffe К К fom total capacity of the buffe K Fo packets of emaining pioities 3 J 1 thee ae a estictive theshold only one pat of the oveall sevice devices V V is available and a pat of the total capacity of the buffe is allocated К К so 1 К classes. К. Within each pioity class J J 1 3 allocated buffe shaed data packets pioity Open Access Jounal Page 4

5 ethod of contolling access to intellectual switching nodes of It should be noted that the oganization of distibution of esouces of switching nodes in a memoy buffe infomation packet pioity class 1 pactically is zeo ( P 0 )). Similaly thee is pobability of losing P 2 infomation packet pioity class 2 P 0. 2 In intellectual switching nodes ITS sevice packet is subject to the following discipline [35]. a) If at the time of access of the infomation packets with pioity J J 1 3 they ae fee fom the pioity class fo the devices so it s in accodance with an algoithm to contol the access to cloud telecommunications esouces entes at the sevice. b) in case of occupancy of all available sevices devices (intellectual switching nodes status V i V K ) sepaate queues ae oganized fo packets with the pioities J and 3 J 1. In this case in each one the following discipline is ealized: when setting the packet in the queue the absolute pioities ae acting and when selecting packets fo sevice elative pioities ae acting in accodance with advanced algoithms to contol access to "cloud" telecommunications esouces. The use of the absolute pioities fo queued educes the aveage waiting time of pioity packets fom the goups and J allows to impove secuity infomation ITS (impoving antivius) and ensues the quality of data sevice As a esult in each queue packet го pioity is accepted fo sevice befoe the packet j гo pioity if Futhemoe if at the time of packet aival го pioity in queues 1 packets so the aival packet is pocessed as follows: 2 2 J o J 1 3 j. К thee was Eithe Accepted in queue unde conditions that thee ae packets with lowpioity j the latte packet with low pioity is ousted fom the system and late does not have any impact on it (system); O Is Lost given that in a queue thee is only packets with highe o equal j м pioity. b) Fo packets го (equal) pioities that ae in the queue J o J 1 3 o seviced in accodance with an advanced algoithm to contol access to the cloud telecommunication esouces. The sevice discipline of infomation packets in intellectual switching node implements edundancy of netwok esouces that is based on the stategy of moving bounday. III. AN IPOVED ALGOITH TO CONTOL ACCESS TO CLOUD TELECOUNICATIONS ESOUCES To study the functional indicatos of intellectual switching nodes quality of type we use the method of the stuctuallogical GETmodel. Let s take a look at its distinctive featues. Accoding to switching nodes ITS model with elative pioities and esouce esevation changes in the states of the node let s pesent GETnetwok. Each banch J 3 J 1 of communication netwok conditionally descibes a sepaate multitheaded sevice system V with dedicated and shaed esouces V. It should be noted that pesenting the stuctuallogic model GET takes into consideation the factos of extenal influences (loss of infomation packet) and the eal eliability (possible equipment failues) though intoducing banches of invese connection with appopiate chaacteistics (example W 42 W 52 W etc.). 74 The pesentation of GETstuctuallogic model as well as an analysis of seveal studies [1 3 5] devoted to the study of pocesses of peventive and final management of infomation steam to intellectual switching nodes sevice allows foming banches chaacteistics and distibution paamete. It should be noted that the studies allow finding a numbe of egulaities in the pocess of intellectual switching nodes functioning elated to pactical identical indicatos accodingly poducing function moment at sepaate stages and in seies mode of opeation. Final esult is the eduction of poducing functions moment. K V K Open Access Jounal Page 5

6 ethod of contolling access to intellectual switching nodes of To solve the above optimization poblem of acceleating the pocess of infomation packet in intellectual switching nodes when it is tansfeed to the cloud antivius system is poposed to optimize the algoithm contol access to the cloud "telecommunications esouces. The basis of the algoithm is put pocedue fo calculating the vitual time pocessing of infomation packet which diffes fom the known facto poviding an additional level of pioitization fo infomation packet metadata [15]. these infomation packets eceive highest pioity pocessing in intellectual switching nodes class 1. Table 1 shows the valid values of aveage time and Jitte of pocessing time and infomation packet fo diffeent level of pioity in intellectual switching nodes The valid values fo the aveage time jitte of pocessing time of infomation packets fom diffeent levels of pioity Let s look at the stuctual scheme of algoithm of contolling access to cloud telecommunication esouces. Level pioity [ i ] T доп мс [ i ] J доп мс 3 J J The fist step: stuctual scheme is checking the access of packet to intellectual switching nodes if thee is no packet; the algoithm goes into waiting mode of eceived packets. In case When at the entance of the intellectual switching node infomation packet is eceived (all levels pioitization o only selected) it is necessaily to select of each queue buffe memoy of each intellectual switching node accoding to the fist packet and the level of pioity to detemine the "efeence"of infomation packet with the appopiate level of pioity. This will educe the pocessing time of the metadata packet of infomation while ensuing indicatos of efficiency of pocessing infomation packets of othe pioity levels. The fouth step of the algoithm is detemined by the value of the VST and VFT. Next we stat with the accomplishment of pocedues to identify the infomation packet fo pocessing in opeating unit of intellectual switching nodes. This includes the following: while eceiving buffe device N packets could ente (N is the numbe of queues in the system) and pioity levels may ente. If the value of the VST is enteed then in step 6 of the steam of infomation the fist ("efeence") packet is selected as well as the value of vitual sevice time in queues. Next in step 9 of stuctual scheme thee is a compaison between "standad of infomation packet with othe enteing at the same moment. The decision about efeence of pioity of the infomation packet was adopted by the following citeia: 1) The minimum value of vitual sevice time in the queue (( VFT min ) ; 2) Belonging of infomation packet to the queue with the highest pioity ( 1 > 2 > 3 ). It should be noted that the condition of assignment efeence" pioity setting in step 14 is not complete and with some exceptions detemined by the pevious indicato fo example an indicatothe pobability of assigning pioity [3]. This indicato can be detemined expeimentally in this case the contol pocedue using this indicato is a distinctive featue of the algoithm to contol access to the "cloud" telecommunication esouces. These exclusions ae necessay to ensue the quality of sevice infomation packet of othe (lowe) pioities. The Infomation packets can be compaed in pais at the initial time; the fist selected infomation packet conditionally has the highest level of pioity. If the condition mentioned in step 5 then in step 7 the algoithm updates infomation about VST and VFT. In step 10 a tansition happens diectly to the packet infomation pocessing pocedues. In step 12 infomation packets assigned the values of the VST and VFT in ode to accompany the infomation packet to the destination. Next in step 13 infomation packet is added to the output queue and ends its pocess of its pocessing in intellectual switching node. Thus algoithm is developed to contol the access to cloud telecommunications esouces whose distinctive featue is the intoduction of nonstandad conditions decide on the attibution of the "efeence" pioity infomation packet based on the additional indicatothe pobability of assigning pioity. This allows solving the poblem of minimizing the pocessing time of the metadata packet of infomation duing the tansmission to the cloud antivius systems while ensuing quality of sevice infomation and othe telecommunication sevices. Open Access Jounal Page 6

7 ethod of contolling access to intellectual switching nodes of IV. CONCLUSION Thus the access contol method in intellectual switching nodes includes a mathematical model of intellectual switching with infomation packet of diffeent pioity and impoved algoithm to contol access to cloud telecommunication esouces. A distinctive featue of the method is the integated use of standad citeia fo infomation management in intellectual switching nodes with additional possibility of sevice packet metadata infomation as it tansfes to the cloud antivius systems. The main esults ae: Based on GETmathematical model of netwok intellectual switching node with infomation packet of diffeent pioities diffes fom the known taking into consideation the maximum pioitizing infomation metadata packets duing thei tansmission to the cloud antivius systems. This helps to detemine the equivalent Wfunction distibution function and density distibution of sevice time infomation packet of metadata in intellectual switching nodes when they ae tansfeed in the cloud antivius systems. The esult of studies indicates that maximum distibution density of the pocessing time infomation in metadata packets in intellectual switching nodes epesent an inteval fom 1 to 2 s. The developed algoithm of contol access to cloud telecommunication esouces distinguished fom the known intoduction of nonstandad conditions a decision on assigning the "standad" pioity infomation packets based on the additional indicatothe pobability of assigning pioity. This makes it possible to solve the poblem of minimizing the pocessing time of the metadata packet of infomation tansmission to the cloud antivius systems while ensuing quality of sevice infomation and othe telecommunication sevices. EFEENCES [1] Semenov S.G. A mathematical model of the spead of compute viuses in heteogeneous compute netwoks of automated pocess contol systems / S.G. Semenov V.V. Davydov // Poceedings of the National Technical Univesity "KhPI". Scientific Papes. Seies: Infomation and simulation. Khakov: NTU "KhPI" 2012 Volume 38 P [2] ohamad Abu Taam. The mathematical model of GETtansmission technology metadata cloud antivius system / ohamad Abu Taam V.V. Bosko A.A. Sminov I.A. Beezyuk // Collected Woks "Infomation pocessing systems". Issue 1 (117). Khakov: KhUAF P [3] ohamad Abu Taam. Stuctual logic GETmodel technology spead of compute viuses / ohamad Abu Taam A.A. Sminov I.A. Beezyuk // anagement systems navigation and communication. Issue 1 (29). Poltava: PNTU P [4] Sminov A.A. Expeimental studies of the statistical popeties of netwok taffic based on the BDSstatistics / A.A. Sminov D.A. Danilenko // Intenational Jounal of Computational Engineeing eseach (IJCE). Volume 4 Issue 5. India. Delhi P [5] AA Sminov Dispesion analysis of netwok taffic fo intusion detection and pevention in telecommunication systems and netwoks / A.A. Kuznetsov A.A. Sminov D.A. Danilenko // Collected Woks "Infomation pocessing systems". Issue 2 (118). Khakov: KhUAF P Open Access Jounal Page 7