Red Swarm: Smart Mobility in Cities with EAs

This work presents an original approach to regulate traffic by using an on-line system controlled by an EA. Our proposal uses computational spots with WiFi connectivity located at traffic lights (the Red Swarm), which are used to suggest alternative individual routes to vehicles. An evolutionary algorithm is also proposed in order to find a configuration for the Red Swarm spots which reduces the travel time of the vehicles and also prevents traffic jams. We solve real scenarios in the city of Malaga (Spain), thus enriching the OpenStreetMap info by adding traffic lights, sensors, routes and vehicle flows. The result is then imported into the SUMO traffic simulator to be used as a method for calculating the fitness of solutions. Our results are competitive compared to the common solutions from experts in terms of travel and stop time, and also with respect to other similar proposals but with the added value of solving a real, big instance.Ministerio de Economía y Competitividad y FEDER (TIN2011-28194

Logical topology design for IP rerouting: ASONs versus static OTNs

IP-based backbone networks are gradually moving to a network model consisting of high-speed routers that are flexibly interconnected by a mesh of light paths set up by an optical transport network that consists of wavelength division multiplexing (WDM) links and optical cross-connects. In such a model, the generalized MPLS protocol suite could provide the IP centric control plane component that will be used to deliver rapid and dynamic circuit provisioning of end-to-end optical light paths between the routers. This is called an automatic switched optical (transport) network (ASON). An ASON enables reconfiguration of the logical IP topology by setting up and tearing down light paths. This allows to up- or downgrade link capacities during a router failure to the capacities needed by the new routing of the affected traffic. Such survivability against (single) IP router failures is cost-effective, as capacity to the IP layer can be provided flexibly when necessary. We present and investigate a logical topology optimization problem that minimizes the total amount or cost of the needed resources (interfaces, wavelengths, WDM line-systems, amplifiers, etc.) in both the IP and the optical layer. A novel optimization aspect in this problem is the possibility, as a result of the ASON, to reuse the physical resources (like interface cards and WDM line-systems) over the different network states (the failure-free and all the router failure scenarios). We devised a simple optimization strategy to investigate the cost of the ASON approach and compare it with other schemes that survive single router failures

A review of traffic simulation software

Computer simulation of tra c is a widely used method in research of tra c modelling, planning and development of tra c networks and systems. Vehicular tra c systems are of growing concern and interest globally and modelling arbitrarily complex tra c systems is a hard problem. In this article we review some of the tra c simulation software applications, their features and characteristics as well as the issues these applications face. Additionally, we introduce some algorithmic ideas, underpinning data structural approaches and quanti able metrics that can be applied to simulated model systems

Joint Energy Efficient and QoS-aware Path Allocation and VNF Placement for Service Function Chaining

Service Function Chaining (SFC) allows the forwarding of a traffic flow along a chain of Virtual Network Functions (VNFs, e.g., IDS, firewall, and NAT). Software Defined Networking (SDN) solutions can be used to support SFC reducing the management complexity and the operational costs. One of the most critical issues for the service and network providers is the reduction of energy consumption, which should be achieved without impact to the quality of services. In this paper, we propose a novel resource (re)allocation architecture which enables energy-aware SFC for SDN-based networks. To this end, we model the problems of VNF placement, allocation of VNFs to flows, and flow routing as optimization problems. Thereafter, heuristic algorithms are proposed for the different optimization problems, in order find near-optimal solutions in acceptable times. The performance of the proposed algorithms are numerically evaluated over a real-world topology and various network traffic patterns. The results confirm that the proposed heuristic algorithms provide near optimal solutions while their execution time is applicable for real-life networks.Comment: Extended version of submitted paper - v7 - July 201