Fabio Neri

Reducing Power Consumption in Backbone Networks

According to several studies, the power consumption of the Internet accounts for up to 10% of the worldwide energy consumption, and several initiatives are being put into place to reduce the power consumption of the ICT sector in general. To this goal, we propose a novel approach to switch off network nodes and links while still guaranteeing full connectivity and maximum link utilization. After showing that the problem falls in the class of capacitated multi-commodity flow problems, and therefore it is NP-complete, we propose some heuristic algorithms to solve it. Simulation results in a realistic scenario show that it is possible to reduce the number of links and nodes currently used by up to 30% and 50% respectively during off-peak hours, while offering the same service quality.

Energy-Aware Backbone Networks: A Case Study

Power consumption of ICT is becoming more and more a sensible problem, which is of interest for both the research community, for ISPs and for the general public. In this paper we consider a real IP backbone network and a real traffic profile. We evaluate the energy cost of running it, and, speculating on the possibility of selectively turning off spare devices whose capacity is not required to transport off-peak traffic, we show that it is possible to easily achieve more than 23% of energy saving per year, i.e., to save about 3GWh/year considering todays power footprint of real network devices.

Minimizing ISP network energy cost: formulation and solutions

According to several studies, the power consumption of the Internet accounts for up to 10% of the worldwide energy consumption and is constantly increasing. The global consciousness on this problem has also grown, and several initiatives are being put into place to reduce the power consumption of the ICT sector in general. In this paper, we face the problem of minimizing power consumption for Internet service provider (ISP) networks. In particular, we propose and assess strategies to concentrate network traffic on a minimal subset of network resources. Given a telecommunication infrastructure, our aim is to turn off network nodes and links while still guaranteeing full connectivity and maximum link utilization constraints. We first derive a simple and complete formulation, which results into an NP-hard problem that can be solved only for trivial cases. We then derive more complex formulations that can scale up to middle-sized networks. Finally, we provide efficient heuristics that can be used for large networks. We test the effectiveness of our algorithms on both real and synthetic topologies, considering the daily fluctuations of Internet traffic and different classes of users. Results show that the power savings can be significant, e.g., larger than 35%.

The European IST project DAVID: a viable approach toward optical packet switching

In this paper, promising technologies and a network architecture are presented for future optical packet switched networks. The overall network concept is presented and the major choices are highlighted and compared with alternative solutions. Both long and shorter term approaches are considered, as well as both the wide-area network and multiple-area networks parts of the network. The results presented in this paper were developed in the frame of the research project DAVID (Data And Voice Integration over DWDM) project, funded by the European Commission through the IST-framework.

On the stability of input-queued switches with speed-up

We consider cell-based switch and router architectures whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling algorithm to select at each slot a subset of input buffered cells which can be transferred toward output ports. We propose several classes of scheduling algorithms whose stability properties are studied using analytical techniques mainly based upon Lyapunov functions. Original stability conditions are also derived for scheduling algorithms that are being used today in high-performance switch and router architectures.

RingO: an experimental WDM optical packet network for metro applications

This paper presents Ring Optical Network (RingO), a wavelength-division-multiplexing (WDM), ring-based, optical packet network suitable for a high-capacity metro environment. We present three alternative architectural designs and elaborate on the effectiveness of optic with respect to electronic technologies, trying to identify an optimal mix. We present the design and prototyping of a simple but efficient access control protocol, based upon the equivalence of the proposed network architecture with input-buffering packet switches. We discuss the problem of node allocation to WDM channels, which can be viewed as a particular optical network design problem. We, finally, briefly illustrate the fault protection properties of the RingO architecture. The main contribution of this paper is the identification and experimental validation of an innovative optical network architecture, which is feasible and cost effective with technologies available today, and can be a valid alternative to more consolidated solutions in metro applications.

Bounds on average delays and queue size averages and variances in input-queued cell-based switches

We develop a general methodology, mainly based upon Lyapunov functions, to derive bounds on average delays, and on queue size averages and variances of complex systems of queues. We then apply this methodology to input-buffered, cell-based switch and router architectures. These architectures require a scheduling algorithm to select at each slot a subset of input-buffered cells which can be transferred towards output ports. Although the stability properties (i.e., the limit throughput) of input-buffered, cell-based switches was already studied for several classes of scheduling algorithms, no analytical results concerning cell delays or queue sizes are yet available in the technical literature. We concentrate on purely input-buffered switches that adopt a maximum weight matching scheduling algorithm, that was proved to be the scheduling algorithm providing the best performance. The derived bounds proved to be rather tight, when compared to simulation results.

MAC protocols and fairness control in WDM multirings with tunable transmitters and fixed receivers

The paper illustrates novel proposals for medium access control protocols in all-optical packet networks based on WDM multichannel ring topologies where nodes are equipped with one fixed-wavelength receiver and one wavelength-tunable transmitter. Such networks provide separate slotted channels for disjoint subsets of destination nodes. Three access protocols based on local status information are described. A channel inspection capability is assumed to be available for the implementation of the access protocols. Global fairness control algorithms derived from those adopted in the Metaring high-speed metropolitan area network are also proposed. Access delays and throughputs are taken as performance Indices for a simulation-based comparison of the proposed protocols, in the case of a 16-node multiring with either balanced or unbalanced traffic. Simulation results show that the throughput limitations and the fairness problems inherent in the network topology can be overcome with relatively simple protocols.

All-optical WDM multi-rings with differentiated QoS

This article considers all-optical WDM networks based on a slotted multichannel ring topology, where nodes are equipped with one fixed-wavelength receiver and one wavelength-tunable transmitter; and shows how to design very effective MAC protocols that provide packet-mode transport to multiple information flows with different QoS requirements. As an example, we describe SR3, a collision-free slotted MAC protocol which combines a packet scheduling strategy (called SRR), a fairness control algorithm (called MMR); and a reservation mechanism. SRR achieves an efficient exploitation of the available bandwidth, MMR guarantees fair throughput access to each node, and SR3, by permitting slot reservations, leads to tighter control on access delays, and can thus effectively support traffic classes with different QoS requirements.

Packet-mode scheduling in input-queued cell-based switches

We consider input-queued switch architectures dealing at their interfaces with variable-size packets, but internally operating on fixed-size cells. Packets are segmented into cells at input ports, transferred through the switching fabric, and reassembled at output ports. Cell transfers are controlled by a scheduling algorithm, which operates in packet-mode: all cells belonging to the same packet are transferred from inputs to outputs without interruption. We prove that input-queued switches using packet-mode scheduling can achieve 100% throughput, and we show by simulation that, depending on the packet size distribution, packet-mode scheduling may provide advantages over cell-mode scheduling.