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

Task Allocation for Mobile Cloud Computing in Heterogeneous Wireless Networks 异构无线网络中移动云计算的任务分配

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288473

Zongqing Lu, J. Zhao, Yibo Wu, G. Cao

引用次数: 26

OpenFlow Accelerator: A Decomposition-Based Hashing Approach for Flow Processing OpenFlow加速器:一种基于分解的流处理哈希方法

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288440

Hai Sun, Yan Sun, Victor C. Valgenti, Min Sik Kim

{"title":"OpenFlow Accelerator: A Decomposition-Based Hashing Approach for Flow Processing","authors":"Hai Sun, Yan Sun, Victor C. Valgenti, Min Sik Kim","doi":"10.1109/ICCCN.2015.7288440","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288440","url":null,"abstract":"To support scalable, flexible software-defined networking, OpenFlow is designed to provide granular traffic control across multiple vendor's network devices for efficient flow processing. Decision-tree packet classification algorithms do not scale to the number of flow table fields while decomposition algorithms such as RFC fail to provide necessary incremental update and determinism. Since searching in a single field is well studied, e.g. Longest Prefix Match (LPM) for prefix fields, we propose a decomposition approach which performs individual search on each flow table field, aggregates these results and conducts a query in a single hash table. Our approach scales well to the number of fields and allows incremental update. Meanwhile deterministic query is enabled for high-speed search. As far as we know our proposal is the first efficient decomposition approach to address multidimensional match in an OpenFlow flow table with an arbitrary number of fields as well as any match type. Theoretical analysis and experiments using synthetic classifiers justify the performance improvement.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127192065","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

Optimal Deployment of Wireless Sensor Networks for Air Pollution Monitoring 空气污染监测无线传感器网络的优化部署

2015 24th International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2015-10-05 DOI: 10.1109/ICCCN.2015.7288443

Ahmed Boubrima, Frederic Matigot, Walid Bechkit, H. Rivano, A. Ruas

引用次数: 30

Optimizing the Loads of Multi-Player Online Game Servers Using Markov Chains 基于马尔可夫链的多人在线游戏服务器负载优化

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

A. Saeed, R. Olsen, J. Pedersen

{"title":"Optimizing the Loads of Multi-Player Online Game Servers Using Markov Chains","authors":"A. Saeed, R. Olsen, J. Pedersen","doi":"10.1109/ICCCN.2015.7288445","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288445","url":null,"abstract":"Multiplayer online games are on the rise with millions of registered player and hundreds of thousands concurrent players. Current state of the art servers achieve scalability by splitting the game world into linked mini worlds that can be hosted on separate servers. One of the problems is that, players are flocking to one area, resulting in an overloaded server with decreasing Quality of Service(QoS) for the players. A number of approaches were developed to address these issues, by balancing loads between the over-loaded and under-loaded servers. This paper investigates a new dimension that is created due to the load balancing of servers. Load balancing among servers is sensitive to correct status information. The Markov based load prediction was introduced in this paper to predict load of under-loaded servers, based on arrival (μ) and departure (λ) rates of players. The prediction based algorithm is proposed to minimize the effect of out dated status information. This approach was compared with normal load status information exchange algorithm. The model presented in this paper does not deal directly with optimizing the load balancing of the server but rather tries to present a new insight that need to be considered when developing load balancing algorithm, that is the reliability of the information that is shared. Simulation results show that Markov based prediction of load information performed better from the normal load status information sharing.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124778527","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

Network Connectivity Graph for Malicious Traffic Dissection 恶意流量剖析的网络连通性图

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

E. Bocchi, L. Grimaudo, M. Mellia, Elena Baralis, Sabyasachi Saha, S. Miskovic, Gaspar Modelo-Howard, Sung-ju Lee

{"title":"Network Connectivity Graph for Malicious Traffic Dissection","authors":"E. Bocchi, L. Grimaudo, M. Mellia, Elena Baralis, Sabyasachi Saha, S. Miskovic, Gaspar Modelo-Howard, Sung-ju Lee","doi":"10.1109/ICCCN.2015.7288435","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288435","url":null,"abstract":"Malware is a major threat to security and privacy of network users. A huge variety of malware typically spreads over the Internet, evolving every day, and challenging the research community and security practitioners to improve the effectiveness of countermeasures. In this paper, we present a system that automatically extracts patterns of network activity related to a specific malicious event, i.e., a seed. Our system is based on a methodology that correlates network events of hosts normally connected to the Internet over (i) time (i.e., analyzing different samples of traffic from the same host), (ii) space (i.e., correlating patterns across different hosts), and (iii) network layers (e.g., HTTP, DNS, etc.). The result is a Network Connectivity Graph that captures the overall \"network behavior\" of the seed. That is a focused and enriched representation of the malicious pattern infected hosts exhibit, purified from ordinary network activities and background traffic. We applied our approach on a large dataset collected in a real commercial ISP where the aggregated traffic produced by more than 20,000 households has been monitored. A commercial IDS has been used to complement network data with alerts related to malicious activities. We use such alerts to trigger our processing system. Results shows that the richness of the Network Connectivity Graph provides a much more detailed picture of malicious activities, considerably enhancing our understanding.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128628282","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

Adaptive Monitoring for Mobile Networks in Challenging Environments 挑战性环境下移动网络的自适应监测

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

Nils Richerzhagen, D. Stingl, Björn Richerzhagen, A. Mauthe, R. Steinmetz

{"title":"Adaptive Monitoring for Mobile Networks in Challenging Environments","authors":"Nils Richerzhagen, D. Stingl, Björn Richerzhagen, A. Mauthe, R. Steinmetz","doi":"10.1109/ICCCN.2015.7288371","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288371","url":null,"abstract":"The increasing capabilities of mobile communication devices are changing the way people interconnect today. Similar trends in the communication technology domain are leading to the expectation that data and media are available anytime and everywhere. A result is an increasing load on communication networks. In dynamic mobile networks that particularly rely on wireless communication such data requirements paired with environmental conditions like mobility or node density increase the risk of network failure. Consequently, monitoring is crucial in mobile networks to ensure reliable and efficient operation. Current monitoring mechanisms mostly rely on a static architecture and exhibit problems to handle the changes of mobile networks and environmental conditions over time. In this paper, an adaptive monitoring mechanism is presented to overcome these limitations. The mechanism exploits the connectivity and resource characteristics of mobile communication devices to (i) reconfigure its monitoring topology and (ii) adapt to changes of mobile networks and environmental conditions. Through evaluations we show that our proposed solution reduces the achieved relative monitoring error by a factor of six and represents a robust and reliable monitoring mechanism for these challenging environments.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114885664","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}

引用次数: 19

A More Scalable Approach to Content Centric Networking 以内容为中心的网络更具可扩展性的方法

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

J. Garcia-Luna-Aceves

引用次数: 6

Modeling and Analysis of Availability in Multi-Tenant SaaS 多租户SaaS中的可用性建模与分析

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

Wenbo Su, Qu Liu, Chuang Lin, Xuemin Shen

{"title":"Modeling and Analysis of Availability in Multi-Tenant SaaS","authors":"Wenbo Su, Qu Liu, Chuang Lin, Xuemin Shen","doi":"10.1109/ICCCN.2015.7288430","DOIUrl":"https://doi.org/10.1109/ICCCN.2015.7288430","url":null,"abstract":"Software as a Service (SaaS) has become an important application development and service delivery model. Among different architectures, multi-tenant architecture (MTA) not only has advantage on maintenance, but also increases resource utilization by sharing instances. However, sharing instances brings challenges to the security of the service. As one of the three principal properties of the security, availability receives more and more attentions. Recently, there are extensive efforts on technical methods to implement a secure multi-tenant SaaS, but few works on the modeling and analysis of its availability. In this paper, we firstly present the availability issues of the multi-tenant SaaS. Two important mechanisms to implement the MTA SaaS are then introduced: network isolation and database sharing. After that, a stochastic Petri net (SPN) model is developed to analyze the availability. Specific metrics are proposed to measure the availability both from the aspects of the system and the tenant. To extend the SPN model for large scale analysis, we solve the state space explosion problem of SPN model based on the theory of Markov chain aggregation. Finally, numerical results are provided to demonstrate the effectiveness of the SPN model and the analysis is efficient.","PeriodicalId":117136,"journal":{"name":"2015 24th International Conference on Computer Communication and Networks (ICCCN)","volume":"164 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":"127379481","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

Siesta: Software-Defined Energy Efficient Base Station Control for Green Cellular Networks Siesta:绿色蜂窝网络的软件定义节能基站控制

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

Sunae Shin, Baek-Young Choi, Sejun Song

引用次数: 6

DIAMoND: Distributed Intrusion/Anomaly Monitoring for Nonparametric Detection DIAMoND:用于非参数检测的分布式入侵/异常监测

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

Maciej Korczyński, Ali Hamieh, J. Huh, Henrik Holm, S. R. Rajagopalan, N. Fefferman

引用次数: 6