Current Issue

• • 2021, Vol. 44 No. 2 Published date:28 April 2021 Last issue Next issue

  The Special Issue on Future Network Architecture and Key Technologies

  • Geographic Routing and Addressing Scheme for Multi-Source Data Retrieval
  • HOU Sai-feng, TIAN Le, HU Yu-xiang, WU Jiang-xing
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 1-7. DOI:10.13190/j.jbupt.2020-227
  • Abstract ( 618 )     HTML( 410 )     　　
  • In order to meet the emerging location-related network services, a geographic location routing and addressing scheme for multi-source data retrieval is proposed on the basis of named-data networking (NDN). By combining geographic location information with content naming in NDN, a geographic location coding scheme is designed to support location-oriented multi-source data retrieval requests; Moreover, based on the NDN routing and forwarding framework, a self-learning geographic location routing and forwarding strategy is proposed. The strategy avoids the overhead caused by routing advertisement and is compatible with the traditional NDN routing and addressing mechanism; Finally, the proposed scheme is implemented on the NDN simulation platform and verified by experiments. The result shows the effectiveness of the routing mechanism.
  • References | Supplementary Material | Related Articles

  • A Multi-Index Mimic Voting Algorithm Based on Improved AHP-FCE Model
  • LU Yi-qin, HUANG Jun-xian, CHENG Zhe, QIN Jian-cheng
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 8-13. DOI:10.13190/j.jbupt.2020-105
  • Abstract ( 626 )     HTML( 479 )     　　
  • In order to improve the accuracy of mimic voting, a multi-index mimic voting algorithm based on the improved analytic hierarchy process-fuzzy comprehensive evaluation(AHP-FCE) model is proposed. In view of the shortcomings of the consistency check in the traditional model, the proposed algorithm improves the construction method of the judgment matrix. It can construct a judgment matrix that must have consistency with no need for consistency check and adjustment. Based on the improved model, the algorithm comprehensively analyzes the consistency, historical confidence, and heterogeneity in the mimic voting, transforming the mimic voting into a fuzzy evaluation process. Simulations show that compared with consensus voting, the algorithm can effectively improve the accuracy of voting and the overall safety performance of a mimic system.
  • References | Supplementary Material | Related Articles

  • High Performance and Scalable NAT System on Commodity Platforms
  • LI Jun-feng, LI Dan, HUANG Yu-kai, CHENG Yang, LING Rui-lin
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 14-19. DOI:10.13190/j.jbupt.2020-133
  • Abstract ( 477 )     HTML( 228 )     　　
  • Quick network address translation (NAT) is proposed to improve the network performance of the NAT system on the commodity server by three ways. Firstly, the quick NAT search algorithm is designed to use the Hash search instead of the sequential search to reduce latency when looking up the NAT rule table. Secondly, to leverage the power of multi-core central processing unit (CPU) and multi-queue network interface card, Quick NAT enables multiple CPU cores to process in parallel. The localized connection tracking table and the compare-and-swap based lock-free NAT Hash tables are designed to eliminate the lock overhead. Thirdly, Quick NAT uses the polling and zero-copy delivery to reduce the cost of interrupt and packet copies. The experiment results show that Quick NAT obtains high scalability and line-rate throughput on the commodity server.
  • References | Supplementary Material | Related Articles

  • Measures of Reliability Improvement of Clock Synchronization in Time Sensitive Networking
  • ZHU Hai-long, YAN Yuan-yuan
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 20-25,46. DOI:10.13190/j.jbupt.2020-129
  • Abstract ( 652 )     HTML( 1202 )     　　
  • In order to improve the reliability of clock synchronization, based on the IEEE 802.1AS protocol, a method for the nearest port master clock backup and the master clock phase offset hot backup redundancy method is proposed. Simulation shows that the recent port master clock backup method is 38% more reliable than the standard master clock reselection method, and the master clock phase offset hot backup redundancy is 48% more accurate than the standard hot backup redundancy method.
  • References | Supplementary Material | Related Articles

  • A Damper Scheduling Mechanism Based on Network Calculus Theory
  • REN Shou-shou, LIU Bing-yang, WANG Chuang, MENG Rui, LIU Xuan
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 26-32. DOI:10.13190/j.jbupt.2020-128
  • Abstract ( 537 )     HTML( 652 )     　　
  • A new packet scheduling mechanism, which can provide bounded latency and jitter for Internet protocol (IP) network, is proposed. With the guidance of network calculus, the Damper scheduling mechanism performs per-hop shaping by actively holding packets in the damper module per-hop and thereby eliminating the delay deterioration. The Damper mechanism requires neither time synchronization among network devices, nor per-flow status maintenance on core devices. It supports large-scale transmission distances and thus can be extended on large-scale IP networks.
  • References | Supplementary Material | Related Articles

  • Cross-Domain Abnormal Traffic Detection Based on Transfer Learning
  • PENG Yu-he, CHEN Xiang, CHEN Shuang-wu, YANG Jian
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 33-39. DOI:10.13190/j.jbupt.2020-114
  • Abstract ( 683 )     HTML( 686 )     　　
  • In order to solve the problem that the machine learning model based on known data is not completely reliable in actual abnormal traffic detection tasks due to the dynamics of the network environment. The different distributed traffic as the source domain and target domain is used to establish a cross-domain framework for abnormal network traffic detection. The transfer learning method based on joint distribution adaptation is proposed by finding the optimal transformation matrix, adapting the conditional probability and edge probability between the source domain and the target domain, the feature transfer between the source domain and the target domain is realized thereby for solving the problem of the large difference in the distribution of the source domain and the target domain causes problems such as decreased detection accuracy. Experiments show that the proposed method can significantly improve the detection accuracy of cross-domain traffic.
  • References | Supplementary Material | Related Articles

  • Network Protocol Security Analysis Based on Abstract Principle and Model Detection
  • WANG Xiao-nan, FU Jin-xuan, YU Hong-fang, SUN Gang, CHEN Hai-bing
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 40-46. DOI:10.13190/j.jbupt.2020-183
  • Abstract ( 409 )     HTML( 261 )     　　
  • An abstract principle is proposed to mitigate the explosion of state space.The proposed scheme scientifically reduces the auxiliary variables, message fields and numbers of automatic state machines in the process of model design, and reduces the complexity and size of the model on the premise of minimizing the accuracy of verification results.A semi-automatic modeling framework is proposed thereafter, which can automatically generate models with uniform specifications with only a small amount of input provided by users and no need to learn grammar, which is convenient for researchers to consult and use.Experiments show that the model based on the proposed abstract principle and the semi-automatic modeling framework can verify the properties of the network protocol.
  • References | Supplementary Material | Related Articles

  • Latency Guarantee Model for Reliable Edge-Node Cooperation
  • YANG Peng, ZHANG Yi-fu, LI Zhi-du, WU Da-peng, WANG Ru-yan
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 47-53. DOI:10.13190/j.jbupt.2020-139
  • Abstract ( 467 )     HTML( 506 )     　　
  • Due to highly time-varying wireless link state, the terminal tasks offloading may fail, resulting in task delay deterioration or even task failure. A latency guarantee model is derived for reliable edge-node cooperation. Firstly, the statistical characteristics of task offloading delay is analyzed based on embedded Markov theory. Secondly, the probabilistic delay of task computing on device side is characterized based on network calculus theory. Finally, a performance evaluation model oriented to delay and reliability perception is proposed. Analysis validates that the proposed strategy can improve the task reliability with specific delay requirements compared with the schemes based on average delay or average rate optimization.
  • References | Supplementary Material | Related Articles

  • A Data Access Control Scheme in Information-Centric Mobile Ad Hoc Networks
  • LIU Ning-chun, GAO Shuai, HOU Xin-di, GUO Xing-chang
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 54-60. DOI:10.13190/j.jbupt.2020-203
  • Abstract ( 379 )     HTML( 356 )     　　
  • Aiming at the characteristics of intermittent connections between nodes and ubiquitous caching in the information-centric mobile Ad hoc networks, a data access control scheme based on threshold secret sharing scheme is proposed. By constructing an auxiliary key block, the consumer's decryption overhead and the storage resource consumption of network nodes are reduced. At the same time, by combining a two-variable one-way function, the uniqueness of the consumer's shares is guaranteed, and the cost of key management is decreased. Simulations show that this mechanism dramatically reduces the decryption overhead on the consumer side, which indicates its well suited for information-centric mobile Ad hoc network scenarios.
  • References | Supplementary Material | Related Articles

  • Research on Pending Interest Table of Named Data Networking Supporting Interest Flooding Attack Detection
  • PENG Peng, LI Zhuo, LIANG Ji-feng, MA Tian-xiang, LIU Kai-hua
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 61-67. DOI:10.13190/j.jbupt.2020-131
  • Abstract ( 455 )     HTML( 343 )     　　
  • In order to solve the problems of efficient variable-length name lookup, hardware-supportable storage consumption, and detection of interest flooding attack in the pending interest table(PIT) of named data networking, an cognition and indexing model(C&I) based on character convolutional neural network is proposed. C&I can support the classification and aggregation of name data, and reduce the storage consumption of name data. At the same time, a pending interest table storage structure C&I-PIT based on C&I and its data retrieval algorithm, which supports the detection of interest flooding attack, is proposed. Through the deployment of multi-level memory, the index structure and storage space are respectively deployed on static random access memory and dynamic random access memory. Experiments show that C&I-PIT has good performance in name aggregation, memory consumption and interest flooding attack detection.
  • References | Supplementary Material | Related Articles

  • A Joint Cache Placement and Replacement Algorithm for Cache Requirements of New Contents in CCN
  • SHAN Si-yang, FENG Chun-yan, ZHU Guang-yu, ZHANG Tian-kui
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 68-74. DOI:10.13190/j.jbupt.2020-086
  • Abstract ( 1797 )     HTML( 250 )     　　
  • In content centric networking (CCN), in order to solve the problem that the existing global cache placement algorithm cannot optimize the cache placement for new content in real time, the global cache placement and replacement algorithm for new content cache requirements is studied, reducing the cache node load and content acquisition delay for users. The network-wide cache gain function is defined, and the optimization problem of maximizing the entire network cache gain is formulated to realize the cache placement of new contents and the cache replacement of existing contents. The optimization problem is decomposed into a cache placement sub-problem and a cache replacement sub-problem. A suboptimal solution to the global cache placement optimization problem is proposed. A collaborative cache replacement algorithm to minimize the loss of cache gain due to cache replacement is proposed. Finally, the joint optimization of cache placement and replacement is realized through iterations. Simulation shows that the proposed algorithm is superior to the traditional methods in terms of cache node load, user hop count and cache hit ratio.
  • References | Supplementary Material | Related Articles

  • Energy Consumption Modeling and Analysis of NDN Data Provider Mobile Support Strategies
  • WANG Guo-qing
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 75-80. DOI:10.13190/j.jbupt.2020-274
  • Abstract ( 486 )     HTML( 331 )     　　
  • Based on different locations and speeds of mobile nodes of data providers in network, combined with named data networking(NDN) requester driven data transmission mode, analytic expressions of network energy consumption of 3 types of NDN mobile support strategies are proposed, which provide a formal modeling method for the study of NDN mobile network. By analyzing and comparing the energy consumption of these 3 mobile support strategies in different scenarios, data popularity distribution, location of mobile nodes and moving speed have different effects on energy consumption of the 3 strategies. It provides a theoretical reference for exploring the optimal energy efficiency mobile support strategies in the future.
  • References | Supplementary Material | Related Articles

  • Differential Privacy-Preserving Recommendation Algorithm Based on Bhattacharyya Coefficient Clustering
  • WANG Yong, YIN En-min, RAN Xun
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 81-88. DOI:10.13190/j.jbupt.2020-174
  • Abstract ( 483 )     HTML( 410 )     　　
  • To improve the accuracy of recommendation algorithm under differential privacy protection, a privacy preservation recommendation algorithm is proposed based on a clustering method with Bhattacharyya coefficient(BC). In the proposed algorithm, the Bhattacharyya coefficient is used as the standard of measuring item similarity. Based on the BC similarity, the items are clustered by K-medoids, and the private neighbors of the items are selected from the clusters. Finally, according to the selected nearest neighbor set, the user's rating is predicted and the Top-n recommendations are output. The proposed algorithm effectively overcomes the problem that the calculation of similarity must depend on the common rated ratings, improves the accuracy of the similarity measurement, and also avoid the problem of quality degradation of the nearest neighbor set due to privacy protection. It is shown that the proposed algorithm not only achieves privacy preservation but also guarantees the high quality of recommendation. Therefore, the proposed algorithm effectively balances the privacy preservation and the data utility, which has good application potential in the recommendation system.
  • References | Supplementary Material | Related Articles

  • Blockchain-Based Cooperative Computing Scheme for IoT Intelligent Terminals
  • ZHA Yu-kun, ZHI Hui, FANG Xiao-tong
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 89-94. DOI:10.13190/j.jbupt.2020-176
  • Abstract ( 421 )     HTML( 407 )     　　
  • The blockchain technology is used to provide a safe and reliable cooperation platform for intelligent terminals, and a suitable incentive mechanism is provided to encourage intelligent terminals to participate in cooperative computing. Specifically, the proposed scheme uses the Kuhn-Munkres algorithm to achieve the optimal pairing and to fully mobilize the computing resources in the network, it also uses the two-stage Stackelberg model to describe the computing resource transaction process, which can optimize computing energy consumption while ensuring fairness. This scheme adoptes the proof-of-reputation consensus mechanism to reduce resource waste caused by mining, used reputation and resource currency revenue as incentive conditions to encourage intelligent terminals to participate in cooperation and improve the quality of service. Simulation shows that the proposed scheme comprehensively considers the utility of the parties in cooperation, not only can provide a credible trading platform, but also can reduce the total energy consumption.
  • References | Supplementary Material | Related Articles

  • Research of Control Framework in Time-Sensitive Network
  • WANG Jing-chao, GAO Xian-ming, HUANG Yu-dong, WANG Shuo, HUANG Tao
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 95-101. DOI:10.13190/j.jbupt.2020-135
  • Abstract ( 893 )     HTML( 837 )     　　
  • In order to advance control architecture research of time-sensitive networks, the design requirement of time-sensitive network control architecture is analyzed. The development status and technical challenges of time sensitive network(TSN) control architecture are presented from three aspects including configuration objects, architecture models, and architecture implementations. The gateway and unified architecture based implementation models are mainly studied around core functions such as demand perception, strategy calculation, and strategy deployment. The development trend of TSN control architecture is given. It is expected to lay a technical foundation for the application and popularization of TSN through the study of TSN control architecture.
  • References | Supplementary Material | Related Articles

  The Special Issue on Internet of Vehicles

  • Edge Intelligence Multi-Source Data Processing for Autonomous Driving in Internet of Vehicles
  • Lü Xin-chen, ZHANG Chen-yu
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 102-108. DOI:10.13190/j.jbupt.2020-266
  • Abstract ( 972 )     HTML( 823 )     　　
  • Designing a highly reliable automatic driving system is challenging due to the limited perception range and computing resources of intelligent vehicles. To this end, the distributed data and available resources in the network should be exploited. An edge intelligence multi-source data processing scheme for autonomous driving in Internet of vehicles is proposed. Firstly, a three-layer network model is constructed to schedule the data transmission. Then the original vehicle nodes are mapped one by one into a set of virtual nodes to decouple the data transmission. Thereafter, the original problem into a minimum cost maximum flow problem, realizing the efficient allocation of computing, communication resources in the network are transformed. Simulations show that the proposed scheme can improve system throughput by 150% and system energy efficiency by 12% compared with local processing scheme.
  • References | Supplementary Material | Related Articles

  • Trust Degree Based RSU Recognition and Resource Allocation in Vehicular Networks
  • HUANG Xiao-ge, WANG Yong-sheng, LAI Chen-bin, CHEN Qian-bin
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 109-115. DOI:10.13190/j.jbupt.2020-088
  • Abstract ( 615 )     HTML( 501 )     　　
  • In network of vehicles, due to some roadside units (RSU) are remote and cannot be maintained timely by network administrator, they may be attacked and become untrustworthy RSUs, resulting in reduction of vehicle communication quality and network energy efficiency. To effectively identify the reliability of the RSU, a trust degree-based RSU recognition and resource allocation algorithm (TRRA) is proposed. In this algorithm, roadside unit identification, transmission mode selection, and power allocation are jointly modeled as the network energy efficiency optimization problem, which is divided into three sub-optimization problems to solve respectively. Firstly, the trust degree-based RSU recognition algorithm is used to identify the trusted and untrusted roadside units; Secondly, the resource block allocation and the link selection are optimized; Finally, the sub-gradient algorithm is used to optimize the transmission power and maximize the network energy efficiency. Simulations show that the proposed algorithm has lower complexity, which can achieve higher recognition accuracy of roadside units, and effectively improve the overall network energy efficiency.
  • References | Supplementary Material | Related Articles

  • Multi-Path Assisted Cooperative Radio-Based Localization for Connected Vehicles
  • CHU Xing-he, LU Zhao-ming, WANG Lu-han, WU Mu-qing, WEN Xiang-ming
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 116-123. DOI:10.13190/j.jbupt.2020-191
  • Abstract ( 543 )     HTML( 434 )     　　
  • In order to solve the less-accuracy and insufficient-coverage problem of the traditional localization methods like global positioning system (GPS) and BeiDou navigation satellite system (BDS) in the areas where the signals are blocked, a multi-path assisted cooperative radio-based localization method is proposed for connected vehicles based on the fifth generation of mobile communications system and vehicle to everything. In detail, the localization information carried by multi-path components from the transmitter to the receiver in vehicle network is modeled into multi-path positioning segments, thus their relative position is calculated based on least squared algorithm. Then a belief propagation based algorithm is presented to calculate the position of each vehicle by fusing the relative positioning information and the partial covered GPS/BDS information. Simulations show that the algorithm can improve the localization accuracy over different vehicle densities and different GPS/BDS available probabilities, which further indicates that the algorithm can solve the GPS/BDS insufficient-coverage problem so as to provide high-accuracy localization for connected vehicles.
  • References | Supplementary Material | Related Articles

  • In Urban Environment Vehicle-to-Vehicle Channel Modeling Based on Geometric Random Model
  • MAO Jing-min, WEI Zai-xue, XING Bing-qian, LIU Kai-zhen, ZHAO Yi
  • Journal of Beijing University of Posts and Telecommunications. 2021, 44(2): 124-130. DOI:10.13190/j.jbupt.2020-251
  • Abstract ( 345 )     HTML( 391 )     　　
  • In complex and changeable urban environment, the communication channel is interfered by various obstacles. The model of the vehicle-to-vehicle channel in the intersection scene is built. In this scene, the scatterers are not uniformly distributed. A Y-shaped random model suitable for intersections is proposed. Based on the ellipsoid range limited by the maximum time delay, the geometric random model is established for the vehicle scatterer on the road and the building scatterers beside the road. In this model, the static scatterers on both sides of the road is assumed to be exponentially distributed in the building area, and the moving scatterers are uniformly distributed in the lane area. In order to get close to the real environment, the discrete Markov process is used to simulate the time-varying characteristics of the scatterers. The arrival angle, the delay power spectrum, the time autocorrelation function, the space cross-correlation function, and the Doppler power spectrum density are deduced and simulated. In addition, the random channel model based on geometry has enough generality and can be used to model communication scenes in various urban environments by adjusting channel parameters.
  • References | Supplementary Material | Related Articles