SlideShare a Scribd company logo
1 of 7
Download to read offline
ISSN (e): 2250 – 3005 || Volume, 05 || Issue, 05 || May – 2015 ||
International Journal of Computational Engineering Research (IJCER)
www.ijceronline.com Open Access Journal Page 1
Method of controlling access to intellectual switching nodes of
telecommunication networks and systems
Alexey Smirnov 1
, Mohamad Abou Taam2
, Sergey Smirnov 2
1 The head of the Department of Software, Kirovohrad National Technical University, Kirovohrad, Ukraine
2 Graduate student in the Department of Software, Kirovohrad National Technical University, Kirovohrad,
Ukraine
I. DEFINITION OF PROBLEM
In current conditions of dynamic development of various approaches of the analysis and synthesis of
the telecommunication networks integrated into information and telecommunication technology [1-5] there are
questions of elaboration and application of the general methods of ensuring service quality based on
allocation of separate classes of quality and realization of managing algorithms, such as prioritization of
information packages, reservation of telecommunication resources, organization of queuing in switching nodes
etc.
The manifestation of new destabilizing factors associated with the influence of the malicious software
on the process of the functioning of information and telecommunication networks obliges to revise the general
capabilities of the existing mechanisms for managing the service quality and putting suggestions (algorithms)
and adapting them with possible wrongful action of participants of telecommunications exchange.
Thus, there is a need to develop networking and communications technologies and to elaborate the
methods of managing network resources that could provide:
- service quality and information security at the joint transfer of heterogeneous traffic, taking into account the
constraint of network resources, the real reliability of telecommunications equipment and possible external
influence malicious or other character ;
- Safety of functioning of individual nodes of information and telecommunication system from the effect of
malicious software;
- Stability (reliability, survivability, functional safety) is functioning under the above conditions, etc.
One of effective mechanisms that face malicious software is the use of antivirus resources “cloud”.
Studies of main procedures of data exchange in information-telecommunication systems have shown that one of
key roles at ensuring delivery timeliness of metadata (signatures) in "cloud" anti-virus systems plays a role of
transmission control mechanism. Thus their basic algorithms are realized specifically in switching nodes. The
given fact has allowed coming to the conclusion about the need to develop a method for managing network
resources taking into account the advanced procedures of the organization and queue scheduling.
ABSTRACT:
The developed method of controlling access to intellectual switching nodes includes a mathematical
model of intellectual switching nodes with service information packets of different priority and an
improved algorithm to control access to the cloud "of telecommunications resources. Based on multi-
channel model (CMO)
rrr KVMM as well as developed GERT model of intellectual switching
nodes carried out the study of functioning information and telecommunication network. The Equivalent
W-function, distribution function and density distribution of service time information packets of
metadata in intelligent switching nodes when they are transferred to the cloud antivirus systems, it is
determined that an additional criterion for attribution information packet "reference" priority can be
the value of the probability of assigning priority.
KEYWORDS: Information and Telecommunications Network, GERT-model, access control,
intellectual switching nodes.
Method of controlling access to intellectual switching nodes of…
www.ijceronline.com Open Access Journal Page 2
II. GENERAL DEFINITION OF PROBLEM AND DESCRIPTION OF SWITCHING
NODES FUNCTIONING
According to data mentioned in [1-5], structural and functional structure ITS of next generation network (NGN)
is heterogeneous. This factor is especially mentioned in the early stages of ITS structure.
It should be noted that only when combining low speed traffic, there are preconditions for the use of models of
simplest packets [1]. This is because the large number of small independent ordinary stationary (non-
stationary) streams with different aftereffect (Khinchin's theorem) [1.2], as well as the transformation of streams
in network (summation, screening) [1.2] in limit gives the stream that is close to the simplest packet:
,0t,0,e1)t(аа r
)t(
rr
r

 (1)
- r
the parameter of stream, transferred to parameters of transmission by using this equation:
rсr )r(q)r( 
,
-  rc
intensity of received messages;
-   1
сегмc )r(t)r()r(q


the average number of packets in the message , r -го priority;
-
)r(
)r(L
)r(t
прд
сегм


the average time of packet segmentation , r -го priority;
-
)r(L
the length of the information portion of packet , r -го priority;
-
)r(прд
speed of sending(processing) information, r -го priority;
- )r(L
)r(L пак
r 
overhead on packet conversion ;
- )r(L пак the length of the packet , r -го priority;
Priority packets from different classes, as soon as they access to ITs, are divided into packets of different length,
while limiting their maximum size. This assumption allows drawing a conclusion on the possibility of use while
creating such networks, in the appropriate calculations, and a demonstration law of distribution of the random
variable duration of their service in switching nodes [1-3]. In this case, the duration of service packet priorities
R,1r  of the random variable with distribution function [1.2] is:
 
 
0b,0t,e1tB b
t

 (2)
And the end of the first two moments is:
 
ср0
1
ttdBb

 

, (3)
  2
ср0
2)2( 2
tdBtb

 

, (4)
 
 






R
1r пак
прд
r
r
rL
rv
, (5)
- ср average intensity of service packets
Method of controlling access to intellectual switching nodes of…
www.ijceronline.com Open Access Journal Page 3
In the example mentioned above, switching node is realized in the next service discipline.
If, at the time of access of packet with any priority R,1r  there are free channels (switching node status
1Vi0  ), so it (packet) immediately access to the service.
b) in the case of occupancy of all channels (switching node status KViV  ) , the received packet  -го
priority is queued and it is accepted for service before the packet of j -го priority, if j : If, at the time of
access of the packet of priority in queues, there were K- packets (the buffer is filled completely), so the
received packet is :
 Accepted in queue under conditions that there are packets with low-priority j-M, the latter packet with low
priority is ousted from the system and, later does not have any impact on it (system);
 The packet Is Lost, given that in a queue there are only packets with higher or equal j -м priority.
b) For packets (equal) priorities that are in the queue, FIFO system is realized
As shown in the discipline of service in switching node when packets set in the queue and queue is managed, the
absolute priority functions, while in the service the relative priority functions. The use of absolute priority queue
management only provides service packets without interruption, but at the same time the losses and the average waiting time
priority packet are minimized.
At the same time, this discipline mentioned above has a number of disadvantages associated with the lack of
malicious factors or other external influences on ITS.
Therefore, in the conditions of destructive external influences and the frequent failure of telecommunications
equipment using this model in the creation of ITS influence negatively on the process of ensuring the quality of service
indicators such as information and functional security, reliability.
Studies have shown that in order to eliminate these disadvantages, it is advisable to use a mathematical
model of switching node type”
rrr KVMM
“with relative priorities, resource reservation and taking into
consideration the real reliability of serving devices.
Model of switching node and its relative priorities, reservations resources and real reliability of serving
devices.
The assumptions listed above (concerning: approximation of packet stream , class : R,1r  ; with the
characteristics of a Poisson distribution law; service with relative priorities R,1r  class of service quality, taking into
account the categories of users and the subsystems; presence of V serving devices , with the ultimate reliability of the
variable-length packets;, characterized by the exponential distribution function (2) with parameter defined by equation (5)),
aim at managing traffic and ensuring the specified quality of service indicators (including informational and functional
safety)under conditions of limited resources ITS, possible malicious or other effects, a discipline service and their relative
priorities R,1r 
, of partial switching channel
rV and a joint (separate) use of drives
rK could be applied. This will ensure
the backup of telecommunication resources for high-priority traffic (especially metadata in “cloud” antivirus systems) [3.5].
The analysis of basic algorithms management queue in ITS communications equipment showed that currently
there are several types of disciplines (ways) of service queues that realize the reservation of resources:
 (Fair Queuing, FQ);
 (Priority Queuing (PQ));
 (Custom Queuing, CQ);
 (WFQ, Fair Queuing, Weighted);
 (Class Based Weighted Fair Queuing CBWFQ), etc. [3-5].
Method of controlling access to intellectual switching nodes of…
www.ijceronline.com Open Access Journal Page 4
Comparative studies of these algorithms have shown that the most effective in terms of ensuring
quality of service, is the algorithms of WFQ, CBWFQ, derived algorithms CQ. Therefore further research is
based on the management of WFQ and CBWFQ queue.
Let’s present a telecommunication system, in which the services are divided into several classes, quality of
service (QoS) with appropriate priorities for latency and packet loss (for example, transfer of information and
measurement of monitoring data, telephony, postal information transfer, video conferencing, etc.). The total
number of priorities for the types of services, users and subsystems is R
Let’s consider that at the entrance, intellectual switching node receives the simplest packets stream r -s priority
classes { Rr1 a,...,а,...,а }, which are numbered in order of priority. Each priority class is characterized by the
intensity of packets r : 0r 
In the particular case, priorities are grouped in three groups 1r1  , J,2r2  , R,1Jr3  , corresponding to the
services:
 1r1  - traffic of metadata for transmission in” the cloud” antivirus system;
 J,2r2  -traffic of real time, critical to network delays (telephony, videoconferencing, data objective control,
etc.);
 R,1Jr3  Traffic of data, critical to losses and not critical to network delays, including stream of traffic
(audio, video on demand, etc..) and elastic traffic (email, web-applications, etc..).
In this case the highest priority is using metadata for transmission to the cloud antivirus system.
Therefore In the switching nodes of information and telecommunication systems, presented different smart
devices (controllers, gateways, switches, routers, gateways, etc.), transport network users of different categories
and subsystems stream received message of different classes. The intensity of received and service messages is
characterized by parameters  rc и  rc , R,1r  and, in accordance with, the speed of received message
(transfer  rv прд
). The received messages in the switching nodes are converted into a packet form and form R an
independent packet stream Rr1 a,...,а,...,а with intensities Rr1 ,...,,...,  .
The intellectual switching nodes ITS consists of  V0 serving devices with identical tactical-technical
characteristics, depending on capabilities of manufacturers of telecommunication equipment, and the buffer
memory capacity  К0 .
In switching nodes, restrictions are imposed on serving devices resources VVr  and memory buffer size
КК r  packet of different priority classes. In this case the packet with priority accesses to all serving devices
and allocates a portion of buffer of the total volume of the buffer, determines in accordance with the advanced
algorithm to control access to "cloud" telecommunications resources described below.
For packet of priorities J,2r2  the available part VVr  of the device service is not in use at the moment of
metadata packet priority, determines the improved algorithm to control access to cloud telecommunications
resources, and allocates a part of buffer КК r  from total capacity of the buffer K
For packets of remaining priorities R,1Jr3  ,there are a restrictive threshold- only one part of the overall
service devices VVr  is available and a part of the total capacity of the buffer is allocated КК r  , so
КК
R
1r
r 

. Within each priority class 1r , J,2r2  , R,1Jr3  , allocated buffer shared data packets priority
classes.
Method of controlling access to intellectual switching nodes of…
www.ijceronline.com Open Access Journal Page 5
It should be noted that the organization of distribution of resources of switching nodes in a memory buffer
information packet priority class 1r practically is zero ( 0P
1r  )). Similarly there is probability of losing
2rP
information packet priority class 2r 0P
2r  .
In intellectual switching nodes ITS, service packet, is subject to the following discipline [3-5].
a) If, at the time of access of the information packets with priority 1r , J,2r2  , R,1Jr3  , they are free from
the priority class for the devices so it’s in accordance with an algorithm to control the access to cloud
telecommunications resources enters at the service.
b) in case of occupancy of all available services devices (intellectual switching nodes status rrr KViV  )
separate queues are organized for packets with the priorities 1r J,2r2  and R,1Jr3  . In this case in each
one, the following discipline is realized: when setting the packet in the queue ,the absolute priorities are acting,
and when selecting packets for service relative priorities are acting in accordance with advanced algorithms to
control access to "cloud" telecommunications resources.
The use of the absolute priorities for queued reduces the average waiting time of priority packets from the
groups 1r and J,2r2  , allows to improve security information ITS (improving antivirus) and ensures the
quality of data service
As a result in each queue, packet  -го priority is accepted for service before the packet j -гo priority if j .
Furthermore, if, at the time of packet arrival  -го priority in queues 1r , J,2r2  or R,1Jr3  there was rК
packets, so the arrival packet is processed as follows:
- Either Accepted in queue under conditions that there are packets with low-priority j-M, the latter packet
with low priority is ousted from the system and, later does not have any impact on it (system);
- Or Is Lost, given that in a queue there is only packets with higher or equal j -м priority.
- b) For packets r -го (equal) priorities that are in the queue 1r , J,2r2  or R,1Jr3  ,or serviced in
accordance with an advanced algorithm to control access to the “cloud” telecommunication resources.
The service discipline of information packets in intellectual switching node implements redundancy of
network resources that is based on the strategy of moving boundary.
III. AN IMPROVED ALGORITHM TO CONTROL ACCESS TO CLOUD
TELECOMMUNICATIONS RESOURCES
To study the functional indicators of intellectual switching nodes quality of type rrr KVMM , we use the
method of the structural-logical GERT-model. Let’s take a look at its distinctive features.
According to switching nodes ITS model with relative priorities and resource reservation changes in the states
of the node let’s present GERT-network. Each branch 1r , J,2r2  , R,1Jr3  , of communication network
conditionally describes a separate multi-threaded service system  rr K,V with dedicated and shared resources
 RV .
It should be noted that presenting the structural-logic model GERT takes into consideration the factors of
external influences (loss of information packet) and the real reliability (possible equipment failures) through
introducing branches of inverse connection with appropriate characteristics (example 42W , 52W , 74W, , etc.).
The presentation of GERT-structural-logic model, as well as an analysis of several studies [1, 3, 5], devoted to
the study of processes of preventive and final management of information stream to intellectual switching nodes
service allows forming branches characteristics and distribution parameter.
It should be noted that the studies allow finding a number of regularities in the process of intellectual switching
nodes functioning related to practical identical indicators, accordingly producing function moment at separate
stages and in series mode of operation. Final result is the reduction of producing functions moment.
Method of controlling access to intellectual switching nodes of…
www.ijceronline.com Open Access Journal Page 6
To solve the above optimization problem of accelerating the process of information packet in
intellectual switching nodes when it is transferred to the cloud antivirus system, is proposed to optimize the
algorithm control access to the cloud "telecommunications resources. The basis of the algorithm is put
procedure for calculating the virtual time processing of information packet, which differs from the known factor
providing an additional level of prioritization for information packet metadata [1-5]., these information packets
receive highest priority processing in intellectual switching nodes class 1r .
Table 1 shows the valid values of average time and Jitter of processing time and information packet for different
level of priority in intellectual switching nodes
The valid values for the average time jitter of processing time of information packets from different levels
of priority
Let’s look at the structural scheme of algorithm of controlling access to cloud telecommunication resources.
Level priority R,1Jr3  J,2r2  1r1 
]i[
допT
, мс
100-800 50-150 1-10
]i[
допJ
, мс
47-53 10-30 1-5
The first step: structural scheme is checking the access of packet to intellectual switching nodes if there is no
packet; the algorithm goes into waiting mode of received packets. In case When at the entrance of the
intellectual switching node information packet is received (all levels prioritization or only selected), it is
necessarily to select of each queue buffer memory of each intellectual switching node according to the first
packet, and the level of priority to determine the "reference"of information packet with the appropriate level of
priority. This will reduce the processing time of the metadata packet of information while ensuring indicators of
efficiency of processing information packets of other priority levels.
The fourth step of the algorithm is determined by the value of the VST and VFT. Next we start with the
accomplishment of procedures to identify the information packet for processing in operating unit of intellectual
switching nodes. This includes the following: while receiving buffer device N packets could enter (N is the
number of queues in the system), and priority levels may enter.
If the value of the VST is entered, then in step 6 of the stream of information, the first ("reference"),
packet is selected, as well as the value of virtual service time in queues.
Next, in step 9 of structural scheme there is a comparison between "standard of information packet
with other entering at the same moment.
The decision about “reference “of priority of the information packet was adopted by the following
criteria:
1) The minimum value of virtual service time in the queue (( minVFT  ) ;
2) Belonging of information packet to the queue with the highest priority ( 1r > 2r > 3r ).
It should be noted that the condition of assignment “reference" priority setting in step 14 is not complete , and
with some exceptions, determined by the previous indicator, for example an indicator-the probability of assigning priority
[3]. This indicator can be determined experimentally in this case, the control procedure using this indicator, is a distinctive
feature of the algorithm to control access to the "cloud" telecommunication resources. These exclusions are necessary to
ensure the quality of service information packet of other (lower) priorities.
The Information packets can be compared in pairs, at the initial time; the first selected information
packet conditionally has the highest level of priority.
If the condition mentioned in step 5, then in step 7 ,the algorithm updates information about VST and VFT.
In step 10 a transition happens directly to the packet information processing procedures. In step 12
information packets assigned the values of the VST and VFT in order to accompany the information packet to
the destination.
Next, in step 13 information packet is added to the output queue and ends its process of its processing
in intellectual switching node.
Thus, algorithm is developed to control the access to cloud telecommunications resources whose
distinctive feature is the introduction of non-standard conditions, decide on the attribution of the "reference"
priority information packet based on the additional indicator-the probability of assigning priority. This allows
solving the problem of minimizing the processing time of the metadata packet of information during the
transmission to the cloud antivirus systems while ensuring quality of service information and other
telecommunication services.
Method of controlling access to intellectual switching nodes of…
www.ijceronline.com Open Access Journal Page 7
IV. CONCLUSION
Thus, the access control method in intellectual switching nodes includes a mathematical model of
intellectual switching with information packet of different priority and improved algorithm to control access to
cloud telecommunication resources. A distinctive feature of the method is the integrated use of standard criteria
for information management in intellectual switching nodes with additional possibility of service packet
metadata information as it transfers to the cloud antivirus systems.
The main results are:
Based on GERT-mathematical model of network intellectual switching node with information packet
of different priorities, differs from the known, taking into consideration the maximum prioritizing information
metadata packets during their transmission to the cloud antivirus systems. This helps to determine the
equivalent W-function, distribution function and density distribution of service time information packet of
metadata in intellectual switching nodes when they are transferred in the cloud antivirus systems. The result of
studies indicates that maximum distribution density of the processing time information in metadata packets in
intellectual switching nodes represent an interval from 1 to 2 Ms.
The developed algorithm of control access to cloud telecommunication resources, distinguished from
the known introduction of non-standard conditions a decision on assigning the "standard" priority information
packets based on the additional indicator-the probability of assigning priority. This makes it possible to solve the
problem of minimizing the processing time of the metadata packet of information transmission to the cloud
antivirus systems while ensuring quality of service information and other telecommunication services.
REFERENCES
[1] Semenov S.G. A mathematical model of the spread of computer viruses in heterogeneous computer networks of automated process
control systems / S.G. Semenov, V.V. Davydov // Proceedings of the National Technical University "KhPI". Scientific Papers.
Series: Information and simulation. - Kharkov: NTU "KhPI", 2012 - Volume 38 - P. 163-171..
[2] Mohamad Abu Taam. The mathematical model of GERT-transmission technology metadata cloud antivirus system / Mohamad Abu
Taam, V.V. Bosko, A.A. Smirnov, I.A. Berezyuk // Collected Works "Information processing systems". - Issue 1 (117). - Kharkov:
KhUAF - 2014. - P. 137-141.
[3] Mohamad Abu Taam. Structural logic GERT-model technology spread of computer viruses / Mohamad Abu Taam, A.A. Smirnov,
I.A. Berezyuk // Management systems, navigation and communication. - Issue 1 (29). - Poltava: PNTU. - 2014. - P. 120-125.
[4] Smirnov A.A. Experimental studies of the statistical properties of network traffic based on the BDS-statistics / A.A. Smirnov,
D.A. Danilenko // International Journal of Computational Engineering Research (IJCER). – Volume 4, Issue 5. – India. Delhi. –
2014. – P. 41-51.
[5] AA Smirnov Dispersion analysis of network traffic for intrusion detection and prevention in telecommunication systems and
networks / A.A. Kuznetsov, A.A. Smirnov, D.A. Danilenko // Collected Works "Information processing systems". - Issue 2 (118). -
Kharkov: KhUAF - 2014. - P. 124-133.

More Related Content

What's hot

Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy Logic
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy LogicImproved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy Logic
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy LogicTELKOMNIKA JOURNAL
 
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...IJERA Editor
 
Survey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lteSurvey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lteijngnjournal
 
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETS
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSAN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETS
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
 
Probability Density Functions of the Packet Length for Computer Networks With...
Probability Density Functions of the Packet Length for Computer Networks With...Probability Density Functions of the Packet Length for Computer Networks With...
Probability Density Functions of the Packet Length for Computer Networks With...IJCNCJournal
 
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...IOSR Journals
 
The improvement of end to end delays in network management system using netwo...
The improvement of end to end delays in network management system using netwo...The improvement of end to end delays in network management system using netwo...
The improvement of end to end delays in network management system using netwo...IJCNCJournal
 
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATION
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATIONA MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATION
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATIONIJCNCJournal
 
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
 
Cloud data management
Cloud data managementCloud data management
Cloud data managementambitlick
 
Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11eSAT Publishing House
 
Analysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 etAnalysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 eteSAT Journals
 
A New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware RoutingA New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
 
Paper id 2120147
Paper id 2120147Paper id 2120147
Paper id 2120147IJRAT
 
Task mapping and routing optimization for hard real-time Networks-on-Chip
Task mapping and routing optimization for hard real-time Networks-on-ChipTask mapping and routing optimization for hard real-time Networks-on-Chip
Task mapping and routing optimization for hard real-time Networks-on-ChipjournalBEEI
 
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETS
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSSECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETS
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSIJCNCJournal
 

What's hot (20)

Jz2417141717
Jz2417141717Jz2417141717
Jz2417141717
 
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy Logic
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy LogicImproved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy Logic
Improved Routing Protocol in Mobile Ad Hoc Networks Using Fuzzy Logic
 
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...
Traffic Engineering and Quality of Experience in MPLS Network by Fuzzy Logic ...
 
Survey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lteSurvey on scheduling and radio resources allocation in lte
Survey on scheduling and radio resources allocation in lte
 
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETS
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSAN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETS
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETS
 
Probability Density Functions of the Packet Length for Computer Networks With...
Probability Density Functions of the Packet Length for Computer Networks With...Probability Density Functions of the Packet Length for Computer Networks With...
Probability Density Functions of the Packet Length for Computer Networks With...
 
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
Multipath Routing Protocol by Breadth First Search Algorithm in Wireless Mesh...
 
The improvement of end to end delays in network management system using netwo...
The improvement of end to end delays in network management system using netwo...The improvement of end to end delays in network management system using netwo...
The improvement of end to end delays in network management system using netwo...
 
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATION
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATIONA MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATION
A MARKOVIAN MODEL FOR INTERNET OF THINGS APPLICATION
 
Hf3612861290
Hf3612861290Hf3612861290
Hf3612861290
 
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...
 
Mq3624532158
Mq3624532158Mq3624532158
Mq3624532158
 
Cloud data management
Cloud data managementCloud data management
Cloud data management
 
P43018691
P43018691P43018691
P43018691
 
Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11Analysis of data transmission in wireless lan for 802.11
Analysis of data transmission in wireless lan for 802.11
 
Analysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 etAnalysis of data transmission in wireless lan for 802.11 e2 et
Analysis of data transmission in wireless lan for 802.11 e2 et
 
A New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware RoutingA New Theoretical Approach to Location Based Power Aware Routing
A New Theoretical Approach to Location Based Power Aware Routing
 
Paper id 2120147
Paper id 2120147Paper id 2120147
Paper id 2120147
 
Task mapping and routing optimization for hard real-time Networks-on-Chip
Task mapping and routing optimization for hard real-time Networks-on-ChipTask mapping and routing optimization for hard real-time Networks-on-Chip
Task mapping and routing optimization for hard real-time Networks-on-Chip
 
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETS
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETSSECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETS
SECURING BGP BY HANDLING DYNAMIC NETWORK BEHAVIOR AND UNBALANCED DATASETS
 

Viewers also liked (17)

Google Florida Gifted Conference 2014
Google Florida Gifted Conference 2014Google Florida Gifted Conference 2014
Google Florida Gifted Conference 2014
 
PAKISTAN YARN
PAKISTAN YARNPAKISTAN YARN
PAKISTAN YARN
 
Trabajodelaafrocolombianidad 120910152328-phpapp01
Trabajodelaafrocolombianidad 120910152328-phpapp01Trabajodelaafrocolombianidad 120910152328-phpapp01
Trabajodelaafrocolombianidad 120910152328-phpapp01
 
Welcome Ramadhan
Welcome RamadhanWelcome Ramadhan
Welcome Ramadhan
 
Presentación grupal
Presentación grupalPresentación grupal
Presentación grupal
 
Ambiente word 1
Ambiente word 1Ambiente word 1
Ambiente word 1
 
Los peligros del internet.
Los peligros del internet.Los peligros del internet.
Los peligros del internet.
 
Presentación videoteca
Presentación videotecaPresentación videoteca
Presentación videoteca
 
Da ideia a propriedade intelectual
Da ideia a propriedade intelectualDa ideia a propriedade intelectual
Da ideia a propriedade intelectual
 
Pulso Perú Octubre 2014 datum-gestion
Pulso Perú Octubre 2014 datum-gestionPulso Perú Octubre 2014 datum-gestion
Pulso Perú Octubre 2014 datum-gestion
 
Definitive guide-to-social-marketing
Definitive guide-to-social-marketingDefinitive guide-to-social-marketing
Definitive guide-to-social-marketing
 
History of dialysis
History of dialysisHistory of dialysis
History of dialysis
 
taller de valores
taller de valorestaller de valores
taller de valores
 
13 interesting houston area real estate facts
13 interesting houston area real estate facts13 interesting houston area real estate facts
13 interesting houston area real estate facts
 
ADA 2
ADA 2ADA 2
ADA 2
 
Que son las ntics
Que son las nticsQue son las ntics
Que son las ntics
 
Poema de Rubem Alves
Poema de Rubem AlvesPoema de Rubem Alves
Poema de Rubem Alves
 

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

An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...
An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...
An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...ijsc
 
Results of simulation modeling of technical parameters of a multiservice network
Results of simulation modeling of technical parameters of a multiservice networkResults of simulation modeling of technical parameters of a multiservice network
Results of simulation modeling of technical parameters of a multiservice networkTELKOMNIKA JOURNAL
 
Macro with pico cells (hetnets) system behaviour using well known scheduling ...
Macro with pico cells (hetnets) system behaviour using well known scheduling ...Macro with pico cells (hetnets) system behaviour using well known scheduling ...
Macro with pico cells (hetnets) system behaviour using well known scheduling ...ijwmn
 
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...ijwmn
 
Congestion control based on sliding mode control and scheduling with prioriti...
Congestion control based on sliding mode control and scheduling with prioriti...Congestion control based on sliding mode control and scheduling with prioriti...
Congestion control based on sliding mode control and scheduling with prioriti...eSAT Publishing House
 
Reliable Metrics for Wireless Mesh Network
Reliable Metrics for Wireless Mesh NetworkReliable Metrics for Wireless Mesh Network
Reliable Metrics for Wireless Mesh NetworkIRJET Journal
 
Capacity Improvement and Protection of LTE Network on Ethernet Based Technique
Capacity Improvement and Protection of LTE Network on Ethernet Based TechniqueCapacity Improvement and Protection of LTE Network on Ethernet Based Technique
Capacity Improvement and Protection of LTE Network on Ethernet Based TechniqueTELKOMNIKA JOURNAL
 
Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...
Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...
Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...ijsrd.com
 
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2csandit
 
Congestion Control Technique with Safety Transmission of Messages in Vehicula...
Congestion Control Technique with Safety Transmission of Messages in Vehicula...Congestion Control Technique with Safety Transmission of Messages in Vehicula...
Congestion Control Technique with Safety Transmission of Messages in Vehicula...IRJET Journal
 
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...IJECEIAES
 
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...IJCNCJournal
 
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...Ericsson
 
A study on cross layer metrics of wireless mesh network
A study on cross layer metrics of wireless mesh networkA study on cross layer metrics of wireless mesh network
A study on cross layer metrics of wireless mesh networkeSAT Publishing House
 
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...cscpconf
 
PERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKS
PERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKSPERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKS
PERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKScscpconf
 
Performance analysis of resource
Performance analysis of resourcePerformance analysis of resource
Performance analysis of resourcecsandit
 

Similar to Method of controlling access to intellectual switching nodes of telecommunication networks and systems (20)

An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...
An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...
An Intelligent Call Admission Controller for Guaranteed QoS in 4G Mobile Netw...
 
Results of simulation modeling of technical parameters of a multiservice network
Results of simulation modeling of technical parameters of a multiservice networkResults of simulation modeling of technical parameters of a multiservice network
Results of simulation modeling of technical parameters of a multiservice network
 
Macro with pico cells (hetnets) system behaviour using well known scheduling ...
Macro with pico cells (hetnets) system behaviour using well known scheduling ...Macro with pico cells (hetnets) system behaviour using well known scheduling ...
Macro with pico cells (hetnets) system behaviour using well known scheduling ...
 
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...
IMPLEMENTATION OF BIOLOGICAL ROUTING PROTOCOL IN TUNNEL WIRELESS SENSOR NETWO...
 
Congestion control based on sliding mode control and scheduling with prioriti...
Congestion control based on sliding mode control and scheduling with prioriti...Congestion control based on sliding mode control and scheduling with prioriti...
Congestion control based on sliding mode control and scheduling with prioriti...
 
Reliable Metrics for Wireless Mesh Network
Reliable Metrics for Wireless Mesh NetworkReliable Metrics for Wireless Mesh Network
Reliable Metrics for Wireless Mesh Network
 
Capacity Improvement and Protection of LTE Network on Ethernet Based Technique
Capacity Improvement and Protection of LTE Network on Ethernet Based TechniqueCapacity Improvement and Protection of LTE Network on Ethernet Based Technique
Capacity Improvement and Protection of LTE Network on Ethernet Based Technique
 
Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...
Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...
Simulation and Performance Analysis of Long Term Evolution (LTE) Cellular Net...
 
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2
 
Congestion Control Technique with Safety Transmission of Messages in Vehicula...
Congestion Control Technique with Safety Transmission of Messages in Vehicula...Congestion Control Technique with Safety Transmission of Messages in Vehicula...
Congestion Control Technique with Safety Transmission of Messages in Vehicula...
 
Ijariie1170
Ijariie1170Ijariie1170
Ijariie1170
 
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...
Exponential MLWDF (EXP-MLWDF) Downlink Scheduling Algorithm Evaluated in LTE ...
 
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
Dynamic bandwidth allocation scheme in lr pon with performance modelling and ...
 
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...
Machine Learning Based Session Drop Prediction in LTE Networks and its SON As...
 
A study on cross layer metrics of wireless mesh network
A study on cross layer metrics of wireless mesh networkA study on cross layer metrics of wireless mesh network
A study on cross layer metrics of wireless mesh network
 
Ttacca
TtaccaTtacca
Ttacca
 
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...
TTACCA: TWO-HOP BASED TRAFFIC AWARE CONGESTION CONTROL ALGORITHM FOR WIRELESS...
 
PERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKS
PERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKSPERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKS
PERFORMANCE ANALYSIS OF RESOURCE SCHEDULING IN LTE FEMTOCELLS NETWORKS
 
Performance analysis of resource
Performance analysis of resourcePerformance analysis of resource
Performance analysis of resource
 
2 sima singh-6-13
2 sima singh-6-132 sima singh-6-13
2 sima singh-6-13
 

Recently uploaded

Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesSinan KOZAK
 
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | DelhiFULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhisoniya singh
 
How to Remove Document Management Hurdles with X-Docs?
How to Remove Document Management Hurdles with X-Docs?How to Remove Document Management Hurdles with X-Docs?
How to Remove Document Management Hurdles with X-Docs?XfilesPro
 
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...HostedbyConfluent
 
Maximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxMaximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxOnBoard
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking MenDelhi Call girls
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonetsnaman860154
 
Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024BookNet Canada
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions
 
Snow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter RoadsSnow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter RoadsHyundai Motor Group
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking MenDelhi Call girls
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slidespraypatel2
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountPuma Security, LLC
 
Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Allon Mureinik
 
Artificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraArtificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraDeakin University
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...shyamraj55
 
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphSIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphNeo4j
 
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):comworks
 
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machineInstall Stable Diffusion in windows machine
Install Stable Diffusion in windows machinePadma Pradeep
 

Recently uploaded (20)

Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen Frames
 
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | DelhiFULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
FULL ENJOY 🔝 8264348440 🔝 Call Girls in Diplomatic Enclave | Delhi
 
E-Vehicle_Hacking_by_Parul Sharma_null_owasp.pptx
E-Vehicle_Hacking_by_Parul Sharma_null_owasp.pptxE-Vehicle_Hacking_by_Parul Sharma_null_owasp.pptx
E-Vehicle_Hacking_by_Parul Sharma_null_owasp.pptx
 
How to Remove Document Management Hurdles with X-Docs?
How to Remove Document Management Hurdles with X-Docs?How to Remove Document Management Hurdles with X-Docs?
How to Remove Document Management Hurdles with X-Docs?
 
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
Transforming Data Streams with Kafka Connect: An Introduction to Single Messa...
 
Maximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptxMaximizing Board Effectiveness 2024 Webinar.pptx
Maximizing Board Effectiveness 2024 Webinar.pptx
 
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
08448380779 Call Girls In Diplomatic Enclave Women Seeking Men
 
How to convert PDF to text with Nanonets
How to convert PDF to text with NanonetsHow to convert PDF to text with Nanonets
How to convert PDF to text with Nanonets
 
Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
Transcript: #StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
 
Pigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping ElbowsPigging Solutions Piggable Sweeping Elbows
Pigging Solutions Piggable Sweeping Elbows
 
Snow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter RoadsSnow Chain-Integrated Tire for a Safe Drive on Winter Roads
Snow Chain-Integrated Tire for a Safe Drive on Winter Roads
 
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men08448380779 Call Girls In Greater Kailash - I Women Seeking Men
08448380779 Call Girls In Greater Kailash - I Women Seeking Men
 
Slack Application Development 101 Slides
Slack Application Development 101 SlidesSlack Application Development 101 Slides
Slack Application Development 101 Slides
 
Breaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path MountBreaking the Kubernetes Kill Chain: Host Path Mount
Breaking the Kubernetes Kill Chain: Host Path Mount
 
Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)Injustice - Developers Among Us (SciFiDevCon 2024)
Injustice - Developers Among Us (SciFiDevCon 2024)
 
Artificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraArtificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning era
 
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
Automating Business Process via MuleSoft Composer | Bangalore MuleSoft Meetup...
 
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge GraphSIEMENS: RAPUNZEL – A Tale About Knowledge Graph
SIEMENS: RAPUNZEL – A Tale About Knowledge Graph
 
CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):CloudStudio User manual (basic edition):
CloudStudio User manual (basic edition):
 
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machineInstall Stable Diffusion in windows machine
Install Stable Diffusion in windows machine
 

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

  • 1. ISSN (e): 2250 – 3005 || Volume, 05 || Issue, 05 || May – 2015 || International Journal of Computational Engineering Research (IJCER) www.ijceronline.com Open Access Journal Page 1 Method of controlling access to intellectual switching nodes of telecommunication networks and systems Alexey Smirnov 1 , Mohamad Abou Taam2 , Sergey Smirnov 2 1 The head of the Department of Software, Kirovohrad National Technical University, Kirovohrad, Ukraine 2 Graduate student in the Department of Software, Kirovohrad National Technical University, Kirovohrad, Ukraine I. DEFINITION OF PROBLEM In current conditions of dynamic development of various approaches of the analysis and synthesis of the telecommunication networks integrated into information and telecommunication technology [1-5] there are questions of elaboration and application of the general methods of ensuring service quality based on allocation of separate classes of quality and realization of managing algorithms, such as prioritization of information packages, reservation of telecommunication resources, organization of queuing in switching nodes etc. The manifestation of new destabilizing factors associated with the influence of the malicious software on the process of the functioning of information and telecommunication networks obliges to revise the general capabilities of the existing mechanisms for managing the service quality and putting suggestions (algorithms) and adapting them with possible wrongful action of participants of telecommunications exchange. Thus, there is a need to develop networking and communications technologies and to elaborate the methods of managing network resources that could provide: - service quality and information security at the joint transfer of heterogeneous traffic, taking into account the constraint of network resources, the real reliability of telecommunications equipment and possible external influence malicious or other character ; - Safety of functioning of individual nodes of information and telecommunication system from the effect of malicious software; - Stability (reliability, survivability, functional safety) is functioning under the above conditions, etc. One of effective mechanisms that face malicious software is the use of antivirus resources “cloud”. Studies of main procedures of data exchange in information-telecommunication systems have shown that one of key roles at ensuring delivery timeliness of metadata (signatures) in "cloud" anti-virus systems plays a role of transmission control mechanism. Thus their basic algorithms are realized specifically in switching nodes. The given fact has allowed coming to the conclusion about the need to develop a method for managing network resources taking into account the advanced procedures of the organization and queue scheduling. ABSTRACT: The developed method of controlling access to intellectual switching nodes includes a mathematical model of intellectual switching nodes with service information packets of different priority and an improved algorithm to control access to the cloud "of telecommunications resources. Based on multi- channel model (CMO) rrr KVMM as well as developed GERT model of intellectual switching nodes carried out the study of functioning information and telecommunication network. The Equivalent W-function, distribution function and density distribution of service time information packets of metadata in intelligent switching nodes when they are transferred to the cloud antivirus systems, it is determined that an additional criterion for attribution information packet "reference" priority can be the value of the probability of assigning priority. KEYWORDS: Information and Telecommunications Network, GERT-model, access control, intellectual switching nodes.
  • 2. Method of controlling access to intellectual switching nodes of… www.ijceronline.com Open Access Journal Page 2 II. GENERAL DEFINITION OF PROBLEM AND DESCRIPTION OF SWITCHING NODES FUNCTIONING According to data mentioned in [1-5], structural and functional structure ITS of next generation network (NGN) is heterogeneous. This factor is especially mentioned in the early stages of ITS structure. It should be noted that only when combining low speed traffic, there are preconditions for the use of models of simplest packets [1]. This is because the large number of small independent ordinary stationary (non- stationary) streams with different aftereffect (Khinchin's theorem) [1.2], as well as the transformation of streams in network (summation, screening) [1.2] in limit gives the stream that is close to the simplest packet: ,0t,0,e1)t(аа r )t( rr r   (1) - r the parameter of stream, transferred to parameters of transmission by using this equation: rсr )r(q)r(  , -  rc intensity of received messages; -   1 сегмc )r(t)r()r(q   the average number of packets in the message , r -го priority; - )r( )r(L )r(t прд сегм   the average time of packet segmentation , r -го priority; - )r(L the length of the information portion of packet , r -го priority; - )r(прд speed of sending(processing) information, r -го priority; - )r(L )r(L пак r  overhead on packet conversion ; - )r(L пак the length of the packet , r -го priority; Priority packets from different classes, as soon as they access to ITs, are divided into packets of different length, while limiting their maximum size. This assumption allows drawing a conclusion on the possibility of use while creating such networks, in the appropriate calculations, and a demonstration law of distribution of the random variable duration of their service in switching nodes [1-3]. In this case, the duration of service packet priorities R,1r  of the random variable with distribution function [1.2] is:     0b,0t,e1tB b t   (2) And the end of the first two moments is:   ср0 1 ttdBb     , (3)   2 ср0 2)2( 2 tdBtb     , (4)           R 1r пак прд r r rL rv , (5) - ср average intensity of service packets
  • 3. Method of controlling access to intellectual switching nodes of… www.ijceronline.com Open Access Journal Page 3 In the example mentioned above, switching node is realized in the next service discipline. If, at the time of access of packet with any priority R,1r  there are free channels (switching node status 1Vi0  ), so it (packet) immediately access to the service. b) in the case of occupancy of all channels (switching node status KViV  ) , the received packet  -го priority is queued and it is accepted for service before the packet of j -го priority, if j : If, at the time of access of the packet of priority in queues, there were K- packets (the buffer is filled completely), so the received packet is :  Accepted in queue under conditions that there are packets with low-priority j-M, the latter packet with low priority is ousted from the system and, later does not have any impact on it (system);  The packet Is Lost, given that in a queue there are only packets with higher or equal j -м priority. b) For packets (equal) priorities that are in the queue, FIFO system is realized As shown in the discipline of service in switching node when packets set in the queue and queue is managed, the absolute priority functions, while in the service the relative priority functions. The use of absolute priority queue management only provides service packets without interruption, but at the same time the losses and the average waiting time priority packet are minimized. At the same time, this discipline mentioned above has a number of disadvantages associated with the lack of malicious factors or other external influences on ITS. Therefore, in the conditions of destructive external influences and the frequent failure of telecommunications equipment using this model in the creation of ITS influence negatively on the process of ensuring the quality of service indicators such as information and functional security, reliability. Studies have shown that in order to eliminate these disadvantages, it is advisable to use a mathematical model of switching node type” rrr KVMM “with relative priorities, resource reservation and taking into consideration the real reliability of serving devices. Model of switching node and its relative priorities, reservations resources and real reliability of serving devices. The assumptions listed above (concerning: approximation of packet stream , class : R,1r  ; with the characteristics of a Poisson distribution law; service with relative priorities R,1r  class of service quality, taking into account the categories of users and the subsystems; presence of V serving devices , with the ultimate reliability of the variable-length packets;, characterized by the exponential distribution function (2) with parameter defined by equation (5)), aim at managing traffic and ensuring the specified quality of service indicators (including informational and functional safety)under conditions of limited resources ITS, possible malicious or other effects, a discipline service and their relative priorities R,1r  , of partial switching channel rV and a joint (separate) use of drives rK could be applied. This will ensure the backup of telecommunication resources for high-priority traffic (especially metadata in “cloud” antivirus systems) [3.5]. The analysis of basic algorithms management queue in ITS communications equipment showed that currently there are several types of disciplines (ways) of service queues that realize the reservation of resources:  (Fair Queuing, FQ);  (Priority Queuing (PQ));  (Custom Queuing, CQ);  (WFQ, Fair Queuing, Weighted);  (Class Based Weighted Fair Queuing CBWFQ), etc. [3-5].
  • 4. Method of controlling access to intellectual switching nodes of… www.ijceronline.com Open Access Journal Page 4 Comparative studies of these algorithms have shown that the most effective in terms of ensuring quality of service, is the algorithms of WFQ, CBWFQ, derived algorithms CQ. Therefore further research is based on the management of WFQ and CBWFQ queue. Let’s present a telecommunication system, in which the services are divided into several classes, quality of service (QoS) with appropriate priorities for latency and packet loss (for example, transfer of information and measurement of monitoring data, telephony, postal information transfer, video conferencing, etc.). The total number of priorities for the types of services, users and subsystems is R Let’s consider that at the entrance, intellectual switching node receives the simplest packets stream r -s priority classes { Rr1 a,...,а,...,а }, which are numbered in order of priority. Each priority class is characterized by the intensity of packets r : 0r  In the particular case, priorities are grouped in three groups 1r1  , J,2r2  , R,1Jr3  , corresponding to the services:  1r1  - traffic of metadata for transmission in” the cloud” antivirus system;  J,2r2  -traffic of real time, critical to network delays (telephony, videoconferencing, data objective control, etc.);  R,1Jr3  Traffic of data, critical to losses and not critical to network delays, including stream of traffic (audio, video on demand, etc..) and elastic traffic (email, web-applications, etc..). In this case the highest priority is using metadata for transmission to the cloud antivirus system. Therefore In the switching nodes of information and telecommunication systems, presented different smart devices (controllers, gateways, switches, routers, gateways, etc.), transport network users of different categories and subsystems stream received message of different classes. The intensity of received and service messages is characterized by parameters  rc и  rc , R,1r  and, in accordance with, the speed of received message (transfer  rv прд ). The received messages in the switching nodes are converted into a packet form and form R an independent packet stream Rr1 a,...,а,...,а with intensities Rr1 ,...,,...,  . The intellectual switching nodes ITS consists of  V0 serving devices with identical tactical-technical characteristics, depending on capabilities of manufacturers of telecommunication equipment, and the buffer memory capacity  К0 . In switching nodes, restrictions are imposed on serving devices resources VVr  and memory buffer size КК r  packet of different priority classes. In this case the packet with priority accesses to all serving devices and allocates a portion of buffer of the total volume of the buffer, determines in accordance with the advanced algorithm to control access to "cloud" telecommunications resources described below. For packet of priorities J,2r2  the available part VVr  of the device service is not in use at the moment of metadata packet priority, determines the improved algorithm to control access to cloud telecommunications resources, and allocates a part of buffer КК r  from total capacity of the buffer K For packets of remaining priorities R,1Jr3  ,there are a restrictive threshold- only one part of the overall service devices VVr  is available and a part of the total capacity of the buffer is allocated КК r  , so КК R 1r r   . Within each priority class 1r , J,2r2  , R,1Jr3  , allocated buffer shared data packets priority classes.
  • 5. Method of controlling access to intellectual switching nodes of… www.ijceronline.com Open Access Journal Page 5 It should be noted that the organization of distribution of resources of switching nodes in a memory buffer information packet priority class 1r practically is zero ( 0P 1r  )). Similarly there is probability of losing 2rP information packet priority class 2r 0P 2r  . In intellectual switching nodes ITS, service packet, is subject to the following discipline [3-5]. a) If, at the time of access of the information packets with priority 1r , J,2r2  , R,1Jr3  , they are free from the priority class for the devices so it’s in accordance with an algorithm to control the access to cloud telecommunications resources enters at the service. b) in case of occupancy of all available services devices (intellectual switching nodes status rrr KViV  ) separate queues are organized for packets with the priorities 1r J,2r2  and R,1Jr3  . In this case in each one, the following discipline is realized: when setting the packet in the queue ,the absolute priorities are acting, and when selecting packets for service relative priorities are acting in accordance with advanced algorithms to control access to "cloud" telecommunications resources. The use of the absolute priorities for queued reduces the average waiting time of priority packets from the groups 1r and J,2r2  , allows to improve security information ITS (improving antivirus) and ensures the quality of data service As a result in each queue, packet  -го priority is accepted for service before the packet j -гo priority if j . Furthermore, if, at the time of packet arrival  -го priority in queues 1r , J,2r2  or R,1Jr3  there was rК packets, so the arrival packet is processed as follows: - Either Accepted in queue under conditions that there are packets with low-priority j-M, the latter packet with low priority is ousted from the system and, later does not have any impact on it (system); - Or Is Lost, given that in a queue there is only packets with higher or equal j -м priority. - b) For packets r -го (equal) priorities that are in the queue 1r , J,2r2  or R,1Jr3  ,or serviced in accordance with an advanced algorithm to control access to the “cloud” telecommunication resources. The service discipline of information packets in intellectual switching node implements redundancy of network resources that is based on the strategy of moving boundary. III. AN IMPROVED ALGORITHM TO CONTROL ACCESS TO CLOUD TELECOMMUNICATIONS RESOURCES To study the functional indicators of intellectual switching nodes quality of type rrr KVMM , we use the method of the structural-logical GERT-model. Let’s take a look at its distinctive features. According to switching nodes ITS model with relative priorities and resource reservation changes in the states of the node let’s present GERT-network. Each branch 1r , J,2r2  , R,1Jr3  , of communication network conditionally describes a separate multi-threaded service system  rr K,V with dedicated and shared resources  RV . It should be noted that presenting the structural-logic model GERT takes into consideration the factors of external influences (loss of information packet) and the real reliability (possible equipment failures) through introducing branches of inverse connection with appropriate characteristics (example 42W , 52W , 74W, , etc.). The presentation of GERT-structural-logic model, as well as an analysis of several studies [1, 3, 5], devoted to the study of processes of preventive and final management of information stream to intellectual switching nodes service allows forming branches characteristics and distribution parameter. It should be noted that the studies allow finding a number of regularities in the process of intellectual switching nodes functioning related to practical identical indicators, accordingly producing function moment at separate stages and in series mode of operation. Final result is the reduction of producing functions moment.
  • 6. Method of controlling access to intellectual switching nodes of… www.ijceronline.com Open Access Journal Page 6 To solve the above optimization problem of accelerating the process of information packet in intellectual switching nodes when it is transferred to the cloud antivirus system, is proposed to optimize the algorithm control access to the cloud "telecommunications resources. The basis of the algorithm is put procedure for calculating the virtual time processing of information packet, which differs from the known factor providing an additional level of prioritization for information packet metadata [1-5]., these information packets receive highest priority processing in intellectual switching nodes class 1r . Table 1 shows the valid values of average time and Jitter of processing time and information packet for different level of priority in intellectual switching nodes The valid values for the average time jitter of processing time of information packets from different levels of priority Let’s look at the structural scheme of algorithm of controlling access to cloud telecommunication resources. Level priority R,1Jr3  J,2r2  1r1  ]i[ допT , мс 100-800 50-150 1-10 ]i[ допJ , мс 47-53 10-30 1-5 The first step: structural scheme is checking the access of packet to intellectual switching nodes if there is no packet; the algorithm goes into waiting mode of received packets. In case When at the entrance of the intellectual switching node information packet is received (all levels prioritization or only selected), it is necessarily to select of each queue buffer memory of each intellectual switching node according to the first packet, and the level of priority to determine the "reference"of information packet with the appropriate level of priority. This will reduce the processing time of the metadata packet of information while ensuring indicators of efficiency of processing information packets of other priority levels. The fourth step of the algorithm is determined by the value of the VST and VFT. Next we start with the accomplishment of procedures to identify the information packet for processing in operating unit of intellectual switching nodes. This includes the following: while receiving buffer device N packets could enter (N is the number of queues in the system), and priority levels may enter. If the value of the VST is entered, then in step 6 of the stream of information, the first ("reference"), packet is selected, as well as the value of virtual service time in queues. Next, in step 9 of structural scheme there is a comparison between "standard of information packet with other entering at the same moment. The decision about “reference “of priority of the information packet was adopted by the following criteria: 1) The minimum value of virtual service time in the queue (( minVFT  ) ; 2) Belonging of information packet to the queue with the highest priority ( 1r > 2r > 3r ). It should be noted that the condition of assignment “reference" priority setting in step 14 is not complete , and with some exceptions, determined by the previous indicator, for example an indicator-the probability of assigning priority [3]. This indicator can be determined experimentally in this case, the control procedure using this indicator, is a distinctive feature of the algorithm to control access to the "cloud" telecommunication resources. These exclusions are necessary to ensure the quality of service information packet of other (lower) priorities. The Information packets can be compared in pairs, at the initial time; the first selected information packet conditionally has the highest level of priority. If the condition mentioned in step 5, then in step 7 ,the algorithm updates information about VST and VFT. In step 10 a transition happens directly to the packet information processing procedures. In step 12 information packets assigned the values of the VST and VFT in order to accompany the information packet to the destination. Next, in step 13 information packet is added to the output queue and ends its process of its processing in intellectual switching node. Thus, algorithm is developed to control the access to cloud telecommunications resources whose distinctive feature is the introduction of non-standard conditions, decide on the attribution of the "reference" priority information packet based on the additional indicator-the probability of assigning priority. This allows solving the problem of minimizing the processing time of the metadata packet of information during the transmission to the cloud antivirus systems while ensuring quality of service information and other telecommunication services.
  • 7. Method of controlling access to intellectual switching nodes of… www.ijceronline.com Open Access Journal Page 7 IV. CONCLUSION Thus, the access control method in intellectual switching nodes includes a mathematical model of intellectual switching with information packet of different priority and improved algorithm to control access to cloud telecommunication resources. A distinctive feature of the method is the integrated use of standard criteria for information management in intellectual switching nodes with additional possibility of service packet metadata information as it transfers to the cloud antivirus systems. The main results are: Based on GERT-mathematical model of network intellectual switching node with information packet of different priorities, differs from the known, taking into consideration the maximum prioritizing information metadata packets during their transmission to the cloud antivirus systems. This helps to determine the equivalent W-function, distribution function and density distribution of service time information packet of metadata in intellectual switching nodes when they are transferred in the cloud antivirus systems. The result of studies indicates that maximum distribution density of the processing time information in metadata packets in intellectual switching nodes represent an interval from 1 to 2 Ms. The developed algorithm of control access to cloud telecommunication resources, distinguished from the known introduction of non-standard conditions a decision on assigning the "standard" priority information packets based on the additional indicator-the probability of assigning priority. This makes it possible to solve the problem of minimizing the processing time of the metadata packet of information transmission to the cloud antivirus systems while ensuring quality of service information and other telecommunication services. REFERENCES [1] Semenov S.G. A mathematical model of the spread of computer viruses in heterogeneous computer networks of automated process control systems / S.G. Semenov, V.V. Davydov // Proceedings of the National Technical University "KhPI". Scientific Papers. Series: Information and simulation. - Kharkov: NTU "KhPI", 2012 - Volume 38 - P. 163-171.. [2] Mohamad Abu Taam. The mathematical model of GERT-transmission technology metadata cloud antivirus system / Mohamad Abu Taam, V.V. Bosko, A.A. Smirnov, I.A. Berezyuk // Collected Works "Information processing systems". - Issue 1 (117). - Kharkov: KhUAF - 2014. - P. 137-141. [3] Mohamad Abu Taam. Structural logic GERT-model technology spread of computer viruses / Mohamad Abu Taam, A.A. Smirnov, I.A. Berezyuk // Management systems, navigation and communication. - Issue 1 (29). - Poltava: PNTU. - 2014. - P. 120-125. [4] Smirnov A.A. Experimental studies of the statistical properties of network traffic based on the BDS-statistics / A.A. Smirnov, D.A. Danilenko // International Journal of Computational Engineering Research (IJCER). – Volume 4, Issue 5. – India. Delhi. – 2014. – P. 41-51. [5] AA Smirnov Dispersion analysis of network traffic for intrusion detection and prevention in telecommunication systems and networks / A.A. Kuznetsov, A.A. Smirnov, D.A. Danilenko // Collected Works "Information processing systems". - Issue 2 (118). - Kharkov: KhUAF - 2014. - P. 124-133.