No abstract

Metamaterials are artificial structures which have recently enabled the realization of novel electromagnetic components with engineered and even unnatural functionalities. Existing metamaterials are specifically designed for a single application working under preset conditions (e.g. electromagnetic cloaking for a fixed angle of incidence) and cannot be reused. Software-Defined Metamaterials (SDMs) are a much sought-after paradigm shift, exhibiting electromagnetic properties that can be reconfigured at runtime using a set of software primitives. To enable this new technology, SDMs require the integration of a network of controllers within the structure of the metamaterial, where each controller interacts locally and communicates globally to obtain the programmed behavior. The design approach for such controllers and the interconnection network, however, remains unclear due to the unique combination of constraints and requirements of the scenario. To bridge this gap, this paper aims to provide a context analysis from the computation and communication perspectives. Then, analogies are drawn between the SDM scenario and other applications both at the micro and nano scales, identifying possible candidates for the implementation of the controllers and the intra-SDM network. Finally, the main challenges of SDMs related to computing and communications are outlined.

Transparent optical networks are the enabling infrastructure for converged multi-granular networks in the Future Internet. The cross-layer planning of these networks considers physical impairments in the network layer design. This is complicated by the diversity of modulation formats, transmission rates, amplification and compensation equipments, or deployed fiber links. Thereby, the concept of Quality of Transmission (QoT) attempts to embrace the effects of the physical layer impairments, to introduce them in a multicriterium optimization and planning process. This paper contributes in this field by the proposal and comparative evaluation of two novel offline impairment aware planning algorithms for transparent optical networks, which share a common QoT evaluation function. The first algorithm is based on an iterative global search driven by a set of binary integer linear programming formulations. Heuristic techniques are included to limit the binary programming complexity. The second algorithm performs different pre-orderings of the lightpath demand, followed by a sequential processing of the lightpath demands. The performance and the scalability of both approaches are investigated. Results reveal great scalability properties of the global search algorithm, and a performance similar to or better than the sequential schemes.

No abstract

The majority of the research studies on Flex-Grid over multi-core fiber (Flex-Grid/MCF) networks are built on the assumption of fully non-blocking ROADMs (FNB-ROADMs), able to switch any portion of the spectrum from any input core of any input fiber to any output core of any output fiber. Such flexibility comes at an enormous extra hardware cost. In this paper, we explore the trade-off of using ROADMs that impose the so-called core continuity constraint (CCC). Namely, a CCC-ROADM can switch spectrum from a core on an input fiber to a chosen output fiber, but cannot choose the specific output core. For instance, if all fibers have the same number of cores, the i-th core in the input fibers can be just switched to the i-th core in the output fibers. To evaluate the performance vs. cost trade-off of using CCC-ROADMs, we present two Integer Linear Programming (ILP) formulations for optimally allocating incoming demands in Flex-Grid/MCF networks, where the CCC constraint is imposed or not, respectively. A set of results are extracted applying both schemes in two different backbone networks. Transmission reach estimations are conducted accounting for the fiber's linear and non-linear effects, as well as the inter-core crosstalk (ICXT) impairment introduced by laboratory MCF prototypes of 7, 12 and 19 cores. Our numerical evaluations show that the performance penalty of CCC is minimal, i.e., below 1% for 7 and 12-core MCF and up to 10% for 19-core MCF, while the cost reduction is large. In addition, results reveal that the ICXT effect can be significant when the number of cores per MCF is high, up to a point that equipping the network with 12-core MCFs can yield superior effective capacity than with 19-core MCFs.

Constraint-based routing is an invaluable part of a fullfledged Quality of Service architecture. Unfortunately, QoS routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The need for such algorithms has resulted in the proposal of numerous heuristics and a few exact solutions. This chapter presents a thorough, concise, and fair evaluation of the most important multi-constrained path selection algorithms known today. A performance evaluation of these algorithms is presented based on a complexity analysis and simulation results. Besides the routing algorithm, dynamic aspects of QoS routing are discussed: how to cope with incomplete or inaccurate topology information and (in)stability issues.

No abstract

No abstract