Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114742
M. T. Alam, H. Li, A. Patidar
Privacy aware anonymous trading for smart grid using digital currency has received very low attention so far. In this paper, we analyze the possibility of Bitcoin serving as the user friendly and effective privacy aware trading currency to facilitate energy exchange for smart grid.
{"title":"Bitcoin for smart trading in smart grid","authors":"M. T. Alam, H. Li, A. Patidar","doi":"10.1109/LANMAN.2015.7114742","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114742","url":null,"abstract":"Privacy aware anonymous trading for smart grid using digital currency has received very low attention so far. In this paper, we analyze the possibility of Bitcoin serving as the user friendly and effective privacy aware trading currency to facilitate energy exchange for smart grid.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"8 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":"114913679","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}
Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114738
Ali Mohammadkhan, S. Ghapani, Guyue Liu, Wei Zhang, K. Ramakrishnan, Timothy Wood
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.
{"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}
Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114731
Saeid Montazeri Shahtouri, Richard T. B. Ma
Least Recently Used (LRU) is the most commonly used cache replacement policy; however, it suffers from two problems: i) cache thrashing, i.e., repeated references cause continuous page evictions due to a larger size of the working set than that of the cache, and ii) cache pollution, i.e., high reuse content gets evicted by items with low or no reuse from a cache. To solve these problems, prior works divide the cache into multiple segments and keeping the history of evicted pages, which impose high overhead in terms of memory. In this paper, we propose an adaptive cache replacement policy which divides the cache into two variable-sized segments: protected and unprotected. The division of cache segments is elastic in nature and can adaptively react to the workload changes without any history of evicted pages. We conduct extensive simulations using both synthetic and real workloads. Our evaluation shows that our policy can obtain the hit ratio close to the state of the art policies which keep history information of evicted pages up to multiple times of cache size.
{"title":"APP: adaptively protective policy against cache thrashing and pollution","authors":"Saeid Montazeri Shahtouri, Richard T. B. Ma","doi":"10.1109/LANMAN.2015.7114731","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114731","url":null,"abstract":"Least Recently Used (LRU) is the most commonly used cache replacement policy; however, it suffers from two problems: i) cache thrashing, i.e., repeated references cause continuous page evictions due to a larger size of the working set than that of the cache, and ii) cache pollution, i.e., high reuse content gets evicted by items with low or no reuse from a cache. To solve these problems, prior works divide the cache into multiple segments and keeping the history of evicted pages, which impose high overhead in terms of memory. In this paper, we propose an adaptive cache replacement policy which divides the cache into two variable-sized segments: protected and unprotected. The division of cache segments is elastic in nature and can adaptively react to the workload changes without any history of evicted pages. We conduct extensive simulations using both synthetic and real workloads. Our evaluation shows that our policy can obtain the hit ratio close to the state of the art policies which keep history information of evicted pages up to multiple times of cache size.","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":"121210760","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}
Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114733
Suhwuk Kim, Yuki Urata, Y. Koizumi, T. Hasegawa
This paper proposes an NDN-based message delivery protocol over a cellular network in disasters. Collaborative communication among cellular devices is integrated into the protocol so that power consumed by battery-operated BSs (Base Stations) is reduced when a breakout occurs. A key idea is to reduce consumed radio resources by making cellular devices of which radio propagation quality is better forward messages of neighboring devices. The radio resource reduction contributes to reducing power consumed by a battery-operated BS.
{"title":"Power-saving NDN-based message delivery based on collaborative communication in disasters","authors":"Suhwuk Kim, Yuki Urata, Y. Koizumi, T. Hasegawa","doi":"10.1109/LANMAN.2015.7114733","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114733","url":null,"abstract":"This paper proposes an NDN-based message delivery protocol over a cellular network in disasters. Collaborative communication among cellular devices is integrated into the protocol so that power consumed by battery-operated BSs (Base Stations) is reduced when a breakout occurs. A key idea is to reduce consumed radio resources by making cellular devices of which radio propagation quality is better forward messages of neighboring devices. The radio resource reduction contributes to reducing power consumed by a battery-operated BS.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"24 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":"129519871","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}
Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114730
Runhui Li, P. Lee
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.
{"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}
Pub Date : 2015-04-22DOI: 10.1109/LANMAN.2015.7114740
Lihua Miao, W. Ding, J. Gong
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.
报告显示，DDoS攻击在互联网上无处不在，严重威胁网络的稳定运行。为了了解这种威胁的性质并进一步进行有效的控制和管理，有必要对整个internet范围内的攻击进行全面的了解。传统的方法使用暗网来达到这个目的。然而，随着IPv4地址空间的耗尽，暗网越来越难以获取。在本文中，我们试图使用实时网络来检测互联网范围内的攻击。我们特别关注最普遍的SYN泛洪攻击。首先，根据攻击者、被攻击对象和攻击地址的位置，建立了完整的攻击场景模型;然后，在讨论了所有场景的特征之后，提出了一种名为WSAND的算法，该算法利用Netflow数据检测全互联网范围内的SYN泛洪攻击。为了对其进行评估，将该算法部署在中国教育和研究网络(CERNET)的28个主要pop (point of Presence)上，内部总地址空间高达200/16块。详细讨论了2014年3月检测到的大量全互联网SYN泛洪攻击。借助检测到的攻击，给出了一个检测内部僵尸的案例研究。
{"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}
Pub Date : 2015-04-01DOI: 10.1109/LANMAN.2015.7114723
Xiao Yu, Wei Li
Data center is the infrastructure in big data processing, which constructs computing platform by distributed computer. The paper aims to investigate the analytical model by adopting queueing theory in data center of big data. The new queueing model developed fits the MapReduce programming model accurately and discovers the nature of the programming model. The utilizations and mean waiting times of Mapper and Reducer are obtained respectively. The effect of workload (and number of Mapper slots) on the system performance (i.e., utilization) is exposed. The significance of this paper is it explores the theoretical insight of the MapReduce programming model and provides the optimal parameter recommendation for computing resource configuration.
{"title":"Performance modelling and analysis of mapreduce/hadoop workloads","authors":"Xiao Yu, Wei Li","doi":"10.1109/LANMAN.2015.7114723","DOIUrl":"https://doi.org/10.1109/LANMAN.2015.7114723","url":null,"abstract":"Data center is the infrastructure in big data processing, which constructs computing platform by distributed computer. The paper aims to investigate the analytical model by adopting queueing theory in data center of big data. The new queueing model developed fits the MapReduce programming model accurately and discovers the nature of the programming model. The utilizations and mean waiting times of Mapper and Reducer are obtained respectively. The effect of workload (and number of Mapper slots) on the system performance (i.e., utilization) is exposed. The significance of this paper is it explores the theoretical insight of the MapReduce programming model and provides the optimal parameter recommendation for computing resource configuration.","PeriodicalId":193630,"journal":{"name":"The 21st IEEE International Workshop on Local and Metropolitan Area Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126766990","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：