Pub Date : 2014-07-01DOI: 10.1016/S1005-8885(14)60520-3
Jian-yi LIU , Cong Wang , Ru Zhang , Xin-yi Zhao
This paper designs and implements the advertising recommending system based on user behavior under mobile Internet. By analyzing the user's online behavior, user profile that includes long-term interests and short-term interests can be obtained. In the end of this paper, the similarity between the behavior clusters and the advertisements is calculated, which is used to rank and select the most appropriate advertisements. The experiments show that the system can push the appropriate advertisements according to the user's different interest
{"title":"Research on behavioral targeted advertising in mobile Internet","authors":"Jian-yi LIU , Cong Wang , Ru Zhang , Xin-yi Zhao","doi":"10.1016/S1005-8885(14)60520-3","DOIUrl":"10.1016/S1005-8885(14)60520-3","url":null,"abstract":"<div><p>This paper designs and implements the advertising recommending system based on user behavior under mobile Internet. By analyzing the user's online behavior, user profile that includes long-term interests and short-term interests can be obtained. In the end of this paper, the similarity between the behavior clusters and the advertisements is calculated, which is used to rank and select the most appropriate advertisements. The experiments show that the system can push the appropriate advertisements according to the user's different interest</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 1-5"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60520-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89076786","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60515-X
Hai-hong E, Jun-jie TONG, Mei-na SONG, Jun-de SONG
Quality-of-service (QoS) describes the non-functional characteristics of Web services. As such, the QoS is a critical parameter in service selection, composition and fault tolerance, and must be accurately determined by some type of QoS prediction method. However, with the dramatic increase in the number of Web services, the prediction failure caused by data sparseness has become a critical challenge. In this paper, a new hybrid user-location-aware prediction based on WAA (HUWAA) is proposed. The implicit neighbor search is optimized by incorporating location factors. Meanwhile, the ability of the improved algorithms to solve the data sparsity problem is validated in experiments on public real world datasets. The new algorithms outperform the existing IPCC, UPCC and WSRec algorithms.
{"title":"A location-aware hybrid web service QoS prediction algorithm","authors":"Hai-hong E, Jun-jie TONG, Mei-na SONG, Jun-de SONG","doi":"10.1016/S1005-8885(14)60515-X","DOIUrl":"10.1016/S1005-8885(14)60515-X","url":null,"abstract":"<div><p>Quality-of-service (QoS) describes the non-functional characteristics of Web services. As such, the QoS is a critical parameter in service selection, composition and fault tolerance, and must be accurately determined by some type of QoS prediction method. However, with the dramatic increase in the number of Web services, the prediction failure caused by data sparseness has become a critical challenge. In this paper, a new hybrid user-location-aware prediction based on WAA (HUWAA) is proposed. The implicit neighbor search is optimized by incorporating location factors. Meanwhile, the ability of the improved algorithms to solve the data sparsity problem is validated in experiments on public real world datasets. The new algorithms outperform the existing IPCC, UPCC and WSRec algorithms.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 34-40"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60515-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87691289","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60518-5
Yi ZHANG, Yuchun GUO, Yishuai CHEN
Today, with rapid growth of apps (applications) for computers and mobile terminals, software update happens frequently. As a result, the flash crowd appearing in the early stage of a software patch release cannot be handled smoothly with abruptly arriving requests, thus considerable server bandwidth is needed. Unfortunately, it is still unknown how much bandwidth a content provider should provision to handle this case. In this paper, through measurements in one of the largest game patch distribution systems in China, we propose a simple but accurate user demand prediction model, since our finding that a highly predictable pattern of user requests exists in such a system. We further present the design of a pre-fetch based software update system. In this system, users who are idle and capable in hours before the patch release time could fetch the patches in advance and then serve other users requiring the patches. The design of this system mainly includes demand prediction and pre-fetch scale computation. After the deployment of this system, the contribution rate of users increases about 20% in the release day and is more stable than that before. Moreover, the peak of server bandwidth decreases by about 30%, which significantly saves bandwidth cost for providers.
{"title":"Pre-fetch based content distribution system for software update: design and evaluation","authors":"Yi ZHANG, Yuchun GUO, Yishuai CHEN","doi":"10.1016/S1005-8885(14)60518-5","DOIUrl":"10.1016/S1005-8885(14)60518-5","url":null,"abstract":"<div><p>Today, with rapid growth of apps (applications) for computers and mobile terminals, software update happens frequently. As a result, the flash crowd appearing in the early stage of a software patch release cannot be handled smoothly with abruptly arriving requests, thus considerable server bandwidth is needed. Unfortunately, it is still unknown how much bandwidth a content provider should provision to handle this case. In this paper, through measurements in one of the largest game patch distribution systems in China, we propose a simple but accurate user demand prediction model, since our finding that a highly predictable pattern of user requests exists in such a system. We further present the design of a pre-fetch based software update system. In this system, users who are idle and capable in hours before the patch release time could fetch the patches in advance and then serve other users requiring the patches. The design of this system mainly includes demand prediction and pre-fetch scale computation. After the deployment of this system, the contribution rate of users increases about 20% in the release day and is more stable than that before. Moreover, the peak of server bandwidth decreases by about 30%, which significantly saves bandwidth cost for providers.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 12-19"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60518-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82139604","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60505-7
Hong-xin ZHANG , Jing LI , Han GAN , Peng-fei HE
This article has been retracted: please see Elsevier Policy on Article Withdrawal (https://www.elsevier.com/about/our-business/policies/article-withdrawal).
This article has been retracted at the request of the author.
Electromagnetic emission data from a simulation experiment referred to in the article cannot be depended on because some of the data was acquired from incorrect techniques taking place within the research. This has caused the author to reach incorrect conclusions and the experiment cannot be reproduced as published. The Editor and author have subsequently agreed to retract the article.
{"title":"RETRACTED: A study on clustering-based power trace classification for side channel attacks","authors":"Hong-xin ZHANG , Jing LI , Han GAN , Peng-fei HE","doi":"10.1016/S1005-8885(14)60505-7","DOIUrl":"10.1016/S1005-8885(14)60505-7","url":null,"abstract":"<div><p>This article has been retracted: please see Elsevier Policy on Article Withdrawal (<span>https://www.elsevier.com/about/our-business/policies/article-withdrawal</span><svg><path></path></svg>).</p><p>This article has been retracted at the request of the author.</p><p>Electromagnetic emission data from a simulation experiment referred to in the article cannot be depended on because some of the data was acquired from incorrect techniques taking place within the research. This has caused the author to reach incorrect conclusions and the experiment cannot be reproduced as published. The Editor and author have subsequently agreed to retract the article.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 101-105"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60505-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83856259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2014-07-01DOI: 10.1016/S1005-8885(14)60509-4
Lian-ju NING, Hao-yu WANG, Xin FENG
The existing online shopping researches on consumer reviews are mostly based on the attitude change model (ACM). Although the ACM is valuable, it is not easy to judge the trustworthiness of the reviews and measure the values of the reviews. Based on the online data acquisition technology, we have got the data of 360buy, a domestic large-scale business to customer (B2C) commerce website in China. With application of data-mining and the density clustering algorithm (DBSCAN), we focus on the intervals distribution and the synthetic value of consumer reviews. The distribution of review interval can be depicted by the power-law function which presents a monotonically increasing relationship between the power-exponent and the customers’ concerns with the commodity: the higher the exponent is, the more attention will be drawn. We also find that the value of online reviews can be measured by the expertise value, which is the attraction and the quality of the reviews. Based on the above results, we have constructed the online review-trust model and the synthetic value model. The relationship between the power-exponent and the consumer attention has played a vital role in the consumer attention to online-shopping, and then the synthetic value model will help people find out useful reviews more effectively.
{"title":"Research on online review-trust model and synthetical value model based on power-law and density clustering algorithm","authors":"Lian-ju NING, Hao-yu WANG, Xin FENG","doi":"10.1016/S1005-8885(14)60509-4","DOIUrl":"10.1016/S1005-8885(14)60509-4","url":null,"abstract":"<div><p>The existing online shopping researches on consumer reviews are mostly based on the attitude change model (ACM). Although the ACM is valuable, it is not easy to judge the trustworthiness of the reviews and measure the values of the reviews. Based on the online data acquisition technology, we have got the data of 360buy, a domestic large-scale business to customer (B2C) commerce website in China. With application of data-mining and the density clustering algorithm (DBSCAN), we focus on the intervals distribution and the synthetic value of consumer reviews. The distribution of review interval can be depicted by the power-law function which presents a monotonically increasing relationship between the power-exponent and the customers’ concerns with the commodity: the higher the exponent is, the more attention will be drawn. We also find that the value of online reviews can be measured by the expertise value, which is the attraction and the quality of the reviews. Based on the above results, we have constructed the online review-trust model and the synthetic value model. The relationship between the power-exponent and the consumer attention has played a vital role in the consumer attention to online-shopping, and then the synthetic value model will help people find out useful reviews more effectively.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 71-78"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60509-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88005965","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60516-1
Yu-sheng LI, Mei-na SONG, Hai-hong E, Jun-de SONG
Using the social information among users in recommender system can partly solve the data sparsely problems and significantly improve the performance of the recommendation system. However, the recommendation systems which using the users' social information have two main problems: the explicit user social connection information is not always available in real-world recommender systems, and the user social connection information is directly used in recommender systems when the user explicit social information is available. But as we know that the user social information is not all based on user interest, so this can introduce noise to the recommender systems. This paper proposes a social recommender system model called interest social recommendation (ISoRec). Based on probability matrix factorization (PMF), the model addresses the problems mentioned above by combining user-item rating matrix, explicit user social connection information and implicit user interest social connection information to make more accurately recommendation. In addition, the computational complexity of our algorithm is linear with respect to the number of observed data sets used in this algorithm, and can scalable to very large datasets.
{"title":"Social recommendation algorithm fusing user interest social network","authors":"Yu-sheng LI, Mei-na SONG, Hai-hong E, Jun-de SONG","doi":"10.1016/S1005-8885(14)60516-1","DOIUrl":"10.1016/S1005-8885(14)60516-1","url":null,"abstract":"<div><p>Using the social information among users in recommender system can partly solve the data sparsely problems and significantly improve the performance of the recommendation system. However, the recommendation systems which using the users' social information have two main problems: the explicit user social connection information is not always available in real-world recommender systems, and the user social connection information is directly used in recommender systems when the user explicit social information is available. But as we know that the user social information is not all based on user interest, so this can introduce noise to the recommender systems. This paper proposes a social recommender system model called interest social recommendation (ISoRec). Based on probability matrix factorization (PMF), the model addresses the problems mentioned above by combining user-item rating matrix, explicit user social connection information and implicit user interest social connection information to make more accurately recommendation. In addition, the computational complexity of our algorithm is linear with respect to the number of observed data sets used in this algorithm, and can scalable to very large datasets.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 26-33"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60516-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76192218","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60514-8
Yan HU, Yan ZHANG
The developing of network drive the developing of information systems in campus. More and more business information systems are built in1990's. But most of these systems in campus are developed on different platform without standard. And some data in business information system should be shared between different departments. So the target of this paper is to solve the problem of sharing data in campus the through the web service. Web service is a service-oriented architecture (SOA) to provider service for service consumer. But the traditional model of web service is not suitable in digital campus. This paper designs a new model of web service for digital campus environment. And then a public-data platform is designed to realize the data sharing in heterogeneous systems. Next, the database designing and data processing flow is introduced. Finally, some monitor information of platform is showed.
{"title":"A design of public-data platform in digital campus based on web service","authors":"Yan HU, Yan ZHANG","doi":"10.1016/S1005-8885(14)60514-8","DOIUrl":"10.1016/S1005-8885(14)60514-8","url":null,"abstract":"<div><p>The developing of network drive the developing of information systems in campus. More and more business information systems are built in1990's. But most of these systems in campus are developed on different platform without standard. And some data in business information system should be shared between different departments. So the target of this paper is to solve the problem of sharing data in campus the through the web service. Web service is a service-oriented architecture (SOA) to provider service for service consumer. But the traditional model of web service is not suitable in digital campus. This paper designs a new model of web service for digital campus environment. And then a public-data platform is designed to realize the data sharing in heterogeneous systems. Next, the database designing and data processing flow is introduced. Finally, some monitor information of platform is showed.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 41-45"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60514-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76533099","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60511-2
Dong-yu WANG , Tao DUAN
This paper proposes a method of blind multi-user detection algorithm based on signal sub-space estimation under the fading channels in the present of impulse noise. This algorithm adapts recursive least square (RLS) filter that can estimate the coefficients using only the signature waveform. In addition, to strengthen the ability of resisting the impulse noise, a new suppressive factor is induced, which can suppress the amplitude of the impulse, and improve the ability of convergence speed. Simulation results show that new RLS algorithm is more robust against consecutive impulse noise and have better convergence ability than conventional RLS. In addition, Compared to the least mean square (LMS) detector, the new robust RLS sub-space based method has better multi-address-inference (MAI) suppressing performance, especially, when channel degrades.
{"title":"The multi-user detection under fading channel","authors":"Dong-yu WANG , Tao DUAN","doi":"10.1016/S1005-8885(14)60511-2","DOIUrl":"10.1016/S1005-8885(14)60511-2","url":null,"abstract":"<div><p>This paper proposes a method of blind multi-user detection algorithm based on signal sub-space estimation under the fading channels in the present of impulse noise. This algorithm adapts recursive least square (RLS) filter that can estimate the coefficients using only the signature waveform. In addition, to strengthen the ability of resisting the impulse noise, a new suppressive factor is induced, which can suppress the amplitude of the impulse, and improve the ability of convergence speed. Simulation results show that new RLS algorithm is more robust against consecutive impulse noise and have better convergence ability than conventional RLS. In addition, Compared to the least mean square (LMS) detector, the new robust RLS sub-space based method has better multi-address-inference (MAI) suppressing performance, especially, when channel degrades.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 59-63"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60511-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78607344","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60506-9
Hang DONG , Neng-qiang HE , Ge HU , Qi LI , Miao ZHANG
The amount of mobile malicious code is increasing faster every year and a serious security threat is posed by this. Hence, malware detection has become a critical topic in the field of computer security. This paper proposes a method to detect variants of known malware families in Android devices using simplify Dalvik instructions. This method is based on the sequence of instructions. A method is described in this paper to give the simplified description of each instruction and group them with n-gram patterns, which are set to be the malicious features. The result of the experiment shows that features extracted by this method are easy to be recognized, thus an effective way to detect variants of known malware families is provided.
{"title":"Malware detection method of android application based on simplification instructions","authors":"Hang DONG , Neng-qiang HE , Ge HU , Qi LI , Miao ZHANG","doi":"10.1016/S1005-8885(14)60506-9","DOIUrl":"10.1016/S1005-8885(14)60506-9","url":null,"abstract":"<div><p>The amount of mobile malicious code is increasing faster every year and a serious security threat is posed by this. Hence, malware detection has become a critical topic in the field of computer security. This paper proposes a method to detect variants of known malware families in Android devices using simplify Dalvik instructions. This method is based on the sequence of instructions. A method is described in this paper to give the simplified description of each instruction and group them with n-gram patterns, which are set to be the malicious features. The result of the experiment shows that features extracted by this method are easy to be recognized, thus an effective way to detect variants of known malware families is provided.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 94-100"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60506-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75217756","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 : 2014-07-01DOI: 10.1016/S1005-8885(14)60512-4
Lei YAN , Qin ZHAO , Zi-wei HU , Xin LI
Recently, the number of personal intelligent equipment increases rapidly which makes the internet protocol version 6 (IPv6) transition more imperative. Port control protocol (PCP) is one of the important IPv4-in-IPv6 tunnel technologies. Meanwhile, with the increasing demand to communicate or share files between terminal equipment, it is necessary to realize the peer to peer communication to support the transmission of data directly between the terminal equipment without a third-party server. In this paper, the structure of user access network and the deployment of the IPv6 transition technology based on IPv4-in-IPv6 tunnel are analyzed comprehensively, based on which the internet protocol security (IPSec) solution is chosen to protect the security of PCP message and the transport layer security (TLS) solution is chosen to protect the security of the peer-to-peer communications. A system for the authorization and distribution of digital certificates is designed for the TLS solution. Finally, the open source software Openswan is used to implement the IPSec solution, and the open source software OpenSSL is used to implement the TLS solution.
近年来,个人智能设备数量的迅速增加,使得互联网协议版本6 (IPv6)的过渡更加迫切。端口控制协议(Port control protocol, PCP)是IPv4-in-IPv6隧道的重要技术之一。同时,随着终端设备之间通信或文件共享的需求日益增加,有必要实现点对点通信,以支持终端设备之间不需要第三方服务器直接传输数据。本文综合分析了用户接入网的结构和基于IPv4-in-IPv6隧道的IPv6转换技术的部署,在此基础上选择了互联网协议安全(IPSec)方案来保护PCP报文的安全性,选择了传输层安全(TLS)方案来保护对等通信的安全性。为TLS解决方案设计了一个数字证书的授权和分发系统。最后,采用开源软件Openswan实现IPSec解决方案,采用开源软件OpenSSL实现TLS解决方案。
{"title":"Design and implementation of IPv6 oriented security mechanisms of port control protocol and peer-to-peer communication","authors":"Lei YAN , Qin ZHAO , Zi-wei HU , Xin LI","doi":"10.1016/S1005-8885(14)60512-4","DOIUrl":"10.1016/S1005-8885(14)60512-4","url":null,"abstract":"<div><p>Recently, the number of personal intelligent equipment increases rapidly which makes the internet protocol version 6 (IPv6) transition more imperative. Port control protocol (PCP) is one of the important IPv4-in-IPv6 tunnel technologies. Meanwhile, with the increasing demand to communicate or share files between terminal equipment, it is necessary to realize the peer to peer communication to support the transmission of data directly between the terminal equipment without a third-party server. In this paper, the structure of user access network and the deployment of the IPv6 transition technology based on IPv4-in-IPv6 tunnel are analyzed comprehensively, based on which the internet protocol security (IPSec) solution is chosen to protect the security of PCP message and the transport layer security (TLS) solution is chosen to protect the security of the peer-to-peer communications. A system for the authorization and distribution of digital certificates is designed for the TLS solution. Finally, the open source software Openswan is used to implement the IPSec solution, and the open source software OpenSSL is used to implement the TLS solution.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 52-58"},"PeriodicalIF":0.0,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60512-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120815135","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}