Learn More
Open shortest path first (OSPF) is a routing protocol which is widely used in the industry. Its functionality mainly depends on the weights assigned to the links. Given the traffic demands on a network, setting weights such that congestion can be avoided is an NP-hard problem. Optimizing these link weights leads to efficient network utilization which is the(More)
Description: Iterative Computer Algorithms with Applications in Engineering describes in-depth the five main iterative algorithms for solving hard combinatorial optimization problems: Simulated Annealing, Genetic Algorithms, Tabu Search, Simulated Evolution, and Stochastic Evolution. The authors present various iterative techniques and illustrate how they(More)
In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two paral-lelization strategies are integrated: functional decomposition strategy and multi-search threads strategy. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed. The(More)
This paper describes and analyzes the application of a simulated evolution (SE) approach to the problem of matching and scheduling of coarse-grained tasks in a heterogeneous suite of machines. The various steps of the SE algorithm are first discussed. Goodness function required by SE is designed and explained. Then experimental results applied on various(More)
Among one of the most far-reaching influences of the Internet, especially from the perspective of business and market models, is the concept and application of eCommerce. Today, this erstwhile 'experimental' commerce model has become a standard platform for streamlining business flows and broadening product outreach. This is validated by the significant(More)
This paper describes a unique approach to scheduling and allocation problem in high-level synthesis using genetic algorithm (GA). This approach is different from a previous attempt using GA [l] in many respects. Our contributions include: a new chromo-somal representation for scheduling and two subprob-lems of allocation; and two novel crossover operators(More)
We engineer a well-known optimization technique namely Tabu Search (TS) [1] for the performance and low power driven VLSI standard cell placement problem [2], [3]. The above problem is of multiobjective nature since three possibly conflicting objectives are considered to be optimized subject to the constraint of layout width. These objectives are power(More)
The topology design of campus networks (CNs) is a hard constrained combinatorial optimization problem. Therefore, we resort to heuristics to come up with desirable solutions. A desirable solution must optimize several connicting objectives such as minimization of cost, minimization of network delay, and minimization of maximum number of hops etc.(More)