{"title":"Dédalo: A middleware with a single point of access for heterogeneous distributed computing environments","authors":"E. C. Inacio, Frank Siqueira, M. Dantas","doi":"10.1109/ISCC.2016.7543861","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543861","url":null,"abstract":"A great challenge faced by many organizations refers to translating their large computing infrastructure into an effective tool to support their productive chain. In this paper, we introduce a modular single point of access middleware approach focused on integrating distributed and heterogeneous computing resources, coined as Dédalo. Since its design, which follows a software product line (SPL) paradigm, Dédalo aims at providing a production-oriented approach to integrate a variety of existing resource managers under a user-friendly interface, with some context-aware approach. Along with the project detailing, a real use case is discussed, presenting the deployment of the Dédalo middleware to support the execution of oil and gas reservoir engineering simulations in an energy company appearing at the 2015 Forbes' Global 2000 companies.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"55 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122223706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qiu Tang, Majing Su, Lei Jiang, Jiajia Yang, Xu Bai
{"title":"A scalable architecture for low-latency market-data processing on FPGA","authors":"Qiu Tang, Majing Su, Lei Jiang, Jiajia Yang, Xu Bai","doi":"10.1109/ISCC.2016.7543802","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543802","url":null,"abstract":"The speed of market data processing is a key factor to grab the gains and losses of instant trading profits. Typically, the market data processing systems are deployed on software platforms, which introduce high and unpredictable processing latencies. In this paper, we propose a scalable architecture for low-latency market-data processing on Field Programmable Gate Array (FPGA). A market-data processing IP library is implemented by the high-level synthesis (HLS) which automatically translates the C-coded market-data decoders to logic-coded ones. Based on the IP library, we propose a bus-based architecture of market-data decoding engine. A constructor is proposed to automatically build the decoding engines for different market-data templates. We demonstrate our design within a Xilinx Kintex-7 FPGA using three Chinese A-share templates and multiple history market-data sets. Our implementation achieves an ultra-low latency of market data processing, 0.5~1.3us per message on average, 1~2 orders of magnitude faster than a comparable software implementation.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125789412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Logical key hierarchy for groups management in Distributed Online Social Network","authors":"Andrea De Salve, R. D. Pietro, P. Mori, L. Ricci","doi":"10.1109/ISCC.2016.7543820","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543820","url":null,"abstract":"Distributed Online Social Networks (DOSNs) have recently been proposed to shift the control over user data from a unique entity to the users of the DOSN themselves. In this paper, we focus our attention on the problem of privacy preserving content sharing to a large group of users of the DOSNs. Several solutions, based on cryptographic techniques, have been recently proposed. The main challenge here is the definition of a scalable and decentralized approach that: i) minimizes the re-encryption of the contents published in a group when the composition of the group changes and ii) enables a fast distribution of the cryptographic keys to all the members (n) of a group, each time a new user is added or removed from the group by the group owner. Our solution achieves the above goals, providing performance unattained by our competitors. In particular, our approach requires only O(d·logn) encryption operations when the group membership changes (eviction), and only O(2·logn) when a join occurs (where d is an input parameter of the system). The effectiveness of our approach is evaluated by an experimental campaign carried out over a set of traces from a real online social network.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Simulation of Massively Multiplayer Online Games communication using OPNET custom application","authors":"S. A. Abdulazeez, A. Rhalibi, D. Al-Jumeily","doi":"10.1109/ISCC.2016.7543721","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543721","url":null,"abstract":"In recent years, there has been an important growth in online gaming. Nowadays, Massively Multiplayer Online Games (MMOGs) may involve millions of synchronous players scattered around the world and engaging with each other within a single shared game. In this paper, we propose a new technique to communicate between players and game server, and between them based on hybrid Peer-to-Peer architecture. We propose to use OPNET Modeler 18.0, and in particular the custom application to simulate the new architecture, which required the implementation of new nodes models and behaviors in the simulator to emulate correctly the new architecture. We use OPNET Modeler 18.0 to simulate the network, applying two transport protocols TCP and UDP, and with different scenarios. The scenarios include both client-server and hybrid P2P system to evaluate the communication of games with (125, 500, and 1000) peers.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127420515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ramon Hugo de Souza, P. Flores, M. Dantas, Frank Siqueira
{"title":"Architectural recovering model for Distributed Databases: A reliability, availability and serviceability approach","authors":"Ramon Hugo de Souza, P. Flores, M. Dantas, Frank Siqueira","doi":"10.1109/ISCC.2016.7543799","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543799","url":null,"abstract":"The early theoretical studies that presented conceptual definitions for the mapping of Quality of Experience (QoE) through Quality of Service (QoS), in an approach focused on Distributed Databases (DDBs), showed the directions to be threshed in a way to accomplish a hybrid DDBs' QoE-QoS set of evaluation criteria. That evaluation set being classified explicitly as partial, since QoE is a known multidimensional concept, hard to be explicitly well-defined. With these newfound equations being useful specifically to system-level purposes, without focusing on the user explicitly, as the usual QoE approach, these studies presented a new abstraction that allows web storage cloud services to adequately explore and assess requirements for contracted services. This study presents a novel architectural model to deal with reliability, availability and serviceability issues, in order to provide a solution giving QoS-like guarantees to DDB systems. With its origins in this set of evaluation criteria, this new kind of architectural solution aims to provide more stability by dealing with statistical guarantees. The proposed architecture focuses on these evaluations to choose recovery procedures, in order to avoid future unexpected behaviour, dealing with horizontal and vertical DDB's solutions to keep the services according to a Service Level Agreement (SLA).","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"16 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120860568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Alessandro Palla, Luca Sarti, A. Frigerio, L. Fanucci
{"title":"Embedded implementation of an eye-in-hand visual servoing control for a Wheelchair Mounted Robotic Arm","authors":"Alessandro Palla, Luca Sarti, A. Frigerio, L. Fanucci","doi":"10.1109/ISCC.2016.7543753","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543753","url":null,"abstract":"Wheelchair Mounted Robotic Arms (WMRA) can be used by people with severe motor skill impairment, such as SMA (Spinal Muscular Atrophy), Cerebral Palsy etc..., in order to achieve daily life tasks. Many of those systems have been presented in literature and are available on the market but they are really expensive and bulky. Instead we propose a simple robotic arm with 4 Degrees of Freedom (DOF), controlled by a cheap embedded platform in order to keep the size and the cost as low as possible. This paper presents the design and evaluation of a simple visual servoing control loop for the robotic arm based on a camera mounted on the arm end effector. A lot of attention has been given to the design process of an effective and more accessible human machine interface, in order to make the arm simply usable by the user. Tests and evaluations were performed on a simplified version of the final system prove the effectiveness of the proposed solution. However further optimization have to be achieved in order to make the whole system really usable in a real-word scenario.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121264766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Marco Cavallo, G. Modica, Carmelo Polito, O. Tomarchio
{"title":"Application profiling in hierarchical Hadoop for geo-distributed computing environments","authors":"Marco Cavallo, G. Modica, Carmelo Polito, O. Tomarchio","doi":"10.1109/ISCC.2016.7543796","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543796","url":null,"abstract":"In the past two decades there has been a growing interest over the definition of new distributed computational paradigms capable to serve the need of manipulating and analyzing huge amounts of data. Among the others, the MapReduce outstands for popularity. Its open-source implementation Hadoop is widely used in academic environments and is also greatly supported by huge IT players. There are many application scenarios where the data to be manipulated resides on data centers which are heterogeneous in term of computing capacity and are geographically distant from each other's. Unfortunately, in this contexts Hadoop performs very poorly. In this paper we propose to leverage on a hierarchical computing framework to boost the Hadoop performance in geo-distributed computing environments. The framework we propose drains fresh information from the distributed computing context and exploits it to carry out a smart job scheduling strategy. In this work, the focus is put on the study and definition of the application profile of the jobs. We implemented a software prototype of the proposed hierarchical Hadoop framework. Tests run on the prototype proved the capability of the job scheduling system to compute the job's execution path and estimate its completion time.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123337081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Cevher, M. Ulutaş, Sedat Altun, Ibrahim Hökelek
{"title":"Multi Topology Routing based IP Fast Re-Route for Software Defined Networks","authors":"S. Cevher, M. Ulutaş, Sedat Altun, Ibrahim Hökelek","doi":"10.1109/ISCC.2016.7543903","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543903","url":null,"abstract":"The strict Quality of Service requirements of real-time services in communication networks necessitate the fast recovery from link/node failures by activating alternate paths which avoid the failed component. Multi Topology Routing (MTR) based IP Fast Re-Route (IPFRR) technologies rely on virtual topologies (VTs) to seamlessly forward the IP packets during network failures. In this paper, we implement a new MTR based IPFRR technique for Software Defined Networks (SDN) which uses the Multiple Routing Configurations method to construct VTs. Our approach leads to self-recovering SDN against failures. Out preliminary results show that our approach considerably reduces the failure recovery time compared to the reactive recovery process in SDN.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115514784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Identification of congestion links under multipath routing with end-to-end measurements","authors":"Shengli Pan, Qing Jiang, Xiaoyan Nie, Guangmin Hu","doi":"10.1109/ISCC.2016.7543810","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543810","url":null,"abstract":"Congestion links can not only introduce great packet losses, but also cause significant delay flutters to paths that traverse them. However, most of current approaches just try to identify congestion links that meet end-to-end loss observations. What's worse, most of them also take no consideration of multipath routing, while which will introduce more than a single routing path between two end-hosts and can make a single-source network own a non-tree topology instead of the tree one. In this paper, we employ both end-to-end loss and delay observations to identify congestion links in a single-source network where multipath routing is enabled. We first prove that under certain topology conditions, the link delay variances in such non-tree topology can be inferred solely from end-to-end delay measurements. Then, we propose an algorithm to identify as congested a set of links, which can not only account for end-to-end path losses but also demonstrate great delay variances at the meantime. Simulation results validate the desirable performance of our proposed scheme.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115449585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"GREP: A group rekeying protocol based on member join history","authors":"Marco Tiloca, G. Dini","doi":"10.1109/ISCC.2016.7543761","DOIUrl":"https://doi.org/10.1109/ISCC.2016.7543761","url":null,"abstract":"This paper presents GREP, a highly scalable and efficient group rekeying protocol with the following merits. First, it rekeys the group with only two messages, introducing an overhead which is small, constant, and independent of the group size. Second, GREP considers collusion as a first-class attack. Third, GREP efficiently recovers the group from a collusion attack without recourse to a total member reinitialization. The recovery cost smoothly grows with the group size, and gradually increases with the attack severity. GREP achieves these results by organizing nodes into logical subgroups and exploiting the history of node joining events. This allows GREP to establish a total ordering among subgroups and among nodes in each subgroup, so making collusion recovery highly scalable and efficient. We evaluate performance from several standpoints, and show that GREP is deployable in large-scale networks of customary, even resource constrained, platforms.","PeriodicalId":148096,"journal":{"name":"2016 IEEE Symposium on Computers and Communication (ISCC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132021832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}