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

An energy efficient algorithm based on multi-topology routing in IP networks IP网络中基于多拓扑路由的高能效算法

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

Lei Xie, Xiaoning Zhang, Sheng Wang

{"title":"An energy efficient algorithm based on multi-topology routing in IP networks","authors":"Lei Xie, Xiaoning Zhang, Sheng Wang","doi":"10.1109/ICCCN.2014.6911772","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911772","url":null,"abstract":"Energy saving in the Internet has become important since the massive new applications are increasing tremendously, along with their energy consumption. In this paper we propose an energy efficient algorithm based on multi-topology routing. Since traffic flow dynamically changed in actual IP network scenarios, the proposed algorithm has to adapt the network energy consumption to daily traffic scenarios. The proposed algorithm is a three-phases algorithm: first, one day is divided into multiple time periods according to the daily traffic flow; second, in each time period, a corresponding energy efficient sub-topology is obtained by utilizing neighboring region search to configure link weights and switch off low loaded links; last, to improve network performance (such as packet loss rate) during energy efficient sub-topology changes in different time periods, an IP fast rerouting strategy is proposed. Simulation results show that the proposed algorithm has a better performance in energy efficiency than current energy efficient algorithm, and improve the network performance during time period changes.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"29 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":"117059557","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

Preserving privacy for sensitive values of individuals in data publishing based on a new additive noise approach 基于新的加性噪声方法的数据发布中个人敏感值的隐私保护

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

Hong Zhu, Shengli Tian, Meiyi Xie, Mengyuan Yang

{"title":"Preserving privacy for sensitive values of individuals in data publishing based on a new additive noise approach","authors":"Hong Zhu, Shengli Tian, Meiyi Xie, Mengyuan Yang","doi":"10.1109/ICCCN.2014.6911855","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911855","url":null,"abstract":"The disclosure of individuals' sensitive values is a potentially serious problem in privacy preserving data publishing. The popular ℓ-diversity model is able to prevent victim' sensitive value from being revealed with a certainty higher than 1/ℓ. But, the anonymized tables with ℓ-diversity generated by the methods, such as generalization, anatomy and slicing, are all vulnerable to the attacker with some individuals' sensitive values. In this paper we propose a new approach to publish anonymized table with ℓ-diversity against the attacker having publishing algorithm and some individuals' sensitive values. Such an approach replaces the sensitive attribute (SA) value of each record with an values set consisted of the real SA value and several random noise values. The method can be applied to protect numerical and nominal SA, existing additive noise only is used to protect the numerical SA of anonymized table. Comparing with randomization, our method retains the frequency distribution of SA values of original data and retains more correlations (between SA and other attributes). Experimental evaluation shows that our method preserves more correlations than that of generalization, slicing and anatomy.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"48 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":"116142596","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

NDI: Node-dependence-based Dynamic gaming Incentive algorithm in opportunistic networks 机会网络中基于节点依赖的动态博弈激励算法

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

Ruiyun Yu, Pengfei Wang, Zhijie Zhao

引用次数: 4

A measurement study on BGP AS path looping (BAPL) behavior BGP AS路径环路(BAPL)行为度量研究

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

Shenglin Zhang, Y. Liu, Dan Pei

引用次数: 4

Two-stage detection algorithm for RoQ attack based on localized periodicity analysis of traffic anomaly 基于流量异常局部周期性分析的RoQ攻击两阶段检测算法

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

Kun Wen, Jiahai Yang, Fengjuan Cheng, Chenxi Li, Ziyu Wang, Hui Yin

{"title":"Two-stage detection algorithm for RoQ attack based on localized periodicity analysis of traffic anomaly","authors":"Kun Wen, Jiahai Yang, Fengjuan Cheng, Chenxi Li, Ziyu Wang, Hui Yin","doi":"10.1109/ICCCN.2014.6911829","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911829","url":null,"abstract":"Reduction of Quality (RoQ) attack is a stealthy denial of service attack. It can decrease or inhibit normal TCP flows in network. Victims are hard to perceive it as the final network throughput is decreasing instead of increasing during the attack. Therefore, the attack is strongly hidden and it is difficult to be detected by existing detection systems. Based on the principle of Time-Frequency analysis, we propose a two-stage detection algorithm which combines anomaly detection with misuse detection. In the first stage, we try to detect the potential anomaly by analyzing network traffic through Wavelet multiresolution analysis method. According to different time-domain characteristics, we locate the abrupt change points. In the second stage, we further analyze the local traffic around the abrupt change point. We extract the potential attack characteristics by autocorrelation analysis. By the two-stage detection, we can ultimately confirm whether the network is affected by the attack. Results of simulations and real network experiments demonstrate that our algorithm can detect RoQ attacks, with high accuracy and high efficiency.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"101 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":"125548106","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}

引用次数: 9

Characterizing the utility of smartphone background traffic 表征智能手机后台流量的效用

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

L. Meng, Shu Liu, A. Striegel

引用次数: 8

ZET: Zone and energy threshold based clustering routing protocol for Wireless Sensor Networks 基于区域和能量阈值的无线传感器网络聚类路由协议

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

Zain ul Abidin Jaffri, Yueping Cai

{"title":"ZET: Zone and energy threshold based clustering routing protocol for Wireless Sensor Networks","authors":"Zain ul Abidin Jaffri, Yueping Cai","doi":"10.1109/ICCCN.2014.6911866","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911866","url":null,"abstract":"Wireless Sensor Networks (WSNs) have an extensive range of applications but they have many challenging problems to be addressed. The energy consumption of nodes and the extension of network lifetime are among the core challenges. Energy aware routing is one of the methods to solve the energy problem of WSNs. To achieve the desired network operations the clustering (Hierarchical) routing protocols showed remarkable and outstanding improvement in prolonging the lifetime of WSNs. More significantly, heterogeneity-aware and threshold-based (application-aware) clustering routing protocols deal with more practical and realistic scenarios. In this paper, we propose a new clustering routing protocol, ZET (Zone and Energy Threshold based Clustering Routing Protocol) that is application-aware and heterogeneity-aware. In the execution environment, ZET distributed algorithm divides the whole network area into multiple zones. After dividing the nodes into multiple zones, ZET will select a cluster-head node with the highest energy-efficiency in each zone. We initially design the ZET for homogeneous network in which initial energy is same for all nodes. Then we introduce the heterogeneity in its execution network. We evaluate the performance of ZET using MATLAB simulations. The results show that ZET has better network life time, stability and throughput compared with existing routing protocols.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"23 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":"122391432","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}

引用次数: 9

Software cybernetics to manage adaptation behavior of complex network systems 管理复杂网络系统自适应行为的软件控制论

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

K. Ravindran

引用次数: 6

CDRDN: Content Driven Routing in Datacenter Network CDRDN:数据中心网络中的内容驱动路由

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

Ming Zhu, Dan Li, Y. Liu, Jianping Wu

{"title":"CDRDN: Content Driven Routing in Datacenter Network","authors":"Ming Zhu, Dan Li, Y. Liu, Jianping Wu","doi":"10.1109/ICCCN.2014.6911754","DOIUrl":"https://doi.org/10.1109/ICCCN.2014.6911754","url":null,"abstract":"A major challenge in data center networks is to provide enough network capacity to meet the ever increasing demand of large-scale distributed computing. While existing proposals focus on adding more switches and links, which cost extra hardware and energy, we explore another dimension in which spare disk space at servers is used for caching data, so as to increase network throughput without additional hardware. Leveraging the Named Data Networking (NDN) architecture and unique characteristics of data centers, we design a novel Content Driven Routing in Datacenter Network (CDRDN) that enables universal caching in data center networks in an efficient and scalable way. First, rather than using switches for “on-path” caching like in native NDN, CDRDN uses the large storage space at servers to do “off-path” caching. Second, by taking advantage of data center's regular and hierarchical network topology, CDRDN switches are able to direct requests to nearby server caches even under high dynamics of caches. Third, given the vast amount of data in data centers, the full name-based routing table would be difficult to fit in switch's limited fast memory. CDRDN adopts a compound content and location routing to ensure packet delivery while benefiting from name-based routing as much as the switches can afford. CDRDN extends NDN's adaptive forwarding mechanism to deal with cache misses, link failures, and congestion without running routing protocols or cache exchange protocols. Our packet-level simulations show that CDRDN can almost double the network throughput compared with shortest-path routing under the same setting, and CDRDN can effectively deal with link failures using adaptive forwarding.","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":"126300331","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

A lifetime model of online video popularity 在线视频人气的终身典范

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

Liang Chen, Yipeng Zhou, D. Chiu

引用次数: 15