{"title":"A Distributed Merge-and-Split Mechanism for Dynamic Virtual Organization Formation in Grids","authors":"Lena Mashayekhy, Daniel Grosu","doi":"10.1109/NCA.2012.13","DOIUrl":"https://doi.org/10.1109/NCA.2012.13","url":null,"abstract":"We model the Virtual Organization (VO) formation problem in grids using concepts from coalitional game theory and design a distributed mechanism for solving it. The proposed distributed mechanism enables the formation of VOs guaranteeing the maximum profit for their participating Grid Service Providers (GSPs). We show that the proposed mechanism produces stable VOs, that is, the GSPs do not have incentives to break away from the current VO and join some other VO. We perform extensive simulation experiments using real workload traces to characterize the properties of the proposed distributed mechanism. The results show that the proposed distributed mechanism not only produces VOs that are stable yielding high revenue for the participating GSPs, but also decides the structure of the VOs in a reasonable amount of time.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114323450","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}
Raphaël Barazzutti, P. Felber, H. Mercier, Emanuel Onica, J. Pineau, E. Rivière, C. Fetzer
{"title":"Infrastructure Provisioning for Scalable Content-Based Routing: Framework and Analysis","authors":"Raphaël Barazzutti, P. Felber, H. Mercier, Emanuel Onica, J. Pineau, E. Rivière, C. Fetzer","doi":"10.1109/NCA.2012.44","DOIUrl":"https://doi.org/10.1109/NCA.2012.44","url":null,"abstract":"Content-based publish/subscribe is an attractive paradigm for designing large-scale systems, as it decouples producers of information from consumers. This provides extensive flexibility for applications, which can use a modular architecture. Using this architecture, each participant expresses its interest in events by means of filters on the content of those events instead of using pre-established communication channels. However, matching events against filters has a non-negligible processing cost. Scaling the infrastructure with the number of users or events requires appropriate provisioning of resources for each of the operations involved: routing and filtering. In this paper, we propose and describe a generic, modular, and scalable infrastructure for supporting high-performance content-based publish/subscribe. We analyze its properties and show how it dynamically scales in a realistic setting. Our results provide valuable insights into the design and deployment of scalable content-based routing infrastructures.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126604467","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":"Energy Efficient Routing Based on Connected Dominating Sets","authors":"Y. Massad, J. Villadangos, V. Cholvi","doi":"10.1109/NCA.2012.33","DOIUrl":"https://doi.org/10.1109/NCA.2012.33","url":null,"abstract":"In this paper, we propose a set of heuristics to be used within greedy algorithms to build connected dominating sets (CDSs). These algorithms depends on a heuristic and we show that the selection of such heuristic is fundamental to optimizing system operation, both in terms of energy consumption and data transmission. Based on some parameters such as the node's degree, the distances between nodes and the already explored nodes, we propose two different heuristics, denoted HI and HT. Using the network simulator ns-2, we perform a number of experiments in different scenarios and analyzed the performance of our proposed algorithms. We show that our algorithms provide CDSs with lower connection duration at a lower energy cost than previous proposals.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127576712","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":"SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control","authors":"A. Mozo, José Luis López-Presa, Antonio Fernández","doi":"10.1109/NCA.2012.40","DOIUrl":"https://doi.org/10.1109/NCA.2012.40","url":null,"abstract":"The growth of the Internet has increased the need for scalable congestion control mechanisms in high speed networks. In this context, we propose a rate-based explicit congestion control mechanism with which the sources are provided with the rate at which they can transmit. These rates are computed with a distributed max-min fair algorithm, SLBN. The novelty of SLBN is that it combines two interesting features not simultaneously present in existing proposals: scalability and fast convergence to the max-min fair rates, even under high session churn. SLBN is scalable because routers only maintain a constant amount of state information (only three integer variables per link) and only incur a constant amount of computation per protocol packet, independently of the number of sessions that cross the router. Additionally, SLBN does not require processing any data packet, and it converges independently of sessions' RTT. Finally, by design, the protocol is conservative when assigning rates, even in the presence of high churn, which helps preventing link overshoots in transient periods. We claim that, with all these features, our mechanism is a good candidate to be used in real deployments.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127602643","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}
Kshitiz Verma, G. Rizzo, Antonio Fernández, R. C. Rumín, A. Azcorra
{"title":"Greening the Internet: Energy-Optimal File Distribution","authors":"Kshitiz Verma, G. Rizzo, Antonio Fernández, R. C. Rumín, A. Azcorra","doi":"10.1109/NCA.2012.11","DOIUrl":"https://doi.org/10.1109/NCA.2012.11","url":null,"abstract":"Despite file distribution applications are responsible for a major portion of the current Internet traffic, so far little effort has been dedicated to study file distribution from the point of view of energy efficiency. In this paper, we present the first extensive and detailed theoretical study for the problem of energy efficiency in file distribution. Specifically, we first demonstrate that the general problem of minimizing energy consumption in file distribution is NP-hard. For restricted versions of the problem, we derive tight lower bounds on energy consumption, and we design a family of algorithms that achieve these bounds. Our results prove that through collaborative p2p schemes up to 50% energy savings are achievable with respect to the best available centralized file distribution scheme. Through simulation, we show that even in heterogeneous settings (e.g., considering network congestion, and link variability across hosts) our collaborative algorithms always achieve significant energy savings with respect to the power consumption of centralized file distribution systems.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128154933","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":"Task and Server Assignment for Reduction of Energy Consumption in Datacenters","authors":"Ning Liu, Z. Dong, R. Rojas-Cessa","doi":"10.1109/NCA.2012.42","DOIUrl":"https://doi.org/10.1109/NCA.2012.42","url":null,"abstract":"Energy consumption of cloud data centers accounts for a major operational cost. This paper presents an optimization model for task scheduling to minimize task processing time and energy consumption in data centers for cloud computing. We formulate an integer programming optimization problem to minimize the expected energy consumption of homogenous tasks in a data center with a large number of servers and propose the most-efficient-server first greedy task scheduling algorithm to minimize energy expenditure. We show that the proposed task scheduling can minimize the energy expenditure while bounding the average task waiting time. We present a simulation of the proposed task scheduling scheme to show an optimum number of servers to achieve small task processing times and to minimize energy consumption.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114472032","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":"A Reservation Scheme for QoS Provision within Mobile Multihop Relay Networks","authors":"N. Krichene, N. Boudriga","doi":"10.1109/NCA.2012.25","DOIUrl":"https://doi.org/10.1109/NCA.2012.25","url":null,"abstract":"We propose a resources reservation scheme pro-vides QoS for handing over stations within Mobile Multi-hop Relay Networks. The original time interval between two consecutive scans is divided into multiple intermediate time intervals for scan or transmission/reception. On the light of the intermediate scan results and depending on the \"Mobility Context \" of the SS or the mobile RS, the reservation amount on candidate target handover station(s) is updated in a fine-grained way. Simulation results show that our scheme results in relatively low resources waste ratio and induces relatively low overhead.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522760","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":"DiFiSec: An Adaptable Multi-level Security Framework for Event-Driven Communication in Wireless Sensor Networks","authors":"S. R. Afzal, Christophe Huygens, W. Joosen","doi":"10.1109/NCA.2012.49","DOIUrl":"https://doi.org/10.1109/NCA.2012.49","url":null,"abstract":"State of the art security research in the field of wireless sensor networks has focused on providing security in a coarse-grained, full-fledged and static fashion. This implies providing confidentiality, data authentication, data integrity and freshness to the entire spectrum of communication between the participating nodes in a network. In this paper however we advocate that as a result of a number of factors relating wireless sensor networks, providing security in similar fashion for the entire communication set isn't a pragmatic approach and does not precisely reflect the application level security requirements. We therefore propose DiFiSec, a dynamic, fine-grained and adaptable security framework that supports various levels of plug gable security for distinct data communication sets depending on the context, environment and criticality of the data. These plug gable security levels can be enacted at the levels of component wirings and receptacles, hence empowering application users to select only the most appropriate security respecting the resource-constrained nature of WSNs. Furthermore, to support system evolution and changing application requirements DiFiSec offers runtime adaptability. A prototype of this system has been implemented on SunSPOT sensor nodes where we have evaluated our approach in comparison with other network security variations.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131321355","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":"Sensing and Actuation as a Service: A New Development for Clouds","authors":"S. Distefano, Giovanni Merlino, A. Puliafito","doi":"10.1109/NCA.2012.38","DOIUrl":"https://doi.org/10.1109/NCA.2012.38","url":null,"abstract":"Cloud computing is among the hottest trends in ICT, aiming at providing on-demand computing and storage resources with guarantees on the quality of service. A limit of current Cloud implementations is the absence of mechanisms to effectively manage inputs from the physical world. Our idea is to move towards a pervasive Cloud, providing facilities and solutions able to interact with the surrounding environment enabling development of new and value added services. In this vision also mobile devices, such as PDAs, usually equipped with several sensors and actuators, have to be included in the overall picture. Mobile devices and their respective owners can decide whether, how and when to contribute to the Cloud, thus introducing further unknowns. In order to deal with all such issues, in this paper we propose a solution that gives way to the Sensing and Actuation as a Service (SAaaS) paradigm, a step towards the creation of a Cloud of sensors and actuators. This paper mainly focuses on the implementation of the underlying infrastructure at the basis of the SAaaS. An ad-hoc architecture and some preliminary background on this challenging vision are provided and discussed.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133788809","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":"Spotcast -- A Communication Abstraction for Proximity-Based Mobile Applications","authors":"Behnaz Bostanipour, B. Garbinato, A. Holzer","doi":"10.1109/NCA.2012.34","DOIUrl":"https://doi.org/10.1109/NCA.2012.34","url":null,"abstract":"We introduce spot cast, a new communication abstraction specifically aimed at the development of mobile proximity-based applications running in mobile ad hoc networks (MANETs). Our motivation lies in the fact that traditional communication abstractions, typically broadcast primitives with strong consistency guarantees, do not adequately capture the intrinsic here-and-now nature of such applications. Rather, developers need a communication abstraction offering the notion of proximity-based diffusion and some level of message durability, which is precisely what spot cast provides. We illustrate how spot cast can be used to implement mobile applications and we shortly discuss the correctness and the implement ability of the spot cast abstraction in MANETs.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"44 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131992185","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}