The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper investigates the throughput performance of the d-tree multicast capable optical cross-connect (MC-OXC) by using the separated unicast/multicast splitter-and-delivery (SUM-SaD) switches under synchronous traffic. A d-tree property is introduced to constrain the ability that the MC-OXC and SUM-SaD can accommodate the numbers of light trees. We propose the maximal independent set (MIS) model...
In this paper a specialized routing problem for vehicles in a transportation network that need to visit multiple destinations before returning to the starting location in the minimum time is presented. Although this problem is similar to the Traveling Salesman Problem (TSP), it differs because the edge weights can change constantly and the vehicle only needs to visit a subset of the nodes in the graph...
Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenon. Because of the variable and unpredictable capacity of wireless links, packet loses may happen frequently. Several routing protocols have been proposed for Mobile Adhoc networks, yet there is no one for all schemes that works well in...
This paper addresses an unrelated parallel machine problem with machine and job sequence dependent setup times. The objective function considered is a linear combination of the total completion time and the total number of resources assigned. Due to the combinatorial complexity of this problem, we propose an algorithm based on the GRASP metaheuristic, in which the basic parameter that defines the...
Sensor network lifetime is largely affected by the energy consumption for data transmission from sensor nodes to a base station. We generalize and solve the problems of deploying multiple base stations in sensor networks using one-hop and multi-hop communication models to maximize network lifetime. Under the one-hop communication model, the sensors far away from base stations always deplete their...
Hyper-heuristics are increasingly used in function and combinatorial optimization. Rather than attempt to solve a problem using a fixed heuristic, a hyper-heuristic approach attempts to find a combination of heuristics that solve a problem (and in turn may be directly suitable for a class of problem instances). Hyper-heuristics have been little explored in data mining. Here we apply a hyper-heuristic...
Detecting the point in time where a dynamic fitness landscape changes is vital for a considerable number of diversity management schemes that used in evolutionary algorithms employed for solving dynamic optimization problems. Here, we introduce a change detector based on principles of artificial immune systems, namely a negative selection algorithm. We show in numerical experiments that such an immunological...
Pattern theorem in financial time-series is one of the most important technical analysis methods in financial prediction. Recent researches have achieved big progresses in identifying and recognizing time-series patterns. And most of the recent works on time-series deal with this task by using static approaches and mainly focus on the recognition accuracy, but considering that recognition of patterns...
The Hybrid CDN-P2P architecture, or HCDN, which combines the complementary advantages of CDN and P2P networks, has been proposed to reduce the deployment cost and to improve the quality of service in file sharing and video streaming applications. A replica placement algorithm (RPA) decides where to replicate the specific data. Existing RPAs for pure CDN do not work efficiently in the HCDN architecture...
We present a distributed on-line algorithm for detecting conjunctive stable predicates in dynamic systems. The algorithm consists of a virtual network topology to maintain the causality relationships between distributed events and protocols to check the verification of the predicates over consistent global states. A lazy detection protocol has been developed to minimize the number of messages for...
This paper introduces techniques in scheduling jobs on a master/workers platform where the bandwidth is shared by all workers. The goal is to minimize the total makespan. The jobs are independent and each job requires a fixed amount of bandwidth to download input data before execution. The master can communicate with multiple workers simultaneously, provided that the bandwidth used by the master and...
Combining virtual machine technology and network computing technology will be able to effectively aggregate the widely distributed heterogeneous and autonomous resources in the Internet. This paper proposes a virtual machine server aggregation algorithm, called DVSA, based on hierarchical clustering method for virtual computing environment. According to network latencies, the algorithm clusters virtual...
The problem of real time scheduling spans a broad spectrum of algorithms from simple uniprocessor to highly sophisticated multiprocessor scheduling algorithm. This paper proposes a new novel scheduling algorithm to scheduler periodic task for soft real time systems.This is a planning based scheduler where tasks are scheduled on the basis of its instantaneous utilization.Here after every quantum of...
We design and evaluate a hybrid load balancing policy, which selects effective node sets in the stage of static load balancing to lower the odds of selecting ineffective nodes and makes use of the stage of dynamic load balancing. When a node status changes, a new substitute can be located in the shortest time to maintain the execution performance of the system. The algorithm deals with an effective...
Packet classification is one of the most critical techniques in many network devices such as firewall, IDS and IPS, etc. In order to meet the performance requirement for high speed Internet (even higher than 10 Gbps), practical algorithms must keep better spatial and temporal performance. Moreover, as the size of rule set is increasing to tens of thousands, novel packet classification algorithms must...
Graphics processing units (GPUs) have been widely used to accelerate algorithms that exhibit massive data parallelism or task parallelism. When such parallelism is not inherent in an algorithm, computational scientists resort to simply replicating the algorithm on every multiprocessor of a NVIDIA GPU, for example, to create such parallelism, resulting in embarrassingly parallel ensemble runs that...
In this paper we present an empirical, comparative performance, analysis of fourteen variants of Differential Evolution (DE) and Dynamic Differential Evolution (DDE) algorithms to solve unconstrained global optimization problems. The aim is to compare DDE, which employs a dynamic evolution mechanism, against DE and to identify the competitive variants which perform reasonably well on problems with...
Several strategies have been proposed to provide quality solutions to the unit commitment problem and increase the potential saving in the power system operation. These include deterministic and stochastic search algorithms. One of the limitations of deterministic approaches is, they suffer from the curse of dimensionality when dealing with the modern power system with large number of generators....
This paper proposes an affine projection algorithm (APA) using the inner product between input vectors. The existing APAs have fast convergence rate but large steady-state estimation errors. In order to reduce the estimation errors, the proposed algorithm adjusts the number of the input vectors by grouping of the input vectors. The grouping process uses the angle between a current input vector and...
Currently, the field of wireless sensor networks (WSNs) is becoming increasingly important and a challenging research area. Advancements in sensor networks enable a wide range of environmental monitoring and object tracking applications. Moreover, multihop routing in WSN is affected by new nodes constantly entering or leaving the network. Therefore, nature based self-organized and independent mechanisms...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.