Muhammad Ahmad Rathore, Muhammad Usman, JongWon Kim
OF@TEIN (OpenFlow @ Trans-Eurasian Information Network) Playground has brought the monitoring challenges of SDN-enabled multi-site clouds. In order to address the monitoring challenges, we have been developing a multi-layered visibility solution denoted as SmartX Multi-View Framework (MVF). By integrating active monitoring with SmartX MVF, in this paper, we present restricted topology-awareness of OF@TEIN Playground.
OF@TEIN (OpenFlow @ Trans-Eurasian Information Network) Playground带来了sdn支持的多站点云的监控挑战。为了应对监控方面的挑战，我们一直在开发一种多层可见性解决方案，称为SmartX多视图框架(MVF)。通过将主动监控与SmartX MVF集成，本文提出了OF@TEIN Playground的受限拓扑感知。
{"title":"Integrating Active Monitoring for Restricted Topology-awareness of SmartX Multi-View Playground Visibility","authors":"Muhammad Ahmad Rathore, Muhammad Usman, JongWon Kim","doi":"10.1145/3226052.3226053","DOIUrl":"https://doi.org/10.1145/3226052.3226053","url":null,"abstract":"OF@TEIN (OpenFlow @ Trans-Eurasian Information Network) Playground has brought the monitoring challenges of SDN-enabled multi-site clouds. In order to address the monitoring challenges, we have been developing a multi-layered visibility solution denoted as SmartX Multi-View Framework (MVF). By integrating active monitoring with SmartX MVF, in this paper, we present restricted topology-awareness of OF@TEIN Playground.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131819198","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}
Eunsoo Kim, Kuyju Kim, Dongsoon Shin, Beomjin Jin, Hyoungshick Kim
It is becoming increasingly necessary for organizations to build a Cyber Threat Intelligence (CTI) platform to fight against sophisticated attacks. To reduce the risk of cyber attacks, security administrators and/or analysts can use a CTI platform to aggregate relevant threat information about adversaries, targets and vulnerabilities, analyze it and share key observations from the analysis with collaborators. In this paper, we introduce CyTIME (Cyber Threat Intelligence ManagEment framework) which is a framework for managing CTI data. CyTIME can periodically collect CTI data from external CTI data repositories via standard interfaces such as Trusted Automated Exchange of Indicator Information (TAXII). In addition, CyTIME is designed to automatically generate security rules without human intervention to mitigate discovered new cybersecurity threats in real time. To show the feasibility of CyTIME, we performed experiments to measure the time to complete the task of generating the security rule corresponding to a given CTI data. We used 1,000 different CTI files related to network attacks. Our experiment results demonstrate that CyTIME automatically generates security rules and store them into the internal database within 12.941 seconds on average (max = 13.952, standard deviation = 0.580).
{"title":"CyTIME","authors":"Eunsoo Kim, Kuyju Kim, Dongsoon Shin, Beomjin Jin, Hyoungshick Kim","doi":"10.1145/3226052.3226056","DOIUrl":"https://doi.org/10.1145/3226052.3226056","url":null,"abstract":"It is becoming increasingly necessary for organizations to build a Cyber Threat Intelligence (CTI) platform to fight against sophisticated attacks. To reduce the risk of cyber attacks, security administrators and/or analysts can use a CTI platform to aggregate relevant threat information about adversaries, targets and vulnerabilities, analyze it and share key observations from the analysis with collaborators. In this paper, we introduce CyTIME (Cyber Threat Intelligence ManagEment framework) which is a framework for managing CTI data. CyTIME can periodically collect CTI data from external CTI data repositories via standard interfaces such as Trusted Automated Exchange of Indicator Information (TAXII). In addition, CyTIME is designed to automatically generate security rules without human intervention to mitigate discovered new cybersecurity threats in real time. To show the feasibility of CyTIME, we performed experiments to measure the time to complete the task of generating the security rule corresponding to a given CTI data. We used 1,000 different CTI files related to network attacks. Our experiment results demonstrate that CyTIME automatically generates security rules and store them into the internal database within 12.941 seconds on average (max = 13.952, standard deviation = 0.580).","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129494027","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}
Si Young Jang, Yoonhyung Lee, B. Shin, Dongman Lee
We explore issues and challenges for application-aware virtualization in edge Internet-of-Things (IoT) clouds. Since a large number of IoT devices reside in network edges, it is necessary for a current edge computing technology to virtualize them not only as computational resources but also functional resources for achieving the goal of a specific service, which we call application-aware virtualization. This requires translation of abstract application requirements into IoT resource allocation policies using the knowledge of relationships between application layer semantics and underlying device functionalities and status. We implement a prototype for proof-of-concept and show that it is able to dynamically allocate and reallocate IoT resources to applications according to the application's requirements and contexts changes with a reasonably small processing overhead.
{"title":"Towards Application-Aware Virtualization for Edge IoT Clouds","authors":"Si Young Jang, Yoonhyung Lee, B. Shin, Dongman Lee","doi":"10.1145/3226052.3226059","DOIUrl":"https://doi.org/10.1145/3226052.3226059","url":null,"abstract":"We explore issues and challenges for application-aware virtualization in edge Internet-of-Things (IoT) clouds. Since a large number of IoT devices reside in network edges, it is necessary for a current edge computing technology to virtualize them not only as computational resources but also functional resources for achieving the goal of a specific service, which we call application-aware virtualization. This requires translation of abstract application requirements into IoT resource allocation policies using the knowledge of relationships between application layer semantics and underlying device functionalities and status. We implement a prototype for proof-of-concept and show that it is able to dynamically allocate and reallocate IoT resources to applications according to the application's requirements and contexts changes with a reasonably small processing overhead.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129518390","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}
This poster addresses the problem of Network Utility Maximization (NUM) where multiple resources (computing/networking) participate in user services. NUM has usually been solved by Backpressure algorithms which has to build up queue size gradualy. This disadvantage stands out in the situation of multi-resource environment or multi-hop networking. To address the problem, we propose a reinforcement learning based algorithm that utilizes future prediction to overcome the previous limitation of non-learning based algorithms.
{"title":"Learning based Utility Maximization for Multi-Resource Management: Poster Abstract","authors":"Donghoon Lee, S. Chong","doi":"10.1145/3226052.3226060","DOIUrl":"https://doi.org/10.1145/3226052.3226060","url":null,"abstract":"This poster addresses the problem of Network Utility Maximization (NUM) where multiple resources (computing/networking) participate in user services. NUM has usually been solved by Backpressure algorithms which has to build up queue size gradualy. This disadvantage stands out in the situation of multi-resource environment or multi-hop networking. To address the problem, we propose a reinforcement learning based algorithm that utilizes future prediction to overcome the previous limitation of non-learning based algorithms.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122059757","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}
The network applications become more complex such that they need to integrate big data. An emerging problem in current networks is scalability, such as the size of BGP routing table or the multihoming problem. The Locator/Identifier Separation Protocol (LISP) is a protocol to solve such problems. The main concept underlying LISP is a separation between the identifier and the locator. However, few studies have focussed on fault management in LISP mapping system. In this study, we design a fault management system for LISP mapping system on the Software-Defined Network (SDN) controller and modifying the functionality of the tunnel router. We introduce new control messages and processes to check for the survival of LISP mapping system and create a backup of records among controllers. Furthermore, we design and implement functionalities to exchange controller information among the tunnel routers. We implement a scenario to test our fault management system.
{"title":"Design and Implementation of Fault-Tolerant LISP Mapping System","authors":"Junemuk Choi, Jian Li, J. W. Hong","doi":"10.1145/3226052.3226061","DOIUrl":"https://doi.org/10.1145/3226052.3226061","url":null,"abstract":"The network applications become more complex such that they need to integrate big data. An emerging problem in current networks is scalability, such as the size of BGP routing table or the multihoming problem. The Locator/Identifier Separation Protocol (LISP) is a protocol to solve such problems. The main concept underlying LISP is a separation between the identifier and the locator. However, few studies have focussed on fault management in LISP mapping system. In this study, we design a fault management system for LISP mapping system on the Software-Defined Network (SDN) controller and modifying the functionality of the tunnel router. We introduce new control messages and processes to check for the survival of LISP mapping system and create a backup of records among controllers. Furthermore, we design and implement functionalities to exchange controller information among the tunnel routers. We implement a scenario to test our fault management system.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127231410","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}
Since existing methods using entropy are less effective in characterizing encrypted traffic, this paper proposes an encrypted traffic identification method based on n-gram entropy and cumulative sum. This method analyzes the entropy characteristics of n-gram entropy for text, picture, compressed file, and encrypted traffic in the network. Furthermore, an analysis of cumulative sum is performed to better distinguish compressed file traffic and encrypted traffic. The experiments show that our propsed method reaches high accuracy for encrypted traffic identification and performs well in distinguishing compressed file traffic and encrypted traffic.
{"title":"Encrypted Traffic Identification Based on N-gram Entropy and Cumulative Sum Test","authors":"Guang Cheng, Ying Hu","doi":"10.1145/3226052.3226057","DOIUrl":"https://doi.org/10.1145/3226052.3226057","url":null,"abstract":"Since existing methods using entropy are less effective in characterizing encrypted traffic, this paper proposes an encrypted traffic identification method based on n-gram entropy and cumulative sum. This method analyzes the entropy characteristics of n-gram entropy for text, picture, compressed file, and encrypted traffic in the network. Furthermore, an analysis of cumulative sum is performed to better distinguish compressed file traffic and encrypted traffic. The experiments show that our propsed method reaches high accuracy for encrypted traffic identification and performs well in distinguishing compressed file traffic and encrypted traffic.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131224885","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}
Yaqiu Zhou, Yongmao Ren, Xu Zhou, Zhentao Li, Pengfei Fan
Data center networks have become important infrastructures in cloud computing. TCP Incast is a common challenge for data center networks. Although many researchers have tried to address this issue, there is no optimal solution yet. In this paper, different from current effort in IP networks, we try to mitigate the TCP Incast issue by innovatively adopting a new network architecture-Named Data Networking (NDN). Taking advantage of the receiver-driven transfer model and the in-network caching mechanism of NDN, we propose a novel packet request algorithm which can avoid the congestion and we have implemented the algorithm in ndnSIM. Simulation results show that our algorithm can mitigate the TCP Incast issue effectively.
{"title":"A Congestion Control Mechanism for Data Center Networks Based on Named Data Networking","authors":"Yaqiu Zhou, Yongmao Ren, Xu Zhou, Zhentao Li, Pengfei Fan","doi":"10.1145/3226052.3226055","DOIUrl":"https://doi.org/10.1145/3226052.3226055","url":null,"abstract":"Data center networks have become important infrastructures in cloud computing. TCP Incast is a common challenge for data center networks. Although many researchers have tried to address this issue, there is no optimal solution yet. In this paper, different from current effort in IP networks, we try to mitigate the TCP Incast issue by innovatively adopting a new network architecture-Named Data Networking (NDN). Taking advantage of the receiver-driven transfer model and the in-network caching mechanism of NDN, we propose a novel packet request algorithm which can avoid the congestion and we have implemented the algorithm in ndnSIM. Simulation results show that our algorithm can mitigate the TCP Incast issue effectively.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130684148","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}
Keyao Zhang, J. Bi, Yangyang Wang, Yu Zhou, Zhengzheng Liu
Tunneling over IP has been widely used in the field of network virtualization, overlay network, heterogeneous network, and so on. Nonetheless, there exists maintenance difficulty, management complexity, low efficiency in tunneling. SDN provides open and unified APIs, which greatly enhances the network management efficiency. However, as a significant southbound interface, OpenFlow does not primitively support the establishment of IP tunnels, therefore it still relies on traditional manual configurations. In this paper, we adopt Match-Action Table (MAT) programming model and propose a new IP tunnel mechanism, called MAT tunnel. The MAT tunnel can encapsulate and decapsulate packets directly by installing flow rules instead of manually configuring tunnel ports. We implement the MAT tunnel prototype based on Open vSwitch and Floodlight. We also construct a simulation environment based on a real topology. Comparing traditional tunnels, the MAT tunnel can reduce the average delay while improving the programmability and flexibility. In addition, the tunnel path switching tests suggest the MAT tunnel can significantly decrease the delay jitter and throughput loss.
{"title":"Tunneling over IP Based on Match-Action Table in Software Defined Networks","authors":"Keyao Zhang, J. Bi, Yangyang Wang, Yu Zhou, Zhengzheng Liu","doi":"10.1145/3226052.3226054","DOIUrl":"https://doi.org/10.1145/3226052.3226054","url":null,"abstract":"Tunneling over IP has been widely used in the field of network virtualization, overlay network, heterogeneous network, and so on. Nonetheless, there exists maintenance difficulty, management complexity, low efficiency in tunneling. SDN provides open and unified APIs, which greatly enhances the network management efficiency. However, as a significant southbound interface, OpenFlow does not primitively support the establishment of IP tunnels, therefore it still relies on traditional manual configurations. In this paper, we adopt Match-Action Table (MAT) programming model and propose a new IP tunnel mechanism, called MAT tunnel. The MAT tunnel can encapsulate and decapsulate packets directly by installing flow rules instead of manually configuring tunnel ports. We implement the MAT tunnel prototype based on Open vSwitch and Floodlight. We also construct a simulation environment based on a real topology. Comparing traditional tunnels, the MAT tunnel can reduce the average delay while improving the programmability and flexibility. In addition, the tunnel path switching tests suggest the MAT tunnel can significantly decrease the delay jitter and throughput loss.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130522900","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}
Unknown traffic is a serious problem in network traffic classification for network management and security, since it degrades the performance of a traffic classifier. We propose a machine learning-based classifier that can not only categorize the traffic of known classes but also detect unknown traffic in data imbalanced network environment, where frequency of traffic from one application outweighs that of other application. We improved the previous RTC model by adding data preprocessing module and simulated with synthesized dataset to show the effect of the data imbalance problem on classification accuracy and to validate the performance of our model in data-imbalanced network environment.
{"title":"Unknown Flow Detection with Imbalanced Traffic Data: Poster Abstract","authors":"Jeongmin Bae, S. Chong","doi":"10.1145/3226052.3226058","DOIUrl":"https://doi.org/10.1145/3226052.3226058","url":null,"abstract":"Unknown traffic is a serious problem in network traffic classification for network management and security, since it degrades the performance of a traffic classifier. We propose a machine learning-based classifier that can not only categorize the traffic of known classes but also detect unknown traffic in data imbalanced network environment, where frequency of traffic from one application outweighs that of other application. We improved the previous RTC model by adding data preprocessing module and simulated with synthesized dataset to show the effect of the data imbalance problem on classification accuracy and to validate the performance of our model in data-imbalanced network environment.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127858299","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}
The Sixth International Conference on Future Internet Technologies (CFI 2011) continues the tradition of being the forum for early work on Future Internet research. This year we received 42 submissions and accepted 21 (8 Regular and 13 Short) papers out of them. Each paper was extensively reviewed by more than three members of the Technical Program Committee. As the goal of CFI 2011 is to be the nurturing platform for budding research, the Technical Program Committee put much effort to return encouraging reviews and also scout for promising ideas.
{"title":"Proceedings of the 13th International Conference on Future Internet Technologies","authors":"D. Kim","doi":"10.1145/3226052","DOIUrl":"https://doi.org/10.1145/3226052","url":null,"abstract":"The Sixth International Conference on Future Internet Technologies (CFI 2011) continues the tradition of being the forum for early work on Future Internet research. This year we received 42 submissions and accepted 21 (8 Regular and 13 Short) papers out of them. Each paper was extensively reviewed by more than three members of the Technical Program Committee. As the goal of CFI 2011 is to be the nurturing platform for budding research, the Technical Program Committee put much effort to return encouraging reviews and also scout for promising ideas.","PeriodicalId":409980,"journal":{"name":"Proceedings of the 13th International Conference on Future Internet Technologies","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133509336","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
扫码关注我们
求助内容：
应助结果提醒方式：