Searcharxiv⌕ Search

arXiv subjects

Carlos Guerrero

Publications and source records attributed to Carlos Guerrero.

25 records · Page 2Linked to original sources

Availability-aware Service Placement Policy in Fog Computing Based on Graph Partitions

This paper presents a policy for service placement of fog applications inspired on complex networks and graph theory. We propose a twofold partition process based on communities for the partition of the fog devices and based on transitive closures for the application services partition. The allocation of the services is performed sequentially by, firstly, mapping applications to device communities and, secondly, mapping service transitive closures to fog devices in the community. The underlying idea is to place as many inter-related services as possible in the most nearby devices to the users. The optimization objectives are the availability of the applications and the Quality of Service (QoS) of the system, measured as the number of requests that are executed before the application deadlines. We compared our solution with an Integer Linear Programming approach, and the simulation results showed that our proposal obtains higher QoS and availability when fails in the nodes are considered.

cs.NI↗

Genetic-based fog colony optimization hybridized with hierarchical clustering and its influence in the placement of fog services

The organization of fog devices into fog colonies has reduced the complexity management of fog domains. One of the main influencing factors on this complexity is the large number of devices, i.e. the high scale level of the infrastructure. Fog colonies are subsets of fog devices that are managed independently from the other colonies. Thus, the number of devices involved in the management of a colony is much smaller. Previous studies have evaluated the influence of the fog colony layout on system performance metrics. We propose to use a hierarchical clustering as the base definition of the fog colony layout of the fog infrastructure. The dendrogram obtained from this hierarchical clustering includes all the colony candidates. A genetic algorithm is in charge of selecting the subset of colony candidates that optimizes the two performance metrics under study: the network communication time between users and applications, and the execution time of the algorithms that manage internally the placement of the applications in each colony. We implemented the NSGA-II, a common multi-objective approach for GAs, to evaluate our proposal. The results show that a meta-heuristic such as a GA improves the performance metrics by defining the fog colony layout through the use of the dendrogram. Nine different experiment scenarios, varying the number of applications and fog devices, were studied. In the worst of the cases, 137 generations were enough to the results of the GA dominated the solutions obtained with two control algorithms. The number of genetic solutions and their homogeneous distribution in the Pareto front were also satisfactory.

cs.DC↗

Hybrid in-beam PET- and Compton prompt-gamma imaging aimed at enhanced proton-range verification

We report on an hybrid in-beam PET and prompt-gamma Compton imaging system aimed at quasi real-time ion-range verification in proton-therapy treatments. Proof-of-concept experiments were carried out at the radiobiology beam line of the CNA cyclotron facility using a set of two synchronous Compton imagers and different target materials. The time structure of the 18~MeV proton beam was shaped with a series of beam-on and beam-off intervals, thereby mimicking a pulsed proton beam on a long time scale. During beam-on intervals, Compton imaging was performed utilizing the high energy $γ$-rays promptly emitted from the nuclear reactions occurring in the targets. In the course of the beam-off intervals in-situ positron-emission tomography was accomplished with the same imagers using the $β^{+}$ decay of activated nuclei. The targets used were stacks of different materials covering also various proton ranges and energies. A systematic study on the performance of these two complementary imaging techniques is reported and the experimental results interpreted on the basis of Monte Carlo calculations. The results demonstrate the possibility to combine both imaging techniques in a concomitant way, where high-efficiency prompt-gamma imaging is complemented with the high spatial accuracy of PET. Empowered by these results we suggest that a pulsed beam with a suitable duty cycle, in conjunction with in-situ Compton- and PET-imaging may help to attain complementary information and quasi real-time range monitoring with high accuracy.

physics.med-ph↗

Genetic-based optimization in Fog Computing: current trends and research opportunities

Fog computing is a new computational paradigm that emerged from the need to reduce network usage and latency in the Internet of Things (IoT). Fog can be considered as a continuum between the cloud layer and IoT users that allows the execution of applications or storage/processing of data in network infrastructure devices. The heterogeneity and wider distribution of fog devices are the key differences between cloud and fog infrastructure. Genetic-based optimization is commonly used in distributed systems; however, the differentiating features of fog computing require new designs, studies, and experimentation. The growing research in the field of genetic-based fog resource optimization and the lack of previous analysis in this field have encouraged us to present a comprehensive, exhaustive, and systematic review of the most recent research works. Resource optimization techniques in fog were examined and analyzed, with special emphasis on genetic-based solutions and their characteristics and design alternatives. We defined a classification of the optimization scope in fog infrastructures and used this optimization taxonomy to classify the 70 papers in this survey. Subsequently, the papers were assessed in terms of genetic optimization design. Finally, the benefits and limitations of each surveyed work are outlined in this paper. Based on these previous analyses of the relevant literature, future research directions were identified. We concluded that more research efforts are needed to address the current challenges in data management, workflow scheduling, and service placement. Additionally, there is still room for improved designs and deployments of parallel and hybrid genetic algorithms that leverage, and adapt to, the heterogeneity and distributed features of fog domains.

cs.DC↗

How to Place Your Apps in the Fog -- State of the Art and Open Challenges

Fog computing aims at extending the Cloud towards the IoT so to achieve improved QoS and to empower latency-sensitive and bandwidth-hungry applications. The Fog calls for novel models and algorithms to distribute multi-service applications in such a way that data processing occurs wherever it is best-placed, based on both functional and non-functional requirements. This survey reviews the existing methodologies to solve the application placement problem in the Fog, while pursuing three main objectives. First, it offers a comprehensive overview on the currently employed algorithms, on the availability of open-source prototypes, and on the size of test use cases. Second, it classifies the literature based on the application and Fog infrastructure characteristics that are captured by available models, with a focus on the considered constraints and the optimised metrics. Finally, it identifies some open challenges in application placement in the Fog.

cs.DC↗

YAFS: A simulator for IoT scenarios in fog computing

We propose a fog computing simulator for analysing the design and deployment of applications through customized and dynamical strategies. We model the relationships among deployed applications, network connections and infrastructure characteristics through complex network theory, enabling the integration of topological measures in dynamic and customizable strategies such as the placement of application modules, workload location, and path routing and scheduling of services. We present a comparative analysis of the efficiency and the convergence of results of our simulator with the most referenced entity, iFogSim. To highlight YAFS functionalities, we model three scenarios that, to the best of our knowledge, cannot be implemented with current fog simulators: dynamic allocation of new application modules, dynamic failures of network nodes and user mobility along the topology.

cs.NI↗

Analysing Human Mobility Patterns of Hiking Activities through Complex Network Theory

The exploitation of high volume of geolocalized data from social sport tracking applications of outdoor activities can be useful for natural resource planning and to understand the human mobility patterns during leisure activities. This geolocalized data represents the selection of hike activities according to subjective and objective factors such as personal goals, personal abilities, trail conditions or weather conditions. In our approach, human mobility patterns are analysed from trajectories which are generated by hikers. We propose the generation of the trail network identifying special points in the overlap of trajectories. Trail crossings and trailheads define our network and shape topological features. We analyse the trail network of Balearic Islands, as a case of study, using complex weighted network theory. The analysis is divided into the four seasons of the year to observe the impact of weather conditions on the network topology. The number of visited places does not decrease despite the large difference in the number of samples of the two seasons with larger and lower activity. It is in summer season where it is produced the most significant variation in the frequency and localization of activities from inland regions to coastal areas. Finally, we compare our model with other related studies where the network possesses a different purpose. One finding of our approach is the detection of regions with relevant importance where landscape interventions can be applied in function of the communities.

physics.soc-ph↗