2015
Authors
Proença, J; Tivoli, M;
Publication
FOCLASA
Abstract
2015
Authors
Ramachandran, GS; Daniels, W; Proença, J; Michiels, S; Joosen, W; Hughes, D; Porter, B;
Publication
Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based Software Engineering, CBSE 2015, Montreal, QC, Canada, May 4-8, 2015
Abstract
The aggregation of network traffic has been shown to enhance the performance of wireless sensor networks. By reducing the number of packets that are transmitted, energy consumption, collisions and congestion are minimised. However, current data aggregation schemes restrict developers to a specific network structure or cannot handle multi-hop data aggregation. In this paper, we propose Hitch Hiker, a remote component binding model that provides support for multi-hop data aggregation. Hitch Hiker uses component meta-data to discover remote component bindings and to construct a multi-hop overlay network within the free payload space of existing traffic ows. This overlay network provides end-To-end routing of low-priority traffic while using only a small fraction of the energy of standard communication. We have developed a prototype implementation of Hitch Hiker for the LooCI component model. Our evaluation shows that Hitch Hiker consumes minimal resources and that using Hitch Hiker to deliver low-priority traffic reduces energy consumption by up to 15%. Copyright © 2015 ACM.
2015
Authors
Cámara, J; Proença, J;
Publication
FOCLASA
Abstract
2015
Authors
Machado, N; Lucia, B; Rodrigues, L;
Publication
ACM SIGPLAN NOTICES
Abstract
We present Symbiosis: a concurrency debugging technique based on novel differential schedule projections (DSPs). A DSP shows the small set of memory operations and data-flows responsible for a failure, as well as a reordering of those elements that avoids the failure. To build a DSP, Symbiosis first generates a full, failing, multithreaded schedule via thread path profiling and symbolic constraint solving. Symbiosis selectively reorders events in the failing schedule to produce a non-failing, alternate schedule. A DSP reports the ordering and data-flow differences between the failing and non-failing schedules. Our evaluation on buggy real-world software and benchmarks shows that, in practical time, Symbiosis generates DSPs that both isolate the small fraction of event orders and data-flows responsible for the failure, and show which event reorderings prevent failing. In our experiments, DSPs contain 81% fewer events and 96% fewer data-flows than the full failure-inducing schedules. Moreover, by allowing developers to focus on only a few events, DSPs reduce the amount of time required to find a valid fix.
2015
Authors
Silva, JMC; Carvalho, P; Lima, SR;
Publication
2015 23RD INTERNATIONAL CONFERENCE ON SOFTWARE, TELECOMMUNICATIONS AND COMPUTER NETWORKS (SOFTCOM)
Abstract
The paradigm of having everyone and everything connected in an ubiquitous way poses huge challenges to today's networks due to the massive traffic volumes involved. To turn treatable all network tasks requiring traffic analysis, sampling the traffic has become mandatory triggering substantial research in the area. Aiming at fostering the deployment and tuning of new sampling techniques, this paper presents a flexible sampling framework developed following a multilayer design in order to easily set up the characteristics of a sampling technique according to the measurement task to be assisted. The framework implementation relies on a comprehensive sampling taxonomy which identifies the granularity, selection scheme and selection trigger as the inner characteristics distinguishing current sampling proposals. As proof of concept of the versatility of this framework in testing the suitability of distinct sampling schemes, this work provides a comparative performance evaluation of classical and recent sampling techniques regarding the estimation accuracy, the volume of data involved in the sampling process and the computational weight in terms of CPU and memory usage.
2015
Authors
Silva, JMC; Carvalho, P; Lima, SR;
Publication
2015 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC)
Abstract
Understanding network workload through the characterization of network flows, being essential for assisting network management tasks, can benefit largely from traffic sampling as long as an accurate snapshot of network behavior is captured. This paper is devoted to evaluate the real applicability of using sampling to support flow analysis. Considering both classical and emerging sampling techniques, a comparative performance study is carried out to assess the accuracy of estimating flow parameters through sampling. After identifying the main building blocks of sampled-based measurements, a sampling framework has been implemented to provide a versatile and fair platform for carrying out the testing and comparison process. Through an encompassing coverage of representative sampling techniques, the present study aims to provide useful insights regarding the use of sampling in traffic flow analysis.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.