2014 23rd International Conference on Computer Communication and Networks (ICCCN)最新文献_第10页

Sensor placement algorithms for confident information coverage in wireless sensor networks 无线传感器网络中可靠信息覆盖的传感器放置算法

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911802

Jiajun Zhu, Bang Wang

{"title":"Sensor placement algorithms for confident information coverage in wireless sensor networks","authors":"Jiajun Zhu, Bang Wang","doi":"10.1109/ICCCN.2014.6911802","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911802","url":null,"abstract":"Coverage is an important performance metric in wireless sensor networks, which reflects how well a sensor field is monitored by the deployed sensors. This paper studies the sensor placement problem for ensuring network coverage. Instead of using the simplistic disk coverage model, we adopt our recently proposed confident information coverage model for field attribute monitoring applications. The sensor field is divided into grid cells each with equal area, and sensors can be only placed at the center of each grid cell. Our objective is to place the least number of sensors to provide confident information coverage for all the grid points. We first formulate the sensor placement problem as a constrained optimization problem and use the exhaustive search algorithm to find the optimal solution. To reduce computation complexity, we also propose two greedy algorithms to find the approximate solutions. The simulation results show that the performance of the two proposed algorithms is close to the optimal solution obtained by the exhaustive search algorithm yet with significantly reduced computation complexity.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124080017","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}

引用次数: 13

Cache as a service: Leveraging SDN to efficiently and transparently support video-on-demand on the last mile 缓存即服务:利用SDN在最后一英里高效、透明地支持视频点播

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911775

Panagiotis Georgopoulos, M. Broadbent, B. Plattner, N. Race

{"title":"Cache as a service: Leveraging SDN to efficiently and transparently support video-on-demand on the last mile","authors":"Panagiotis Georgopoulos, M. Broadbent, B. Plattner, N. Race","doi":"10.1109/ICCCN.2014.6911775","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911775","url":null,"abstract":"High quality online video streaming, both live and on-demand, has become an essential part of consumers' every-day lives. The popularity of video streaming has placed a heavy burden on the network infrastructure that now has to transfer an enormous amount of data very quickly to the end-user. To further exacerbate the situation, the Video-on-Demand (VoD) distribution paradigm uses a unicast independent flow for each user request. This results in multiple duplicate flows carrying the same video assets many times end-to-end. We present OpenCache: a highly configurable, efficient and transparent in-network caching service that aims to improve the VoD distribution efficiency by caching video assets as close to the end-user as possible. OpenCache leverages Software Defined Networking to benefit last mile environments by improving network utilisation and increasing the Quality of Experience for the end-user. Our evaluation on a pan-European OpenFlow testbed uses adaptive video streaming and demonstrates that with the use of OpenCache, the external link utilisation is reduced by 100%. Furthermore the streaming application receives better quality video and observes higher throughput, lower latency and shorter start up and buffering times.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126422479","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}

引用次数: 40

VNetMapper: A fast and scalable approach to virtual networks embedding VNetMapper:一种快速、可扩展的虚拟网络嵌入方法

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911859

Z. Despotovic, A. Hecker, Ahsan Malik, Riccardo Guerzoni, I. Vaishnavi, R. Trivisonno, S. Beker

{"title":"VNetMapper: A fast and scalable approach to virtual networks embedding","authors":"Z. Despotovic, A. Hecker, Ahsan Malik, Riccardo Guerzoni, I. Vaishnavi, R. Trivisonno, S. Beker","doi":"10.1109/ICCCN.2014.6911859","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911859","url":null,"abstract":"Virtual network embedding is considered an important problem to solve in order to make infrastructure virtualization economically reasonable. The most efficient algorithms proposed so far define link and node mappings as optimal solutions of Integer Programming (IP) problems. They exhibit reasonably good performance only for small problem instance sizes, including few tens of nodes and links per physical substrate, few nodes and links per virtual request and a dozen of virtual requests to handle in parallel. However, we find these instances too small to be of any practical use. To address this scalability issue, we propose VNetMapper, an algorithm to solve the virtual network embedding problem based on an integer program formulation with appropriately selected objective function, variables and the set of constraints tuned to give an optimal performance. We show through simulations that VNetMapper can quickly, within seconds, solve large problem instances, involving physical substrates with hundreds of nodes and thousands of links and batches of hundreds of virtual network requests. By identifying exact properties that make VNetMapper so fast and scalable, we present guidelines for designing scalable integer programs.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128161236","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}

引用次数: 14

Streaming videos over BitTorrent by balancing playback continuity and distribution of piece rareness 通过平衡播放连续性和片段稀缺性分布的BitTorrent流媒体视频

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911868

Chow-Sing Lin, Jhe-Wei Lin

{"title":"Streaming videos over BitTorrent by balancing playback continuity and distribution of piece rareness","authors":"Chow-Sing Lin, Jhe-Wei Lin","doi":"10.1109/ICCCN.2014.6911868","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911868","url":null,"abstract":"In recent years, the BitTorrent (BT) has been one of the most efficient mechanisms for Peer-to-Peer (P2P) non-realtime content distribution. Many approaches for streaming videos over BitTorrent have been proposed by modifying the piece selection policy to cope with the real time requirement. Most of them provide the continuity of video playback at the cost of the variety of pieces on P2P streaming networks. In this paper, we propose the novel urgency-aware BT streaming mechanism, called UR-Aware, which intends to enhance the video streaming efficiency over BitTorrent on P2P networks by balancing playback continuity and distribution of piece rareness. There are two sets for piece downloading, called Uset and Rset. The Uset contains the most urgent pieces of video playback, while the Rset contains the rarest pieces. Downloading bandwidth of a peer is dynamically allocated to the two sets based on the number of consecutive pieces beyond the playback position in Uset. Furthermore, to implicitly preserve the continuity of pieces for future playback, consecutive k pieces are grouped as a section which would be selected to insert into Rset based on its rareness. The experimental results showed that the UR-Aware has the best performance among other BT streaming approaches in terms of video download time and piece late rate.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"3 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132462637","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}

引用次数: 1

Scalable area-based hierarchical control plane for software defined information centric networking 软件定义信息中心网络中基于可扩展区域的分层控制平面

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911839

Shuai Gao, Yujing Zeng, Hongbin Luo, Hongke Zhang

引用次数: 26

Preserving the Anonymity in MobilityFirst networks MobilityFirst网络的匿名性保护

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911810

K. Manandhar, B. Adcock, Xiaojun Cao

引用次数: 3

Double-ruling-based location-free data replication and retrieval scheme in mobile ad hoc networks 移动自组织网络中基于双规则的无位置数据复制与检索方案

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911822

Yao-Jen Tang, Jian-Jhih Kuo, Ming-Jer Tsai

引用次数: 4

A joint real grassmannian quantization strategy for MIMO interference alignment with limited feedback 有限反馈MIMO干扰对准的联合实格拉斯曼量化策略

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911873

W. Wu, Xu Li, Huarui Yin, Guo Wei

引用次数: 1

Maximizing charging throughput in rechargeable sensor networks 最大限度地提高可充电传感器网络的充电吞吐量

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911792

Xiaojiang Ren, W. Liang, Wenzheng Xu

{"title":"Maximizing charging throughput in rechargeable sensor networks","authors":"Xiaojiang Ren, W. Liang, Wenzheng Xu","doi":"10.1109/ICCCN.2014.6911792","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911792","url":null,"abstract":"Energy is one of the most critical optimization objectives in wireless sensor networks. Compared with renewable energy harvesting technology, wireless energy transfer based on magnetic resonant coupling is able to provide more reliable energy supplies for sensors in wireless rechargeable sensor networks. The adoption of wireless mobile chargers (mobile vehicles) to replenish sensors' energy has attracted much attention recently by the research community. Most existing studies assume that the energy consumption rates of sensors in the entire network lifetime are fixed or given in advance, and no constraint is imposed on the mobile charger (e.g., its travel distance per tour). In this paper, we consider the dynamic sensing and transmission behaviors of sensors, by providing a novel charging paradigm and proposing efficient sensor charging algorithms. Specifically, we first formulate a charging throughput maximization problem. Since the problem is NP-hard, we then devise an offline approximation algorithm and online heuristics for it. We finally conduct extensive experimental simulations to evaluate the performance of the proposed algorithms. Experimental results demonstrate that the proposed algorithms are efficient.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134470959","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}

引用次数: 62

Is more P2P always bad for ISPs? An analysis of P2P and ISP business models 更多的P2P对互联网服务提供商来说总是坏事吗?P2P和ISP的商业模式分析

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI: 10.1109/ICCCN.2014.6911841

Qi Liao, Z. Li, A. Striegel

引用次数: 3