The 21st IEEE International Workshop on Local and Metropolitan Area Networks最新文献_第3页

Bitcoin for smart trading in smart grid 智能电网中智能交易的比特币

The 21st IEEE International Workshop on Local and Metropolitan Area Networks Pub Date : 2015-04-22 DOI: 10.1109/LANMAN.2015.7114742

M. T. Alam, H. Li, A. Patidar

引用次数: 27

Virtual function placement and traffic steering in flexible and dynamic software defined networks 灵活动态软件定义网络中的虚拟功能定位和流量控制

The 21st IEEE International Workshop on Local and Metropolitan Area Networks Pub Date : 2015-04-22 DOI: 10.1109/LANMAN.2015.7114738

Ali Mohammadkhan, S. Ghapani, Guyue Liu, Wei Zhang, K. Ramakrishnan, Timothy Wood

{"title":"Virtual function placement and traffic steering in flexible and dynamic software defined networks","authors":"Ali Mohammadkhan, S. Ghapani, Guyue Liu, Wei Zhang, K. Ramakrishnan, Timothy Wood","doi":"10.1109/LANMAN.2015.7114738","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114738","url":null,"abstract":"The integration of network function virtualization (NFV) and software defined networks (SDN) seeks to create a more flexible and dynamic software-based network environment. The line between entities involved in forwarding and those involved in more complex middle box functionality in the network is blurred by the use of high-performance virtualized platforms capable of performing these functions. A key problem is how and where network functions should be placed in the network and how traffic is routed through them. An efficient placement and appropriate routing increases system capacity while also minimizing the delay seen by flows. In this paper, we formulate the problem of network function placement and routing as a mixed integer linear programming problem. This formulation not only determines the placement of services and routing of the flows, but also seeks to minimize the resource utilization. We develop heuristics to solve the problem incrementally, allowing us to support a large number of flows and to solve the problem for incoming flows without impacting existing flows.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131006796","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}

引用次数: 109

APP: adaptively protective policy against cache thrashing and pollution APP:自适应保护策略，防止缓存抖动和污染

The 21st IEEE International Workshop on Local and Metropolitan Area Networks Pub Date : 2015-04-22 DOI: 10.1109/LANMAN.2015.7114731

Saeid Montazeri Shahtouri, Richard T. B. Ma

引用次数: 1

Power-saving NDN-based message delivery based on collaborative communication in disasters 基于灾难协同通信的省电ndn消息传递

The 21st IEEE International Workshop on Local and Metropolitan Area Networks Pub Date : 2015-04-22 DOI: 10.1109/LANMAN.2015.7114733

Suhwuk Kim, Yuki Urata, Y. Koizumi, T. Hasegawa

引用次数: 8

Making mapreduce scheduling effective in erasure-coded storage clusters 使mapreduce调度在擦除编码存储集群中有效

The 21st IEEE International Workshop on Local and Metropolitan Area Networks Pub Date : 2015-04-22 DOI: 10.1109/LANMAN.2015.7114730

Runhui Li, P. Lee

{"title":"Making mapreduce scheduling effective in erasure-coded storage clusters","authors":"Runhui Li, P. Lee","doi":"10.1109/LANMAN.2015.7114730","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114730","url":null,"abstract":"With the explosive growth of data, enterprises increasingly adopt erasure coding on storage clusters to save storage space. On the other hand, erasure coding incurs higher performance overhead, especially during recovery. This motivates us to study the feasibility of alleviating performance overhead of erasure coding, while maintaining its storage efficiency advantage. In this paper, we study the performance issue of MapReduce when it runs on erasure-coded storage. We first review our previously proposed degraded-first scheduling, which avoids network bandwidth competition among degraded map tasks in failure mode, and hence improves the MapReduce performance over the default locality-first scheduling in MapReduce. We then show that the basic degraded-first scheduling may not work effectively when there are multiple running MapReduce jobs, and hence we propose heuristics to enhance the degraded-first scheduling design. Simulations demonstrate the performance gain of our enhanced degraded-first scheduling in a multi-job scenario. Our work makes a case that a new design of MapReduce scheduling is critical when we move to erasure-coded storage.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127008732","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

A real-time method for detecting internet-wide SYN flooding attacks 一个实时的方法来检测整个互联网的SYN洪水攻击

The 21st IEEE International Workshop on Local and Metropolitan Area Networks Pub Date : 2015-04-22 DOI: 10.1109/LANMAN.2015.7114740

Lihua Miao, W. Ding, J. Gong

{"title":"A real-time method for detecting internet-wide SYN flooding attacks","authors":"Lihua Miao, W. Ding, J. Gong","doi":"10.1109/LANMAN.2015.7114740","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114740","url":null,"abstract":"Reports show that DDoS attacks are ubiquitous on the Internet and may jeopardize networks' stable operation. In order to understand the nature of this threat and further to enable effective control and management, a whole picture of the Internet-wide attacks is a necessity. Traditional methods use darknets to this end. However, with the IPv4 address space exhaustion, darknets become hard to acquire. In this paper, we seek to detect Internet-wide attacks using a live network. In particular, we focus on the most prevalent SYN flooding attacks. First, a complete attack scenario model is introduced according to the positions of the attacker, the victim and the attacking address. Then, after discussing the features of all scenarios, an algorithm named WSAND is proposed to detect Internet-wide SYN flooding attacks using Netflow data. In order to evaluate it, the algorithm is deployed at 28 main PoPs (Points of Presence) of the China Education and Research Network (CERNET) and the total internal address space is up to 200/16 blocks. A large quantity of Internet-wide SYN flooding attacks detected in March 2014 is discussed in detail. With the help of the detected attacks, a case study of detecting an internal zombie is presented.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130967516","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}

引用次数: 13

Performance modelling and analysis of mapreduce/hadoop workloads mapreduce/hadoop工作负载的性能建模和分析

The 21st IEEE International Workshop on Local and Metropolitan Area Networks Pub Date : 2015-04-01 DOI: 10.1109/LANMAN.2015.7114723

Xiao Yu, Wei Li

引用次数: 6