Abstract
In this paper, we present an integer linear programming model for the vehicle routing problem that considers real-world three-dimensional (3D) loading constraints. In this problem, a set of customers make requests of goods that are wrapped up in boxes, and the objective is to find minimum cost delivery routes for a set of identical vehicles that, departing from a depot, visit all customers only once and return to the depot. Apart from the usual 3D container loading constraints that ensure the boxes are packed completely inside the vehicles and the boxes do not overlap each other in each vehicle, the problem also takes into account constraints related to the vertical stability of the cargo, multidrop situations, and load-bearing strength of the boxes (including fragility). Computational tests with the proposed model were performed using an optimization solver embedded into a modeling language. The results validate the model and show that it is only able to handle problems of a moderate size. However, this model will be useful to motivate other researchers to explore approximate solution approaches to solve this problem, such as decomposition methods, relaxation methods, heuristics, among others, as well as to treat other variants of the problem, such as when time windows or a heterogeneous fleet are present, among others.

Abstract
Achieving affordable high speed fiber optic communication networks for airplane systems has proved to be challenging. In this paper we describe a summary of the EU Framework 7 project DAPHNE (Developing Aircraft Photonic Networks). DAPHNE aimed to exploit photonic technology from terrestrial communications networks, and then develop and optimize aircraft photonic networks to take advantage of the potential cost savings. The main areas of emphasis were on: multiplexing networks; providing standard components; simplifying installation; and reducing through life support costs. DAPHNE (fifteen partners from seven nations) finished in February 2013; and was supported by the European Commission?s Seventh Framework Programme, although the consortium members are continuing with in-house developments. © 2013 SPIE.

Abstract
Health and social care systems are currently faced with a set of challenges that continually require more sophisticated responses. The integration of health, social and informal care and the care personalization are important issues in the organization of the care systems. This article aims to propose an information architecture for Ambient Assisted Living (AAL) environments that can contribute to integrated and personalized care.

Abstract
Optical backbone networks transport both synchronous and asynchronous traffic. The synchronous traffic is from legacy telecommunication networks still employing legacy SONET/SDH, or SONET/SDH over WDM equipment. In the WDM layer, optical circuit switching (OCS) has been widely deployed, but can be potentially bandwidth inefficient. Optical burst switching (OBS) has been proposed as an alternative to OCS that uses statistical multiplexing at a sub-wavelength granularity, but for the time constrained and loss intolerant traffic this switching paradigm is still not efficient. This article presents both open and closed ended in-advanced periodic resource reservation protocols that fulfill the QoS requirements of synchronous traffic. The proposed reservation protocols, called C2OBS Synchronous Resource Reservation Scheme (C2OBS-SRR), provide appropriate resources for SONET/SDH traffic in a Clustered Cooperative Optical Burst Switching (C2OBS) network architecture. In the C2OBS-SRR, the synchronous traffic is offered a circuit like service without two way end-to-end reservation, while still benefiting from the high level of statistical multiplexing of an optical burst switching network. The C2OBS-SRR is also compared with both OCS and classical JET OBS.

Abstract
Large-scale distributed systems appear as the major infrastructures for supporting planet-scale services. These systems call for appropriate management mechanisms and protocols. Slicing is an example of an autonomous, fully decentralized protocol suitable for large-scale environments. It aims at organizing the system into groups of nodes, called slices, according to an application-specific criteria where the size of each slice is relative to the size of the full system. This allows assigning a certain fraction of nodes to different task, according to their capabilities. Although useful, current slicing techniques lack some features of considerable practical importance. This paper proposes a slicing protocol, that builds on existing solutions, and addresses some of their frailties. We present novel solutions to deal with non-uniform slices and to perform online and dynamic slices schema reconfiguration. Moreover, we describe how to provision a slice-local Peer Sampling Service for upper protocol layers and how to enhance slicing protocols with the capability of slicing over more than one attribute. Slicing is presented as a complete, dependable and integrated distributed systems primitive for large-scale systems.

Abstract
Traffic Sampling is a crucial step towards scalable network measurements, enclosing manifold challenges. The wide variety of foreseeable sampling scenarios demands for a modular view of sampling components and features, grounded on a consistent architecture. Articulating the measurement scope, the required information model and the adequate sampling strategy is a major design issue for achieving an encompassing and efficient sampling solution. This is the main focus of the present work, where a layered architecture, a taxonomy of existing sampling techniques distinguishing their inner characteristics and a flexible framework able to combine these characteristics are introduced. In addition, a new multiadaptive technique proposal, based on linear prediction, allows to reduce the measurement overhead significantly, while assuring that traffic samples reflect the statistical behavior of the global traffic under analysis. © 2013 IEEE.