{"title":"Flyover: A Cost-Efficient and Scale-Out Data Center Network Architecture","authors":"Sheng Xu, Binzhang Fu, Mingyu Chen, Lixin Zhang","doi":"10.1109/ICCCN.2015.7288413","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288413","url":null,"abstract":"Torus, which is simple and incrementally expandable, could perfectly fit the scale-out model of current large scale computing systems, such as data centers. However, on the downside, torus suffers from its long network diameter. One way to address this problem is using random shortcuts. However, this approach does not consider the variety of data center traffic, and leads to severe non-uniform network performance. To address this problem, we propose the Flyover, which exploits the flexibility of optical circuit switching to add on-demand shortcuts, as a cost-efficient and scale-out network architecture for DCNs. The following three features guarantee Flyover a good performance. First, a new defined serpent flow instead of the elephant flow is prioritized. Unlike the elephant flow, which is big in size, the serpent flow is big in both size and distance. Through this, the electrical torus network could be maximally relieved and the overall network performance is optimized. Second, Flyover generates region-to-region instead of the point-to-point shortcuts. Therefore, the valuable optical shortcuts could be fully utilized. Third, a semi-random heuristic algorithm is proposed to achieve the advantages of both reducing computation time and improving network performance. Furthermore, several ways to expand Flyover are discussed and evaluated to make sure that Flyover is highly scalable. Finally, Flyover is extensively analyzed and compared with its counterparts using both simulations and prototypes. The results show that Flyover could maximally improve the network throughput by 135% and latency by 277%.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126907812","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":"Utility-Based Uploading Strategy in Cloud Scenarios","authors":"Ziqi Wan, Jie Wu, Huanyang Zheng","doi":"10.1109/ICCCN.2015.7288484","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288484","url":null,"abstract":"There is a great potential to boost the performance of mobile devices by offloading computation-intensive parts of mobile applications to the cloud. However, this potential is hindered by a gap between how individual mobile devices demand computational resources and how cloud providers offer them: offloading requests from a mobile device usually require a quick response, which may be infrequent, and is subject to variable network connectivity, whereas cloud resources incur relatively long setup times, are leased for long time quanta, and are indifferent to network connectivity. In this paper, we present the design of utility-based uploads sharing strategy in cloud scenarios, which bridges the above gap through providing computation offloading as a service to mobile devices. Our scheme efficiently manages cloud resources for offloading requests to improve offloading performances of mobile devices, as well as to reduce the monetary cost per request of the provider. We also schedule offloading requests to resolve the contention problem for cloud resources. The proposed scheme makes offloading decisions with a controlled risk to overcome the uncertainties caused by variable network connectivity and program execution. Simulation results show that the proposed scheme can reduce the costs of cloud resources and enable mobile computation speedup for mobile devices.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"135 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120973325","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":"Optimizing Load Schedule for Building Energy Management in Smart Grids","authors":"K. Manandhar, Xiaojun Cao","doi":"10.1109/ICCCN.2015.7288444","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288444","url":null,"abstract":"In this paper, scheduling and control of appliance's energy consumption in a household or a small office building is studied. The household appliances include Heating, Ventilating and Air Conditioning (HVAC), and deferrable loads such as Electric Vehicle (EV) and washer/dryer. The appliances in the office building include HVAC, non-deferrable and non-interruptible loads such as computers/servers as well as deferrable and interruptible loads such as batch printing/photocopying. Given the temperature and price forecasts, a Linear Programming (LP) model for the system is derived to maximize the user comfort. The paper also presents a heuristic solution, namely Comfort Prioritizing Greedy (CPG), which employs iterative greedy algorithm to prioritize user comfort and enables the scheduling even in case of blocking. We compare our proposed greedy algorithm with the bin-packing algorithm and show that the proposed greedy algorithm can effectively be used to schedule the load in Home Energy Management (HEM) system as well as in small offices without much overhead.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"11 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":"123962569","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":"Security-Aware Resource Allocation for Mobile Cloud Computing Systems","authors":"Yanchen Liu, Myung J. Lee","doi":"10.1109/ICCCN.2015.7288465","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288465","url":null,"abstract":"In this paper, a novel resource allocation algorithm is proposed for secure mobile cloud computing systems. The mobile request for using cloud resource is classified according to its level of security requirement and the amount of required resource for remote computing. We formulate the resource allocation problem as a semi-Markov decision process under the average reward criterion, where the average reward of states is expected to be optimized. Through maximizing the long-term reward while meeting the system requirements of the blocking probability and the amount of resource requested with a security guarantee, the optimal resource allocation policy is calculated by using the linear programming. Simulation results demonstrate that the system adaptively modifies the resource allocation policy for cloud computing, and determines whether to utilize extra resource for security implementation according to the mobile request type, the current traffic, and the cloud resource availability.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"7 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":"124097859","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":"Controlled Spectrum Sensing and Scheduling under Resource Constraints","authors":"Nicolò Michelusi, U. Mitra","doi":"10.1109/ICCCN.2015.7288389","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288389","url":null,"abstract":"In this paper, a cross-layer framework to perform spectrum sensing and scheduling in agile wireless networks under resource constraints is presented. A network of secondary users (SUs) opportunistically accesses portions of the spectrum left unused by a network of licensed primary users (PUs). A central controller (CC) schedules the traffic of the SUs over the spectrum bands, based on distributed compressed spectrum sensing performed by the SUs. Both sensing and scheduling are controlled based on the current spectrum occupancy belief, with the goal to maximize the SU throughput, under constraints on the PU throughput degradation and the sensing-transmission cost incurred by the SUs. The high optimization complexity is reduced by proposing a partially myopic scheduling strategy, where the total traffic of the SUs is determined optimally via dynamic programming, whereas the allocation of the resulting total traffic across frequency bands is determined via a myopic maximization of the instantaneous trade-off between PU and SU throughputs, which can be solved efficiently using convex optimization tools. Structural results of the partially myopic scheduling strategy are proved. Simulation results demonstrate how the proposed framework allows to balance optimally the cost of acquisition of state information via distributed spectrum sensing and the cost of data transmission incurred by the SUs, while achieving the best trade-off between PU and SU throughput under the resource constraints available.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"22 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":"132335514","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":"Quantifying Benefits of Lossless Compression Utilities on Modern Smartphones","authors":"Armen Dzhagaryan, A. Milenković, Martin Burtscher","doi":"10.1109/ICCCN.2015.7288455","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288455","url":null,"abstract":"The data traffic originating on mobile computing devices has been growing exponentially over the last several years. Lossless data compression and decompression can be essential in increasing communication throughput, reducing communication latency, achieving energy-efficient communication, and making effective use of available storage. This paper experimentally evaluates several compression utilities and configurations on a modern smartphone. We characterize each utility in terms of its compression ratio, compression and decompression throughput, and energy efficiency for representative use cases. We find a wide variety of energy costs associated with data compression and decompression and provide practical guidelines for selecting the most energy efficient configurations for each use case. For data transfers over WLAN, the best configurations provide a 2.1-fold and 2.7-fold improvement in energy efficiency for compressed uploads and downloads, respectively, when compared to uncompressed data transfers. For data transfers over a mobile broadband network, the best configurations provide a 2.7-fold and 3-fold improvement in energy efficiency for compressed uploads and downloads, respectively.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"68 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":"115683184","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":"QoE-Based Interworking Call Admission, Handoff, and Packet Scheduling System for Multimedia Streaming Services over LTE Network","authors":"Wan Kim, K. Park, Hwangjun Song","doi":"10.1109/ICCCN.2015.7288454","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288454","url":null,"abstract":"This work presents a QoE-based interworking call admission, handoff, and packet scheduling system to provide a seamless multimedia streaming services over LTE network. First, QoE metrics are defined based on the amount of buffered frames at the video decoder buffer. Based on these QoE metrics, the proposed call admission algorithm estimates the cell idleness at the next call arriving time to determine the admission of a new UE and the proposed handoff algorithm determines the appropriate handoff trigger timing to keep a balance of the QoE satisfaction levels among immediately adjacent cells. The proposed packet scheduling algorithm has designed in consideration of both the QoE satisfaction levels and the wireless link states of all admitted UEs. Finally, experimental results indicate that the proposed interworking system improves the QoE satisfaction levels of all admitted UEs and overall network utilization better than other existing methods.","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":"129585280","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":"Novel Applications and Experiments on Programmable Infrastructures","authors":"Y. Minami, Kazuhisa Yamada","doi":"10.1109/ICCCN.2015.7288437","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288437","url":null,"abstract":"We show novel applications as use cases and experiments on programmable infrastructures. We have designed and implemented a programmable infrastructure called VNode on a Japanese testbed network. The VNode infrastructure allows the network developer or researcher to create a slice. A slice is a set of connected virtualized computational resources and link resources. The user can easily configure and modify own network topology and deploy service functions as software like SDN and NFV. We realize multicast streaming and adaptive bit rate streaming by deploying video processing functions in a slice. Moreover, we realize automatic function deployment that responds to traffic intensity. We conduct some experiments to confirm the feasibility and usability of our use cases and the VNode infrastructure. We establish data streaming via a slice with enhanced functionalities and measure the resource utilization rate. Furthermore, we conduct some experiments on a federated slice established between VNode and GENI, which is a programmable infrastructure in the U.S. The results show that we can enhance service functionalities and use resources more efficiently by deploying software functions on programmable infrastructures.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"26 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":"129644498","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":"Coalition Formation Towards Energy-Efficient Collaborative Mobile Computing","authors":"Liyao Xiang, Baochun Li, Bo Li","doi":"10.1109/ICCCN.2015.7288384","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288384","url":null,"abstract":"With mobile offloading, computation-intensive tasks can be offloaded from mobile devices to the cloud to conserve energy. In principle, the idea is to trade the relatively low communication energy expense for high computation power consumption. In this paper, we propose that computation-intensive tasks can be distributed among nearby mobile devices, and focus on the case that a group of mobile users may collaborate with one another with one common target job. In particular, a user can reduce its own energy consumption by delegating a portion of the job to nearby users in a coalition. We propose distributed collaboration strategies based on game theory, and formulate the problem as a non-transferable utility coalition formation game in which users join or split from coalitions depending on the local preference. The stability of the resulting partition is studied. We show through simulation that the proposed algorithm reduces up to 22% of the average energy costs compared to the non-cooperative case, and the running time scales well as the number of users grows.","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":"130662490","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":"Distributed Beamforming Relay Selection to Increase Base Station Anonymity in Wireless Ad Hoc Networks","authors":"Jon R. Ward, M. Younis","doi":"10.1109/ICCCN.2015.7288399","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288399","url":null,"abstract":"Wireless ad hoc networks have become valuable assets to both the commercial and military communities with applications ranging from industrial control on a factory floor to reconnaissance of a hostile border. In most applications, nodes act as data sources and forward information to a central base station (BS) that may also perform network management tasks. The critical role of the BS makes it a target for an adversary's attack. Even if an ad hoc network employs conventional security primitives such as encryption and authentication, an adversary can apply traffic analysis techniques to find the BS. Therefore, the BS should be kept anonymous to protect its identity, role, and location. Previous work has demonstrated distributed beamforming to be an effective technique to boost BS anonymity in wireless ad hoc networks; however, the increased anonymity and corresponding energy consumption depend on the quality and quantity of selected helper relays. In this paper we present a novel, distributed approach for determining a set of relays per hop that boosts BS anonymity using evidence theory analysis while minimizing energy consumption. The identified relay set is further prioritized using local wireless channel statistics. The simulation results demonstrate the effectiveness our approach.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":" 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132094550","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}