Abstract: The expectation of network performance from the
early days of ARPANET until now has been changed significantly.
Every day, new advancement in technological infrastructure opens
the doors for better quality of service and accordingly level of
perceived quality of network services have been increased over the
time. Nowadays for many applications, late information has no value
or even may result in financial or catastrophic loss, on the other hand,
demands for some level of guarantee in providing and maintaining
quality of service are ever increasing. Based on this history, having a
QoS aware routing system which is able to provide today's required
level of quality of service in the networks and effectively adapt to the
future needs, seems as a key requirement for future Internet. In this
work we have extended the traditional AntNet routing system to
support QoS with multiple metrics such as bandwidth and delay
which is named Q-Net. This novel scalable QoS routing system aims
to provide different types of services in the network simultaneously.
Each type of service can be provided for a period of time in the
network and network nodes do not need to have any previous
knowledge about it. When a type of quality of service is requested,
Q-Net will allocate required resources for the service and will
guarantee QoS requirement of the service, based on target objectives.
Abstract: Set covering problem is a classical problem in
computer science and complexity theory. It has many applications,
such as airline crew scheduling problem, facilities location problem,
vehicle routing, assignment problem, etc. In this paper, three
different techniques are applied to solve set covering problem.
Firstly, a mathematical model of set covering problem is introduced
and solved by using optimization solver, LINGO. Secondly, the
Genetic Algorithm Toolbox available in MATLAB is used to solve
set covering problem. And lastly, an ant colony optimization method
is programmed in MATLAB programming language. Results
obtained from these methods are presented in tables. In order to
assess the performance of the techniques used in this project, the
benchmark problems available in open literature are used.
Abstract: Scheduling of diversified service requests in
distributed computing is a critical design issue. Cloud is a type of
parallel and distributed system consisting of a collection of
interconnected and virtual computers. It is not only the clusters and
grid but also it comprises of next generation data centers. The paper
proposes an initial heuristic algorithm to apply modified ant colony
optimization approach for the diversified service allocation and
scheduling mechanism in cloud paradigm. The proposed optimization
method is aimed to minimize the scheduling throughput to service all
the diversified requests according to the different resource allocator
available under cloud computing environment.