Escolar Documentos
Profissional Documentos
Cultura Documentos
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
J. Jeyachitra
Research Scholar
Dr. K. Iyakutti Dr. K. Alagarsamy
Dept. of Computer Professor Associate Professor
Applications Dept. of Physics and Dept. of Computer
School of Information Nanotechnology Applications
Technology SRM University School of Information
Madurai Kamaraj Chennai Technology
University Madurai Kamaraj
University
IJCSRTV1IS050058 www.ijcsrt.org 1
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
detachment of the rules that supervise the actions need uninterrupted query operations for instance
IJCSRTV1IS050058 www.ijcsrt.org 2
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
association, aggregation, and straining to data question, a novel status system is constructed
streams in actual time. Disseminated stream upon the multivariate Bayesian assumption [4].
processing schemes permit network stream In recent times, the IEEE 1900.4 set precised a
processing to attain better scalability and quality- policy-based radio reserve organization (RRM)
of-service (QoS) condition. In [1], the author structure in which the choice making procedure
presented Synergy, a narrative dispersed stream is dispersed among network-terminal units.
processing middleware that presents habitual In [5], the author presented three main RRM
sharing-aware constituent symphony methods from diverse features, spanning
ability. Conventional admittance direct diagonally prognostic versus reactive to model-
representations acquire some presentation based approaches.
consequence.
Light-trail is planned as
In large-scale standard systems with a candidate to transmit IP traffic over wavelength
physically dispersed server clusters, accessing separation multiplexing networks agreed its
admittance control on every group can effect ability of allowing high-speed provisioning and
in long reply latency, if the customer request is obliging multi-granularity passage. With the
deprived of one location and has to be on warded current expansion on ultra-fast visual board up,
T
to another site. In [2], the author measured a the author proposed enhanced light-trail
SR
destructive admittance control strategy where construction, termed as opportunistic hyper
every agent might disclose more requests than its channel in [6]. The paper [7] presented a
IJC
IJCSRTV1IS050058 www.ijcsrt.org 3
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
IJCSRTV1IS050058 www.ijcsrt.org 4
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
distributed system by adapting the hassle free Associate the nodes using the
curved optimization technique. The presence of network for efficient routing
traffic in the load imbalanced distributed system and the communication range
is identfied and rectified while minimizing the between the set of nodes over
communication overhead among different set of the network is similar.
distributed users.
Each node in the network has
task t referrred as Tn.
The second phase describes the
process of providing secuirty to the distributed Identify the number of users in
network environment. The task based validation the network.
scheme assigns an individual role to users in the
network based on their appropriate task over the Assign the set of resource
network system. The role is assigned based on available over the network
IJCSRTV1IS050058 www.ijcsrt.org 5
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
specified task. Each node in the network will added into the resource pool. The capacity of
define its limit to process the assigned task with new arrival resource is determined as,
the required amount of resources. So, the main
objective of load balancing is to distribute the Cap( Ri ) P MIPS ( P) ……………. Eqn 1
jobs to all the nodes in the network, it will: where
(1) Boost the processing rate of the network to
ti
achieve the assigned task; MIPS ( P)
T 1,000,000
(2) Boost the number of nodes to increase the
quality of service over the network for
Set a counter C for each of
utilization.
the resource (both the existing and new arrival
For an effective set of
set of resources) to identify the number of
load balancing scheme, heuristic technique is
successful tasks in the system. Based on the
utilized here, an optimization method for
assignment of counter, the loads (set of tasks to
identifying the presence of hassles. The presence
be processed) in the distributed system are
of hassles is identified based on the resource
balanced. For instance, if the new task enters for
demand over the resource pool. When the
processing, then it will search for the suitable
demand occurs, the task assigned to the resource
T resource (based on the resource capacity and the
might get interrupted. So, a hassle free
task processing time) needed to process the task.
SR
distributed system is built for balancing the load
Before assigning the task to the particular
effectively.
resource, it is necessary to check with the
IJC
IJCSRTV1IS050058 www.ijcsrt.org 6
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
IJCSRTV1IS050058 www.ijcsrt.org 7
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
task of the individual set of users is assigned the diverse set of user roles, the user requests in
with the administrative roles which are the traffic is analyzed and processed.
maintained as a list in the distributed systems.
The algorithm below describes the
The lists are,
process of enhancing QoS and security in
Resource list, set
distributed systems is described as follows,
of resources the
authorized users
can access Input: Set of resources R, set of
permissions tasks T
Service list, list
Assign U as a set of users
of services user
NewU is the new user and ExisU is the
roles are defined
existing user
and accessed.
R is the role assigned to the user
L is the limit given to the users U for security
User role list, a
purpose
list of resources and
Perm is the permission given to the set of
services the users
T
//users U
have granted access.
Load balancing scheme
SR
The users in the distributed systems are assigned Begin
with the set of individual roles to protect the data Initialize the available set
IJC
in the traffic roles are assigned as supervisor, of resources in the distributed system
analyzer, Evaluator. All these set of roles Determine the processing
maintain the above set of lists to protect the data tasks P
in the network. Determine the MIPS
rating of the particular task tn
At first, the supervisor analyzes the
Identify the number of
users requests and resources for processing the
tasks to be processed as n
tasks assigned to them. The supervisor sets a
Do
state based on the assignement of resources. The
state is being positive if it successfully assigned Begin
the resources to the tasks in the distributed Choose the task ti from tn
the users and its processed job over the assign the task ti based on the cap(Ri)
IJCSRTV1IS050058 www.ijcsrt.org 8
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
IJCSRTV1IS050058 www.ijcsrt.org 9
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
The values of the attribute information are With these set, the experiments are
described in the subsequent table (table 2). conducted to estimate the performance of the
proposed ASEP scheme.
Attribute Values
Quality assurance
Code for class (A,B,C,D,E,F,H)
Quality assurance (QA) is defined as
the engineering behaviors for providing a quality
Code for largest (X,R,S,A,H,K)
spot size distributed system so that task for the specified
set of service is monitored. It is the methodical
Code for spot (X,O,I,C)
dimension, and a connected loop that presents
distribution
error preclusion.
Activity 1-reduced, 2-
unchanged Security
Security is the extent of confrontation
Evolution 1-decay, 2 – no
growth, 3 - growth to, or fortification from the unauthorized access
to users in the distributed systems. Security
24 hour flare 1-nothing as big as
achieves the secure process of tasks assigned
activity code an m1, 2- one M1
T with the users in the network without any
Historically 1-yes, 2- No
SR
complex interruption.
Area of the largest 1 = < =5, 2 = >5 The time taken to achieve the
spot
reliable security and QoS (considered both the
load balancing and task based validation scheme)
Table 2 Attribute description
to process the data in the dataset is referred as
From all these predictors three set of flare classes execution time. It is measured in terms of
are predicted, which are represented in the last seconds.
three columns. 5. RESULTS AND DISCUSSION
ASEP scheme in distributed
C - Common flares - Class flares production in system is compared with the existing distributed
24 hours; admission control model [2] for measuring the
M - Moderate flares - Class flares production in rate of security, quality assurance and execution
24 hours; time. The below table and graph describes the
X - Severe flares - Class performance of the proposed ASEP Scheme in
flares production in 24 hours; distributed systems and existing self protection
scheme in clustered distributed systems.
IJCSRTV1IS050058 www.ijcsrt.org 10
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
No. of Quality assurance (%) proposed ASEP model provides good quality of
assurance. Because, the proposed ASEP model
tasks Proposed Existing
balanced the task loads in the distributed systems
ASEP distributed efficiently by implementing the load balancing
scheme admission scheme in the distributed systems. So, the data
control model traffic rate occurrence is less in the proposed
ASEP model, contrast to the existing distributed
25 62 40
admission control model. The variance in the
50 69 46
quality assurance is 10-155 high in the proposed
75 73 52 ASEP approach.
100 76 58
125 81 62 No. of Security (%)
150 85 66 users Proposed Existing
200 89 76 ASEP distributed
scheme admission
Table 5.1 No. of tasks vs. quality control model
T
assurance 50 54 40
SR
The quality assurance is measured based on the 100 62 46
number of tasks present in the distributed
IJC
150 69 52
systems. The value of the proposed ASEP
scheme is compared with the existing distributed 200 75 58
admission control model is illustrated in table
250 82 64
5.1.
300 86 72
100
Quality assurance (%)
80
60
350 89 79
40
20
0
25 50 75 100 125 150 200 Table 5.2 No. of users vs. security
No. of tasks
IJCSRTV1IS050058 www.ijcsrt.org 11
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
ASEP distributed
60
scheme admission
40
20
control
0 model
50 100 150 200 250 300 350 50 14 20
No. of users
100 20 26
Proposed ASEP scheme Existing distributed admission control model
150 23 31
200 28 35
Fig 5.2 No. of users vs. security 250 35 40
300 39 43
Fig 5.2 describes the security level of the users 350 46 50
and their appropriate data in the distributed
Table 5.3 No. of tasks vs. execution
systems. Compared to the existing distributed
T
time
SR
admission control model, the proposed ASEP
The execution time is measured based on the
scheme provides high level of security. Since the
number of tasks present in the distributed
IJC
60
50
in the distributed systems is less contrast to the
40
existing distributed admission control model. 30
20
The variance in the security level is 11-13% high
10
in the proposed ASEP scheme. 0
50 100 150 200 250 300 350
No. of tasks
IJCSRTV1IS050058 www.ijcsrt.org 12
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
distributed admission control model, the assurance with high security by consuming
proposed ASEP scheme consumes less time to minimal communication cost.
achieve the quality over distributed systems.
Since, the load balancing is achieved before
REFERENCES
providing security to the specified tasks of the
[1] Repantis, T. , Xiaohui Gu ; Kalogeraki, V,.,
users in the distributed systems, the time
„QoS-Aware Shared Component Composition
consumption is less.
for Distributed Stream Processing Systems‟,
Finally, it is being observed that the proposed
Parallel and Distributed Systems, IEEE
ASEP scheme provides reliable Qualtiy of
Transactions on (Volume:20 , Issue: 7 ), 2009.
service over the distributed systems by timely
adapting the software engineering principles.
[2] Zhonghang Xia, Wei Hao ; I-Ling Yen ; Peng
Li, “A distributed admission control model for
6. CONCLUSION QoS assurance in large-scale media delivery
In this paper, software systems”, Parallel and Distributed Systems,
engineering principles is presented for achieving IEEE Transactions on (Volume:16 , Issue: 12 ),
the QoS and security over the distributed T 2005
systems. Load balancing and security are the two
[3] Chunyu Hu ET. AL.,, “A Distributed
SR
principles utilized for achieving the QoS in
distributed systems that provides the active Approach of Proportional Bandwidth Allocation
environment for packet transmission and for Real-Time Services in UltraWideBand
IJC
assignment of limits and capabilities to a user of (UWB) WPANs”, Parallel and Distributed
the database. For effective load balancing, Systems, IEEE Transactions on (Volume:21
heuristic optimization technique is presented , Issue: 11 ), 2010
with given communication pattern to produce an
optimal solution. The optimization technique [4] Yanchao Zhang, Yuguang Fang, “A Fine-
provides hassle free HCO algorithm used here Grained Reputation System for Reliable Service
for identifying the presence of hassles based on Selection in Peer-to-Peer Networks”, Parallel
the trial and error method. For security, the task and Distributed Systems, IEEE Transactions
based validation scheme is presented based on on (Volume:18 , Issue: 8 ), 2007.
the assignment of role and user access
permission limits supported with the [5] Eng Hwee Ong ; Khan, J.Y. ; Mahata, K.,
environment. Experimental evaluation is done “Radio Resource Management of Composite
with the dataset extracted from UCI repository to Wireless Networks: Predictive and Reactive
analyze the performance. Results revealed that Approaches”, Mobile Computing, IEEE
compared to the non parametric approach, the Transactions on (Volume:11 , Issue: 5 ), 2012
proposed ASEP provides 5-6% reliable quality [6] Jing Chen et. Al., “Opportunistic Optical
Hyperchannel and Its Distributed QoS Assuring
IJCSRTV1IS050058 www.ijcsrt.org 13
International Journal of Computer Science Research & Technology (IJCSRT)
ISSN: 2321-8827
Vol. 1 Issue 5, October - 2013
IJCSRTV1IS050058 www.ijcsrt.org 14