#### Filter Results:

#### Publication Year

2004

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

—This paper presents a new version of a multiobjective multicast routing algorithm (MMA) for traffic engineering, based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the maximum link utilization, the cost of the tree, the maximum end-to-end delay and the average delay. In this way, a set of optimal solutions, known as… (More)

This paper presents a new multiobjective multicast routing algorithm (MMA) based on the Strength Pareto Evolutionary Algorithm (SPEA), which simultaneously optimizes the cost of the tree, the maximum end-to-end delay, the average delay and the maximum link utilization. In this way, a set of optimal solutions, known as Pareto set, is calculated in only one… (More)

—The routing problem in Wireless Mesh Networks is concerned with finding " good " source-destination paths. It generally faces multiple objectives to be optimized, such as i) path capacity, which accounts for the bits per second that can be sent along the path connecting the source to the destination node, and ii) end-to-end delay. This paper presents the… (More)

Multicast routing problem in computer networks, with more than one objective to consider, like cost and delay, is usually treated as a mono-objective Optimization Problem, where the cost of the tree is minimized subject to a priori restrictions on the delays from the source to each destination. This paper presents a new multicast algorithm based on the… (More)

—In this paper, we address the minimum length scheduling problem in wireless networks, where each transmitter has a finite amount of data to deliver to a common receiver node (e.g., base station). In contrast with previous works that model wireless channels according to the Protocol or Physical model of interference, this paper studies the scheduling… (More)

We present an incentive model for route distribution in the context of path vector routing protocols and we focus on the Border Gateway Protocol (BGP). BGP is the de-facto protocol for interdomain routing on the Internet. We model BGP route distribution and computation using a game in which a BGP speaker advertises its prefix to its direct neighbors… (More)

—In this paper, we present a multi-objective Integer Linear Program (ILP) for the joint throughput optimization and traffic engineering problem in Wavelength-Division Multi-plexing (WDM) networks. The proposed model simultaneously maximizes the aggregated throughput, minimizes the resource consumption, and achieves load balancing by minimizing the maximum… (More)

—Recent advances in the physical layer have enabled the simultaneous reception of multiple packets by a node in wireless networks. We address the throughput optimization problem in wireless networks that support multi-packet reception (MPR) capability. The problem is modeled as a joint routing and scheduling problem, which is known to be NP-hard. The… (More)