Pub Date : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449178
Sheng Hu, Chongwu Dong, Wushao Wen
Deep Neural Network (DNN) based artificial intelligence help driving the great development of mobile Internet. However, the hardware of a mobile device may not be sufficiently to meet the computational requirements of a DNN inference task. Fortunately, computation offloading to the network edge can mitigate part of computation pressure for mobile devices. In this case, DNN computation in mobile devices can be accelerated by an edge-assistance collaborative inference scheme. Since co-inference tasks with multiple processing stages may continuously arrive at mobile devices, only considering one DNN-based task for acceleration is not practical. To solve the above challenge effectively, we formulate the problem of multiple co-inference tasks acceleration as a pipeline execution model. Based on the model, we design a fine-grained optimizer, which integrates model partition, model early-exit and intermediate data compression, to achieve tradeoff between accuracy and latency. Considering computational characteristics of a pipeline, the goal of the optimizer is designed to ensure the pipeline system's inference rate and single task execution performance. We implement the system prototype and do benchmark tests under a real-life testbed and the results prove the effectiveness of the optimizer.
{"title":"Enable Pipeline Processing of DNN Co-inference Tasks In the Mobile-Edge Cloud","authors":"Sheng Hu, Chongwu Dong, Wushao Wen","doi":"10.1109/ICCCS52626.2021.9449178","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449178","url":null,"abstract":"Deep Neural Network (DNN) based artificial intelligence help driving the great development of mobile Internet. However, the hardware of a mobile device may not be sufficiently to meet the computational requirements of a DNN inference task. Fortunately, computation offloading to the network edge can mitigate part of computation pressure for mobile devices. In this case, DNN computation in mobile devices can be accelerated by an edge-assistance collaborative inference scheme. Since co-inference tasks with multiple processing stages may continuously arrive at mobile devices, only considering one DNN-based task for acceleration is not practical. To solve the above challenge effectively, we formulate the problem of multiple co-inference tasks acceleration as a pipeline execution model. Based on the model, we design a fine-grained optimizer, which integrates model partition, model early-exit and intermediate data compression, to achieve tradeoff between accuracy and latency. Considering computational characteristics of a pipeline, the goal of the optimizer is designed to ensure the pipeline system's inference rate and single task execution performance. We implement the system prototype and do benchmark tests under a real-life testbed and the results prove the effectiveness of the optimizer.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130740021","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}
In order to solve the problem that the normal fertilization robot cannot feed different species of plants in one time, an intelligent fertilization robot based on image recognitions was designed. Based on the customers' requirements, the system we designed can supply the machine ability of normal plants classification and auto fertilization after verifying the plants. In this paper, the Intelligent Fertilization System Based on Image Recognition will be introduced but base on the data leakage of dataset, it requires the plants to be pictured in the same background.
{"title":"Intelligent Fertilization System Based on Image Recognition","authors":"Zhe Sun, Wei Feng, Jintao Jin, Qujiang Lei, Guangchao Gui, Weijun Wang","doi":"10.1109/ICCCS52626.2021.9449144","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449144","url":null,"abstract":"In order to solve the problem that the normal fertilization robot cannot feed different species of plants in one time, an intelligent fertilization robot based on image recognitions was designed. Based on the customers' requirements, the system we designed can supply the machine ability of normal plants classification and auto fertilization after verifying the plants. In this paper, the Intelligent Fertilization System Based on Image Recognition will be introduced but base on the data leakage of dataset, it requires the plants to be pictured in the same background.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132421335","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449258
Hui Cheng, Weiyu Dong, Yan Zheng, Bo Lv
With the continuous expansion of the business scale of the Internet of Things, the concept of the Internet of Everything has been deeply rooted in the hearts of the people. At the same time, various security issues have been exposed, which has greatly affected the trust of enterprises and users. Discovering and identifying IoT devices as an important part of IoT security should be taken seriously. In this paper, we propose a new method for classifying devices on the Internet of Things, which uses the data characteristics of the main page of the device's web interface to classify the vendor name, even the product name and other information of the device. We randomly selected IP address ranges on the Internet for scanning, and obtained a training set containing 80,000 entries and covering more than 1,000 devices from 74 vendors. Using the random forest algorithm and proceeding 10-fold cross-validation, our method classified IoT devices with an accuracy rate of over 97.5%.
{"title":"Identify IoT Devices through Web Interface Characteristics","authors":"Hui Cheng, Weiyu Dong, Yan Zheng, Bo Lv","doi":"10.1109/ICCCS52626.2021.9449258","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449258","url":null,"abstract":"With the continuous expansion of the business scale of the Internet of Things, the concept of the Internet of Everything has been deeply rooted in the hearts of the people. At the same time, various security issues have been exposed, which has greatly affected the trust of enterprises and users. Discovering and identifying IoT devices as an important part of IoT security should be taken seriously. In this paper, we propose a new method for classifying devices on the Internet of Things, which uses the data characteristics of the main page of the device's web interface to classify the vendor name, even the product name and other information of the device. We randomly selected IP address ranges on the Internet for scanning, and obtained a training set containing 80,000 entries and covering more than 1,000 devices from 74 vendors. Using the random forest algorithm and proceeding 10-fold cross-validation, our method classified IoT devices with an accuracy rate of over 97.5%.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132083017","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449251
Emmanuel Ufiteyezu, Yun Li
This paper provides an overview of the influence of mutual antenna coupling on the massive MIMO and its effects on gaining energy efficiency and power allocation schemes. As massive MIMO downlink cooperation becomes more prevalent, it becomes challenging to design and manufacture antenna arrays. We derive expressions for the multi-objective optimum power allocation strategy under the influence of mutual antenna coupling. When joint antenna coupling is taken into account or ignored, the numerical analysis and simulation results indicate a substantial gap in the measured results for the optimized average channel power. The results suggest that antenna common coupling effects need to be carefully considered to obtain individual rate or sum-rate capability and the right optimal power allocation strategy. Computer simulation instances back this argument.
{"title":"Dynamic Power Allocation for Cooperative Multi- Antenna Networks in Presence of Mutual Coupling","authors":"Emmanuel Ufiteyezu, Yun Li","doi":"10.1109/ICCCS52626.2021.9449251","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449251","url":null,"abstract":"This paper provides an overview of the influence of mutual antenna coupling on the massive MIMO and its effects on gaining energy efficiency and power allocation schemes. As massive MIMO downlink cooperation becomes more prevalent, it becomes challenging to design and manufacture antenna arrays. We derive expressions for the multi-objective optimum power allocation strategy under the influence of mutual antenna coupling. When joint antenna coupling is taken into account or ignored, the numerical analysis and simulation results indicate a substantial gap in the measured results for the optimized average channel power. The results suggest that antenna common coupling effects need to be carefully considered to obtain individual rate or sum-rate capability and the right optimal power allocation strategy. Computer simulation instances back this argument.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130997847","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449104
Xinhong Pan, Guoyi Zhang, Li Wang, Guangbo Wang, Jingyi Dong, Jiali Cao
The data represented by tensor can maintain its original form, which is conductive to preserving high dimensional structure and adjacent relation information of data. Tensor factorization plays an instrumental role in signal processing, especially image processing. However, the existing tensor-based fitting algorithms require a lot of time cost and have low fitting accuracy, which is more obvious when the image data is large. In this paper, an accelerated fitting algorithm based on the Canonical Polyadic (CP) tensor analysis is designed to process images. Compared with the existing tensor-based fitting algorithm, the developed algorithm greatly improves the fitting speed with high fitting accuracy, and can quickly reduce the noise of the image. Simulation results for color image show that our method have greatly improved the efficiency of image denoising.
{"title":"A Fast Image Denoising Method Based on CP Tensor Analysis","authors":"Xinhong Pan, Guoyi Zhang, Li Wang, Guangbo Wang, Jingyi Dong, Jiali Cao","doi":"10.1109/ICCCS52626.2021.9449104","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449104","url":null,"abstract":"The data represented by tensor can maintain its original form, which is conductive to preserving high dimensional structure and adjacent relation information of data. Tensor factorization plays an instrumental role in signal processing, especially image processing. However, the existing tensor-based fitting algorithms require a lot of time cost and have low fitting accuracy, which is more obvious when the image data is large. In this paper, an accelerated fitting algorithm based on the Canonical Polyadic (CP) tensor analysis is designed to process images. Compared with the existing tensor-based fitting algorithm, the developed algorithm greatly improves the fitting speed with high fitting accuracy, and can quickly reduce the noise of the image. Simulation results for color image show that our method have greatly improved the efficiency of image denoising.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127880627","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449157
Yanlei Zheng, Yacheng Liu, Guangquan Wang
In the comprehensive digital transformation work, China Unicom takes the construction of SDOTN network as the top priority. This paper analyzes the reasons for the use of REST interface in SDOTN network. Based on the interface development experience, we make an in-depth interface model analysis of two mainstream northbound interface (NBI) of SDOTN controller, and give the basis and principles of model selection. Finally, the time to create the service is actually measured and the comparison data is given based on two different interface models.
{"title":"Considerations on the Model Selection of SDOTN Controller Northbound Interface","authors":"Yanlei Zheng, Yacheng Liu, Guangquan Wang","doi":"10.1109/ICCCS52626.2021.9449157","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449157","url":null,"abstract":"In the comprehensive digital transformation work, China Unicom takes the construction of SDOTN network as the top priority. This paper analyzes the reasons for the use of REST interface in SDOTN network. Based on the interface development experience, we make an in-depth interface model analysis of two mainstream northbound interface (NBI) of SDOTN controller, and give the basis and principles of model selection. Finally, the time to create the service is actually measured and the comparison data is given based on two different interface models.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129267454","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449167
Dongmei Wei, Xingjun Wu, Guoqiang Bai, Linlin Su, Sufen Xu
With the rapid development of face verification technology, the current face verification has reached a high accuracy rate. However, face verification requires large computing resources and complex model parameters, so it is difficult to be applied in real scenes. The face verification system based on embedded applications can well solve the problems of huge model storage space occupation and high computing resource consumption. The existing mainstream face verification models have reached high accuracy, such as VGG16Net. Although there have been studies trying to design lightweight neural networks, such as MobileFaceNet, etc., there are still shortcomings such as complex structure and high resource consumption, so it is only suitable for mobile devices and other embedded devices, and it is difficult to apply to low power consumption and low performance such as embedded systems. In the device. For embedded systems with limited memory and computing power, a more lightweight neural network model is needed. Therefore, this paper conducts two researches on the problems of model storage requiring a large amount of space and high computational resource consumption. First of all, a lightweight face verification network model MobileFaceNet-v3m based on the attention mechanism is designed to solve the problem of model storage space occupation. Our model has a 15.26% smaller space occupation than MobileFaceNet, which successfully reduces the resource consumption of the model. The accuracy rate can still be maintained at a high level-95.47% of face verification accuracy is achieved on LFW; secondly, We use the learning rate optimization method based on efficient warm restart to train the model, the accuracy of the model is improved faster, and the model is successfully transplanted to the embedded platform, which is another step forward to the real scene application in the future.
{"title":"Attention-based Efficient Lightweight Model for Accurate Real-Time Face Verification on Embedded Device","authors":"Dongmei Wei, Xingjun Wu, Guoqiang Bai, Linlin Su, Sufen Xu","doi":"10.1109/ICCCS52626.2021.9449167","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449167","url":null,"abstract":"With the rapid development of face verification technology, the current face verification has reached a high accuracy rate. However, face verification requires large computing resources and complex model parameters, so it is difficult to be applied in real scenes. The face verification system based on embedded applications can well solve the problems of huge model storage space occupation and high computing resource consumption. The existing mainstream face verification models have reached high accuracy, such as VGG16Net. Although there have been studies trying to design lightweight neural networks, such as MobileFaceNet, etc., there are still shortcomings such as complex structure and high resource consumption, so it is only suitable for mobile devices and other embedded devices, and it is difficult to apply to low power consumption and low performance such as embedded systems. In the device. For embedded systems with limited memory and computing power, a more lightweight neural network model is needed. Therefore, this paper conducts two researches on the problems of model storage requiring a large amount of space and high computational resource consumption. First of all, a lightweight face verification network model MobileFaceNet-v3m based on the attention mechanism is designed to solve the problem of model storage space occupation. Our model has a 15.26% smaller space occupation than MobileFaceNet, which successfully reduces the resource consumption of the model. The accuracy rate can still be maintained at a high level-95.47% of face verification accuracy is achieved on LFW; secondly, We use the learning rate optimization method based on efficient warm restart to train the model, the accuracy of the model is improved faster, and the model is successfully transplanted to the embedded platform, which is another step forward to the real scene application in the future.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125387481","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449236
Wei Wang, Zhongshan Zhang
The full-duplex technology can achieve higher spectrum utilization than the traditional half-duplex technology, which has attracted widespread attention in both academia and industry. Since the performance of the full-duplex system is severely restricted by the self-interference (SI) signal, the influence of the SI signal must be eliminated to give full play to the advantages of the full-duplex technology. Restricted by device performance and circuit structure, traditional analog domain SI cancellation technology has disadvantages such as low accuracy, poor flexibility, and high hardware overhead. In order to avoid the above-mentioned problems, we investigate the SI cancellation technology in the digital domain, and uses digital beamforming (DBF) algorithm for high-precision SI channel estimation. Relying on the auto-correlation characteristics of spread spectrum sequences, SI channel parameters can be quickly obtained by implementing both amplitude and phase tests. It is shown in both simulation and hardware experiment that the adjustment accuracy of amplitude and phase can be better than 0.05dB and 0.05° which is far better than that of the commonly used 8-bit controlled phase shifter, with the accuracy of 1.4° and adjustable attenuator, with the accuracy of 0.5dB. The improvement of accuracy makes the SI cancellation capability of the proposed algorithm 13.49 dB higher than that of the traditional method. The proposed algorithm can be implemented with high enough accuracy and better performance which has a wide range of applications.
{"title":"DBF Based Channel Estimation for Self-interference Cancellation in Full-Duplex Communications","authors":"Wei Wang, Zhongshan Zhang","doi":"10.1109/ICCCS52626.2021.9449236","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449236","url":null,"abstract":"The full-duplex technology can achieve higher spectrum utilization than the traditional half-duplex technology, which has attracted widespread attention in both academia and industry. Since the performance of the full-duplex system is severely restricted by the self-interference (SI) signal, the influence of the SI signal must be eliminated to give full play to the advantages of the full-duplex technology. Restricted by device performance and circuit structure, traditional analog domain SI cancellation technology has disadvantages such as low accuracy, poor flexibility, and high hardware overhead. In order to avoid the above-mentioned problems, we investigate the SI cancellation technology in the digital domain, and uses digital beamforming (DBF) algorithm for high-precision SI channel estimation. Relying on the auto-correlation characteristics of spread spectrum sequences, SI channel parameters can be quickly obtained by implementing both amplitude and phase tests. It is shown in both simulation and hardware experiment that the adjustment accuracy of amplitude and phase can be better than 0.05dB and 0.05° which is far better than that of the commonly used 8-bit controlled phase shifter, with the accuracy of 1.4° and adjustable attenuator, with the accuracy of 0.5dB. The improvement of accuracy makes the SI cancellation capability of the proposed algorithm 13.49 dB higher than that of the traditional method. The proposed algorithm can be implemented with high enough accuracy and better performance which has a wide range of applications.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121226668","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449205
Ping Zhang, Qian Yuan
Under the lightweight setting, the security requirements and the leaking security bits for devices or systems are stricter. This paper focuses on the security of permutation-based lightweight authenticated encryption (LAE) modes, presents a new syntax of LAE, and, on the basis of OPP. proposes an enhanced LAE mode called OPP-plus which supports beyond-birthday-bound (BBB) security and integrity security under the releasing unverified plaintext (INT-RUP). For achieving BBB security, OPP-plus is set up by two-round Even-Mansour ciphers with distinct keys. For ensuring INT-RUP security, the authentication part of OPP-plus utilizes an extra intermediated checksum technique to generate the authentication tag. Then, by using the hybrid argument, we prove that OPP-plus meets our stronger security requirements in the nonce-respecting scenario if the underlying permutation is an ideal random permutation. Finally, we discuss the properties of OPP-plus. OPP-plus is based on a pure-permutation, and supports adaptively block-size and smaller security losses. As OPP-plus does not perform the key expansion algorithm and its parts of combinatorial circuits can be replaced directly by lookup tables, the cost of keys' update is relatively small and the implementation efficiency is relatively high in practice.
{"title":"Lightweight Authenticated Encryption Mode with Enhancing Security Guarantees","authors":"Ping Zhang, Qian Yuan","doi":"10.1109/ICCCS52626.2021.9449205","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449205","url":null,"abstract":"Under the lightweight setting, the security requirements and the leaking security bits for devices or systems are stricter. This paper focuses on the security of permutation-based lightweight authenticated encryption (LAE) modes, presents a new syntax of LAE, and, on the basis of OPP. proposes an enhanced LAE mode called OPP-plus which supports beyond-birthday-bound (BBB) security and integrity security under the releasing unverified plaintext (INT-RUP). For achieving BBB security, OPP-plus is set up by two-round Even-Mansour ciphers with distinct keys. For ensuring INT-RUP security, the authentication part of OPP-plus utilizes an extra intermediated checksum technique to generate the authentication tag. Then, by using the hybrid argument, we prove that OPP-plus meets our stronger security requirements in the nonce-respecting scenario if the underlying permutation is an ideal random permutation. Finally, we discuss the properties of OPP-plus. OPP-plus is based on a pure-permutation, and supports adaptively block-size and smaller security losses. As OPP-plus does not perform the key expansion algorithm and its parts of combinatorial circuits can be replaced directly by lookup tables, the cost of keys' update is relatively small and the implementation efficiency is relatively high in practice.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133080633","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 : 2021-04-23DOI: 10.1109/ICCCS52626.2021.9449288
Bingyang Guo, M. Zhang, Chengxi Xu, Fan Shi
As the Internet continues to evolve, the Domain Name System (DNS), which is originally designated as distributed service, starts to aggregate to fewer DNS servers. Thus, it is of great significance to dig out these name servers and carry out specific security protection on them. Researchers try to calculate the importance of an individual name server based on the number of domains resolved by it. However, we argue that semantic information such as the structure of a name server can also contribute to its importance. In this paper, we present a novel ranking method based on heterogeneous information networks, which not only considers the number of zones affected by the nameserver but also takes the importance of the zone and the influence of its adjacent name servers into consideration. We collect the name servers of the Alexa Top 1000 domains and calculate their importance. Results show that our method is more accurate compared to the existing method.
随着互联网的不断发展，原本被指定为分布式服务的DNS (Domain Name System)开始向更少的DNS服务器聚合。因此，挖掘这些域名服务器并对其进行针对性的安全保护具有重要意义。研究人员试图根据域名服务器解析的域名数量来计算单个域名服务器的重要性。然而，我们认为语义信息，如名称服务器的结构，也有助于其重要性。本文提出了一种基于异构信息网络的域名排序方法，该方法不仅考虑了受域名服务器影响的区域数量，而且考虑了区域的重要性及其相邻域名服务器的影响。我们收集了Alexa Top 1000域名的域名服务器，并计算了它们的重要性。结果表明，与现有方法相比，该方法具有更高的精度。
{"title":"A Nameserver Importance Ranking Method Based on Heterogeneous Information Network","authors":"Bingyang Guo, M. Zhang, Chengxi Xu, Fan Shi","doi":"10.1109/ICCCS52626.2021.9449288","DOIUrl":"https://doi.org/10.1109/ICCCS52626.2021.9449288","url":null,"abstract":"As the Internet continues to evolve, the Domain Name System (DNS), which is originally designated as distributed service, starts to aggregate to fewer DNS servers. Thus, it is of great significance to dig out these name servers and carry out specific security protection on them. Researchers try to calculate the importance of an individual name server based on the number of domains resolved by it. However, we argue that semantic information such as the structure of a name server can also contribute to its importance. In this paper, we present a novel ranking method based on heterogeneous information networks, which not only considers the number of zones affected by the nameserver but also takes the importance of the zone and the influence of its adjacent name servers into consideration. We collect the name servers of the Alexa Top 1000 domains and calculate their importance. Results show that our method is more accurate compared to the existing method.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133329872","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
扫码关注我们
求助内容：
应助结果提醒方式：