2015 24th International Conference on Computer Communication and Networks (ICCCN)最新文献_第8页

DST: Leveraging Delay-Insensitive Workload in Cloud Storage for Smart Home Network DST:在智能家庭网络的云存储中利用延迟不敏感的工作负载

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288401

Suiming Guo, Liang Chen, D. Chiu

引用次数: 1

InfoMax: An Information Maximizing Transport Layer Protocol for Named Data Networks 一种用于命名数据网络的信息最大化传输层协议

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288420

Jongdeog Lee, Akash Kapoor, Md. Tanvir Al Amin, Zhehao Wang, Zeyuan Zhang, Radhika Goyal, T. Abdelzaher

{"title":"InfoMax: An Information Maximizing Transport Layer Protocol for Named Data Networks","authors":"Jongdeog Lee, Akash Kapoor, Md. Tanvir Al Amin, Zhehao Wang, Zeyuan Zhang, Radhika Goyal, T. Abdelzaher","doi":"10.1109/ICCCN.2015.7288420","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288420","url":null,"abstract":"The advent of social networks, mobile sensing, and the Internet of Things herald an age of data overload, where the amount of data generated and stored by various data services exceeds application consumption needs. In such an age, an increasingly important need of data clients will be one of data sub-sampling. This need calls for novel data dissemination protocols that allow clients to request from the network a representative sampling of data that matches a query. In this paper, we present the design of a new transport-layer dissemination protocol, called InfoMax, that allows applications to request such a data sampling. InfoMax exploits the recently proposed named-data-networking (NDN) stack that makes networks aware of hierarchical data names, as opposed to IP addresses. Assuming that named objects with longer prefixes are semantically more similar, InfoMax has the property of minimizing semantic redundancy among delivered data items, hence offering the best coverage of the requested topic with the fewest bytes. The paper discusses the design of InfoMax, its experimental evaluation, and example applications.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114146536","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}

引用次数: 10

Discovering the Densest Subgraph in MapReduce for Assortative Big Natural Graphs 分类大自然图MapReduce中最密集子图的发现

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288397

Bo Wu, Haiying Shen

{"title":"Discovering the Densest Subgraph in MapReduce for Assortative Big Natural Graphs","authors":"Bo Wu, Haiying Shen","doi":"10.1109/ICCCN.2015.7288397","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288397","url":null,"abstract":"Discovering the densest subgraph is important in graph analysis, which has wide-ranging applications from social network community mining to the discovery of biological network modules. However, the previous algorithms neglect the connectivity of the dense subgraph since it is a challenge to give consideration to both subgraph structure and time efficiency. As a result, it may lead to isolated subgraphs in the output though they aim to find one connected dense subgraph. Also, there are lacking of efficient algorithms for big natural graphs, especially considering datasets become increasingly larger in this era of Big Data. Furthermore, previous algorithms fail to take advantage of various features of natural graphs (e.g., power-law degree distribution, homophyly of vertices, and power-law community size) which can be applied to improve the efficiency and precision of the densest subgraph discovery. To handle these problems, we design a heuristic algorithm for discovering the connected densest subgraph for massive undirected graphs in a MapReduce framework by taking advantage of the features of natural graphs. Experimental results show that our algorithm is capable of discovering the connected densest subgraph. Also, it can reduce the running times by 62% for average and discover denser subgraphs in 50% of the real datasets and 88% of the simulated datasets comparing with previous algorithm in a MapReduce framework.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680231","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}

引用次数: 8

SCmesh: Solar-Powered Wireless Smart Camera Mesh Network SCmesh:太阳能无线智能摄像机网状网络

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288462

Leland Miller, Kevin Abas, K. Obraczka

引用次数: 4

Mitigating SDN Controller Performance Bottlenecks 缓解SDN控制器性能瓶颈

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288429

C. Caba, José Soler

引用次数: 9

On Effectiveness of Smart Grid Applications Using Co-Simulation 基于联合仿真的智能电网应用有效性研究

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288438

Paul Moulema, Wei Yu, D. Griffith, N. Golmie

引用次数: 18

Disseminating Authorized Content in Interest-Centric Opportunistic Social Networks 在以兴趣为中心的机会主义社交网络中传播授权内容

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288398

C. Kong, Xiaojun Cao

{"title":"Disseminating Authorized Content in Interest-Centric Opportunistic Social Networks","authors":"C. Kong, Xiaojun Cao","doi":"10.1109/ICCCN.2015.7288398","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288398","url":null,"abstract":"The authorized content is the content which can only be generated by the content provider (CP). The content copies delivered to a user may bring some reward to the CP if the content is adopted by the user. The overall reward obtained by the CP depends on how much the user is interested in the content and how the user may help disseminate the content copies. Hence, to maximize the reward obtained, the content provider are motivated to disseminate the authorized content to the most interested users. In this paper, we study how to effectively disseminate the authorized content in interest-centric opportunistic social networks (IOSNs) such that the reward is maximized. We first derive the Social Connection Pattern (SCP) to statistically describe the interest distribution of the users contacted or connected. The SCP is used to predict the interests of possible contactors and connectors. We then propose our Social Connection Pattern based Dissemination algorithm (SCPD) to calculate the best number of content copies to disseminate when two users meet. Our dataset based simulation shows that our SCPD algorithm is effective and efficient to disseminate the authorized content in IOSNs","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121227081","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}

引用次数: 5

Enhancing and Implementing Fully Transparent Internet Voting 加强和实施完全透明的互联网投票

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288408

Kevin Butterfield, Huian Li, X. Zou, Feng Li

引用次数: 1

Road Network-Aware Anonymization in Mobile Systems with Reciprocity Support 互惠支持下移动系统中道路网络感知匿名化

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288459

Bhuvan Bamba, Ling Liu, Emre Yigitoglu

{"title":"Road Network-Aware Anonymization in Mobile Systems with Reciprocity Support","authors":"Bhuvan Bamba, Ling Liu, Emre Yigitoglu","doi":"10.1109/ICCCN.2015.7288459","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288459","url":null,"abstract":"Most existing solutions on location anonymization fail to address the issue of location privacy protection for mobile users traveling on road networks. In this paper, we present a road network-aware privacy model to handle the location privacy problem in mobile systems. We present third party supported anonymization which can be plugged into existing mobile systems without major modifications. As opposed to current road network specific solutions, our system has the following salient features. First, we argue that the graph density of a cloaked subgraph is an important location cloaking quality measure for road network-based location privacy protection. High graph density leads to high utility of the cloaked location with respect to spatial resolution. Second, we devise a suite of graph-based cloaking algorithms which guarantee reciprocity - an important location cloaking property that many existing approaches fail to support - under an enhanced privacy model. Further, we use controlled randomization in the cloaking process to provide higher privacy strength while maintaining the utility of the cloaked location. Last but not the least, our experimental evaluation shows the efficiency and robustness of the approach in terms of privacy, utility and performance of the model.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133140742","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

REduce: Removing Redundancy from Regular Expression Matching in Network Security REduce:在网络安全中去除正则表达式匹配中的冗余

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-08-01 DOI: 10.1109/ICCCN.2015.7288457

Victor C. Valgenti, Min Sik Kim, Sung-il Oh, Inbok Lee

{"title":"REduce: Removing Redundancy from Regular Expression Matching in Network Security","authors":"Victor C. Valgenti, Min Sik Kim, Sung-il Oh, Inbok Lee","doi":"10.1109/ICCCN.2015.7288457","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288457","url":null,"abstract":"Regular expressions have become a fixture in network security systems such as Network Intrusion Detection, Spam email filtering, and Antivirus. Unfortunately, regular expressions require considerably more resources in matching over fixed binary or character strings. Much research has focused on improving matching architectures or hardware support to create more efficient regular expression matching. This research, however, investigated whether or not the regular expression set itself contained any lever that might make for creating more efficient automata prior to moving such automata to any specific matching architecture or hardware. We found that typical Non-deterministic Finite Automata (NFA) construction methodologies create redundant paths in the NFA when used with the complex rule-sets employed in network security. This stems directly from the fact that creating optimized NFA is a hard problem. As such, we created REduce, a tool that uses shared prefixes among regular expressions as a heuristic to eliminate redundant paths among shared prefixes within constructed NFA. The end result is smaller matching automata (between 4-50% depending on the rule-set) and a 4-900% improvement in throughput due to reductions in active state. More importantly, REduce only targets NFA construction, thus the generated NFA can be converted to any specific matching architecture or hardware for cumulative improvement.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114208846","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}

引用次数: 3