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

A fine-grained spatial cloaking scheme for privacy-aware users in Location-Based Services 在基于位置的服务中，为具有隐私意识的用户提供了一种细粒度的空间隐身方案

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

Ben Niu, Qinghua Li, Xiao-yan Zhu, Hui Li

引用次数: 35

Virtual network embedding: An optimal decomposition approach 虚拟网络嵌入:一种最优分解方法

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

Qian Hu, Yang Wang, Xiaojun Cao

{"title":"Virtual network embedding: An optimal decomposition approach","authors":"Qian Hu, Yang Wang, Xiaojun Cao","doi":"10.1109/ICCCN.2014.6911723","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911723","url":null,"abstract":"In network virtualization, a traditional ISP collapses into two independent tiers, where the infrastructure provider (InP) manages the physical (or substrate) networks and the service provider (SP) operates the service (or virtual) networks. In this work, we investigate the virtual network embedding (VNE) problem, which bridges above two tiers by mapping the virtual network request to the substrate networks. Existing VNE approaches are either optimal Integer Linear Programming formulations that suffer from extensive computational time, or relaxation/heuristics (mostly decompose the VNE problem into link mapping (LM) and node assignment (NA) sub-problems) that are unable to provide an optimal solution or near-optimal solution with guaranteed quality. In this paper, we attempt to fill this gap with a new VNE solution, which relies on an iterative process enabling feedbacks between the NA, and LM sub-problems (obtained based on the Primal-dual analysis of the VNE problem). With our approach, one can reach either an optimal solution or a near optimal solution with a per-instance guarantee on its closeness to the optimal solution.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"2 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":"129988201","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}

引用次数: 16

The store-and-flood distributed reflective denial of service attack 存储-泛滥分布式反射式拒绝服务攻击

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

Bingshuang Liu, Skyler Berg, Jun Yu Li, Tao Wei, Chao Zhang, Xinhui Han

引用次数: 3

PASA: Passive broadcast for smartphone ad-hoc networks PASA:用于智能手机自组织网络的无源广播

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

Ying Mao, Jiayin Wang, Joseph Paul Cohen, B. Sheng

引用次数: 21

Topology and migration-aware energy efficient virtual network embedding for green data centers 绿色数据中心的拓扑和迁移感知节能虚拟网络嵌入

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

Xinjie Guan, Baek-Young Choi, Sejun Song

{"title":"Topology and migration-aware energy efficient virtual network embedding for green data centers","authors":"Xinjie Guan, Baek-Young Choi, Sejun Song","doi":"10.1109/ICCCN.2014.6911768","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911768","url":null,"abstract":"With the rapid proliferation of data centers, their energy consumption and green house gas emissions have significantly increased. Some efforts have been made to control and lower energy consumption of data centers such as proportional energy consuming hardware, dynamic provisioning and virtual-ization machine techniques. However, it is still common that many servers and network resources are often underutilized, and idle servers spend a large portion of their peak power consumption. We first built a novel model of a network virtualization in order to minimize energy usage in data centers for both computing and network resources by taking practical factors into consideration. Due to the NP-hardness of the proposed model, we have developed a heuristic algorithm for virtual network scheduling and mapping, considering expected energy consumption at different times, a data center architecture, and virtual network migration, as well as operation costs. Our evaluation results show that our algorithm could reduce energy consumption up to 40%, and take up to 57% higher number of virtual network requests over other existing virtual mapping schemes.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"57 32 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":"122719695","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}

引用次数: 16

Attacks/faults detection and isolation in the Smart Grid using Kalman Filter 基于卡尔曼滤波的智能电网攻击/故障检测与隔离

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

K. Manandhar, Xiaojun Cao

引用次数: 7

One-time symmetric key based cloud supported secure smart meter reading 基于云的一次性对称密钥支持安全智能抄表

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

Kewei Sha, Chenguang Xu, Zhiwei Wang

引用次数: 7

An effective online scheme for detecting Android malware 一个有效的检测Android恶意软件的在线方案

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

Shuang Liang, Xiaojiang Du, C. C. Tan, Wei Yu

引用次数: 4

A probabilistic approach towards modeling email network with realistic features 具有真实特征的电子邮件网络建模的概率方法

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

Quangang Li, Jinqiao Shi, Tingwen Liu, Li Guo, Zhiguang Qin

{"title":"A probabilistic approach towards modeling email network with realistic features","authors":"Quangang Li, Jinqiao Shi, Tingwen Liu, Li Guo, Zhiguang Qin","doi":"10.1109/ICCCN.2014.6911760","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911760","url":null,"abstract":"Email plays a very important role in our daily life. Much work have been put into practice on email network. Those studies mostly require real email network datasets and reliable models to analyze user information and understand the mechanisms of network evolution. However, much research work is constrained by the absence of real large-scale email datasets. Although email communication is ubiquitous, there are very few large-scale available email datasets satisfied different research purposes. Due to privacy policy and restricted permissions, it is arduous to collect a real large-scale email dataset in a short time. Various social network models are usually used to create synthetic email networks. However, these models focus on modeling several structural properties of network without considering user behaviour patterns. They are not appropriate to generate large-scale realistic synthetic email network datasets. Towards this end, we propose a probabilistic model by which we can construct large-scale synthetic email datasets with a small captured email log. What is more important is that the generated synthetic dataset matches real email network properties and individual communication patterns. Moreover, it has linear complexity, and can be paralleled easily. Experimental results on Enron dataset demonstrate the above benefits of our model.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"37 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":"126414299","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}

引用次数: 0

An online mechanism for dynamic instance allocation in reserved instance marketplace 预留实例市场中动态实例分配的在线机制

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

Min Yao, Chuang Lin

{"title":"An online mechanism for dynamic instance allocation in reserved instance marketplace","authors":"Min Yao, Chuang Lin","doi":"10.1109/ICCCN.2014.6911763","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911763","url":null,"abstract":"As one of the pricing model offered by Amazon, reserved instance enables users to reserve capacities for their EC2 instances and lowers their average instance cost. To attract more users to adopt the reserved instance, Amazon has provided a platform named Reserved Instance Marketplace to give users the flexibility to sell the remainder of their reserved instances as their needs change. However, the present trading mechanism inside the Reserved Instance Marketplace requires the reserved instance sellers to sell their reserved capacities at month level and set the upfront fee by themselves, which is not flexible enough and hard for an inexperienced seller to specify a suitable upfront fee. To address this problem, this paper proposes an online mechanism for the Reserved Instance Marketplace. Our online mechanism tries to maximize the sellers' revenue by dynamically allocating the reserved capacities among various buyers without the need of specifying upfront fee in advance. The competitive ratio of the online allocation algorithm inside our mechanism is proved to be within a small constant factor of optimal competitive ratio in theory. To evaluate the performance of our online mechanism, we conduct simulations on synthetic data and real data trace from one of Google clusters. The simulation results show that our online mechanism can achieve at least 55% of the offline optimal algorithm in most cases.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"39 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":"132352984","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}

引用次数: 6