2018 27th International Conference on Computer Communication and Networks (ICCCN)最新文献_第9页

INCEPT: INcremental ControllEr PlacemenT in Software Defined Networks INCEPT:软件定义网络中的增量控制器放置

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487454

T. Das, G. Mohan

{"title":"INCEPT: INcremental ControllEr PlacemenT in Software Defined Networks","authors":"T. Das, G. Mohan","doi":"10.1109/ICCCN.2018.8487454","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487454","url":null,"abstract":"In almost a decade, Software Defined Networking (SDN) has transitioned from university laboratories to real-life networks. As networks evolve from legacy networks to hybrid OSPF/SDN networks to pure SDN networks, the associated challenge of appropriate controller placement - i.e. optimal count and location of controllers in an SDN network - need to be suitably addressed. Several studies investigated the controller placement problem at a point in time primarily from a latency minimization approach, in addition to various secondary objectives. However, considering long-term network growth, it is also important to evaluate the best timing to introduce a controller in an SDN network. In this paper, we introduce and formulate the incremental (multi- period) controller placement problem to add controllers in an SDN network in a phased manner over a finite planning horizon. We consider a practical scenario with increasing network traffic, as well as falling capital and operational expenditures of SDN controllers on account of vendor competition and technology maturity. We propose a multi-objective optimization model to derive the optimal multi- period controller roll-out plan. Using extensive simulations, we evaluate our solution in terms of various performance metrics and find that our multi-period placement schedule attains significant cost savings over single-period placement schedule at the cost of a small and acceptable increase in switch-controller latency.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117054191","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

Wi-Count: Passing People Counting with COTS WiFi Devices Wi-Count:使用COTS WiFi设备进行人流计数

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487420

Yanni Yang, Jiannong Cao, Xuefeng Liu, Xiulong Liu

{"title":"Wi-Count: Passing People Counting with COTS WiFi Devices","authors":"Yanni Yang, Jiannong Cao, Xuefeng Liu, Xiulong Liu","doi":"10.1109/ICCCN.2018.8487420","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487420","url":null,"abstract":"People counting provides valuable information on population mobility and human dynamics, which plays a critical role for intelligent crowd control and retail management. Recently, people counting has been achieved via radio-frequency signals as human presence can influence the propagation of wireless signals, from which the information of the moving crowd can be extracted. However, most of the existing studies using wireless signals only apply to the scenario when people keep moving all the time. Besides, they require labour-intensive training phase for building the counting model. In the Wi-Count system, we take another approach, which is to count the people passing by the doorway with COTS WiFi devices. It can not only detect the passing direction, but also identify the number of people even when multiple persons pass by concurrently without regulating passing behavior and pre-trained counting model. The passing direction is recognized by modeling the effects of the bi-directional passing behavior on the phase difference of WiFi signals. In addition, the number of passing people is obtained through an enhanced signal separation algorithm for providing precise counting result. Extensive experiments show the average accuracy on passing direction detection and passing people counting are about 95% and 92% respectively.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117183943","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}

引用次数: 31

Centralized versus Distributed Efficient Route Computation with Multiply-Constrained Link Costs 基于多重约束链路成本的集中式与分布式高效路由计算

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487425

Rajesh Bajracharya, J. Daigle

{"title":"Centralized versus Distributed Efficient Route Computation with Multiply-Constrained Link Costs","authors":"Rajesh Bajracharya, J. Daigle","doi":"10.1109/ICCCN.2018.8487425","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487425","url":null,"abstract":"We quantify and compare the complexities of two computational algorithms, the Floyd-Warshall algorithm and a widest-remaining- path-first algorithm (WRaPFt), which we introduce here, that compute abstract node representations for autonomous systems in hierarchical networks. Both algorithms compute the traversing characteristics under bandwidth dependent link costs and give identical results. The techniques discussed here can be applied to any cost metrics that can be defined as elements of a semi-ring. We compare the execution time and the number of steps required to compute the efficient frontiers for the case of flow-controlled cost functions. For all node pairs, we found WRaPFt to be faster at lower connectivities and Floyd- Warshall to be faster at higher connectivities, the crossover point being roughly 0.5. Execution time for the WRaPFt algorithm is never more than 1.7 times the execution time of the Floyd-Warshall algorithm. Thus, WRaPFt can provide a speed-up factor of 1.7/ V in routing table update computation. Finally, we found that the execution time increases approximately proportional to the 4th power of V for both algorithms for fully connected random test networks.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124365841","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 Extended Exploration to the Epidemic Containment Game 传染病控制博弈的扩展探索

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487370

Jia-Hao Xu, Zhen Wang, Guanghai Cui, Yizhi Ren, Hong Ding, Kim-Kwang Raymond Choo

{"title":"An Extended Exploration to the Epidemic Containment Game","authors":"Jia-Hao Xu, Zhen Wang, Guanghai Cui, Yizhi Ren, Hong Ding, Kim-Kwang Raymond Choo","doi":"10.1109/ICCCN.2018.8487370","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487370","url":null,"abstract":"The epidemic containment game is a formulation to describe voluntary vaccination behaviors before epidemic spreading. This game relies on the characterization of the susceptible-infected- susceptible (SIS) model in terms of the spectral radius of the network. Existing researches showed that finding the worst Nash Equilibrium (NE) is NP-hard and used a heuristic algorithm called Low Degree (LDG) to estimate the maximum social cost under the worst NE (Max NE cost). By comparing the results of the LDG algorithm and exhaustive search, we found the LDG algorithm cannot estimate Max NE cost well, thus, we proposed a new neighbor information based algorithm to estimate Max NE cost in this paper. Moreover, we discussed Stackelberg strategies in which some nodes are secured first by a leader, then other agents choose their strategies voluntarily. We found the target (TAR) strategy is effective to reduce Max NE cost in a scale- free network when T is large and useless when T is low (T is the ratio of the recovery rate to the transmission rate in the SIS model). Moreover, we found that a lot of nodes with small degrees are secured voluntarily under the TAR strategy when T is low, which leads to high Max NE cost. At last, we proposed a new greedy algorithm to select nodes secured first, which can reduce Max NE cost when T is low.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130616478","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}

引用次数: 2

New Reliable Self-Adaptive Routing Protocol for Vehicular Ad Hoc Network 一种新的可靠自适应车载自组织网络路由协议

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487442

De-gan Zhang, Yue Dong, Jie Zhang, Ting Zhang

引用次数: 2

2018 ICCCN Technical Program Overview 2018 ICCCN技术方案概述

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/icccn.2018.8487311

引用次数: 0

Protecting the Privacy of Networked Multi-Agent Systems Controlled over the Cloud 保护通过云控制的网络多代理系统的隐私

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487355

A. Sultangazin, S. Diggavi, P. Tabuada

引用次数: 5

FastQ: QoS Control Based on the Time Sequence of First Few Packets FastQ:基于前几个报文时间顺序的QoS控制

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487392

A. Myat, Masaru Onodera, Y. Tobe

引用次数: 0

Estimating Short Connection Capacity on High Performance User Level Network Stack 高性能用户级网络堆栈短连接容量估计

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/ICCCN.2018.8487397

Jingmin Xie, Wenxue Cheng, Tong Zhang, Danfeng Shan, Fengyuan Ren

{"title":"Estimating Short Connection Capacity on High Performance User Level Network Stack","authors":"Jingmin Xie, Wenxue Cheng, Tong Zhang, Danfeng Shan, Fengyuan Ren","doi":"10.1109/ICCCN.2018.8487397","DOIUrl":"https://doi.org/10.1109/ICCCN.2018.8487397","url":null,"abstract":"Short connections are generally used to transfer small-size messages, which contribute a large part of workload in modern applications. The maximum sustainable short connection rate, which is called short connection capacity, is an important index for admission control, Web QoS control, and energy saving. A capacity estimation mechanism aims to find the workload just saturating the server, and it relies on both workload information and system information. Past researches point out that kernel space network stack becomes the bottleneck when a huge number of concurrent short connections coexist. On the other hand, high performance user level network stacks have been proved to eliminate such bottleneck, thus become a hot research topic in both academia and industry. However, they also bring challenges for estimating short connection capacity, making traditional methods ineffective. Therefore, it is important to find a new method to estimate short connection capacity on high performance user level network stacks. In this paper, we prove that the effective CPU utilization is an adaptive index to different workload patterns and application complexities, which can reflect the server state. Then we design and implement an online capacity estimator on the Seastar platform. We conduct experiments to verify the effectiveness of our online capacity estimator. The results show that our estimator can actually estimate the capacity online. When the server is near saturated, the 90th percentile relative estimating error is no more than 9.18%. Furthermore, our capacity estimator only introduces no more than 1.38% of capacity loss in our experiments.","PeriodicalId":399145,"journal":{"name":"2018 27th International Conference on Computer Communication and Networks (ICCCN)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121839869","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

Panel II: Research Challenges on Networks in Social Spaces 分论坛二:社会空间中网络的研究挑战

2018 27th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2018-07-01 DOI: 10.1109/icccn.2018.8487310

引用次数: 0