|
Paper Title |
Authors |
Conference |
Abstract |
|
|
Ontology-based Distributed Intrusion Detection System |
F. Abdoli
M. Kahani
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Abstract—In this paper we discussed about utilizing
methods and techniques of semantic web in the Intrusion
Detection Systems. To extract semantic relations between
computer attacks and intrusions in a Distributed Intrusion
Detection System, we ... more
Abstract—In this paper we discussed about utilizing
methods and techniques of semantic web in the Intrusion
Detection Systems. To extract semantic relations between
computer attacks and intrusions in a Distributed Intrusion
Detection System, we use ontology. Protégé software is our
selected software for building ontology. In addition, we
utilized Jena framework to make interaction between
MasterAgent and attacks ontology. Our Distributed
Intrusion Detection System is a network which contains
some IDSagents and a special MasterAgent. MasterAgent
contains our proposed attacks ontology. Every time a
IDSagent detects an attack or new suspected condition, it
sends detection’s report for MasterAgent. Therefore, it can
extract the semantic relationship among computer attacks
and suspected situations in the network with proposed
ontology. Finally, the experience shows that the pruposed
system reduced the rate of false positive and false negative. less
Abstract—In this paper we discussed about utilizing
methods and techniques of semantic web in the Intrusion
Detection Systems. To extract semantic relations between
computer attacks and intrusions in a Distributed Intrusion
Detection System, we ... more |
خرید مقاله
|
|
Job Failure Prediction in Grid Environment Based on Workload Characteristics |
Hamid Fadishei
Hamid Saadatfar
Hossein Deldari
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
The power of grid technology in aggregating
autonomous resources owned by several organizations
into a single virtual system has made it popular in
compute-intensive and data-intensive applications.
Complex and dynamic nature of grid makes ... more
The power of grid technology in aggregating
autonomous resources owned by several organizations
into a single virtual system has made it popular in
compute-intensive and data-intensive applications.
Complex and dynamic nature of grid makes failure of
users’ jobs fairly probable. Furthermore, traditional
methods for job failure recovery have proven costly
and thus a need to shift toward proactive and
predictive management strategies is necessary in such
systems. In this paper, an innovative effort is made to
predict the futurity of jobs submitted to a production
grid environment (AuverGrid). By analyzing grid
workload traces and extracting patterns describing
common failure characteristics, the success or failure
status of jobs during 6 months of AuverGrid activity
was predicted with around 96% accuracy. The quality
of services on grid can be improved by integrating the
result of this work into management services like
scheduling and monitoring. less
The power of grid technology in aggregating
autonomous resources owned by several organizations
into a single virtual system has made it popular in
compute-intensive and data-intensive applications.
Complex and dynamic nature of grid makes ... more |
خرید مقاله
|
|
Distributed Resource Discovery in Grid with Efficient Range Query |
Seyed Mehdi Fattahi
Nasrollah Moghaddam Charkari
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Grid is an environment that makes it possible to share resources that are managed by diverse, independent and administrative geographically distributed organizations. The main objective of grid is to enable ... more
Grid is an environment that makes it possible to share resources that are managed by diverse, independent and administrative geographically distributed organizations. The main objective of grid is to enable users to solve problems using the available geographically distributed resources. Grid resource discovery is a challenging issue because characteristics of resources are heterogeneous, dynamic, various and autonomous. In this paper we propose a mobile agent approach based on peer to peer model for the resource discovery problem that presents essential characteristics for efficient, self-configuring and fault-tolerant resource discovery and is able to handle range queries. For this reason, we encode resources’ range attributes to bitmap index and compare with query attributes in order to know whether resource satisfies query or not. Moreover, we employ a Distributed Ant Colony System (ACS) algorithm to route requests into Grid and locate the required resources. The innovation in this paper is to support range queries and to eliminate centralized control and provide node autonomy. less
Grid is an environment that makes it possible to share resources that are managed by diverse, independent and administrative geographically distributed organizations. The main objective of grid is to enable ... more |
خرید مقاله
|
|
A Novel Approach towards QoS Provisioning in Delay-sensitive Flows over Wireless Networks |
Mohammad H. Hajiesmaili
Aresh Dadlani
Nasser Yazdani
Ahmad Khonsari
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Wireless networks are poised to support a myriad
of existing as well as emerging multimedia streaming
applications. With increase in use of wireless local
area networks (WLANs), ranging from simple data
transfer to bandwidth-intense, ... more
Wireless networks are poised to support a myriad
of existing as well as emerging multimedia streaming
applications. With increase in use of wireless local
area networks (WLANs), ranging from simple data
transfer to bandwidth-intense, delay-sensitive, and
loss-tolerant multimedia applications, issues regarding
quality of service (QoS) have become a major research
endeavor. Several challenges posed by robust video
streaming over 802.11 WLANs include coping with
packet losses caused by network buffer overflow, link
erasures, or deadline misses. A major observation is
that the retry limit settings of the MAC layer can be
optimized in a way such that the overall packet loss
caused by link erasure, buffer overflow, or deadline
miss is minimized. In this paper, we propose a novel
solution for minimizing packet loss in multimedia
applications over WLANs. Simulation results justify the
improved quality of the received video based on our
proposed approach. less
Wireless networks are poised to support a myriad
of existing as well as emerging multimedia streaming
applications. With increase in use of wireless local
area networks (WLANs), ranging from simple data
transfer to bandwidth-intense, ... more |
خرید مقاله
|
|
An Improved Resource-based Performance Model for Optical Core Switches |
Aresh Dadlani
Ahmad Khonsari
Mohammad H. Hajiesmaili
Ahmad Kianrad
Abolfazl Dianat
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
The evolution of optical technology has resulted in
the emergence of several promising paradigms so as to
realize the next generation Internet backbone
infrastructure. Among all the existing switching
techniques, optical burst switching (OBS) ... more
The evolution of optical technology has resulted in
the emergence of several promising paradigms so as to
realize the next generation Internet backbone
infrastructure. Among all the existing switching
techniques, optical burst switching (OBS) has shown to
support the bursty nature of diverse IP traffic classes
more efficiently. Nevertheless, with increase in realtime
applications over the Internet, devising
mechanisms that guarantee quality of service (QoS)
and efficient bandwidth utilization within the OBS
network has become a major endeavor. In the
literature, resource allocation-based QoS management
has been investigated as a possible solution to
overcome this necessity. However, to the best of our
knowledge, the resource-based technique has not been
analytically studied for any arbitrary number of traffic
classes taking both, wavelengths and fiber delay lines
(FDLs) into account. In this paper, we present a novel
mathematical model for the resource-based approach
with two service classes namely, real-time (H) and non
real-time (L) classes. We then extend the model to
cover any number of classes. The effectiveness of the
model is justified through simulation experiments. less
The evolution of optical technology has resulted in
the emergence of several promising paradigms so as to
realize the next generation Internet backbone
infrastructure. Among all the existing switching
techniques, optical burst switching (OBS) ... more |
خرید مقاله
|
|
A Distributed Algorithm for Node Localization by Connectivity in Large Scale Wireless Mesh Sensor Networks |
Hosein Sabaghian-Bidgoli
Nasser Yazdani
Farshad Lahouti
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Locating sensor nodes is essential for many
applications and protocols in wireless sensor network.
Large numbers of localization algorithms have been
proposed to do this. Distributed algorithms decrease
communication cost while having lower accuracy. ... more
Locating sensor nodes is essential for many
applications and protocols in wireless sensor network.
Large numbers of localization algorithms have been
proposed to do this. Distributed algorithms decrease
communication cost while having lower accuracy. In
this paper we propose a distributed method to localize
sensor node using only neighboring information. Our
focus is on location estimation although some ideas
are also presented for implementation. Our algorithm
employs an error analysis scheme and calculates
expected error as well as estimated location for each
sensor node. Simulation results confirm effectiveness of
our scheme and prove capability of using connectivity
approach. less
Locating sensor nodes is essential for many
applications and protocols in wireless sensor network.
Large numbers of localization algorithms have been
proposed to do this. Distributed algorithms decrease
communication cost while having lower accuracy. ... more |
خرید مقاله
|
|
Multiprocessor Scheduling with Evolving Cellular Automata Based on Ant Colony Optimization |
Toktam Ghafarian
Hossein Deldari
Mohammad-R. Akbarzadeh –T.
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Multiprocessor scheduling belongs to a special category of NP-complete computational problems. The purpose of scheduling is to scatter tasks among the processors in such a way that the precedence constraints ... more
Multiprocessor scheduling belongs to a special category of NP-complete computational problems. The purpose of scheduling is to scatter tasks among the processors in such a way that the precedence constraints between tasks are kept, and the total execution time is minimized. Cellular automata (CA) can be used for multiprocessor scheduling, but one of the difficulties in using CA is the exponentially increasing number of rules with increasing number of processor and neighborhood radius. Here, we propose a combined use of ant colony and evolutionary meta-heuristics to search the rule’s feasible space in order to find optimal rule base. Also we introduce a two dimensional cellular automata structure based on the important task attributes in the precedence task graph. The proposed scheduler that uses evolving cellular automata based on ant colony can find optimal response time for some of well known precedence task graph in the multiprocessor scheduling area. less
Multiprocessor scheduling belongs to a special category of NP-complete computational problems. The purpose of scheduling is to scatter tasks among the processors in such a way that the precedence constraints ... more |
خرید مقاله
|
|
Hard Real-Time Multiobjective Scheduling in Heterogeneous Systems Using Genetic Algorithms |
Mohammad Reza Miryani
Mahmoud Naghibzadeh
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Optimal tasks allocation is one of the most
important problems in multiprocessing. Optimal
assignment of tasks to a multiprocessor is an NPhard
problem in general cases, and precedence task
graph makes it more complex. ... more
Optimal tasks allocation is one of the most
important problems in multiprocessing. Optimal
assignment of tasks to a multiprocessor is an NPhard
problem in general cases, and precedence task
graph makes it more complex. Many factors affect
optimal tasks allocation. One of them is cache reload
time in multiprocessor systems. These problems exist
in real-time systems, too. Due to high sensitivity of
‘time’ in real-time systems, scheduling with respect
to time constraints becomes very important. This
paper proposes a suboptimal scheduler for hard realtime
heterogeneous multiprocessor systems
considering time constraints and cache reload time
simultaneously, using multiobjective genetic
algorithm. In addition, it tries to propose a
generalized method for real-time multiobjective
scheduling in multiprocessor systems using genetic
algorithms. less
Optimal tasks allocation is one of the most
important problems in multiprocessing. Optimal
assignment of tasks to a multiprocessor is an NPhard
problem in general cases, and precedence task
graph makes it more complex. ... more |
خرید مقاله
|
|
An Improved Ant Algorithm for Grid Scheduling Problem |
Jamshid Bagherzadeh
Mojtaba MadadyarAdeh
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Grid computing is a promising technology for
future computing platforms and is expected to provide
easier access to remote computational resources that are
usually locally limited. Scheduling is one of the active
research topics ... more
Grid computing is a promising technology for
future computing platforms and is expected to provide
easier access to remote computational resources that are
usually locally limited. Scheduling is one of the active
research topics in grid environments. The goal of grid task
scheduling is to achieve high system throughput and to
allocate various computing resources to applications. The
Complexity of scheduling problem increases with the size of
the grid and becomes highly difficult to solve effectively.
Many different methods have been proposed to solve this
problem. Some of these methods are based on heuristic
techniques that provide an optimal or near optimal solution
for large grids. In this paper we introduce a new task
scheduling algorithm based on Ant Colony Optimization
(ACO). According to the experimental results, the proposed
algorithm confidently demonstrates its competitiveness with
previously proposed algorithms. less
Grid computing is a promising technology for
future computing platforms and is expected to provide
easier access to remote computational resources that are
usually locally limited. Scheduling is one of the active
research topics ... more |
خرید مقاله
|
|
Resource discovery using rough set in Grid environment |
Iraj Ataollahi
Morteza Analoui
|
چهاردهمین کنفرانس بین‌المللی سالانه انجمن کامپیوتر ایران |
Grid environment is being a service oriented
infrastructure in which many heterogeneous resources
participate for providing the high performance
computation. On of bug issue in the grid environment
is the vagueness and uncertainty between ... more
Grid environment is being a service oriented
infrastructure in which many heterogeneous resources
participate for providing the high performance
computation. On of bug issue in the grid environment
is the vagueness and uncertainty between advertised
resources and requested resources. In this work we
propose a solution for the vagueness and uncertainty
problems based on rough set theory. Here you can see
how the rough set theory is developed to deal with the
problem. We also report the result of the solution
obtained from the simulation in Gridsim simulator. The
comparison has been made between the proposed
method and UDDI and OWL-S combined method.
Rough set theory shows much better precision for the
cases with vagueness and uncertainty. less
Grid environment is being a service oriented
infrastructure in which many heterogeneous resources
participate for providing the high performance
computation. On of bug issue in the grid environment
is the vagueness and uncertainty between ... more |
خرید مقاله
|
.gif){kind=icon}
