{"title":"RobustGeo: A Disruption-Tolerant Geo-Routing Protocol","authors":"Ruolin Fan, Yu-Ting Yu, M. Gerla","doi":"10.1109/ICCCN.2015.7288461","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288461","url":null,"abstract":"While geo-routing is a promising routing algorithm in urban vehicular ad-hoc networks (VANETs), there is still much work to be done for it to become truly usable for such environments. One of the biggest obstacles to this goal is the intermittent nature of VANETs due to mobility. Traditional geo-routing algorithms do not perform well in these conditions because they drop packets whenever they cannot find an immediate forwarder for the packet. In this paper, we propose RobustGeo, a routing protocol that combines the simplicity and efficiency of the greedy forwarding technique in geo-routing algorithms, with the robustness of delay tolerant networks in the face of disruptions in network connectivity. When there exists a good connection between the source and destination, RobustGeo can route the packet like the traditional geo-routing algorithms, and when the network faces disruptions, RobustGeo relies upon vehicle mobility and packet replication to explore multiple georoute paths and quickly recover the packet back to greedy forwarding. We show that for a highly intermittent scenario, RobustGeo has a delivery ratio of over 20% (compared to a pure geo-routing protocol's delivery ratio of 0), and it reduces delay by over 40% as compared to a more pure delay-tolerant routing solution.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126085844","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}
Siguang Chen, Chuanxin Zhao, Meng Wu, Zhixin Sun, Jian Jin
{"title":"Clustered Spatio-Temporal Compression Design for Wireless Sensor Networks","authors":"Siguang Chen, Chuanxin Zhao, Meng Wu, Zhixin Sun, Jian Jin","doi":"10.1109/ICCCN.2015.7288383","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288383","url":null,"abstract":"Since the temporal and spatial correlations of sensor readings are existent in wireless sensor networks (WSNs), this paper develops a clustered spatio-temporal compression scheme by integrating network coding (NC) and compressed sensing (CS) for correlated data. The proper selections of NC coefficients and measurement matrix are designed for this scheme. This design guarantees the reconstruction of clustered compression data successfully with an overwhelming probability and unifies the operations of NC and CS into real field successfully. Moreover, in contrast to other spatio-temporal schemes with the same computational complexity, the proposed scheme possesses lower reconstruction error by employing the independent encoding in each sensor node (including the cluster head nodes) and joint decoding in sink node. At the same time it has lower computational complexity as compared with JSM-based spatio-temporal scheme by exploiting the temporal and spatial correlations of original sensing data step by step. Finally, the simulation results verify that the clustered spatio-temporal compression scheme outperforms the other two compression schemes significantly in terms of recovery error and compression gain.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121777344","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}
Xiaoxi Ou, Yiren Shen, Zhipeng Zeng, Guanglin Zhang, L. Wang
{"title":"Cost Minimization Online Energy Management for Microgrids with Power and Thermal Storages","authors":"Xiaoxi Ou, Yiren Shen, Zhipeng Zeng, Guanglin Zhang, L. Wang","doi":"10.1109/ICCCN.2015.7288390","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288390","url":null,"abstract":"In this paper, we consider a typical microgrid scenario that consists of centralized power grid, renewable energy generation, and combined heat and power (CHP) local (co-)generation, as well as power and heat energy storage devices. We aim to minimize the microgrid's operating cost by formulating it as a stochastic non-convex optimization programming, which is challenging to solve optimally. We design an online algorithm by developing a modified Lyapunov optimization approach based on the random system inputs (e.g., the acquired electricity from power grid, the charging/discharging of the energy storage devices, obtained power from the local generator, and the renewable energy generation etc.), which does not require any statistic information of the system. Considering that the nonconvexity of the problem is caused by the dependence of power in battery pack and heat energy in thermal tank, we further explore the relation between them and convert the problem into a convex stochastic optimization programming. We show that the proposed algorithm is efficient with very low computational complexity and is proved to achieve near optimal performance. Moreover, extensive empirical evaluations using real-world traces are provided to study the effectiveness of the proposed algorithm.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"54 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120929645","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. Siby, Adriano Galati, Theodoros Bourchas, Maria Olivares, T. Gross, S. Mangold
{"title":"METhoD: A Framework for the Emulation of a Delay Tolerant Network Scenario for Media-Content Distribution in Under-Served Regions","authors":"S. Siby, Adriano Galati, Theodoros Bourchas, Maria Olivares, T. Gross, S. Mangold","doi":"10.1109/ICCCN.2015.7288425","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288425","url":null,"abstract":"Wireless communication remains to be the most efficient way of providing access to information to users in developing economies. We are interested in Delay-Tolerant Networks (DTNs) for distributing multimedia content to micro-entrepreneurs in under-served rural areas of South Africa. In our project, public commuter buses carrying WLAN-enabled devices (mobile infostations) that provide DTN connectivity are used to ferry data between urban and rural areas. Before the actual deployment in the field, rigorous lab experiments have been performed to study the performance of the proposed network design. Such an activity is time consuming and requires arduous preparation. Simulators, while convenient, do not provide the most realistic results. Given the complexity of DTN testing, we try to find a middle ground approach by building a mobility emulator testbed, which we use to emulate the network scenario. In this paper, we outline the design and implementation details of the network emulator. We then describe the experiments that were performed to study the impact of different network dynamics on content delivery, and their results. The results from the experiments are used to improve our current network design.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129767353","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":"EAFR: An Energy-Efficient Adaptive File Replication System in Data-Intensive Clusters","authors":"Yuhua Lin, Haiying Shen","doi":"10.1109/ICCCN.2015.7288402","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288402","url":null,"abstract":"In data intensive clusters, a large amount of files are stored, processed and transferred simultaneously. To increase the data availability, some file systems create and store three replicas for each file in randomly selected servers across different racks. However, they neglect the file heterogeneity and server heterogeneity, which can be leveraged to further enhance data availability and file system efficiency (in terms of replication delay and request response delay). As files have heterogeneous popularities, a rigid number of three replicas may not provide immediate response to an excessive number of read requests to hot files, and waste resources (including energy) for replicas of cold files that have few read requests. Also, servers are heterogeneous in network bandwidth, hardware configuration and capacity (i.e., the maximal number of service requests that can be supported simultaneously), it is crucial to select replica servers to ensure low replication delay and request response delay. In this paper, we propose an Energy-Efficient Adaptive File Replication System (EAFR), which incorporates three components. It is adaptive to time-varying file popularities to achieve a good tradeoff between data availability and efficiency. Higher popularity of a file leads to more replicas and vice versa. Also, to achieve energy efficiency, servers are classified into hot servers and cold servers with different energy consumption, and cold files are stored in cold servers. Further, EAFR selects a server with sufficient capacity (including network bandwidth and capacity) to hold a replica. Experimental results on a real-world cluster show the effectiveness of EAFR in reducing file read latency, replication time, and power consumption in large clusters.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131790754","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":"An Adaptive Reservation Scheme for Effective QoS Provisioning in the Cloud SDN Stack","authors":"Abiola Adegboyega","doi":"10.1109/ICCCN.2015.7288373","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288373","url":null,"abstract":"The virtualized cloud hosts multiple applications each with unique traffic characteristics necessitating QoS provisioning for its finite network resource. While hypervisor and network based virtualization techniques provide traffic isolation in multitenant cloud environments, there is a gap in their interworking & integration for effective end-to-end SLA maintenance. Recent solutions in cloud network provisioning through reservation practices have accomplished some degree of success. However they are oblivious of the entire application communication path & don't provide the requisite SLA. In this work, we develop a reservation methodology that is aware of the complex hierarchy of the cloud network. Furthermore, given the volatility of traffic generated and received by cloud tenant applications, we employ a general class of dynamic score models of time-series to develop a predictive algorithm integrated with the bandwidth provisioning framework. This solution is resident in the application layer of the SDN stack as a controller. Our methods have been tested in the OpenStack environment that integrates a layered cloud network in a real-life test-bed. Our predictive methods provide a 15% increase in accuracy over current methods while able to provide effective SLA maintenance across clients with unique QoS requirements.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134028769","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":"User Experience Driven Multi-Layered Video Based Applications","authors":"Hengky Susanto, Byung-Guk Kim, Benyuan Liu","doi":"10.1109/ICCCN.2015.7288482","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288482","url":null,"abstract":"The growing popularity for video based applications has put an enormous strain on the network and causes the network to be more prone to congestion. The study of congestion control and bandwidth allocation problems is often formulated into Network Utility Maximization (NUM) framework, and the existing solutions for NUM generally focus on single-layered applications. However, today's quality of video is divided into several layers, where each layer provides different level of enhancement of quality. In this paper, we study how multi-layered video based applications impact network performance and pricing through NUM formulation, in particularly traffic from video streaming. In our investigation, we design and implement a new multi-layered user utility model that leverages on studies of human visual perception. Then, using this new utility model to examine network activities, we demonstrate that solving NUM with multi-layered utility is intractable, and that rate allocation and network pricing may oscillate due to user behavior specific to multi-layered applications. To address this, we propose a new approach for admission control to ensure quality of service and experience.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133556198","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":"TinySet - An Access Efficient Self Adjusting Bloom Filter Construction","authors":"Gil Einziger, R. Friedman","doi":"10.1109/ICCCN.2015.7288476","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288476","url":null,"abstract":"Bloom filters are a very popular and efficient data structure for approximate set membership queries. However, Bloom filters have several key limitations as they require 44% more space than the lower bound, their operations access multiple memory words and they do not support removals. This work presents TinySet, an alternative Bloom filter construction that is more space efficient than Bloom filters for false positive rates smaller than 2.8%, accesses only a single memory word and partially supports removals. TinySet is mathematically analyzed and extensively tested and is shown to be fast and more space efficient than a variety of Bloom filter variants. TinySet also has low sensitivity to configuration parameters and is therefore more flexible than a Bloom filter.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126302954","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 New MPLS-Based Quality of Service Architecture for Wireless Mesh Networks","authors":"G. D. Stasi, S. Avallone","doi":"10.1109/ICCCN.2015.7288366","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288366","url":null,"abstract":"In this work we describe and analyze a new Quality of Service (QoS) architecture for wireless mesh networks. Such architecture is mainly composed of two components, i.e. a new admission control criteria for flows and a new link metric. The first allows to only admit flows whose required QoS (specified in terms of bandwidth) can be guaranteed, while the latter allows to maximize the number of accepted flows. In particular, the admission control criteria is designed to precisely evaluate the available bandwidth of the WMN links, which depends not only on the transmission rate of the link but also on the number and the transmission rates of the links in the neighboorhood working on the same channel. The new link metric, instead, is designed to select paths for flows so as to reduce the usage of resources. The proposed architecture relies on the ability of explicitly routing flows. To this purpose, we chose to employ MPLS (Multi Protocol Label Switching), which is able to finely control the path of each single flow. Such possibility further allows to increase the number of accepted flows by exploiting bandwidth where available.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126339477","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":"Faster Web through Client-Assisted CDN Server Selection","authors":"U. Goel, Mike P. Wittie, Moritz Steiner","doi":"10.1109/ICCCN.2015.7288411","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288411","url":null,"abstract":"Modern websites use Content Delivery Networks (CDNs) to speed up the delivery of static content. However, we show that DNS-based selection of CDN servers can be refined to fully deliver on the speedup of CDNs. We propose DNS-Proxy (dp), a client-side process that shares load-balancing functionality with CDNs by choosing from among resolved CDN servers based on last mile network performance. Our measurement study of CDN infrastructure deployed by five major CDN providers shows that dp reduces webpage load time by 29% on average. If dp has already resolved the domain, the reduction in webpage load time is as much as 40%. Finally, dp reduces the load time of individual static Web objects by as much as 43%. We argue that dp enables a more effective use of existing content delivery infrastructure and represents a complementary strategy to a continual increase of geographic content availability.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120939428","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}