Pub Date : 2018-11-01DOI: 10.1109/CANDARW.2018.00095
Tomoya Arakawa, Shun Shiramatsu, Akira Iwata
In this study, we focused on wandering behavior, which is one of symptoms of dementia patients, and developed a system for watching over such patients. In our proposed method, Bluetooth Low Energy (BLE) beacons were carried by elderly people with dementia. We installed fixed receivers in the town where we conducted this study. We visualized the wandering route by using the reception history of the BLE beacon that can be acquired from the fixed receiver. In this paper, we aimed to develop an interface that enables us to check the history of actions to narrow down the search range when an elderly person with dementia is missing. Also, by using this interface, his/her family and caregivers can check that an elderly person with dementia is in a safe place. Particularly, (1) because the signal range of the BLE beacon has been improved, it became possible for some fixed receivers to receive signal, and this solved the problem of detecting an elderly person with dementia in the vicinity. Furthermore, (2) merely displaying the shortest route is insufficient for the purpose of searching for a wandering route, and it was necessary to be able to display detour routes. To deal with these two problems, we developed a method to acquire only the reception history of the BLE beacon that is considered necessary for route visualization.
{"title":"Wandering Path Visualization System Prototype for Finding Wandering Elderly People Using BLE Beacon","authors":"Tomoya Arakawa, Shun Shiramatsu, Akira Iwata","doi":"10.1109/CANDARW.2018.00095","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00095","url":null,"abstract":"In this study, we focused on wandering behavior, which is one of symptoms of dementia patients, and developed a system for watching over such patients. In our proposed method, Bluetooth Low Energy (BLE) beacons were carried by elderly people with dementia. We installed fixed receivers in the town where we conducted this study. We visualized the wandering route by using the reception history of the BLE beacon that can be acquired from the fixed receiver. In this paper, we aimed to develop an interface that enables us to check the history of actions to narrow down the search range when an elderly person with dementia is missing. Also, by using this interface, his/her family and caregivers can check that an elderly person with dementia is in a safe place. Particularly, (1) because the signal range of the BLE beacon has been improved, it became possible for some fixed receivers to receive signal, and this solved the problem of detecting an elderly person with dementia in the vicinity. Furthermore, (2) merely displaying the shortest route is insufficient for the purpose of searching for a wandering route, and it was necessary to be able to display detour routes. To deal with these two problems, we developed a method to acquire only the reception history of the BLE beacon that is considered necessary for route visualization.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"40 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":"134266500","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.00083
Ryousuke Komiya, Yaokai Feng, K. Sakurai
Distributed Cyber Attack launched from many hosts simultaneously has become one of the most sophisticated and the most dangerous attacks in the cyber world including the traditional Internet and the SDN (Software Defined Networking) environments. As a kind of centralized network environment, the SDN has been greatly developed and popularized in recent years, especially in cloud systems. Thus, how to efficiently detect distributed attacks in SDN environments has attracted great attentions in academia and industry and various researches have been done to counter such attacks. The latest related researches made attempts to exploit the information of the PacketIn packets collected in the SDN controller and those methods proved efficient for detecting distributed cyber attacks in SDN environments. However, such methods adopted a threshold for distinguishing between attacks and normal situations. The threshold must be properly determined manually in advance, which is not easy in many applications even for experts. In this study, we try to automatically extract a proper threshold from the historical data of the monitored SDN environment so that the difficult parameter-tuning (determination of the threshold) process can be removed. In addition, because the extracted threshold can well reflect the actual situations of the monitored environment, a better detection performance than the existing approaches can be expected. The detection performance of our proposal is also tested using real traffic data.
{"title":"Detecting Distributed Cyber Attacks in SDN Based on Automatic Thresholding","authors":"Ryousuke Komiya, Yaokai Feng, K. Sakurai","doi":"10.1109/CANDARW.2018.00083","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00083","url":null,"abstract":"Distributed Cyber Attack launched from many hosts simultaneously has become one of the most sophisticated and the most dangerous attacks in the cyber world including the traditional Internet and the SDN (Software Defined Networking) environments. As a kind of centralized network environment, the SDN has been greatly developed and popularized in recent years, especially in cloud systems. Thus, how to efficiently detect distributed attacks in SDN environments has attracted great attentions in academia and industry and various researches have been done to counter such attacks. The latest related researches made attempts to exploit the information of the PacketIn packets collected in the SDN controller and those methods proved efficient for detecting distributed cyber attacks in SDN environments. However, such methods adopted a threshold for distinguishing between attacks and normal situations. The threshold must be properly determined manually in advance, which is not easy in many applications even for experts. In this study, we try to automatically extract a proper threshold from the historical data of the monitored SDN environment so that the difficult parameter-tuning (determination of the threshold) process can be removed. In addition, because the extracted threshold can well reflect the actual situations of the monitored environment, a better detection performance than the existing approaches can be expected. The detection performance of our proposal is also tested using real traffic data.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"2019 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":"131439237","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.00055
Kenya Yamada, T. Katagiri, H. Takizawa, K. Minami, M. Yokokawa, Toru Nagai, M. Ogino
In numerical libraries for sparse matrix operations, there are many tuning parameters related to implementation selection. Selection of different tuning parameters could result in totally different performance. Moreover, optimal implementation depends on the sparse matrices to be operated. It is difficult to find optimal implementation without executing each implementation and thereby examining its performance on a given sparse matrix. In this study, we propose an implementation selection method for sparse iterative algorithms and preconditioners in a numerical library using deep learning. The proposed method uses full color images to represent the features of a sparse matrix. We present an image generation method for partitioning a given matrix (to generate its feature image) so that the value of each matrix element is considered in the implementation selection. We then evaluate the effectiveness of the proposed method by conducting a numerical experiment. In this experiment, the accuracy of implementation selection is evaluated. The training data comprise a pair of sparse matrix and its optimal implementation. The optimal implementation of each sparse matrix in the training data is obtained in advance by executing every implementation and getting the best one. The experimental results obtained using the proposed method show that the accuracy of selecting the optimal implementation of each sparse matrix is 79.5%.
{"title":"Preconditioner Auto-Tuning Using Deep Learning for Sparse Iterative Algorithms","authors":"Kenya Yamada, T. Katagiri, H. Takizawa, K. Minami, M. Yokokawa, Toru Nagai, M. Ogino","doi":"10.1109/CANDARW.2018.00055","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00055","url":null,"abstract":"In numerical libraries for sparse matrix operations, there are many tuning parameters related to implementation selection. Selection of different tuning parameters could result in totally different performance. Moreover, optimal implementation depends on the sparse matrices to be operated. It is difficult to find optimal implementation without executing each implementation and thereby examining its performance on a given sparse matrix. In this study, we propose an implementation selection method for sparse iterative algorithms and preconditioners in a numerical library using deep learning. The proposed method uses full color images to represent the features of a sparse matrix. We present an image generation method for partitioning a given matrix (to generate its feature image) so that the value of each matrix element is considered in the implementation selection. We then evaluate the effectiveness of the proposed method by conducting a numerical experiment. In this experiment, the accuracy of implementation selection is evaluated. The training data comprise a pair of sparse matrix and its optimal implementation. The optimal implementation of each sparse matrix in the training data is obtained in advance by executing every implementation and getting the best one. The experimental results obtained using the proposed method show that the accuracy of selecting the optimal implementation of each sparse matrix is 79.5%.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"15 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":"132868056","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.00080
Yuya Ban, Toshihiro Yamauchi
Use-after-free (UAF) vulnerabilities, are abused by exploiting a dangling pointer that refers to a freed memory, location and then executing arbitrary code. Vulnerabilities are caused by bugs in software programs, particularly large scale programs such as browsers. We had previously proposed HeapRevolver, which prohibits freed memory area from being reused for a certain period. HeapRevolver on Windows uses the number of freed memory areas that are prohibited for reuse as a trigger to release the freed memory area. Alternatively, HeapRevolver uses the number of the freed memory areas as a threshold for releasing freed memory. However, when the size of individual freed memory area is large, HeapRevolver on Windows increases the memory overhead. In this paper, we propose an improved HeapRevolver for Windows considering the size and number of the freed memory areas. The improved HeapRevolver prohibits the reuse of a certain number of freed memory areas at a given time by considering the size and number of freed memory areas as thresholds. Evaluation results demonstrate that the improved HeapRevolver can prevent attacks that exploit UAF vulnerabilities. Particularly, when the size of individual freed memory area is small in a program, HeapRevolver is effective in decreasing the attack success rate.
{"title":"Mitigating Use-after-Free Attack Using Library Considering Size and Number of Freed Memory","authors":"Yuya Ban, Toshihiro Yamauchi","doi":"10.1109/CANDARW.2018.00080","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00080","url":null,"abstract":"Use-after-free (UAF) vulnerabilities, are abused by exploiting a dangling pointer that refers to a freed memory, location and then executing arbitrary code. Vulnerabilities are caused by bugs in software programs, particularly large scale programs such as browsers. We had previously proposed HeapRevolver, which prohibits freed memory area from being reused for a certain period. HeapRevolver on Windows uses the number of freed memory areas that are prohibited for reuse as a trigger to release the freed memory area. Alternatively, HeapRevolver uses the number of the freed memory areas as a threshold for releasing freed memory. However, when the size of individual freed memory area is large, HeapRevolver on Windows increases the memory overhead. In this paper, we propose an improved HeapRevolver for Windows considering the size and number of the freed memory areas. The improved HeapRevolver prohibits the reuse of a certain number of freed memory areas at a given time by considering the size and number of freed memory areas as thresholds. Evaluation results demonstrate that the improved HeapRevolver can prevent attacks that exploit UAF vulnerabilities. Particularly, when the size of individual freed memory area is small in a program, HeapRevolver is effective in decreasing the attack success rate.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"17 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":"132709883","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.00047
Naoki Matsumura, Hiroki Tokura, Yuki Kuroda, Yasuaki Ito, K. Nakano
Image-to-image translation is a task of mapping an image in one domain to a corresponding image in another domain. The task includes various types of problems such as super-resolution, colorization, and artistic style transfer. In recent years, with the advent of deep learning, the technology has been rapidly advanced. The main purpose of this paper is to propose a tile art image generation method using machine learning approach based on conditional generative adversarial networks. To make the training data set of tile art images, we adopted a square-pointillism image generation method using the greedy approach. After training, the proposed network can generate tile art images that have the structure of tiles and reproduce the original images well. As regards generating time, the greedy approach takes 1322 seconds to generate tile art image of size 4096x3072, while the proposed machine learning approach takes 0.593 seconds.
{"title":"Tile Art Image Generation Using Conditional Generative Adversarial Networks","authors":"Naoki Matsumura, Hiroki Tokura, Yuki Kuroda, Yasuaki Ito, K. Nakano","doi":"10.1109/CANDARW.2018.00047","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00047","url":null,"abstract":"Image-to-image translation is a task of mapping an image in one domain to a corresponding image in another domain. The task includes various types of problems such as super-resolution, colorization, and artistic style transfer. In recent years, with the advent of deep learning, the technology has been rapidly advanced. The main purpose of this paper is to propose a tile art image generation method using machine learning approach based on conditional generative adversarial networks. To make the training data set of tile art images, we adopted a square-pointillism image generation method using the greedy approach. After training, the proposed network can generate tile art images that have the structure of tiles and reproduce the original images well. As regards generating time, the greedy approach takes 1322 seconds to generate tile art image of size 4096x3072, while the proposed machine learning approach takes 0.593 seconds.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"52 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":"114314317","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.00075
Yoshiomi Otsuka, T. Aramaki
Planungszelle (PZ) has attracted attention as a new consensus formation method. One of the core features of PZ is random sampling of participants, aimed at securing the diversity of participant attributes. In this research, a method for selecting participants that ensures the diversity of their attributes was developed through an online questionnaire on PZ implementation to discuss the future of a sustainable water use system. To select PZ participants, we carried out a screening survey with registered monitors and asked candidates about their willingness to participate, as well as collected the demographics and psychographics of monitors. Participation requests were sent by e-mail, controlled by real-time monitoring with the demographics and psychographics information of candidates. This method enables the PZ organizer to easily control participant selection and reduces lead-time by a factor of ten in comparison with the traditional mail method.
{"title":"Application of an Online Questionnaire to Secure the Diversity of Planungszelle Participant Attributes","authors":"Yoshiomi Otsuka, T. Aramaki","doi":"10.1109/CANDARW.2018.00075","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00075","url":null,"abstract":"Planungszelle (PZ) has attracted attention as a new consensus formation method. One of the core features of PZ is random sampling of participants, aimed at securing the diversity of participant attributes. In this research, a method for selecting participants that ensures the diversity of their attributes was developed through an online questionnaire on PZ implementation to discuss the future of a sustainable water use system. To select PZ participants, we carried out a screening survey with registered monitors and asked candidates about their willingness to participate, as well as collected the demographics and psychographics of monitors. Participation requests were sent by e-mail, controlled by real-time monitoring with the demographics and psychographics information of candidates. This method enables the PZ organizer to easily control participant selection and reduces lead-time by a factor of ten in comparison with the traditional mail method.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"35 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":"114712005","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.00094
Masahiro Arai, F. Akagi, Saneyasu Yamaguchi, K. Yoshida
Parallelization with a message passing interface (MPI) is useful for improving the performance of the LLG micromagnetics simulator used for analysis of magnetization behavior. However, it is necessary to transpose elements of 3-D data arrays to be consistent in the data. In this paper, we investigated two methods for improving the performance of the transpose processes. One divides 6-transpose-processes in a triple for loop into 6-triple for loops. The other transposes the elements of the 3-D data arrays in each process before the data is integrated by using MPI_Allgather(). We compared the effects of the two methods on improving performances on two supercomputers: Oakforest-PACS and Reedbush-U. The results show that the former method was only effective on Oakforest-PACS, but the latter method was effective on both computers.
{"title":"Improving Performance of Transposition Algorithm of 3-D Data Array for Parallelization Using Message Passing Interface","authors":"Masahiro Arai, F. Akagi, Saneyasu Yamaguchi, K. Yoshida","doi":"10.1109/CANDARW.2018.00094","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00094","url":null,"abstract":"Parallelization with a message passing interface (MPI) is useful for improving the performance of the LLG micromagnetics simulator used for analysis of magnetization behavior. However, it is necessary to transpose elements of 3-D data arrays to be consistent in the data. In this paper, we investigated two methods for improving the performance of the transpose processes. One divides 6-transpose-processes in a triple for loop into 6-triple for loops. The other transposes the elements of the 3-D data arrays in each process before the data is integrated by using MPI_Allgather(). We compared the effects of the two methods on improving performances on two supercomputers: Oakforest-PACS and Reedbush-U. The results show that the former method was only effective on Oakforest-PACS, but the latter method was effective on both computers.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"49 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":"115546866","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.00022
Yudai Kaneko, T. Asaka
Blockchain technology which is the fundamental system of Bitcoin running on a peer-to-peer (P2P) network, has attracted a lot of attention. This enables a practical P2P electronic money system with Byzantine fault tolerance and stability with all participating nodes having the same transaction ledger and using a distributed consensus algorithm called Proof of Work (PoW) that performs calculation work called mining. Many studies have proposed methods of enhancing scalability in terms of transaction processing of blockchain, however few studies have proposed them in term of network load in a P2P network architecture. To solve these problems, we propose a method in which all nodes are separated into mining nodes in a pure P2P network and blockchain data having nodes in a distributed hash table (DHT) network. Kademlia is incorporated as DHT network for processing responsible blocks' data for each node cluster and broadcasting efficiently. The results of a broadcast simulation show that our method improved the redundancy rate and average number of messages in the networks.
{"title":"DHT Clustering for Load Balancing Considering Blockchain Data Size","authors":"Yudai Kaneko, T. Asaka","doi":"10.1109/CANDARW.2018.00022","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00022","url":null,"abstract":"Blockchain technology which is the fundamental system of Bitcoin running on a peer-to-peer (P2P) network, has attracted a lot of attention. This enables a practical P2P electronic money system with Byzantine fault tolerance and stability with all participating nodes having the same transaction ledger and using a distributed consensus algorithm called Proof of Work (PoW) that performs calculation work called mining. Many studies have proposed methods of enhancing scalability in terms of transaction processing of blockchain, however few studies have proposed them in term of network load in a P2P network architecture. To solve these problems, we propose a method in which all nodes are separated into mining nodes in a pure P2P network and blockchain data having nodes in a distributed hash table (DHT) network. Kademlia is incorporated as DHT network for processing responsible blocks' data for each node cluster and broadcasting efficiently. The results of a broadcast simulation show that our method improved the redundancy rate and average number of messages in the networks.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"44 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":"114653403","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.00103
Joji Toshima, Akiko Takahashi
In Japan, agriculture is facing a crisis due to the aging of farmers and the shortage of successors. In addition, there is much work in agriculture based on know-how that new farmers cannot get easily; therefore, some new farmers give up farming after a few years. Consequently, it is necessary to share the know-how with new farmers. However, it is difficult to positively share the know-how due to the difficulty of verbalizing the know-how. Therefore, it is necessary to provide the know-how providers with an incentive. In this paper, we propose an incentive decision method using auto-negotiation while considering the intentions of the know-how providers. This method consists of agents that have utility functions, which express the intentions of farmers and a service. The performances of our method are investigated by simulation experiments. Specifically, we verify that the method collects more high-quality know-how while giving a lower incentive. Our results indicate that the proposed method better performs compared to the other simple methods we assume in the experiments.
{"title":"Design of an Incentive Decision Method for an Agriculture Information Sharing System","authors":"Joji Toshima, Akiko Takahashi","doi":"10.1109/CANDARW.2018.00103","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00103","url":null,"abstract":"In Japan, agriculture is facing a crisis due to the aging of farmers and the shortage of successors. In addition, there is much work in agriculture based on know-how that new farmers cannot get easily; therefore, some new farmers give up farming after a few years. Consequently, it is necessary to share the know-how with new farmers. However, it is difficult to positively share the know-how due to the difficulty of verbalizing the know-how. Therefore, it is necessary to provide the know-how providers with an incentive. In this paper, we propose an incentive decision method using auto-negotiation while considering the intentions of the know-how providers. This method consists of agents that have utility functions, which express the intentions of farmers and a service. The performances of our method are investigated by simulation experiments. Specifically, we verify that the method collects more high-quality know-how while giving a lower incentive. Our results indicate that the proposed method better performs compared to the other simple methods we assume in the experiments.","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":"121348233","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.00067
Donghong Qin, Lina Ge, Ting Lv
To deploy multipath inter-domain routing, this paper tries to integrate our designed incentive mechanism into multipath inter-domain routing and propose an Incentive Driving Multi-path Inter-domain Routing scheme (IDMIR). Under the incentive mechanism, it can collect the path-let information from the selected nodes from the feasible BGP paths and build a scale-limited topology to compute the special routes. Meanwhile, it can adjust the protocol performance by configuring the path-let visibility degree (R) and topological nodes size (N). The simulation results demonstrate that IDMIR has strong path discovery capability with reasonable overhead.
{"title":"Incentive Driving Multipath Inter-Domain Routing","authors":"Donghong Qin, Lina Ge, Ting Lv","doi":"10.1109/CANDARW.2018.00067","DOIUrl":"https://doi.org/10.1109/CANDARW.2018.00067","url":null,"abstract":"To deploy multipath inter-domain routing, this paper tries to integrate our designed incentive mechanism into multipath inter-domain routing and propose an Incentive Driving Multi-path Inter-domain Routing scheme (IDMIR). Under the incentive mechanism, it can collect the path-let information from the selected nodes from the feasible BGP paths and build a scale-limited topology to compute the special routes. Meanwhile, it can adjust the protocol performance by configuring the path-let visibility degree (R) and topological nodes size (N). The simulation results demonstrate that IDMIR has strong path discovery capability with reasonable overhead.","PeriodicalId":329439,"journal":{"name":"2018 Sixth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"49 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":"124321740","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
扫码关注我们
求助内容：
应助结果提醒方式：