http://sedici.unlp.edu.ar:80/handle/10915/65508 Wed, 28 Oct 2026 09:18:04 GMT 2026-10-28T09:18:04Z http://sedici.unlp.edu.ar:80/handle/10915/119042 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017) Domain Specific Languages (DSLs) are high-level languages defined for combining expressiveness and simplicity by means of linguistic constructs which are close to the problem domain but independent of the complexities inherent to the underlying software implementations. This article presents the CSSL v2.0 language that allows defining in precise, concise and friendly manner the abstract concepts of collaborative systems. Specially, the language makes available the concepts of awareness and collaborative processes. The language is independent of both the framework and the development tools and allows the application of the MDD approach to the development of such systems. The CSSL v2.0 language was designed as a UML extension using the metamodeling mechanism and was implemented with open source tools on the Eclipse platform. It provides improvements on previous proposals by enabling more complete and complex specifications of collaborative situations. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/119042 2017-01-01T00:00:00Z Domain Specific Languages (DSLs) are high-level languages defined for combining expressiveness and simplicity by means of linguistic constructs which are close to the problem domain but independent of the complexities inherent to the underlying software implementations. This article presents the CSSL v2.0 language that allows defining in precise, concise and friendly manner the abstract concepts of collaborative systems. Specially, the language makes available the concepts of awareness and collaborative processes. The language is independent of both the framework and the development tools and allows the application of the MDD approach to the development of such systems. The CSSL v2.0 language was designed as a UML extension using the metamodeling mechanism and was implemented with open source tools on the Eclipse platform. It provides improvements on previous proposals by enabling more complete and complex specifications of collaborative situations. http://sedici.unlp.edu.ar:80/handle/10915/65519 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). Cloud computing providers must support requests for resources in dynamic environments, considering service elasticity and overbooking of physical resources. Due to the randomness of requests, Virtual Machine Placement (VMP) problems should be formulated under uncertainty. In this context, a renewed formulation of the VMP problem is presented, considering the optimization of four objective functions: (i) power consumption, (ii) economical revenue, (iii) resource utilization and (iv) reconfiguration time. To solve the presented formulation, a two-phase optimization scheme is considered, composed by an online incremental VMP phase (iVMP) and an offline VMP reconfiguration (VMPr) phase. An experimental evaluation of five algorithms taking into account 400 different scenarios was performed, considering three VMPr Triggering and two VMPr Recovering methods as well as three VMPr resolution alternatives. Experimental results indicate which algorithm outperformed the other evaluated algorithms, improving the quality of solutions in a scenario-based uncertainty model considering the following evaluation criteria: (i) average, (ii) maximum and (iii) minimum objective function costs. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65519 2017-01-01T00:00:00Z Cloud computing providers must support requests for resources in dynamic environments, considering service elasticity and overbooking of physical resources. Due to the randomness of requests, Virtual Machine Placement (VMP) problems should be formulated under uncertainty. In this context, a renewed formulation of the VMP problem is presented, considering the optimization of four objective functions: (i) power consumption, (ii) economical revenue, (iii) resource utilization and (iv) reconfiguration time. To solve the presented formulation, a two-phase optimization scheme is considered, composed by an online incremental VMP phase (iVMP) and an offline VMP reconfiguration (VMPr) phase. An experimental evaluation of five algorithms taking into account 400 different scenarios was performed, considering three VMPr Triggering and two VMPr Recovering methods as well as three VMPr resolution alternatives. Experimental results indicate which algorithm outperformed the other evaluated algorithms, improving the quality of solutions in a scenario-based uncertainty model considering the following evaluation criteria: (i) average, (ii) maximum and (iii) minimum objective function costs. http://sedici.unlp.edu.ar:80/handle/10915/65518 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). Survivability of optical networks is considered among the most critical problems that telecommunications operators need to solve at a reasonable cost. Survivability can be enhanced by increasing the amount of network links and its spare capacity, nevertheless this deploys more resources on the network that will be used only under failure scenarios. In other words, these spare resources do not generate any direct profit to network operators as they are reserved to route only disrupted traffic. In particular, the case of dual link failures on fiber optic cables (i.e., fiber cuts) has recently received much attention as repairing these cables typically requires much time, which then increases the probability of a second failure on another link of the network. In this context, survivability schemes can be used to recover the network from a dual link failure scenario. In this work, we analyze the case of protection and restoration schemes, which are two well-known recovery strategies. The former is simpler to implement as it considers a fixed set of backup paths for all failure scenarios; however, it cannot take into account the spare capacity released by disrupted connections. Instead, the latter computes the best recovery path considering not only the spare capacity but also the released one due to failures. Achieving 100% survivability (i.e., recovery from all possible dual link failures) requires a triconnected network, where three disjoint paths for each connection are required. Since these networks can become extremely expensive since they can require a huge number of network links (i.e., fibers connections), a more realistic case of non-triconnected networks is assumed. In these networks, full network recovery is not be feasible, but achieving the maximum possible survivability is desired. Spare capacity can then be allocated to existing network links, which represents the actual cost of the survivability. We propose optimization models that take into account these different recovery strategies, and demonstrate that restoration has the potential to provide a much better recovery capability with almost the same amount of spare capacity required in protection schemes. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65518 2017-01-01T00:00:00Z Survivability of optical networks is considered among the most critical problems that telecommunications operators need to solve at a reasonable cost. Survivability can be enhanced by increasing the amount of network links and its spare capacity, nevertheless this deploys more resources on the network that will be used only under failure scenarios. In other words, these spare resources do not generate any direct profit to network operators as they are reserved to route only disrupted traffic. In particular, the case of dual link failures on fiber optic cables (i.e., fiber cuts) has recently received much attention as repairing these cables typically requires much time, which then increases the probability of a second failure on another link of the network. In this context, survivability schemes can be used to recover the network from a dual link failure scenario. In this work, we analyze the case of protection and restoration schemes, which are two well-known recovery strategies. The former is simpler to implement as it considers a fixed set of backup paths for all failure scenarios; however, it cannot take into account the spare capacity released by disrupted connections. Instead, the latter computes the best recovery path considering not only the spare capacity but also the released one due to failures. Achieving 100% survivability (i.e., recovery from all possible dual link failures) requires a triconnected network, where three disjoint paths for each connection are required. Since these networks can become extremely expensive since they can require a huge number of network links (i.e., fibers connections), a more realistic case of non-triconnected networks is assumed. In these networks, full network recovery is not be feasible, but achieving the maximum possible survivability is desired. Spare capacity can then be allocated to existing network links, which represents the actual cost of the survivability. We propose optimization models that take into account these different recovery strategies, and demonstrate that restoration has the potential to provide a much better recovery capability with almost the same amount of spare capacity required in protection schemes. http://sedici.unlp.edu.ar:80/handle/10915/65517 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). As small satellites become more capable through miniaturized electronics and on-board processing, constellations of low-cost satellites lunched in Low- Earth Orbit (LEO) become feasible. The increase in the number of LEO satellites drives the need for frequency coexistence between the LEO constellation systems with the already existing geostationary (GSO) satellite networks. In this context, it is crucial to design the communication links paying special attention to interference analysis. This is particularly true when the LEO satellite constellation exploit inter-satellite communication links (ISL). In this paper, a radio frequency interference analysis based on simulation of the dynamic satellite constellation is presented and the design parameters of the inter-satellite links are analyzed. The results suggest that carefully choosing the design parameters of the intersatellite links, spectrum coexistence of LEO and GSO networks may be possible. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65517 2017-01-01T00:00:00Z As small satellites become more capable through miniaturized electronics and on-board processing, constellations of low-cost satellites lunched in Low- Earth Orbit (LEO) become feasible. The increase in the number of LEO satellites drives the need for frequency coexistence between the LEO constellation systems with the already existing geostationary (GSO) satellite networks. In this context, it is crucial to design the communication links paying special attention to interference analysis. This is particularly true when the LEO satellite constellation exploit inter-satellite communication links (ISL). In this paper, a radio frequency interference analysis based on simulation of the dynamic satellite constellation is presented and the design parameters of the inter-satellite links are analyzed. The results suggest that carefully choosing the design parameters of the intersatellite links, spectrum coexistence of LEO and GSO networks may be possible. http://sedici.unlp.edu.ar:80/handle/10915/65516 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). Fragmentation in Elastic Optical Networks is an issue caused by isolated, non-aligned, and non-contiguous frequency slots that can not be used to allocate new connection request to the network, due to the optical layer restrictions imposed to the Routing and Spectrum Assignment (RSA) algorithms. To deal with this issue, several studies about Spectrum Defragmentation have been presented. In this work, we analyze the most important Non-Hitless Defragmentation Algorithms found in the literature, with proactive and reactive approaches that include rerouting and non-rerouting schemes, and compare their performance in terms of Blocking Probability, Entropy, and Bandwidth Fragmentation Ratio. Simulations results showed that the Fragmentation Aware schemes outperformed the other algorithms in low traffic load, but the Reactive schemes got better results in high traffic load. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65516 2017-01-01T00:00:00Z Fragmentation in Elastic Optical Networks is an issue caused by isolated, non-aligned, and non-contiguous frequency slots that can not be used to allocate new connection request to the network, due to the optical layer restrictions imposed to the Routing and Spectrum Assignment (RSA) algorithms. To deal with this issue, several studies about Spectrum Defragmentation have been presented. In this work, we analyze the most important Non-Hitless Defragmentation Algorithms found in the literature, with proactive and reactive approaches that include rerouting and non-rerouting schemes, and compare their performance in terms of Blocking Probability, Entropy, and Bandwidth Fragmentation Ratio. Simulations results showed that the Fragmentation Aware schemes outperformed the other algorithms in low traffic load, but the Reactive schemes got better results in high traffic load. http://sedici.unlp.edu.ar:80/handle/10915/65515 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). Today, Internet of Things (IoT) is an emergent concept in which billions of devices are connected to Internet capable of producing and exchanging data. One of the most used technologies in this area regards to the Radio Frequency Identification (RFID). It can produce large amount of data from many things like objects, persons and assets. Thus, it is needed middlewares which must support processing in large scales. However, the state-of-the-art does not present satisfactory solutions in which this kind of middlewares are capable of adapt themselves according to processing demands. In this context, this article presents a proactive cloud elasticity model called Proliot aiming at providing scalability to IoT middlewares. Proliot is capable of predicting load behavior combining time series techniques. In addition, it adapts cloud resources beforehand an overload or underload situation occurs. We evaluated our model comparing results with a reactive elasticity model. In our experiments, Proliot achieved best performance up to 76% when compared to Eliot. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65515 2017-01-01T00:00:00Z Today, Internet of Things (IoT) is an emergent concept in which billions of devices are connected to Internet capable of producing and exchanging data. One of the most used technologies in this area regards to the Radio Frequency Identification (RFID). It can produce large amount of data from many things like objects, persons and assets. Thus, it is needed middlewares which must support processing in large scales. However, the state-of-the-art does not present satisfactory solutions in which this kind of middlewares are capable of adapt themselves according to processing demands. In this context, this article presents a proactive cloud elasticity model called Proliot aiming at providing scalability to IoT middlewares. Proliot is capable of predicting load behavior combining time series techniques. In addition, it adapts cloud resources beforehand an overload or underload situation occurs. We evaluated our model comparing results with a reactive elasticity model. In our experiments, Proliot achieved best performance up to 76% when compared to Eliot. http://sedici.unlp.edu.ar:80/handle/10915/65514 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). Code injection attacks are an undeniable threat in today’s cyberworld. Instruction Set Randomization (ISR) was initially proposed in 2003. This technique was designed to protect systems against code injection attacks by creating an unique instruction set for each machine, thanks to randomization. It is a promising technique in the growing embedded system and Internet of Things (IoT) devices ecosystem, where the lack of complex memory management make these devices more vulnerable. However, most of ISR implementations up to day are entirely software based. In this work, we implement hardware support for an ISR defense on an 32 bits, 5 pipeline stages MIPS processor (which is an embedded system compatible architecture). Two obfuscation schemes were implemented, one based on XOR encryption and the other on transposition. The hardware implementation was tested under synthetic code injection attacks and results shows the effectiveness of the defense using both encryption circuits. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65514 2017-01-01T00:00:00Z Code injection attacks are an undeniable threat in today’s cyberworld. Instruction Set Randomization (ISR) was initially proposed in 2003. This technique was designed to protect systems against code injection attacks by creating an unique instruction set for each machine, thanks to randomization. It is a promising technique in the growing embedded system and Internet of Things (IoT) devices ecosystem, where the lack of complex memory management make these devices more vulnerable. However, most of ISR implementations up to day are entirely software based. In this work, we implement hardware support for an ISR defense on an 32 bits, 5 pipeline stages MIPS processor (which is an embedded system compatible architecture). Two obfuscation schemes were implemented, one based on XOR encryption and the other on transposition. The hardware implementation was tested under synthetic code injection attacks and results shows the effectiveness of the defense using both encryption circuits. http://sedici.unlp.edu.ar:80/handle/10915/65513 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). This article presents a system for determining the position and orientation of unmanned aerial vehicles. The system has two hardware layers coupled in both directions. One layer stabilizes the vehicle while the other determines lateral displacements. The two-directional coupling between layers allows the system to minimize estimation errors. The proposed implementation is evaluated on real hardware and evaluation results show that a real time implementation is feasible. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65513 2017-01-01T00:00:00Z This article presents a system for determining the position and orientation of unmanned aerial vehicles. The system has two hardware layers coupled in both directions. One layer stabilizes the vehicle while the other determines lateral displacements. The two-directional coupling between layers allows the system to minimize estimation errors. The proposed implementation is evaluated on real hardware and evaluation results show that a real time implementation is feasible. http://sedici.unlp.edu.ar:80/handle/10915/65512 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). In this work the WiMax MAC Protocol for Dynamic Service Flow management and their transactions is analyzed by showing this several pitfalls of the specification and how this can affect the implementation of the protocol using Colored Petri Nets (CPNs). A detailed description of the protocol is developed at level of transactions it supports, and at level of service flows. The modeling and analysis of the protocol are important to improve the current specification and to support the reuse of the concepts in emerging networks. We show the potentialities of using a transaction oriented approach in the description of this kind of protocols. The contributions of this paper are focused on providing a clear description of the protocol, presentation of the model, validation and analysis of the model according to the generation of the Dynamic Service Flow management transactions protocol language, as well as the determination of regular expressions Language. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65512 2017-01-01T00:00:00Z In this work the WiMax MAC Protocol for Dynamic Service Flow management and their transactions is analyzed by showing this several pitfalls of the specification and how this can affect the implementation of the protocol using Colored Petri Nets (CPNs). A detailed description of the protocol is developed at level of transactions it supports, and at level of service flows. The modeling and analysis of the protocol are important to improve the current specification and to support the reuse of the concepts in emerging networks. We show the potentialities of using a transaction oriented approach in the description of this kind of protocols. The contributions of this paper are focused on providing a clear description of the protocol, presentation of the model, validation and analysis of the model according to the generation of the Dynamic Service Flow management transactions protocol language, as well as the determination of regular expressions Language. http://sedici.unlp.edu.ar:80/handle/10915/65511 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). This paper presents an approach using range measurement through homography calculation to build 2D visual occupancy grid and control the robot through monocular vision. This approach is designed for a Cellbot architecture. The robot is equipped with wall following behavior to explore the environment, which enables the robot to trail objects contours, residing in the fuzzy control the responsibility to provide commands for the correct execution of the robot movements while facing the adversities in the environment. In this approach the Cellbot camera works as a sensor capable of correlating the images elements to the real world, thus the system is capable of finding the distances of the obstacles and that information is used for the occupancy grid mapping and for fuzzy control input. Experimental results with V-REP simulator are presented to validate the proposal, and the results were favorable to the use in robotics and in acceptable computing time. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65511 2017-01-01T00:00:00Z This paper presents an approach using range measurement through homography calculation to build 2D visual occupancy grid and control the robot through monocular vision. This approach is designed for a Cellbot architecture. The robot is equipped with wall following behavior to explore the environment, which enables the robot to trail objects contours, residing in the fuzzy control the responsibility to provide commands for the correct execution of the robot movements while facing the adversities in the environment. In this approach the Cellbot camera works as a sensor capable of correlating the images elements to the real world, thus the system is capable of finding the distances of the obstacles and that information is used for the occupancy grid mapping and for fuzzy control input. Experimental results with V-REP simulator are presented to validate the proposal, and the results were favorable to the use in robotics and in acceptable computing time. http://sedici.unlp.edu.ar:80/handle/10915/65510 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). Given mobile devices ubiquity and capabilities, some researchers now consider them as resource providers of distributed environments called mobile Grids for running resource intensive software. Therefore, job scheduling has to deal with device singularities, such as energy constraints, mobility and unstable connectivity. Many existing schedulers consider at least one of these aspects, but their applicability strongly depends on information that is unavailable or difficult to estimate accurately, like job execution time. Other efforts do not assume knowing job CPU requirements but ignore energy consumption due to data transfer operations, which is not realistic for data-intensive applications. This work, on the contrary, considers the last as non negligible and known by the scheduler. Under these assumptions, we conduct a performance study of several traditional scheduling heuristics adapted to this environment, which are applied with the known information of jobs but evaluated along with job information unknown to the scheduler. Experiments are performed via a simulation software that employs hardware profiles derived from real mobile devices. Our goal is to contribute to better understand both the capabilities and limitations of this kind of schedulers in the incipient area of mobile Grids. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65510 2017-01-01T00:00:00Z Given mobile devices ubiquity and capabilities, some researchers now consider them as resource providers of distributed environments called mobile Grids for running resource intensive software. Therefore, job scheduling has to deal with device singularities, such as energy constraints, mobility and unstable connectivity. Many existing schedulers consider at least one of these aspects, but their applicability strongly depends on information that is unavailable or difficult to estimate accurately, like job execution time. Other efforts do not assume knowing job CPU requirements but ignore energy consumption due to data transfer operations, which is not realistic for data-intensive applications. This work, on the contrary, considers the last as non negligible and known by the scheduler. Under these assumptions, we conduct a performance study of several traditional scheduling heuristics adapted to this environment, which are applied with the known information of jobs but evaluated along with job information unknown to the scheduler. Experiments are performed via a simulation software that employs hardware profiles derived from real mobile devices. Our goal is to contribute to better understand both the capabilities and limitations of this kind of schedulers in the incipient area of mobile Grids. http://sedici.unlp.edu.ar:80/handle/10915/65509 Objeto de conferencia Simposio Latinoamericano de Infraestructura, Hardware y Software (SLIHS) - JAIIO 46 (Córdoba, 2017). Spatial modulation (SM) added to traditional OFDM communications has been intensively studied as a candidate transmission method to convey high-speed, low-delay, powerefficient and high-mobility 5G communications in a reliable basis. This approach implies the use of multiple antennas at the transmitter. Then, the fundamental aspect revised in this work takes into account that in a single-carrier SM system, the selection of the active transmit antenna according to (part of) the information bits makes it possible to use a single power amplifier (PA) that is switched among the available antennas. On the other hand, in a conventional SM-OFDM system, every antenna needs to be continuously active as the index information is typically different for each subcarrier. Consequently, we propose a transmission scheme that precodes the information symbols in frequency domain, such that the global symbol period is split into partitions that enable a sequential operation of antennas which can be fed by a single PA. In addition, it is possible to establish that the proposed approach tends to be more robust against disturbances observed in high mobility environments. Sun, 01 Jan 2017 00:00:00 GMT http://sedici.unlp.edu.ar:80/handle/10915/65509 2017-01-01T00:00:00Z Spatial modulation (SM) added to traditional OFDM communications has been intensively studied as a candidate transmission method to convey high-speed, low-delay, powerefficient and high-mobility 5G communications in a reliable basis. This approach implies the use of multiple antennas at the transmitter. Then, the fundamental aspect revised in this work takes into account that in a single-carrier SM system, the selection of the active transmit antenna according to (part of) the information bits makes it possible to use a single power amplifier (PA) that is switched among the available antennas. On the other hand, in a conventional SM-OFDM system, every antenna needs to be continuously active as the index information is typically different for each subcarrier. Consequently, we propose a transmission scheme that precodes the information symbols in frequency domain, such that the global symbol period is split into partitions that enable a sequential operation of antennas which can be fed by a single PA. In addition, it is possible to establish that the proposed approach tends to be more robust against disturbances observed in high mobility environments.