Resource Reservation Mechanism Research Articles

Analytical Model of the Connection Handoff in 5G Mobile Networks with Call Admission Control Mechanisms.

Handoff mechanisms are very important in fifth-generation (5G) mobile networks because of the cellular architecture employed to maximize spectrum utilization. Together with call admission control (CAC) mechanisms, they enable better optimization of bandwidth use. The primary objective of the research presented in this article is to analyze traffic levels, aiming to optimize traffic management and handling. This article considers the two most popular CAC mechanisms: the resource reservation mechanism and the threshold mechanism. It presents an analytical approach to occupancy distribution and blocking probability calculation in 5G mobile networks, incorporating connection handoff and CAC mechanisms for managing multiple traffic streams generated by multi-service sources. Due to the fact that the developed analytical model is an approximate model, its accuracy was also examined. For this purpose, the results of analytical calculations of the blocking probability in a group of 5G cells are compared with the simulation data. This paper is an extended version of our paper published in 17th ConTEL 2023.

Advanced Considerations Concerning Impact of Applied Call Admission Control Mechanisms on Traffic Characteristics in Elastic Optical Network Nodes

Over the past few years, a significant increase in network traffic volumes has been observed. The ever growing bandwidth demands mean that a reliable and optimum service level needs to be ensured in communication systems for specific traffic categories. Optimal allocation and use of resources may be achieved through the use of call admission control (CAC) mechanisms implemented in network systems. The resource reservation mechanism and the threshold mechanism are two of the most popular CAC methods. In the reservation mechanisms, a certain number of resources is reserved for selected (predefined) services only. In the case of threshold mechanisms, the number of resources allocated to individual traffic classes depends on the network load. This article discusses the results of simulations verifying the impact of applied CAC mechanisms on the traffic characteristics in elastic optical network (EON) nodes with a Clos structure. Loss probability results obtained with the use of the simulator are presented as well.

Performance Comparison of JIT and JET Protocols on the OBS Networks

Over the past few years, internet traffic has been explosive growth due to users' need for more applications and services. All these developments on the internet need more bandwidth. The Optical Burst Switching (OBS) mechanism along with Wavelength-Division-Multiplexing (WDM) technology is very useful in meeting the high bandwidth requirements. However, the OBS network uses a one-way resource reservation mechanism, as well as it is a buffer lack at the intermediate (core) node. Therefore, the OBS network depends on contention resolution mechanisms to achieve acceptable levels of performance. In this paper, the Deflection Routing (DR) mechanism is used to overcome contention. The performance of the OBS network has been estimated by executing Just-In-Time (JIT) and Just-Enough-Time (JET) signaling reservation protocols with the DR. NCTUns-6.0 simulator was employed to verify the performance of the OBS network based on two metrics: throughput and packets dropped in the network. The results show that the bandwidth resources utilization in the OBS network with JET and DR (OBS-JET-DR) is better than in the OBS network with JIT and DR (OBS-JIT-DR). However, the average number of packets dropped in OBS-JET-DR is less than OBS-JIT-DR by 21%. In addition, the throughput of OBS-JET-DR has increased by 4% compared with OBS-JIT-DR.

Two-Stage Traffic Load Prediction-Based Resource Reservation for Sliced HSR Wireless Networks

In this letter, we propose a two-stage traffic load prediction scheme for network slices (NSs) in high-speed railway (HSR) wireless networks, where in the first stage, the K-means algorithm is leveraged to cluster traffic flows, and in the second stage, the long-short term memory (LSTM) algorithm is applied to predict the traffic load. Based on the obtained traffic features (including traffic volume and user velocity) and the network radio resource characteristics (including coverage performance and capacity), we design a service-tailored resource reservation mechanism. Simulation results show that our proposed scheme can significantly improve the traffic load prediction accuracy to ensure the NS resource reservation performance.

Video Streaming Adaptive QoS Routing with Resource Reservation (VQoSRR) Model for SDN Networks

Video streaming has become extremely widespread, especially with the growing number of users and the spread of mobile devices, along with the increase in the availability and diversity of multimedia applications and communication technologies. Real-time video communication requires awareness of the quality of experience (QoE) to provide customers with a satisfactory service, for example, in smart cities that use video surveillance systems. The quality of service (QoS) is dependent on network performance, which directly affects the QoE. However, reliance on traditional network infrastructure and routing protocols cannot assure QoS. The emergence of software defined networks (SDN) may eliminate current network limitations. Due to SDN’s global view and programmability characteristics, such capabilities could help in providing an automated QoS control and management. This paper introduces video streaming adaptive QoS-based routing and resource reservation (VQoSRR), which gives SDN networks the ability to meet video demands and enhance user experience over best effort networks, such as the ones required for video surveillance in smart cities. In order to implement QoS-based routing (QBR), we developed algorithms for calculating routing, installing routing paths in the forwarding devices, and shifting traffic to an alternative path when QoE is violated. As well, we used queuing mechanisms to allocate resources based on the QoE requirements of video streaming. Our results indicate that resource reservation mechanisms combined with QoS-based routing enable effective control over routes and resources. Our framework guarantees the video quality as well. This technique of using video streaming would improve the tools and applications used for smart cities such as surveillance systems for hospitals and civil defense organizations.

An efficient hybrid integer and categorical particle swarm optimization algorithm for the multi-mode multi-project inverse scheduling problem in turbine assembly workshop

This article deals with the multi-mode multi-project inverse scheduling problem of the turbine assembly workshop in a Chinese electric power station equipment manufacturing firm considering some unexpected disturbances in the assembly process, such as materials delay, equipment failure and parts rework, etc. The objective is to optimize the assembly cost in inverse scheduling under the constraints of due date, worker modes, cranes, etc. A modified integer and categorical particle swarm optimization algorithm combined with Tabu search (MICPSO-TS) is proposed. In the proposed MICPSO-TS, double-vector encoding is presented to show the execution modes of activities and overtime schedule of projects which are optimized by ICPSO and TS respectively. A hybrid heuristic decoding algorithm (HHDA) including project order selection rules, crane scheduling rules, resource reservation mechanism and overtime determination rules is proposed. Eventually, the feasibility and effectiveness of the proposed MICPSO-TS are verified by the experimental test data and a real-world engineering case.

A Tutorial on Mathematical Modeling of 5G/6G Millimeter Wave and Terahertz Cellular Systems

Millimeter wave (mmWave) and terahertz (THz) radio access technologies (RAT) are expected to become a critical part of the future cellular ecosystem providing an abundant amount of bandwidth in areas with high traffic demands. However, extremely directional antenna radiation patterns that need to be utilized at both transmit and receive sides of a link to overcome severe path losses, dynamic blockage of propagation paths by large static and small dynamic objects, macro- and micromobility of user equipment (UE) makes provisioning of reliable service over THz/mmWave RATs an extremely complex task. This challenge is further complicated by the type of applications envisioned for these systems inherently requiring guaranteed bitrates at the air interface. This tutorial aims to introduce a versatile mathematical methodology for assessing performance reliability improvement algorithms for mmWave and THz systems. Our methodology accounts for both radio interface specifics as well as service process of sessions at mmWave/THz base stations (BS) and is capable of evaluating the performance of systems with multiconnectivity operation, resource reservation mechanisms, priorities between multiple traffic types having different service requirements. The framework is logically separated into two parts: (i) parameterization part that abstracts the specifics of deployment and radio mechanisms, and (ii) queuing part, accounting for details of the service process at mmWave/THz BSs. The modular decoupled structure of the framework allows for further extensions to advanced service mechanisms in prospective mmWave/THz cellular deployments while keeping the complexity manageable and thus making it attractive for system analysts.

Determination of Traffic Characteristics of Elastic Optical Networks Nodes with Reservation Mechanisms

With the ever-increasing demand for bandwidth, appropriate mechanisms that would provide reliable and optimum service level to designated or specified traffic classes during heavy traffic loads in networks are becoming particularly sought after. One of these mechanisms is the resource reservation mechanism, in which parts of the resources are available only to selected (pre-defined) services. While considering modern elastic optical networks (EONs) where advanced data transmission techniques are used, an attempt was made to develop a simulation program that would make it possible to determine the traffic characteristics of the nodes in EONs. This article discusses a simulation program that has the advantage of providing the possibility to determine the loss probability for individual service classes in the nodes of an EON where the resource reservation mechanism has been introduced. The initial assumption in the article is that a Clos optical switching network is used to construct the EON nodes. The results obtained with the simulator developed by the authors will allow the influence of the introduced reservation mechanism on the loss probability of calls of individual traffic classes that are offered to the system under consideration to be determined.

Methods for Estimating the Required Volume of Resource for Multiservice Access Nodes

We construct and study a mathematical model for the distribution of information transmission resource in a multiservice access node. The model considers an arbitrary number of multimedia traffic streams, which differ in the intensity of claims arrival, the amount of resource used to service one claim, and the resource occupation time. The time intervals between the arrival of claims have an exponential distribution with a parameter depending on the number of claims being serviced in the considered flow. We construct a recursive algorithm for evaluating the characteristics. Relations are established between the integral and flow characteristics of the quality of service for the claims. We construct an efficient algorithm for estimating the amount of resource required to service given traffic flows with required quality. The efficiency of the computational procedure is achieved as a result of organizing recursion over the volume of resource and the use of normalized values of state probabilities. We consider a solution to the problem of estimating the required amount of resource for a multiservice node model, which allows to use resource reservation and dynamic distribution mechanisms when servicing elastic traffic. We show numerical examples that illustrate the features of the implementation of the constructed computational procedures.

Stable Matching for Wireless URLLC in Multi-Cellular, Multi-User Systems

Ultra-Reliable Low-Latency Communications (URLLC) are considered as one of the key services of the upcoming fifth generation (5G) of wireless communications systems. Enabling URLLC is especially challenging due to the strict requirements in terms of latency and reliability. Multi-connectivity is a powerful approach to increase reliability. However, most of the current research is restricted to single-user scenarios, neglecting the challenges of multi-cellular, multi-user systems, i.e., interference and the competition for limited resources. In this article, we develop analytic comparisons of different connectivity approaches, showing that multi-connectivity may not always be optimal in the considered scenario. Moreover, we propose and evaluate novel resource allocation approaches based on stable matching theory to enable wireless URLLC. We extend the pure many-to-one stable matching procedure by utilizing the optimal connectivity approach for each user, optimizing the maximum number of matched resources, and providing a resource reservation mechanism for users suffering from bad channel conditions. System-level simulations demonstrate that the proposed algorithm outperforms baseline resource allocation approaches in outage probability by up to three orders of magnitude. Even in a highly loaded system, an outage probability in the range of ${10^{-5}}$ is achieved.

An intelligent resource dynamic allocation method for UAV wireless mobile network which supports QoS

The development of Unmanned Aerial Vehicle (UAV) business requires that the wireless mobile network can provide the highest possible data rate with limited wireless resources and harsh channel environment, while ensuring the requirements of different quality of service (QoS). The present algorithm only considers one or two spatial sub channels with the maximum eigenvalue, and does not consider how to satisfy multiple requirements with limited resources, nor does it consider the problem of admission control. In order to solve the above problems, this paper proposes an intelligent resource dynamic allocation method based on QoS. In this paper, resources are managed effectively through resource reservation mechanism and selective QoS adjustment mechanism. Then, all non-zero eigenvalue space sub channels are used for data transmission to maximize channel capacity under the condition that the total transmission power is limited and user QoS requirements are met. The simulation results show that the algorithm can effectively improve the throughput of the system by making full use of multi-user diversity on the basis of satisfying the QoS requirements of users.

Sector-Based Efficient Trust Routing Protocol (SETRP) with Text Based Compression for Maximizing the Lifetime of WSN

WSN is distributed for the dispersion of different sensor nodes in a predetermined topology to sense the environment with finite resources, and by using cluster head the perceived data is communicated with the base station. WSN is a wireless network which consists of base stations and various sensor nodes. WSN can implement different functions like cluster’s head modification, avert redundant messages, resource reservation mechanism and resource cancellation mechanism. There is a major problem in the distribution of WSN i.e., ‘Non-uniform terrain structure’. Because of the irregular terrain structure, distribution of sensor nodes is stochastic in nature and due to this stochastic distribution, nodes are not properly arranged in a distributed way. A Sector-Based Efficient Trust Routing Protocol (SETRP) with Text based Compression is proposed by splitting the network into distinct clusters and then dividing the clusters into sub-clusters. Each sub-clusters are again classified into distinct sectors and each sector is designated with a sector head. The attainment of proposed approach is to compare this protocol with similar protocols (like GEED-M, EETRP, and FERP) accomplished for peculiar terrain structure like plateaus and military areas. A Sector-based Efficient Trust Routing Protocol (SETRP) with Text based Compression is to boost up the lifetime of the network by 69%, and to diminish the energy consumption of the network by 30%.

Reconfiguration in Network Slicing—Optimizing the Profit and Performance

Network slicing enables diversified services to be accommodated by isolated slices in network function virtualization-enabled software-defined networks. To maintain satisfactory user experience and high profit for service providers in a dynamic environment, a slice may need to be reconfigured according to the varying traffic demand and resource availability. However, frequent reconfigurations incur certain cost and might cause service interruption. In this paper, we propose a hybrid slice reconfiguration (HSR) framework, where a fast slice reconfiguration (FSR) scheme reconfigures flows for individual slices at the time scale of flow arrival/departure, while a dimensioning slices with reconfiguration (DSR) scheme is occasionally performed to adjust allocated resources according to the time-varying traffic demand. In order to optimize the slice’s profit, i.e., the total utility minus the resource consumption and reconfiguration cost, we formulate the problems for FSR and DSR, which are difficult to solve due to the discontinuity and non-convexity of the reconfiguration cost function. Hence, we approximate the reconfiguration cost function with ${L} _{1}$ norm, which preserves the sparsity of the solution, thus facilitating restricting reconfigurations. Besides, we design an algorithm to schedule FSR and DSR, so that DSR is timely triggered according to the traffic dynamics and resource availability to improve the profit of slice. Furthermore, we extend HSR with a resource reservation mechanism, which reserves partial resources for near future traffic to reduce potential reconfigurations. Numerical results validate that our reconfiguration framework is effective in reducing reconfiguration overhead and achieving high profit for slices.

The Delay-Constraint Broadcast Combined With Resource Reservation Mechanism and Field Test in VANET

VANET broadcasting algorithm plays an important role in ensuring the reliability and speed of information interaction between vehicles. Recently, the multi-hop broadcast has become a promising direction. In this paper, we propose a multi-hop broadcasting algorithm called delay-constraint broadcast combined with resource reservation mechanism (DBCRRM) which can increase the packet delivery ratio (PDR) effectively. The proposed broadcasting algorithm can make use of the distance between the source node and receiving nodes to select the forwarding node and uses the resource reservation mechanism (RRM) to select the resource of timeslot and frequency. Meanwhile, the algorithm can ensure the delay in the permissible range. Due to the difficulty of the field test in VANET broadcasting algorithms, most VANET broadcasting algorithms are only evaluated by simulation but lack the results of field tests. To make up the deficiency, we design a field test platform for broadcasting algorithms in VANET, and practically test the delay-constraint broadcast (DB) and DBCRRM. Compared to the test results of two-hop broadcast and the one-hop broadcast, the DBCRRM and DB show the superiority and practicability.

SDN Based Energy Efficient Mechanism for Constrained Networks

Constraint networks consist of a large number of nodes, where each node is limited by its resources like memory, bandwidth, and energy. Most of the applications being developed in such networks are meant for critical a service which requires high computation leading to power dissipation and energy consumption. In such constraint networks, energy consumption is a significant cost factor for computing resources. Hence, there is a need for design and development of an efficient mechanism for optimal utilization of energy. This paper proposes a Software Defined Networking based resource reservation mechanism for optimal utilization of energy by reducing the energy consumption of each node thereby reducing the overall energy consumption of the system. Results of the proposed work have proven the reduced energy consumption and hence increasing the system performance.

HTS通信系统波束切换动态资源预留机制研究

HTS通信系统波束切换动态资源预留机制研究

Analytical modelling of multiservice switching networks with multiservice sources and resource management mechanisms

This article proposes a new analytical method of determining occupancy distribution and blocking probability in multiservice switching networks with admission control mechanisms and resource management mechanisms. The proposed method is a universal one, which allows for determining blocking probability using the same model, regardless of the type of admission control mechanisms and resource management mechanisms. The versatility of the method is demonstrated in the article for two selected mechanisms, i.e. a threshold mechanism and a resource reservation mechanisms. The switching networks under consideration are offered multiservice traffic streams, generated by the so-called multiservice sources, according to Erlang, Engset and Pascal distributions. The proposed method is based on a generalised way of determining traffic characteristics for inter-stage links of switching networks with resource and call management mechanisms. Particular attention is given to determining the influence of the introduced mechanisms in outgoing links of the switching network on the traffic properties of inter-stage links of the network. The results of analytical calculations are then compared with the results obtained in digital simulation for a number of selected switching networks.

QoS Routing for Multimedia Communication over Wireless Mobile Ad Hoc Networks

A lot of intensive research has been carried out in the direction of providing multimedia communication over wireless mobile ad hoc network (MANET). In MANET, various QoS problems exist such as inefficient routing, handling node mobility, power conservation, limited processing capabilities of network devices, high error rates. Wireless routing introduces new challenges as applying basic routing algorithms directly on MANET could lead to large power consumption, interference, and load-balancing problems. Many routing algorithms have been proposed as extensions to the basic routing algorithms to enhance their performance in MANETs. This paper summarizes existing solutions on QoS routing and resource reservation mechanisms in order to provide multimedia communication over MANET. It also considers the limitations of existing QoS models with regard to satisfying QoS in serving multimedia over MANET. The newest QoS architectures give much better results in providing QoS support. However, more refinements must be proposed in order to enhance further their performance in MANETs.

Soft Resource Reservation for Low-Delayed Teleoperation Over Mobile Networks

The emerging Tactile Internet (TI) will enable control-oriented networks for remotely accessing or manipulating objects or devices. One major challenge in this context is how to achieve ultra-low-delay communication between the local operator and the remote object/device to guarantee the stability of the global control loop and to maximize the user’s quality-of-experience (QoE). Being one of the major human-in-the-loop applications of the TI, haptic teleoperation inherits its delay-sensitive nature and requires the orchestration of communication and control approaches. In this paper, we focus on the radio access protocol, and its impact on the latency of wireless communication. We propose a novel soft resource reservation mechanism for the uplink scheduling of mobile networks that can significantly reduce the latency compared with the current legacy scheme. By leveraging the characteristics of teleoperation data traffic, and reserving resources accordingly, the proposed soft reservation scheme maintains the spectral efficiency while the human operator’s QoE is improved. The simulation results confirm the efficiency of the proposed scheme.

Multiservice Switching Networks with Overflow Links and Resource Reservation

This paper proposes a new analytical model of a multiservice switching network with overflow links in the first stage and resource reservation for selected call classes in output directions. The proposed model assumes that both the overflow mechanism and the resource reservation mechanism can be used in a number of selected, or all, classes of calls. A particular attention is given to the way the effective availability parameter for networks with overflow links in the point-to-point selection mode is determined. The proposed model makes it possible to determine dependencies between the internal blocking probability, capacity of overflow links, and the number of reserved resources for call classes to be analysed. Simulation experiments confirm high accuracy of the proposed method and potential applications of the model in engineering issues.