Displaying similar documents to “Oriented multicast routing algorithm applied to network-level agent search.”

A branch-and-cut for the Non-Disjoint m-Ring-Star Problem

Pierre Fouilhoux, Aurélien Questel (2014)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this article we study the realistic network topology of Synchronous Digital Hierarchy (SDH) networks. We describe how providers fulfill customer connectivity requirements. We show that SDH Network design reduces to the Non-Disjoint m-Ring-Star Problem (NDRSP). We first show that there is no two-index integer formulation for this problem. We then present a natural 3-index formulation for the NDRSP together with some classes of valid inequalities that are used as cutting planes in a...

An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks

Popova, Hristina (2014)

Serdica Journal of Computing

Similarity:

We develop a simplified implementation of the Hoshen-Kopelman cluster counting algorithm adapted for honeycomb networks. In our implementation of the algorithm we assume that all nodes in the network are occupied and links between nodes can be intact or broken. The algorithm counts how many clusters there are in the network and determines which nodes belong to each cluster. The network information is stored into two sets of data. The first one is related to the connectivity of the...

Ant algorithm for flow assignment in connection-oriented networks

Krzysztof Walkowiak (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern...

Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

Michal Przewozniczek, Krzysztof Walkowiak (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main...

Approximation algorithms for the design of SDH/SONET networks

Nadia Brauner, Yves Crama, Gerd Finke, Pierre Lemaire, Christelle Wynants (2003)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.

Hybrid Particle Swarm and Neural Network Approach for Streamflow Forecasting

A. Sedki, D. Ouazar (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

In this paper, an artificial neural network (ANN) based on hybrid algorithm combining particle swarm optimization (PSO) with back-propagation (BP) is proposed to forecast the daily streamflows in a catchment located in a semi-arid region in Morocco. The PSO algorithm has a rapid convergence during the initial stages of a global search, while the BP algorithm can achieve faster convergent speed around the global optimum. By combining the...