A quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systems

Efficient management of the radio spectrum can be accomplished by making use of channel assignment techniques, which work by allocating different channels of the spectrum to the cells of the network in a conflict-free manner (i.e., the co-channel interference is minimized). The problem of dynamically reallocating the channels in response to change in user location patterns, which occurs frequently for a microcell network architecture, is even more difficult to tackle in a timely manner. Most existing approaches use various sequential search-based heuristics which cannot produce high-quality allocation fast enough to cope with the frequent traffic requirement variations. In this paper, we propose a quasi-static approach which combines the merits of both static and dynamic schemes. The static component of our approach uses a parallel genetic algorithm to generate a suite of representative assignments based on a set of different estimated traffic scenarios. At on-line time, the dynamic component observes the actual traffic requirement and retrieves the representative assignment of the closest scenario from the off-line table. The retrieved assignment is then quickly refined by using a fast parallel local search algorithm. Our extensive simulation experiments have indicated that the proposed quasi-static system outperforms other dynamic channel assignment techniques significantly in terms of both blocking probabilities and computational overhead.published_or_final_versio

A bi-level programming approach for trip matrix estimation and traffic control problems with stochastic user equilibrium link flows

This paper deals with two mathematically similar problems in transport network analysis: trip matrix estimation and traffic signal optimisation on congested road networks. These two problems are formulated as bi-level programming problems with stochastic user equilibrium assignment as the second-level programming problem. We differentiate two types of solutions in the combined matrix estimation and stochastic user equilibrium assignment problem (or, the combined signal optimisation and stochastic user equilibrium assignment problem): one is the solution to the bi-level programming problem and the other the mutually consistent solution where the two sub-problems in the combined problem are solved simultaneously. In this paper, we shall concentrate on the bi-level programming approach although we shall also consider mutually consistent solutions so as to contrast the two types of solutions. The purpose of the paper is to present a solution algorithm for the two bi-level programming problems and to test the algorithm on several networks

Efficient Passive ICS Device Discovery and Identification by MAC Address Correlation

Owing to a growing number of attacks, the assessment of Industrial Control Systems (ICSs) has gained in importance. An integral part of an assessment is the creation of a detailed inventory of all connected devices, enabling vulnerability evaluations. For this purpose, scans of networks are crucial. Active scanning, which generates irregular traffic, is a method to get an overview of connected and active devices. Since such additional traffic may lead to an unexpected behavior of devices, active scanning methods should be avoided in critical infrastructure networks. In such cases, passive network monitoring offers an alternative, which is often used in conjunction with complex deep-packet inspection techniques. There are very few publications on lightweight passive scanning methodologies for industrial networks. In this paper, we propose a lightweight passive network monitoring technique using an efficient Media Access Control (MAC) address-based identification of industrial devices. Based on an incomplete set of known MAC address to device associations, the presented method can guess correct device and vendor information. Proving the feasibility of the method, an implementation is also introduced and evaluated regarding its efficiency. The feasibility of predicting a specific device/vendor combination is demonstrated by having similar devices in the database. In our ICS testbed, we reached a host discovery rate of 100% at an identification rate of more than 66%, outperforming the results of existing tools.Comment: http://dx.doi.org/10.14236/ewic/ICS2018.

Sonet Network Design Problems

This paper presents a new method and a constraint-based objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the Intra-ring Synchronous Optical Network Design Problem (IDP). These network topology problems can be represented as a graph partitioning with capacity constraints as shown in previous works. We present here a new objective function and a new local search algorithm to solve these problems. Experiments conducted in Comet allow us to compare our method to previous ones and show that we obtain better results

Distribution planning in a weather-dependent scenario with stochastic travel times: a simheuristics approach

In real-life logistics, distribution plans might be affected by weather conditions (rain, snow, and fog), since they might have a significant effect on traveling times and, therefore, on total distribution costs. In this paper, the distribution problem is modeled as a multi-depot vehicle routing problem with stochastic traveling times. These traveling times are not only stochastic in nature but the specific probability distribution used to model them depends on the particular weather conditions on the delivery day. In order to solve the aforementioned problem, a simheuristic approach combining simulation within a biased-randomized heuristic framework is proposed. As the computational experiments will show, our simulation-optimization algorithm is able to provide high-quality solutions to this NP-hard problem in short computing times even for large-scale instances. From a managerial perspective, such a tool can be very useful in practical applications since it helps to increase the efficiency of the logistics and transportation operations.Peer ReviewedPostprint (published version

Distribution planning in a weather-dependent scenario with stochastic travel times: a simheuristics approach

In real-life logistics, distribution plans might be affected by weather conditions (rain, snow, and fog), since they might have a significant effect on traveling times and, therefore, on total distribution costs. In this paper, the distribution problem is modeled as a multi-depot vehicle routing problem with stochastic traveling times. These traveling times are not only stochastic in nature but the specific probability distribution used to model them depends on the particular weather conditions on the delivery day. In order to solve the aforementioned problem, a simheuristic approach combining simulation within a biased-randomized heuristic framework is proposed. As the computational experiments will show, our simulation-optimization algorithm is able to provide high-quality solutions to this NP-hard problem in short computing times even for large-scale instances. From a managerial perspective, such a tool can be very useful in practical applications since it helps to increase the efficiency of the logistics and transportation operations.Peer ReviewedPostprint (published version

Towards Developing a Travel Time Forecasting Model for Location-Based Services: a Review

Travel time forecasting models have been studied intensively as a subject of Intelligent Transportation Systems (ITS), particularly in the topics of advanced traffic management systems (ATMS), advanced traveler information systems (ATIS), and commercial vehicle operations (CVO). While the concept of travel time forecasting is relatively simple, it involves a notably complicated task of implementing even a simple model. Thus, existing forecasting models are diverse in their original formulations, including mathematical optimizations, computer simulations, statistics, and artificial intelligence. A comprehensive literature review, therefore, would assist in formulating a more reliable travel time forecasting model. On the other hand, geographic information systems (GIS) technologies primarily provide the capability of spatial and network database management, as well as technology management. Thus, GIS could support travel time forecasting in various ways by providing useful functions to both the managers in transportation management and information centers (TMICs) and the external users. Thus, in developing a travel time forecasting model, GIS could play important roles in the management of real-time and historical traffic data, the integration of multiple subsystems, and the assistance of information management. The purpose of this paper is to review various models and technologies that have been used for developing a travel time forecasting model with geographic information systems (GIS) technologies. Reviewed forecasting models in this paper include historical profile approaches, time series models, nonparametric regression models, traffic simulations, dynamic traffic assignment models, and neural networks. The potential roles and functions of GIS in travel time forecasting are also discussed.