Search

Abstract Cooperative intelligent transport systems (C‐ITS) deployments for vehicle‐to‐infrastructure communication require substantial investments from European Member States in road‐side units (RSUs) and in central traffic management systems. The promise of numerous societal benefits should justify these public investments. However, C‐ITS uptake in passenger cars, and thus the subsequent societal benefits, are highly uncertain. Therefore, here, a case study of Flanders is presented in which real option analysis) is used to help road authorities assess the RSU investment opportunity. The framework combines a detailed cost and benefit model and includes managerial options for the road authority. This technique aims to incorporate the value of the flexibility that is available during the deployment to reduce risk exposure, and as such more accurately appraise the investment. C‐ITS uptake in passenger cars was modelled as the major source of uncertainty, as it is the primary driver of societal benefits. While a static RSU investment analysis for Flanders, Belgium, was found to be negative, embedding the option to defer the investment decision to further study C‐ITS uptake results in a positive average net present value. The results are useful for any road authority aspiring to roll out C‐ITS road‐side infrastructure.

Abstract Background Gravity models are often hard to apply in practice due to their data-hungry nature. Standard implementations of gravity models require that data on each variable is available for each supply node. Since these model types are often applied in a competitive context, data availability of specific variables is commonly limited to a subset of supply nodes. Methods This paper introduces a methodology that accommodates the use of variables for which data availability is incomplete, developed for a health care context, but more broadly applicable. The study uses simulated data to evaluate the performance of the proposed methodology in comparison with a conventional approach of dropping variables from the model. Results It is shown that the proposed methodology is able to improve overall model accuracy compared to dropping variables from the model, and that model accuracy is considerably improved within the subset of supply nodes for which data is available, even when that availability is sparse. Conclusion The proposed methodology is a viable approach to improve the performance of gravity models in a competitive health care context, where data availability is limited, and especially where a the supply nodes with complete data are most relevant for the practitioner.

Abstract Connectivity and cooperation are considered important prerequisites to automated driving, as they are crucial elements in increasing the safety of future automated vehicles and their full integration in the overall transport system. Although many European Member States, as part of the C‐Roads Platform, have implemented and are still implementing Road‐side Units (RSUs) for Cooperative Intelligent Transportation Systems (C‐ITS) within pilot deployment projects, the platform aspires a wide extension of deployments in the coming years. Therefore, this paper investigates techno‐economic aspects of C‐ITS RSU deployments from a road authority viewpoint. A two‐phased approach is used, in which firstly the optimal RSU locations are determined, taking into account existing road‐side infrastructure. Secondly, a cost model translates the amount of RSUs into financial results. It was found that traffic density has a significant impact on required RSU density, hence impacting costs. Furthermore, major cost saving can be obtained by leveraging existing road‐side infrastructure. The proposed methodology is valuable for other member states, and in general, to any other country aspiring to roll out C‐ITS road infrastructure. Results can be used to estimate required investment costs based on legacy infrastructure, as well as to benchmark with the envisioned benefits from the deployed C‐ITS services.

Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecommunications, Fiber-To-The-Home (FTTH) houses are clustered so they can be connected with fiber as cost-efficiently as possible. The cost calculation of a fiber installment can be formulated as a capacitated STP. Often, STP variants are solved with integer linear programs, which provide excellent solutions, though the running time costs increase quickly with graph size. Some geographical areas require graphs of over 20000 nodes-typically unattainable for integer linear programs. This paper presents an alternative approach. It extends the shortest path heuristic for the STP to a new heuristic that can construct solutions for the capacitated STP: the Capacitated Shortest Path Heuristic (CSPH). It is straightforward to implement, allowing many extensions. In experiments on realistic telecommunications datasets, CSPH finds solutions on average in time O(|V|2), quadratic in the number of nodes, making it possible to solve 50000 node graphs in under a minute.

Abstract Wireless data demands keep rising at a fast rate. In 2016, Cisco measured a global mobile data traffic volume of 7.2 Exabytes per month and projected a growth to 49 Exabytes per month in 2021. Wi-Fi plays an important role in this as well. Up to 60% of the total mobile traffic was off-loaded via Wi-Fi (and femtocells) in 2016. This is further expected to increase to 63% in 2021. In this publication, we look into the roll-out of public Wi-Fi networks, public meaning in a public or semi-public place (pubs, restaurants, sport stadiums, etc.). More concretely we look into the collaboration between two parties, a technical party and a venue owner, for the roll-out of a new Wi-Fi network. The technical party is interested in reducing load on its mobile network and generating additional direct revenues, while the venue owner wants to improve the attractiveness of the venue and consequentially generate additional indirect revenues. Three Wi-Fi pricing models are considered: entirely free, slow access with ads or fast access via paid access (freemium), and paid access only (premium). The technical party prefers a premium model with high direct revenues, the venue owner a free/freemium model which is attractive to its customers, meaning both parties have conflicting interests. This conflict has been modeled using non-cooperative game theory incorporating detailed cost and revenue models for all three Wi-Fi pricing models. The initial outcome of the game is a premium Wi-Fi network, which is not the optimal solution from an outsider’s perspective as a freemium network yields highest total payoffs. By introducing an additional compensation scheme which corresponds with negotiation in real life, the outcome of the game is steered toward a freemium solution.

Abstract Background Graphlets are useful for bioinformatics network analysis. Based on the structure of Hočevar and Demšar’s ORCA algorithm, we have created an orbit counting algorithm, named Jesse. This algorithm, like ORCA, uses equations to count the orbits, but unlike ORCA it can count graphlets of any order. To do so, it generates the required internal structures and equations automatically. Many more redundant equations are generated, however, and Jesse’s running time is highly dependent on which of these equations are used. Therefore, this paper aims to investigate which equations are most efficient, and which factors have an effect on this efficiency. Results With appropriate equation selection, Jesse’s running time may be reduced by a factor of up to 2 in the best case, compared to using randomly selected equations. Which equations are most efficient depends on the density of the graph, but barely on the graph type. At low graph density, equations with terms in their right-hand side with few arguments are more efficient, whereas at high density, equations with terms with many arguments in the right-hand side are most efficient. At a density between 0.6 and 0.7, both types of equations are about equally efficient. Conclusions Our Jesse algorithm became up to a factor 2 more efficient, by automatically selecting the best equations based on graph density. It was adapted into a Cytoscape App that is freely available from the Cytoscape App Store to ease application by bioinformaticians.

Broadcasters are building studio architectures based on commercial off-the-shelf (COTS) IT hardware because of advantages such as cost reduction, ease of management, and upgradation. Media function virtualization (MFV) leverages IP networking to transport media streams between virtual media functions (VMFs), where they are processed. Media service deployment in an MFV environment entails solving the VMF-FG scheduling problem to ensure that the required broadcast quality guarantees are fulfilled. In this paper, we formulate the VMF-FG scheduling problem and propose a greedy-based algorithm to solve it. The evaluation of the algorithm is carried in terms of the end-to-end delay and VMF queuing delay. Moreover, the importance of VMF-FG decomposition in upgradation to higher-quality formats is also highlighted.

European funded research into the Recursive Inter-Network Architecture (RINA) started with IRATI, which developed an initial prototype implementation for OS/Linux. IRATI was quickly succeeded by the PRISTINE project, which developed different policies, each tailored to specific use cases. Both projects were development-driven, where most experimentation was limited to unit testing and smaller scale integration testing. In order to assess the viability of RINA as an alternative to current network technologies, larger scale experimental deployments are needed. The opportunity arose for a project that shifted focus from development towards experimentation, leveraging Europe’s investment in Future Internet Research and Experimentation (FIRE+) infrastructures. The ARCFIRE project took this next step, developing a user-friendly framework for automating RINA experiments. This paper reports and discusses the implications of the experimental results achieved by the ARCFIRE project, using open source RINA implementations deployed on FIRE+ Testbeds. Experiments analyze the properties of RINA relevant to fast network recovery, network renumbering, Quality of Service, distributed mobility management, and network management. Results highlight RINA properties that can greatly simplify the deployment and management of real-world networks; hence, the next steps should be focused on addressing very specific use cases with complete network RINA-based networking solutions that can be transferred to the market.

The aim of this paper is to demonstrate the feasibility of a live Automated Incident Detection (AID) system using only Floating Car Data (FCD) in one of the first large-scale FCD AID field trials. AID systems detect traffic events and alert upcoming drivers to improve traffic safety without human monitoring. These automated systems traditionally rely on traffic monitoring sensors embedded in the road. FCD allows for finer spatial granularity of traffic monitoring. However, low penetration rates of FCD probe vehicles and the data latency have historically hindered FCD AID deployment. We use a live country-wide FCD system monitoring an estimated 5.93% of all vehicles. An FCD AID system is presented and compared to the installed AID system (using loop sensor data) on 2 different highways in Netherlands. Our results show the FCD AID can adequately monitor changing traffic conditions and follow the AID benchmark. The presented FCD AID is integrated with the road operator systems as part of an innovation project, making this, to the best of our knowledge, the first full chain technical feasibility trial of an FCD-only AID system. Additionally, FCD allows for AID on roads without installed sensors, allowing road safety improvements at low cost.

Computer network administrators are often interested in the maximal bandwidth that can be achieved between two nodes in the network, or how many edges can fail before the network gets disconnected. Classic maximum flow algorithms that solve these problems are well-known. However, in practice, network policies are in effect, severely restricting the flow that can actually be set up. These policies are put into place to conform to service level agreements and optimize network throughput, and can have a large impact on the actual routing of the flows. In this work, we model the problem and define a series of progressively more complex conditions and algorithms that calculate increasingly tighter bounds on the policy-compliant maximum flow using regular expressions and finite state automata. To the best of our knowledge, this is the first time that specific conditions are deduced, which characterize how to calculate policy-compliant maximum flows using classic algorithms on an unmodified network.

Graphlets are small subgraphs, usually containing up to five vertices, that can be found in a larger graph. Identification of the graphlets that a vertex in an explored graph touches can provide useful information about the local structure of the graph around that vertex. Actually finding all graphlets in a large graph can be time-consuming, however. As the graphlets grow in size, more different graphlets emerge and the time needed to find each graphlet also scales up. If it is not needed to find each instance of each graphlet, but knowing the number of graphlets touching each node of the graph suffices, the problem is less hard. Previous research shows a way to simplify counting the graphlets: instead of looking for the graphlets needed, smaller graphlets are searched, as well as the number of common neighbors of vertices. Solving a system of equations then gives the number of times a vertex is part of each graphlet of the desired size. However, until now, equations only exist to count graphlets with 4 or 5 nodes. In this paper, two new techniques are presented. The first allows to generate the equations needed in an automatic way. This eliminates the tedious work needed to do so manually each time an extra node is added to the graphlets. The technique is independent on the number of nodes in the graphlets and can thus be used to count larger graphlets than previously possible. The second technique gives all graphlets a unique ordering which is easily extended to name graphlets of any size. Both techniques were used to generate equations to count graphlets with 4, 5 and 6 vertices, which extends all previous results. Code can be found at https://github.com/IneMelckenbeeck/equation-generator and https://github.com/IneMelckenbeeck/graphlet-naming.

Networks and graphs are highly relevant in modeling real-life communities and their interactions. In order to gain insight in their structure, different roles are attributed to vertices, effectively clustering them in equivalence classes. A new formal definition of regular equivalence is presented in this paper, and the relation with other equivalence types is investigated and mathematically proven. An efficient algorithm is designed, able to detect all regularly equivalent roles in large-scale complex networks. We apply it to both Barabási–Albert random networks, as well as real-life social networks, which leads to interesting insights.

A lot of research has been done on the adoption of electric vehicles and on the deployment of the infrastructure for charging the batteries of these vehicles. Currently the total number of installed charging points keeps growing due to both public and private investments. Often charging services are offered as free service extensions. Maintaining this free business model will be difficult on the long term because of the investments needed. Therefore, the long term business viability and durability is not always clear from an investor point of view. This work presents a techno-economic model that describes the expected cost and revenue evolution resulting from different deployment strategies for a municipal or private parking facility operator. For charging service providers, charging pole exploiters and infrastructure owners for electric vehicle charging, the model allows to project the expected profitability. The main findings from this research indicate that business cases for public charging infrastructure can be viable, durable and could be competitive with the costs for charging the electric vehicle at home. Also, in a multi-actor market model all actors involved could benefit from deploying electric vehicle charging infrastructure. Although the business cases will be positive, significant investments are needed.

Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived. More specifically in biological networks, subgraph matching algorithms are used to discover network motifs, specific patterns occurring more often than expected by chance. Finding these network motifs yields information on the underlying biological relations modelled by the network. In this work, we present the Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS), an improved version of the Index-based Subgraph Matching Algorithm (ISMA). ISMA quickly finds all instances of a predefined motif in a network by intelligently exploring the search space and taking into account easily identifiable symmetric structures. However, more complex symmetries (possibly involving switching multiple nodes) are not taken into account, resulting in superfluous output. ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs. These structures are then converted to symmetry-breaking constraints used to prune the search space and speed up calculations. The performance of the algorithm was tested on several types of networks (biological, social and computer networks) for various subgraphs with a varying degree of symmetry. For subgraphs with complex (multi-node) symmetric structures, high speed-up factors are obtained as the search space is pruned by the symmetry-breaking constraints. For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations. Moreover, the calculated list of subgraph instances is minimal as it contains no instances that differ by only a subgraph symmetry. An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.