In this paper we propose a framework for the overall design problem of internet protocol (IP) networks with performance guarantees that includes the locatio...

This paper presents a mixed 0-1 linear programming model for the metropolitan area network (MAN) expansion problem. The model includes the location of new...

In this paper we deal with the problem of how to expand MANs (Metropolitan Area Networks) in a cost-effective way. We first propose a mathematical programmi...

This paper deals with the problem of how to update telecommunication networks economically. We first propose a mixed integer programming model that includes...

In this article we propose a mixed 0-1 linear programming model for the topological network design problem with modular switches such as the ones that will ...

ATM (Asynchronous Transfer Mode) is a new technology recently chosen by the ITU-T standard for broadband networks. Being a powerful and yet complex techno...

For many years banks designed their promotional efforts to aim at the broadest possible markets in hopes of recruiting new clients. Recently, competitive me...

The Steiner Tree Problem in graphs (STP) is well known NP-Hard problem. It has regained attention due to the introduction of new telecommunication technolog...

This paper deals with the problem of how to update a telecommunication network economically. We first propose a mixed integer programming model that include...

In this article we propose a model for the topological design problem of two-level multitechnology telecommunication networks that includes the optimal loca...

Multi-commodity flow models are well known and have been widely used in the design of packet-switched networks. They have also been used as approximations ...

This paper presents a framework to assess a performability measure in a urban transportation network given the possibility of an accident condition. This fr...

Managing redundant information is becoming an important issue in today's increasingly large distributed computer networks. As total redundancy is extremely ...

This paper presents a scenario-oriented optimization model and solution algorithm to solve the joint routing/capacity assignment problem for computer networ...

We consider a model for communications network design that includes the optimal location of switches (of which there are several types) and the design of th...

In a subway system, when a train leaves one station to go to another power consumption increases and, at one point, reaches a peak. When such peaks occur s...

We present several versions of a tabu search algorithm for the Steiner tree problem in graphs. A basic tabu search heuristic and versions with radical and/...

The paper presents three parallel versions of a column generation software applied to very large airline planning problems. The algorithms were implemented...

In this paper we tackle the problem of jointly finding the optimal location of the ATM switches, the topology of the backbone and local access networks, the...

Routing models for packet-switched networks have traditionally been based on the assumption that the offered traffic is Poisson. This is unrealistic since ...