Access Network Nodes Research Articles

Machine Learning-based fixed access Network Interface Congestion Prediction

Network interface congestion refers to a situation in which network interfaces or communication channels within a network experience high levels of traffic, leading to performance degradation or potential network failures. In modern networking, this issue remains relevant and can manifest in various contexts due to a surge in data traffic, Internet of Things (IoT) devices can generate substantial data, increased use of VPNs for remote work and when multiple users or applications concurrently access and transfer data in and out of the cloud. Efforts to forecast and address network interface bottlenecks are crucial to sustaining the performance and consistency of modern networks. In the PTCL fixed access network infrastructure, network blocking is a serious problem that necessities to be addressed. The main objective of this study is to overcome network congestion problems that occur in PTCL's fixed access network through the use of machine learning techniques. Despite having real-time monitoring tools such as SolarWinds, there remains a dearth of software capable of predicting imminent bottlenecks in the network interface. The primary aim is to build an analytical model which can predict potential blockages within 30 days and facilitate proactive management strategies for better administration. Top of Form The study classifies the most effective machine learning technique for this purpose and evaluates its performance against current methods. To achieve the goal, a diagnostic dataset was created, leveraging appropriate configurations, software tools, and hardware resources. Data was sourced from SolarWinds, consisting of information from over 23,000 interfaces across 11,000 access network nodes. This data was analyzed in PTCL's Data Warehouse, where a historical aggregated dataset was constructed. Exploratory data analysis was performed using Python libraries, including Matplotlib, NumPy, Pandas, and Seaborn. This investigation sets the foundation for proactive network management and enhanced user experiences within PTCL's fixed access network, addressing the critical essential for advanced predictive tools to combat congestion and enhance network competence.

Optimal Topology Management for Software‐Defined Networks Minimizing Latency and Using Network Slicing

In this paper, we analyze the problem of managing users from different slices connecting to a software‐defined network (SDN). We seek to minimize the propagation latency between switches and controllers as well as between controllers themselves. We also minimize the connection latency between users and their network access nodes. Thus, the main highlights of the paper are to formally represent the problem utilizing two equivalent mixed‐integer quadratic programming models. The first one represents the user requirements of each slice by using a membership matrix. The second one consists of subsets of users separated within each slice requirement. Subsequently, the above models are analyzed in a standard linearized version. Finally, they are compared with a proposed local search math‐heuristic algorithm. The proposed models and algorithm are solved with the CPLEX solver with default options. To the best of our knowledge, this journal paper constitutes a first attempt to incorporate network slicing in SDN allowing flexibility, resource efficiency, security, and effective management of the network facilitating the deployment of customized and adaptive services. Besides, our models allow us to deal with the management of connecting users to either controller or switch‐type nodes depending on the slice to which each user belongs. For security reasons, a certain slice could only have access to the network controllers, while the rest of the users that belong to the other slices can connect to the switch‐type nodes of the network. From the numerical experiments, we observe that the linear models show a better performance in terms of CPU times and the best solutions obtained. Similarly, our proposed approximation algorithm achieves near‐optimal solutions in significantly shorter CPU times, for all the input graph networks, when compared to the proposed exact models which allows for finding the optimal solutions.

UAV-Aided RF Mapping for Sensing and Connectivity in Wireless Networks

The use of unmanned aerial vehicles (UAV) as flying radio access network (RAN) nodes offers a promising complement to traditional fixed terrestrial deployments. More recently yet still in the context of wireless networks, drones have also been envisioned for use as radio frequency (RF) sensing and localization devices. In both cases, the advantage of using UAVs lies in their ability to navigate themselves freely in 3D and in a timely manner to locations of space where the obtained network throughput or sensing performance is optimal. In practice, the selection of a proper location or trajectory for the UAV very much depends on local terrain features, including the position of surrounding radio obstacles. Hence, the robot must be able to map the features of its radio environment as it performs its data communication or sensing services. The challenges related to this task, referred here as radio mapping, are discussed in this paper. Its promises related to efficient trajectory design for autonomous radio-aware UAVs are highlighted, along with algorithm solutions. The advantages induced by radio-mapping in terms of connectivity, sensing, and localization performance are illustrated.

Minimizing the Signaling Overhead and Latency Based on Users’ Mobility Patterns

We demonstrate a distributed and a centralized 4G/5G compliant approach to minimize signaling and latency related to user mobility in cellular networks. This is crucial due to the densification of networks and the additional signaling introduced by the new 5G service-based architecture. By exploiting standardized protocols, our solutions dynamically reorganize the association between nodes in radio access network (RAN) and the core. We validated the proposed approaches using real user mobility datasets. Our results show that both our distributed and centralized solutions significantly reduce the signaling between core and RAN compared to the traditional approach based on geographical proximity. As a result, both approaches significantly reduce the average handover procedure processing time. Moreover, by relying on locally available information, the distributed approach can quickly adapt to changes in the user movement patterns as they happen.

DCN-MAC: A Dynamic Channel Negotiation MAC Mechanism for Underwater Acoustic Sensor Networks.

In the design of media access control (MAC) mechanism in underwater acoustic sensor networks (UASNs), due to the propagation characteristic of low-speed underwater acoustic signals, it is necessary to solve the spatial–temporal uncertainty problem. In order to avoid the multi-user access conflict in underwater networks, reduce the energy cost and improve the throughput and fairness across the network, a dynamic channel negotiation MAC mechanism based on spatial–temporal mapping of receiving queue (DCN-MAC) was proposed. DCN-MAC uses a duty cycle mechanism and implements a network management based on dynamic single node wake-up. The awakening node collects the request to send (RTS) and network status information in the network to solve the problem of space-temporal uncertainty and the highly dynamic needs of network access nodes and access services. The simulation results show that in different network scenarios, especially in those featuring high density and heavy network load, compared with the traditional underwater acoustic network MAC protocols, this protocol can effectively improve the network throughput and reduce the packet loss probability caused by multi-node conflict.

A method of topology planning and simulation optimization of inter-satellite[JP]link(ISL) based on local laser high-speed node backbone network

The laser inter-satellite link has the technical characteristics of large transmission capacity and high transmission rate. The satellite node with the laser inter-satellite link function can be used as a high-speed backbone network node in the laser-microwave hybrid inter-satellite link network. How to deploy these high-speed nodes,so that,the constructed satellite network topology can reach the optimal goal. It is a research focus in the development of the inter-satellite link from microwave to laser transition. The application scenario is the navigation satellite constellation including 24 Medium orbit (MEO),3 Geochronous orbit(GEO) and 3 Inclined GeoSynchronous Orbit (IGSO) satellites. And the number of high-speed nodes is fixed Under the condition of, comprehensive geometric visibility, inter-satellite distance and engineering constraints and other constraints. With the minimum average end-to-end delay from the satellite network access node to the destination node as the optimization goal, a mathematical model is established. A high-speed node selection algorithm method based on multiple Source shortest path strategy hybrid inter-satellite link network is used to solve the optimal topology of the local laser high-speed node backbone network. Simulation results show that, the topological structure of local laser high-speed node backbone network can make the whole network transmission delay less and the communication performance is more effective.

Characterization of pallidocortical motor network in Parkinson’s disease through complex network analysis

Objective. Deep brain stimulation (DBS) has been demonstrated by numerous clinical trials to be an advanced therapy for selected patients with Parkinson’s disease (PD), while its maximal therapeutic effect is capped by the inadequate understanding of the precise neuronal mechanisms underlying PD. Recordings from multichannel electrodes placed in subcortical and cortical regions of the basal ganglia-thalamocortical (BGTC) motor network during DBS surgical procedures can provide rich physiologic information from accessible network nodes. However, most investigations focus on presumed spatio-spectral points of interest, neither fully utilizing the richness of spatial, spectral and temporal aspects of the multivariate signals nor making discoveries in the context of all possible candidates. In addition, aggregated network-level information has been missed out. Approach. We use complex network analysis to characterize functional network characteristics of the pallidocortical subcircuit of the BGTC motor network in PD at rest and with movement. The network matrix was constructed using distinct frequency bands at each anatomic recording site as virtual nodes and spectral connectivity (through phase–amplitude coupling and coherence) as network edges. Main results. We confirm the critical roles of beta bands and provide additional evidence on their differential functional roles in the pallidocortical motor network. Moreover, significant changes (p < 0.05) in network functional segregation and integration between rest and movement conditions are revealed for the first time. More importantly, movement-dependent modulation of these network metrics are significantly correlated with hemibody unified PD rating scales (UPDRS), providing network-level perspectives of the pallidocortical motor network pertaining to PD symptoms (p < 0.05). Significance. Findings in the present study provide network-level understanding of neuronal mechanisms in the pallidocortical motor network underlying PD. It is also highly plausible that the demonstrated approach can be applied in other important subcircuits towards a comprehensive understanding of the BGTC motor network.

Energy-Efficient Video-On-Demand Content Caching and Distribution in Metro Area Networks

The success of novel multimedia services, such as video-on-demand (VoD) is leading to a tremendous growth of Internet traffic. Content caching can help mitigate such uncontrolled growth by storing video content closer to the users in core, metro, and access network nodes. So far, fixed, and, especially, mobile access networks have evolved independently, leveraging logically (and often also physically) separate infrastructures. This means that mobile users cannot access caches placed in the fixed access network (and vice-versa) even if they are geographically close to them, and energy consumption implications of such undesired effect must be investigated. In this paper we perform an evaluation of energy-efficient VoD content caching and distribution under static and dynamic traffic in converged networks as well as in non-converged networks. We define an integer linear programming optimization problem modeling an energy-efficient placement of caches in core, metro, and fixed/mobile access nodes where energy is minimized by powering-on and -off caches located in different segments of the network and by performing an energy-efficient VoD-request routing. To deal with problem complexity, we propose an energy-efficient content caching and VoD-request routing heuristic algorithm, which is also adopted under dynamic traffic scenarios. Our results show how deploying caches in the access and metro network segments can reduce the overall energy consumption of the network. Moreover, results show how the evolution toward a fixed-mobile converged metro/access network, where fixed and mobile users can share caches, can reduce the energy consumed for VoD content delivery.

Non-full-available queueing model of an EON node

This paper presents a model of a queueing system with non-full-availability server and multi-service Bernoulli-Poisson-Pascal (BPP) traffic. This model is then used for an analysis of an Elastic Optical Network (EON) access node. The model enables the basic characteristics of the system to be determined and, in particular, allows the average number of calls in the queue or blocking probability to be estimated. Proposed model is approximate. The results of the analytical calculations were compared with the results of the simulation experiments, which confirms high accuracy of the proposed analytical solutions.

ТЕРАГЕРЦОВИЙ КАНАЛ РАДІОДОСТУПУ ДЛЯ КОМПЛЕКСІВ БЕЗПЕКИ СИСТЕМ ВИЯВЛЕННЯ ПРИХОВАНИХ ОБ’ЄКТІВ

One of the perspective use of THz (submillimeter) technologies is the wireless communication systems. In particular, it will lead to development of the submillimeter/THz band devices with brand new size, interference immunity and energy efficiency, for high speed video signal broadcasting, line of sight relay, for 5G cell phone transport networks, high precision radars for small size, high velocity target detection and tracking, and hidden object detection radiometric systems. Nowadays, the research of such wireless systems is focused on increase of communication channel bandwidth using superbroadband signals, which occupy all the THz band. However, it’s worth to mention, that in many perspective applications of 5th generation networks, the range has more important role, than the data transmission speed. The goal of the article is the increase of communication center’s information efficiency by the development of innovative solution for construction of the wireless broadband subscriber channel for information resource access using THz band, which provides greater efficiency in the channel’s range and bit rate. The results of THz-band wireless broadband access technical solution analysis are being provided here. The implementation of broadband access requires designating significant informational resource amount per subscriber, which, if the designated resource amount is not enough, leads to decrease in efficiency in service providing. Today’s lack of transmitter/receiver hardware of decent cost, when using unlicensed THz frequencies in backhaul network channels, leads to significant decrease of backhaul network channel length, which means decrease of the network zone size. Therefore, to avoid these flaws, the new technical solution for every subscriber’s bit rate increase, the subscriber amount increase on the territory covered by the access point, and the service coverage territory expansion possibility, is being provided here. During the THz-band channel broadcast system deployment process, one of the main issue is the channel and time resource distribution between the wireless communication system’s different sectors (directions), which is due to the change of traffic quality and amount. A generalized channel and time resource amount prediction algorithm is being provided for high efficiency wireless access channel. The control of such system can be done similarly to the server network. Territorial access point location allows: the increase of data amount being provided to the covered territory subscribers; the possibility to hold energy resource (energy per bit), which means the backhaul channel length is being preserved; the possibility of covered territory size expansion. Generally, the developed solution allows to increase the new generation wireless system data use efficiency, to increase the distance to remote subscriber network in some times, depending on the network access node’s input data stream ratio, and to increase the amount of wireless access points.

Fine-grained cache deployment scheme for arbitrary topology in ICN

Information-centric networking (ICN) is one of the promising candidates for the future network architecture. In-network caching deployed on the routers is the key feature in ICN, which can improve the network performance, off-load network traffic, and further reduce the latency perceived by end users. The appropriate cache capacity assignment and deployment are important factors in ICN performance optimization. In this paper, a fine-grained cache deployment scheme is proposed for the access network based on the traffic load in order to determine the cache location and the cache capacity on the chosen routers simultaneously. Under the total capacity preplanned, we first organize the nodes in access network into hierarchical structure based on the node connectivity. And then a certain cache capacity is decided to deploy on the routers in a hierarchical layer with the best performance each time, until the total capacity is successfully deployed in the ICN network. The simulation results show that the fine-grained cache deployment scheme is always better than the content distribution network-like scheme or edge caching policy, in which the cache capacity is only deployed on the boundary routers.

Evolution Toward 5G Mobile Networks – A Survey on Enabling Technologies

In this paper, an extensive review has been carried out on the trends of existing as well as proposed potential enabling technologies that are expected to shape the fifth generation (5G) mobile wireless networks. Based on the classification of the trends, we develop a 5G network architectural evolution framework that comprises three evolutionary directions, namely, (1) radio access network node and performance enabler, (2) network control programming platform, and (3) backhaul network platform and synchronization. In (1), we discuss node classification including low power nodes in emerging machine-type communications, and network capacity enablers, e.g., millimeter wave communications and massive multiple-input multiple-output. In (2), both logically distributed cell/device-centric platforms, and logically centralized conventional/wireless software defined networking control programming approaches are discussed. In (3), backhaul networks and network synchronization are discussed. A comparative analysis for each direction as well as future evolutionary directions and challenges toward 5G networks are discussed. This survey will be helpful for further research exploitations and network operators for a smooth evolution of their existing networks toward 5G networks.

Research and Application of FPGA-Based Polling Strategy in Ad Hoc Network Data Acquisition System

Ad Hoc network has the characteristics of self-organization and dynamic topology, so it can use polling strategy for data collection. In this paper, the data link layer of the Ad Hoc network data acquisition system has been carried out the detailed analysis and study, through the use of polling policy in the access network node to solve the problem of competition for resources and allocation mechanism in the network link, and improve the channel utilization and system stability. The design based on VHDL language to achieve RTL-level description of the Ad Hoc network data acquisition system, and Altera Corporation EP2C35F672C6 as target chip, and in the Quartus II platform 8.0 conducts synthesis, placement, routing, and comprehensive simulation, and finally inDE2 the experimental board download is verified. The entire hardware design is of simple structure, reliable high, real-time, and can be widely used in the field of sensor networks and mobile communications network.

Modeling access network: Maximum node-degree determines the traffic of the internet

It has been demonstrated that both routers and domains in the Internet have a scale-invariant fractal structure. However, nodes in access network (AN) level are found demonstrate a random geographic distribution. In this paper, we investigate the AN by proposing a model in which the nodes are randomly posited at given regions. In particular, we design a new node-attachment strategy that can yield a connectivity pattern more consistent with real configuration. Taking into account of both the geographical distribution of the nodes and specific local connectivity, our model can therefore serve as more accurate description of real-world Internet. We furthermore use this model to study the traffic load of the Internet, and we found that the optimal betweenness centrality variance and average path length, which is associated with an optimal traffic load, can be obtained by setting a suitable maximum degree Kmax for the AN. Our results indicates that the optimal value of Kmax increases linearly with the number of nodes, which provide useful guidance to improve throughput and transmission efficiency when designing the access network.

Research of Ad Hoc Networks Access Algorithm

Abstract With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. When the ad hoc network is the access network of the internet, the gateway discovery protocol is very important to choose the most appropriate gateway to guarantee the connectivity between ad hoc network and IP based fixed networks. The paper proposes a QoS gateway discovery protocol which uses the time delay and stable route to the gateway selection conditions. And according to the gateway discovery protocol, it also proposes a fast handover scheme which can decrease the handover time and improve the handover efficiency.

Ad Hoc Access Gateway Selection Algorithm

Abstract With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

Optimized ZRP for MANETs and its Applications

In this paper, we unified two new algorithms, i.e., to selectively Bordercast the control packets in order to reduce the network load by limiting the number of control packets when ZRP searches for a new route. The second algorithm is proposed to optimize the performance of Query control mechanisms for the Zone Routing Protocol (ZRP) for mobile ad hoc networks for communication on an urban terrain. ZRP proactively maintains routing information for a local neighbourhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. This hybrid routing approach can be more efficient than traditional Zone Routing Protocol (ZRP) framework. However, without proper query control techniques, the ZRP cannot provide the expected reduction in the control traffic. Our proposed algorithm enhances the structure of the routing zone to provide enhanced detection and prevention of overlapping queries. These techniques can be applied to single or multiple channel mobile adhoc networks to improve both the delay and control traffic performance of ZRP. Our new algorithm allows ZRP to provide routes to all accessible network nodes, with less control traffic than purely proactive link state or purely reactive route discovery, and with less delay than conventional flood searching. To further improve the efficiency of Enhanced ZRP, our future work shall propose a new algorithm to overcome the generation of periodic updates in the routing table to reduce the control traffic. Thus by the implementation of our proposed algorithm the time taken to receive the first packet will be minimized, which results in better throughput. The performance evaluation via simulations using a well known simulator QualNet version 5.0 shows that the new approach has better performance than the traditional ZRP.

Achieving energy savings and QoS in internet access routers

In order to provide high quality communications over a best-effort network, an alternative to complex QoS control procedures is represented by generously over-provisioning the network resources. This approach has guaranteed in the near past reasonably performance for many applications, but it implies a waste of energy that today is unsustainable. This paper proposes an autonomous measurement mechanism, named G-Router, to allow an access node in the Internet to align its power consumption to either the maximum capacity the user traffic requires, or the minimum available capacity in the network path between source and destination. Simulation results show that allowing access network nodes to adapt the switching and transmission resources to the minimum between the above values, the G-Router guarantees the maximum QoS while minimizing the energy consumption.

Performance Analysis of OVPN Over OBS/MPLS Architecture with Different Priorities Traffic

The implementing of optical virtual private networks (OVPNs) over an optical burst-switching (OBS) network based on MPLS is discussed. The network architecture, the core and access nodes faculty are described. We also propose a new model with three traffic priorities, which used to analysis the delay and blocking performance of OVPN over OBS/MPLS network based on queuing theory.

A network-based global mobility management architecture

This paper specifies a network-based global mobility management architecture, named NetGMM. NetGMM supports network-based mobility management and non-Mobile IP mobile environment. There are two design considerations. The first is that a future mobile network requires network-based mobility management, shifting the mobility management function from Mobile Nodes (MN) to Access Network (AN) nodes. The second is that future mobile networks will support IP multi-services, introducing a separation between network address and identity of a mobile node entity, allowing heterogeneous networks to work together without loss of functionality.