Displaying similar documents to “Scatter Search Based Metaheuristic for Robust Optimization of the Deploying Of “Dwdm” Technology on Optical Networks With Survivability”

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak (2010)

International Journal of Applied Mathematics and Computer Science

Similarity:

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of...

Combination of mobile agent and evolutionary algorithm to optimize the client transport services

Hayfa Zgaya, Slim Hammadi, Khaled Ghédira (2008)

RAIRO - Operations Research

Similarity:

This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this level, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it...

The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks

Krzysztof Walkowiak (2002)

International Journal of Applied Mathematics and Computer Science

Similarity:

Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented...

On designing connected rapid transit networks reducing the number of transfers

Laureano Fernando Escudero, Susana Muñoz (2012)

RAIRO - Operations Research

Similarity:

In this paper we introduce some improvements on an approach that we described elsewhere for solving a modification of the well-known extended rapid transit network design problem. Firstly, we propose an integer programming model for selecting the stations to be constructed and the links between them, in such a way that a connected rapid transit network is obtained. Secondly, we consider a linear 0-1 programming model for determining a...