Design of User Access Authentication and Authorization System for VoIP Service

Author(s):  
Ho-Kyung Yang ◽  
Jin-Mook Kim ◽  
Hwang-Bin Ryou
2017 ◽  
Vol 14 (1) ◽  
pp. 1-6 ◽  
Author(s):  
Hejun Zhu ◽  
Liehuang Zhu

In order to solve the problem of direct location management of Internet users under the environment of NAT, the unique session ID that represents the user session was put the first option location of the initial session SYN option, and the same session ID was put the additional tail part of the each initial UDP session and the specified UDP tail part, the traffic identification and location management of the Internet users were realized under the environment of NAT through the message tag and user access authentication, the practical application showed that compared with the traditional method, this method not only solved the location management of the Internet users under the NAT, but also greatly reduced the Internet authentication device, network mirror device, network transmission device, network bandwidth and other resources.


2020 ◽  
pp. 15-28
Author(s):  
Alec Brusilovsky ◽  
Ira McDonald

Current cellular architecture will not be suitable for 5G because it will not scale to the anticipated number of connected endpoints and their rich diversity. The distribution of the previously centralized Core Network (CN) functionality, e.g., Access Authentication and Authorization, has to be decentralized, leading to the demise of the most utilized tool of network security engineering, Physical Security Perimeter. The asserted and attested Platform Integrity of the network nodes that comprise the edges of the network, the network cloud, “network fog”, and the endpoints will allow mobile network operators (MNOs) to create Virtual Network Perimeters and allow highly reliable, diverse, and flexible 5G networks. This article describes the reasons for such network transformation, provides references to applicable standardization activities, and uses the examples of support for Unmanned Aerial Vehicles (UAV) and connected automobiles by 5G networks to justify the need for Platform Integrity.


2019 ◽  
Vol 16 (6) ◽  
pp. 18-30 ◽  
Author(s):  
Shaoyong Guo ◽  
Xing Hu ◽  
Ziqiang Zhou ◽  
Xinyan Wang ◽  
Feng Qi ◽  
...  

Author(s):  
Mahantesh Gawannavar ◽  
Payal Mandulkar ◽  
R. Thandeeswaran ◽  
N. Jeyanthi

2017 ◽  
Vol 45 (3) ◽  
pp. 508-528 ◽  
Author(s):  
Andres Sevtsuk ◽  
Raul Kalvo

We introduce a version of the Huff retail expenditure model, where retail demand depends on households’ access to retail centers. Household-level survey data suggest that total retail visits in a system of retail centers depends on the relative location pattern of stores and customers. This dependence opens up an important question—could overall visits to retail centers be increased with a more efficient spatial configuration of centers in planned new towns? To answer this question, we implement the model as an Urban Network Analysis tool in Rhinoceros 3D, where facility patronage can be analyzed along spatial networks and apply it in the context of the Punggol New Town in Singapore. Using fixed household locations, we first test how estimated store visits are affected by the assumption of whether shoppers come from homes or visit shops en route to local public transit stations. We then explore how adjusting both the locations and sizes of commercial centers can maximize overall visits, using automated simulations to test a large number of scenarios. The results show that location and size adjustments to already planned retail centers in a town can yield a 10% increase in estimated store visits. The methodology and tools developed for this analysis can be extended to other context for planning and right-sizing retail developments and other public facilities so as to maximize both user access and facilities usage.


Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 80
Author(s):  
Qiuqi Han ◽  
Guangyuan Zheng ◽  
Chen Xu

Device-to-Device (D2D) communications, which enable direct communication between nearby user devices over the licensed spectrum, have been considered a key technique to improve spectral efficiency and system throughput in cellular networks (CNs). However, the limited spectrum resources cannot be sufficient to support more cellular users (CUs) and D2D users to meet the growth of the traffic data in future wireless networks. Therefore, Long-Term Evolution-Unlicensed (LTE-U) and D2D-Unlicensed (D2D-U) technologies have been proposed to further enhance system capacity by extending the CUs and D2D users on the unlicensed spectrum for communications. In this paper, we consider an LTE network where the CUs and D2D users are allowed to share the unlicensed spectrum with Wi-Fi users. To maximize the sum rate of all users while guaranteeing each user’s quality of service (QoS), we jointly consider user access and resource allocation. To tackle the formulated problem, we propose a matching-iteration-based joint user access and resource allocation algorithm. Simulation results show that the proposed algorithm can significantly improve system throughput compared to the other benchmark algorithms.


2021 ◽  
pp. 1-14
Author(s):  
Sampa Rani Bhadra ◽  
Ashok Kumar Pradhan ◽  
Utpal Biswas

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.


Sign in / Sign up

Export Citation Format

Share Document