The event as a modern instrument of city marketing based on the example of „Brot&Spiele“ in Trier

nicht vorhande

Destination-aware Adaptive Traffic Flow Rule Aggregation in Software-Defined Networks

In this paper, we propose a destination-aware adaptive traffic flow rule aggregation (DATA) mechanism for facilitating traffic flow monitoring in SDN-based networks. This method adapts the number of flow table entries in SDN switches according to the level of detail of traffic flow information that other mechanisms (e.g. for traffic engineering, traffic monitoring, intrusion detection) require. It also prevents performance degradation of the SDN switches by keeping the number of flow table entries well below a critical level. This level is not preset as a hard threshold but learned during operation by using a machine-learning based algorithm. The DATA method is implemented within a RESTful application (DATA App) which monitors and analyzes the ongoing network traffic and provides instructions to the SDN controller to adapt the traffic flow matching strategies accordingly. A thorough performance evaluation of DATA is conducted in an SDN emulation environment. The results show that---compared to the default behavior of common SDN controllers---the proposed DATA approach yields significant SDN switch performance improvements while still providing detailed traffic flow information on demand.Comment: This paper was presented at NetSys conference 2019. arXiv admin note: text overlap with arXiv:1909.0154

An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design

We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks. We propose an original optimization model for the problem that includes additional variables and constraints to take into account wireless signal coverage. Since the problem can prove challenging even for modern state-of-the art optimization solvers, we propose to solve it by an original primal heuristic which combines a probabilistic fixing procedure, guided by peculiar Linear Programming relaxations, with an exact MIP heuristic, based on a very large neighborhood search. Computational experiments on a set of realistic instances show that our heuristic can find solutions associated with much lower optimality gaps than a state-of-the-art solver.Comment: This is the authors' final version of the paper published in: Squillero G., Burelli P. (eds), EvoApplications 2016: Applications of Evolutionary Computation, LNCS 9597, pp. 283-298, 2016. DOI: 10.1007/978-3-319-31204-0_19. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-31204-0_1

A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks

We consider the problem of optimally designing a body wireless sensor network, while taking into account the uncertainty of data generation of biosensors. Since the related min-max robustness Integer Linear Programming (ILP) problem can be difficult to solve even for state-of-the-art commercial optimization solvers, we propose an original heuristic for its solution. The heuristic combines deterministic and probabilistic variable fixing strategies, guided by the information coming from strengthened linear relaxations of the ILP robust model, and includes a very large neighborhood search for reparation and improvement of generated solutions, formulated as an ILP problem solved exactly. Computational tests on realistic instances show that our heuristic finds solutions of much higher quality than a state-of-the-art solver and than an effective benchmark heuristic.Comment: This is the authors' final version of the paper published in G. Squillero and K. Sim (Eds.): EvoApplications 2017, Part I, LNCS 10199, pp. 1-17, 2017. DOI: 10.1007/978-3-319-55849-3\_16. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-55849-3_1

New concepts for traffic, resource and mobility management in software-defined mobile networks

The evolution of mobile telecommunication networks is accompanied by new demands for the performance, portability, elasticity, and energy efficiency of network functions. Network Function Virtualization (NFV), Software Defined Networking (SDN), and cloud service technologies are claimed to be able to provide most of the capabilities. However, great leap forward will only be achieved if resource, traffic, and mobility management methods of mobile network services can efficiently utilize these technologies. This paper conceptualizes the future requirements of mobile networks and proposes new concepts and solutions in the form of Software-Defined Mobile Networks (SDMN) leveraging SDN, NFV and cloud technologies. We evaluate the proposed solutions through testbed implementations and simulations. The results reveal that our proposed SDMN enhancements supports heterogeneity in wireless networks with performance improvements through programmable interfaces and centralized control

Advances in Communication Networking: 19th EUNICE/IFIP WG 6.6 International Workshop, Chemnitz, Germany, August 28-30, 2013

International audienceBook Front Matter of LNCS 811