Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00104
Yao Xu, Hiroshi Koide, Danilo Vasconcellos Vargas, K. Sakurai
In 2021, it is anticipated that there will be approximately 30 billion Internet of Things (IoT) devices. The tremendous aggregate value of the IoT makes it a tempting and lucrative target for cyber criminals. The breakout of Mirai malware, which compromises poorly secured IoT devices with factory-default username and passphrase to launch Distributed Denial of Service (DDoS) attacks, has raised broad awareness towards the need for increased IoT security. To better defend against Mirai infection and spread, it is critical to know how the malware operates as the first step. In this paper, we give a combined static and dynamic analysis of Mirai, basing on the results of which, we introduce the application of Threat Tracer. Threat tracer is an information system simulator initially developed to help design a system robust against Advanced Persistent Attacks(APT). It offers an intuitive track on how a cyber threat behaves in a complicated networked system. The feedback simultaneously contributes to revealing vulnerabilities of a system. Our work focuses on the replication of Mirai Malware's operating processes in Threat Tracer simulation. By achieving doing so, we believe it could offer a comprehensible description of how Mirai acts. Also, considering the continuous emergence of Mirai variants, the simulation serves as a predictor on upcoming threats' behavior patterns.
{"title":"Tracing MIRAI Malware in Networked System","authors":"Yao Xu, Hiroshi Koide, Danilo Vasconcellos Vargas, K. Sakurai","doi":"10.1109/CANDARW.2018.00104","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00104","url":null,"abstract":"In 2021, it is anticipated that there will be approximately 30 billion Internet of Things (IoT) devices. The tremendous aggregate value of the IoT makes it a tempting and lucrative target for cyber criminals. The breakout of Mirai malware, which compromises poorly secured IoT devices with factory-default username and passphrase to launch Distributed Denial of Service (DDoS) attacks, has raised broad awareness towards the need for increased IoT security. To better defend against Mirai infection and spread, it is critical to know how the malware operates as the first step. In this paper, we give a combined static and dynamic analysis of Mirai, basing on the results of which, we introduce the application of Threat Tracer. Threat tracer is an information system simulator initially developed to help design a system robust against Advanced Persistent Attacks(APT). It offers an intuitive track on how a cyber threat behaves in a complicated networked system. The feedback simultaneously contributes to revealing vulnerabilities of a system. Our work focuses on the replication of Mirai Malware's operating processes in Threat Tracer simulation. By achieving doing so, we believe it could offer a comprehensible description of how Mirai acts. Also, considering the continuous emergence of Mirai variants, the simulation serves as a predictor on upcoming threats' behavior patterns.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123047361","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00061
Yuta Kodera, M. Kuribayashi, Takuya Kusaka, Y. Nogami
The recent development of IoT technologies and cloud storages, many types of information including private information have been gradually outsourced. For such a situation, new convenient functionalities such as arithmetic and keyword search on ciphertexts are required to allow users to retrieve information without leaking any information. Especially, searchable encryptions have been paid much attention to realize a keyword search on an encrypted domain. In addition, an architecture of searchable symmetric encryption (SSE) is a suitable and efficient solution for data outsourcing. In this paper, we focus on an SSE scheme which employs a secure index for searching a keyword with optimal search time. In the conventional studies, it has been widely considered that the scheme searches whether a queried keyword is contained in encrypted documents. On the other hand, we additionally take into account the location of a queried keyword in documents by targeting a matrix-type data format. It enables a manager to search personal information listed per line or column in CSV-like format data.
{"title":"Advanced Searchable Encryption: Keyword Search for Matrix-Type Storage","authors":"Yuta Kodera, M. Kuribayashi, Takuya Kusaka, Y. Nogami","doi":"10.1109/CANDARW.2018.00061","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00061","url":null,"abstract":"The recent development of IoT technologies and cloud storages, many types of information including private information have been gradually outsourced. For such a situation, new convenient functionalities such as arithmetic and keyword search on ciphertexts are required to allow users to retrieve information without leaking any information. Especially, searchable encryptions have been paid much attention to realize a keyword search on an encrypted domain. In addition, an architecture of searchable symmetric encryption (SSE) is a suitable and efficient solution for data outsourcing. In this paper, we focus on an SSE scheme which employs a secure index for searching a keyword with optimal search time. In the conventional studies, it has been widely considered that the scheme searches whether a queried keyword is contained in encrypted documents. On the other hand, we additionally take into account the location of a queried keyword in documents by targeting a matrix-type data format. It enables a manager to search personal information listed per line or column in CSV-like format data.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117120436","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00018
Haobin Wang, W. Huangfu, Yaxi Liu, Cheng Gong, Yebing Ren, W. Liu
Network configurations, which maximize the accessed number of the sensor devices in IoT subjected to limited active base stations is an important topic. The weakness of traditional genetic algorithms mainly lies in that the spatial feature, i.e., the geometry distribution of base stations, is not considered. A novel genetic algorithm, in which the spatial feature of base stations is taken into account, to obtain the optimal subset of base stations in IoT is proposed. The crossover operation and the mutation operation are designated based on the spatial characteristic. Experiments have been conducted to prove the proposed algorithm for the network configuration.
{"title":"Spatial Feature Aware Genetic Algorithm of Network Base Station Configuration for Internet of Things","authors":"Haobin Wang, W. Huangfu, Yaxi Liu, Cheng Gong, Yebing Ren, W. Liu","doi":"10.1109/CANDARW.2018.00018","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00018","url":null,"abstract":"Network configurations, which maximize the accessed number of the sensor devices in IoT subjected to limited active base stations is an important topic. The weakness of traditional genetic algorithms mainly lies in that the spatial feature, i.e., the geometry distribution of base stations, is not considered. A novel genetic algorithm, in which the spatial feature of base stations is taken into account, to obtain the optimal subset of base stations in IoT is proposed. The crossover operation and the mutation operation are designated based on the spatial characteristic. Experiments have been conducted to prove the proposed algorithm for the network configuration.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116164972","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00031
Max Plauth, A. Polze
The overhead of moving data is the major limiting factor in todays hardware, especially in heterogeneous systems where data needs to be transferred frequently between host and accelerator memory. With the increasing availability of hardware-based compression facilities in modern computer architectures, this paper investigates the potential of hardware-accelerated I/O Link Compression as a promising approach to reduce data volumes and transfer time, thus improving the overall efficiency of accelerators in heterogeneous systems. Our considerations are focused on On-the-Fly compression in both Single-Node and Scale-Out deployments. Based on a theoretical analysis, this paper demonstrates the feasibility of hardware-accelerated On-the-Fly I/O Link Compression for many workloads in a Scale-Out scenario, and for some even in a Single-Node scenario. These findings are confirmed in a preliminary evaluation using software-and hardware-based implementations of the 842 compression algorithm.
{"title":"Towards Improving Data Transfer Efficiency for Accelerators Using Hardware Compression","authors":"Max Plauth, A. Polze","doi":"10.1109/CANDARW.2018.00031","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00031","url":null,"abstract":"The overhead of moving data is the major limiting factor in todays hardware, especially in heterogeneous systems where data needs to be transferred frequently between host and accelerator memory. With the increasing availability of hardware-based compression facilities in modern computer architectures, this paper investigates the potential of hardware-accelerated I/O Link Compression as a promising approach to reduce data volumes and transfer time, thus improving the overall efficiency of accelerators in heterogeneous systems. Our considerations are focused on On-the-Fly compression in both Single-Node and Scale-Out deployments. Based on a theoretical analysis, this paper demonstrates the feasibility of hardware-accelerated On-the-Fly I/O Link Compression for many workloads in a Scale-Out scenario, and for some even in a Single-Node scenario. These findings are confirmed in a preliminary evaluation using software-and hardware-based implementations of the 842 compression algorithm.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"55 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114125465","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00040
Sheng-Ta Hsieh, Chun-Ling Lin, Hao-Wen Cheng
Artificial bee colony (ABC) is a population-based optimizer. It simulates bees' social behavior for searching better solutions in solution space. Either too large or too small colony size will influence ABC's solution searching performance directly. In order to deal with the problem, in this paper, an adaptive colony is proposed. The adaptive colony will join potential bees or eliminate redundant bees, according solution searching situation. In experiments, 10 test functions of CEC 2015 are adopted for testing proposed method and compare it with three ABC variants. From the results, it can be observed that the proposed method performs better than other three related works.
{"title":"Adaptive Artificial Bee Colony for Numerical Optimization","authors":"Sheng-Ta Hsieh, Chun-Ling Lin, Hao-Wen Cheng","doi":"10.1109/CANDARW.2018.00040","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00040","url":null,"abstract":"Artificial bee colony (ABC) is a population-based optimizer. It simulates bees' social behavior for searching better solutions in solution space. Either too large or too small colony size will influence ABC's solution searching performance directly. In order to deal with the problem, in this paper, an adaptive colony is proposed. The adaptive colony will join potential bees or eliminate redundant bees, according solution searching situation. In experiments, 10 test functions of CEC 2015 are adopted for testing proposed method and compare it with three ABC variants. From the results, it can be observed that the proposed method performs better than other three related works.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128721155","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00052
H. Tominaga, Asuka Nakamura, Y. Maekawa
Generally, solving random-sparse equations requires a direct method such as the LU decomposition. This paper proposes a speed-up method based on the extended vectorized LU factorization (EMVA) method for solving random-sparse equations using the instruction-level parallelism of the CUDA GPU. It is known that EMVA on CUDA achieves high execution efficiency [1]. However, the overhead of calling the kernel of EMVA is not small because the EMVA method needs to call a new kernel each time the instruction level increases. This overhead becomes smaller when using an architecture that can switch smoothly between the CPU and GPU kernels, such as the Tegra X1 architectures. Therefore, the proposed method selects the execution architecture of each instruction level from CPU to GPU on the basis of the parallelism of its instruction level. Our evaluation result demonstrate that the proposed method achieves about x26.5 speedup compared to the existing EMVA method.
{"title":"Evaluation of EMVA Using the Instruction-Level Parallelism on Tegra X1","authors":"H. Tominaga, Asuka Nakamura, Y. Maekawa","doi":"10.1109/CANDARW.2018.00052","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00052","url":null,"abstract":"Generally, solving random-sparse equations requires a direct method such as the LU decomposition. This paper proposes a speed-up method based on the extended vectorized LU factorization (EMVA) method for solving random-sparse equations using the instruction-level parallelism of the CUDA GPU. It is known that EMVA on CUDA achieves high execution efficiency [1]. However, the overhead of calling the kernel of EMVA is not small because the EMVA method needs to call a new kernel each time the instruction level increases. This overhead becomes smaller when using an architecture that can switch smoothly between the CPU and GPU kernels, such as the Tegra X1 architectures. Therefore, the proposed method selects the execution architecture of each instruction level from CPU to GPU on the basis of the parallelism of its instruction level. Our evaluation result demonstrate that the proposed method achieves about x26.5 speedup compared to the existing EMVA method.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124751524","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00023
Ryuta Mogi, T. Nakayama, T. Asaka
In recent years, small terminals such as smartphones equipped with various sensor functions have become widespread, and studies on wireless sensor networks and edge computing are advancing from the use of the latest technology such as Internet of Things (IoT) and intelligent transport systems. However, there are still many problems such as cooperation between edges and clouds, off-load, and how to realize orchestration. In addition, research on offloading when load conditions dynamically fluctuate and load balancing among edge servers has not been investigated. In this paper, we propose a load balancing method for an IoT sensor system using multi-access edge computing to equalize the load of edge servers when events such as a traffic congestion and guerrilla rainstorms occur.
{"title":"Load Balancing Method for IoT Sensor System Using Multi-access Edge Computing","authors":"Ryuta Mogi, T. Nakayama, T. Asaka","doi":"10.1109/CANDARW.2018.00023","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00023","url":null,"abstract":"In recent years, small terminals such as smartphones equipped with various sensor functions have become widespread, and studies on wireless sensor networks and edge computing are advancing from the use of the latest technology such as Internet of Things (IoT) and intelligent transport systems. However, there are still many problems such as cooperation between edges and clouds, off-load, and how to realize orchestration. In addition, research on offloading when load conditions dynamically fluctuate and load balancing among edge servers has not been investigated. In this paper, we propose a load balancing method for an IoT sensor system using multi-access edge computing to equalize the load of edge servers when events such as a traffic congestion and guerrilla rainstorms occur.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129171004","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00025
Tamotsu Kawamura, Masaru Fukushi, Yasushi Hirano, Y. Fujita, Y. Hamamoto
Developing countermeasures against cyber attacks is an urgent issue in Internet of Things (IoT) environment, and event detection is becoming increasingly important to detect events as the presages of a security incident. This paper proposes an event detection module which can be embedded into IoT devices. The proposed module focuses on the system behavior under cyber attacks and detects events utilizing information from Network Time Protocol (NTP) commonly used in network time synchronization service. This module works under a wireless access point (AP) and detects events on IoT devices linked to the AP. Different from the existing modules, it does not require any additional appliances nor periodic maintenance involving technical knowledges. We conducted demonstration experiments with the developed module generating pseudo cyber attacks. The result shows that the proposed module achieves high recall and precision values, indicating its usefulness in the real time event detection on IoT.
{"title":"A Network-Based Event Detection Module Using NTP for Cyber Attacks on IoT","authors":"Tamotsu Kawamura, Masaru Fukushi, Yasushi Hirano, Y. Fujita, Y. Hamamoto","doi":"10.1109/CANDARW.2018.00025","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00025","url":null,"abstract":"Developing countermeasures against cyber attacks is an urgent issue in Internet of Things (IoT) environment, and event detection is becoming increasingly important to detect events as the presages of a security incident. This paper proposes an event detection module which can be embedded into IoT devices. The proposed module focuses on the system behavior under cyber attacks and detects events utilizing information from Network Time Protocol (NTP) commonly used in network time synchronization service. This module works under a wireless access point (AP) and detects events on IoT devices linked to the AP. Different from the existing modules, it does not require any additional appliances nor periodic maintenance involving technical knowledges. We conducted demonstration experiments with the developed module generating pseudo cyber attacks. The result shows that the proposed module achieves high recall and precision values, indicating its usefulness in the real time event detection on IoT.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121730111","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00087
Yuki Nanjo, Md. Al-Amin Khandaker, Takuya Kusaka, Y. Nogami
In recent years, many innovative cryptography protocols based on the pairing. Finding out an efficient extension field construction is one of the prerequisites for a practical pairing implementation. The author tries to find an elegant extension field construction which will result in efficient pairing over Barreto-Naehrig (BN) curve. In this paper, two construction methods are considered for extension field of degree 12, and one of them results in an efficient exponentiation and the other enables to compute faster Miller loop than the former one. Therefore, a method which uses a basis conversion matrix between the two extension field is proposed. In comparison to the performance of Aranha et al.'s towering, the proposed implementation results in the efficient exponentiation in a multiplicative group, although pairing cost is slightly increased.
{"title":"Consideration of Efficient Pairing Applying Two Construction Methods of Extension Fields","authors":"Yuki Nanjo, Md. Al-Amin Khandaker, Takuya Kusaka, Y. Nogami","doi":"10.1109/CANDARW.2018.00087","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00087","url":null,"abstract":"In recent years, many innovative cryptography protocols based on the pairing. Finding out an efficient extension field construction is one of the prerequisites for a practical pairing implementation. The author tries to find an elegant extension field construction which will result in efficient pairing over Barreto-Naehrig (BN) curve. In this paper, two construction methods are considered for extension field of degree 12, and one of them results in an efficient exponentiation and the other enables to compute faster Miller loop than the former one. Therefore, a method which uses a basis conversion matrix between the two extension field is proposed. In comparison to the performance of Aranha et al.'s towering, the proposed implementation results in the efficient exponentiation in a multiplicative group, although pairing cost is slightly increased.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131505568","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 : 2018-11-01DOI: 10.1109/CANDARW.2018.00076
Ryusei Saka, M. Uehara
In recent years, the use of cloud computing has become more widespread, as has the use of edge computing through distributed systems such as the Internet of Things. Instead of processing everything in the cloud, it is necessary to process information in distributed nodes. We propose the idea of managed network blocks (MNBs) in this paper, which have three features. First, MNBs provide cloud-managed network services to small networks such as home networks. Second, MNBs realizes network address translation traversal because it is based on mist architecture which consists of three components: clouds, mist (so-called cloudlets) and droplets. Mist and droplets are usually located in private local-area networks. Finally, MNBs support reconfigurable devices named droplets. In this paper, we describe the functions of droplets and how to implement them.
{"title":"Implementations of Droplets in Managed Network Blocks","authors":"Ryusei Saka, M. Uehara","doi":"10.1109/CANDARW.2018.00076","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00076","url":null,"abstract":"In recent years, the use of cloud computing has become more widespread, as has the use of edge computing through distributed systems such as the Internet of Things. Instead of processing everything in the cloud, it is necessary to process information in distributed nodes. We propose the idea of managed network blocks (MNBs) in this paper, which have three features. First, MNBs provide cloud-managed network services to small networks such as home networks. Second, MNBs realizes network address translation traversal because it is based on mist architecture which consists of three components: clouds, mist (so-called cloudlets) and droplets. Mist and droplets are usually located in private local-area networks. Finally, MNBs support reconfigurable devices named droplets. In this paper, we describe the functions of droplets and how to implement them.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117336179","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
扫码关注我们
求助内容：
应助结果提醒方式：