Reservation Protocol Research Articles

A Blockchain-Based Privacy-Preserving Charging Station Reservation and Payment Scheme for Electric Vehicles

EV charging infrastructures traditionally rely on untrusted centralized infrastructures that pose several privacy and security threats to EVs’ personal information. Targeted advertisements, privacy leaks, selling data to third parties, are among the threats to privacy and security. By utilizing blockchain-based solutions, recent work address the security and privacy problems associated with EV charging protocols. Most of them are geared toward maintaining EV anonymity rather than preserving end-to-end privacy. As EV owners’ charging histories and payment information are associated with their wallet address on the blockchain, any threat of linkability of these blockchain addresses to physical identities can pose a serious risk to their privacy. In this paper, we propose a ring signature based privacy-preserving end-to-end charging station (CS) reservation and payment protocol, which provides EV owners with the ability to reserve and pay for a charging slot privately, without sharing private information or exposing their identity or addresses at CS locations. Additionally, we provide EV owners with a decentralized charging slot information verification protocol with the help of secure multiparty computation (SMC), which allows them to verify available slots. A dispute resolution mechanism is also proposed that handles disputes between EVs and CSs and penalizes them accordingly by utilizing trusted execution environment (TEE). Results show that the proposed protocol ensures end-to-end EV owners’ privacy with low blockchain transaction and computation overhead.

DeSSR: A Decentralized, Broadcast-Based Scalable Scheduling Reservation Protocol for 6TiSCH Networks

DeSSR: A Decentralized, Broadcast-Based Scalable Scheduling Reservation Protocol for 6TiSCH Networks

Estimation of the Achievable Performance of Mobile Ad Hoc Networks with Optimal Link State Routing

The paper explores the challenges of constructing self-organizing wireless mobile ad hoc networks (MANETs) utilizing Optimal Link State Routing (OLSR) with MPR (MultiPoint Relay) optimization and quality control through the RSVP (Resource Reservation Protocol). Analytical expressions are presented for calculating the achievable network characteristics, including route acquisition time, network efficiency (routing overhead), packet transmission delay (end-to-end delay), and signal propagation losses between nodes assuming no packet collisions within the network nodes. The possibility of network scalability is analyzed depending on the scenarios of operation and the number of network nodes. Recommendations for the construction and scalability of self-organizing wireless networks are formulated based on the conducted evaluations and calculations.

Design and Development of IOT based Telematics System for Electric vehicle

This paper functionally designs an efficient electric vehicle telematics framework for smart transportation, aiming at providing an EV-related advertisement via digital multimedia broadcasting. The electric vehicle charge service develops a reservation protocol between drivers and stations, station-side scheduling, and path adaptation according to a new charge plan. Taking advantage of information technology and wireless communication, the telematics system can support electric vehicle tracking, vehicle sharing, charging station selection, and location data analysis. In addition, as a promising business model, electric vehicle sharing needs station placement and relocation schemes, to which a previous pick-up point analysis result can give a helpful guide. The telematics framework enriches the related applications with diverse basic service building blocks and thus accelerates the penetration of electric vehicles into our daily life. Keywords: Electric Vehicle Road Network, Smart Grid, Path Adoption, Malware

On Offloading Decision for Mobile Edge Computing Systems Considering Access Reservation Protocol

For several years, mobile edge computing (MEC) has been highlighted as a promising technique to support emerging computation-intensive applications in cellular networks, e.g., 5G and 6G. Most previous studies have mainly focused on jointly optimizing communication (i.e., radio) and computation resources to improve offloading performance without considering specific communication protocols required for operating the MEC systems in practice. In this article, we newly design a contention-based access reservation protocol (ARP) for efficiently supporting simultaneous task offloading requests from a number of edge devices (EDs), and further define necessary signalings required to determine an optimal offloading factor. Thereafter, we formulate an optimization problem to find the optimal offloading factor that minimizes the task-completion latency. Through simulations, we mainly evaluate the task-completion latency performance of the MEC system incorporated with our proposed access reservation protocol under a multiple-input multiple-output (MIMO) environment. Particularly, we thoroughly investigate several practical aspects such as the effect of the number of edge devices attempting to join the task offloading, the number of antennas equipped at the edge device, and the amount of reserved radio resources required for configuring access reservation protocol on the optimal offloading decision. From the results, we verify the validity of our approach, and provide meaningful insights regarding how the network should be configured to fruitfully exploit the offloading with the MEC systems.

Возможности протокола резервирования ресурсов для повышения пропускной способности и надежности передачи трафика между системами коммутации

As a research task, the authors define the features of the use of the resource reservation protocol (RSVP) in modern networks of MPLS (Multi protocol label switching) technology, which provides an increase in the throughput of delay-sensitive voice and video traffic. The RSVP protocol allows you to transfer requirements for the level of Quality of Service (QoS) with reference to data flows. The article discusses the characteristics of the RSVP protocol. The use of RSVP of three reservation styles is considered, as well as an extension of RSVP that supports better QoS, the establishment of explicit routable paths (LSP) with or without reservation, the possibility of LSP redirection. The benefits of segment routing (SR) are discussed in giving the network operator more control over the network, simplifying the network, and supporting class of service. It also discusses the protection mechanisms for MPLS-TE tunnels to provide failover.

MAC Protocol for Two-Tier Underwater Wireless Networks With Distance-Dependent Propagation Delay Variation

In this paper, we consider a two-tier communication scenario for the data transmission of underwater sensor network. The underwater sensor nodes form single-hop clusters around the gateway nodes and communicate with them via acoustic wireless links, while the gateway nodes communicate to the remotely located sink node directly via radio frequency (RF) wireless links. Thus, the field data is collected at the sink node via two-hop communication links. The first hop acoustic communication link is characterized by long propagation delay and distance-dependent delay variance, whereas the second hop is considered to be connected by satellite links which is characterized by long propagation delay but negligible propagation delay variance. We use ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> , <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula> ) to denote that medium access control (MAC) protocol <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> is used at first hop and MAC protocol <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$Y$ </tex-math></inline-formula> is used at second hop. For the first hop communication, we propose and analyze the performance of dynamic reservation protocol (DRP) in presence of transmitter-receiver distance-dependent propagation delay variance. Then, considering TDMA-reservation protocol (TRP) in the second hop, we analyze (DRP, TRP) protocol performance at the sink. Further, we study the optimum cluster size that maximizes the overall network utilization and compare the performance with the (Aloha, Aloha) protocol. We show that, for Exponentially distributed large message the utilization of our protocol set (DRP, TRP) is approximately thrice the utilization of (Aloha, Aloha) protocol. Also, the delay of (DRP, TRP) is significantly less than the delay of (Aloha, Aloha) with long message size as well as with high load scenario. The analytical results are supported by discrete event based random network simulation studies.

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.

A trusted effective approach for forecasting the failure of data link and intrusion in wireless sensor networks

Wireless sensor network (WSN) is often utilised in many different industries for a variety of purposes. The improved network access area and quick network setup make it an excellent technology. However, certain eradicating problems will also be present, slowing the expansion of the network. The forecasting of connection failure is still thought to be a mystery in the WSN area. The suggested method provides a thorough understanding of connection failure. This method introduces the proficient trustworthy Node ID dependent resource reservation protocol (PTN-RRP). Then, using technique weighted on end-to-end latency, the shortest path is identified. Major issues with WSN include data link failure and intrusions. This method might increase the rate of detection since it determines the shortest route from a particular preliminary point to the target. The hop address and sequence number are added to the protocol by determining the shortest path. Following the discovery of the shortest path, the likelihood of connection failure is calculated. The established trustworthy etiquette adopted has a link failure structure that can foresee and resolve connection failure-related problems. After that, a posterior probability evaluation approach is used to determine the type of assault in order to determine the attack reason intended for the connection failure. Finally, a simulation study is used to evaluate the performance of the suggested strategy. The simulation's results show that the proposed technique is extremely successful in identifying link breaks, and the developed algorithm for recognising the shortest path will shorten the time required to find the shortest way. To demonstrate the usefulness of the suggested methodology, the performance result is contrasted with currently used procedures.

Revisiting network congestion avoidance through adaptive packet-chaining reservation

Endpoint congestion is a bottleneck in high-performance computing (HPC) networks, which severely impacts system performance, especially for latency-sensitive applications. When the long messages (or flows) has a far larger duration than the round-trip time (RTT), the proactive or reactive countermeasures, an effective solution to endpoint solution, can control the injection rate within a proper range dynamically. However, many HPC applications produce hybrid traffic (a mix of short and long messages) and are dominated by short messages. Existing proactive congestion avoidance methods face the great challenge of scheduling the rapidly changing traffic caused by these short messages. In this paper, we first propose the Packet-Chaining Reservation Protocol (PCRP), that is, a novel congestion management strategy which leverages the advantages of proactive (scheduling the whole flow) and reactive (scheduling the single packet) congestion avoidance techniques. In fact, it is an eclectic method of scheduling. We select the chaining of packets as a flexible reservation granularity between the whole flow and a single packet. The PCRP allows small flows to be speculatively transmitted without being discarded. It also gives the small flows an appropriate priority based on the detected traffic conditions. The PCRP can make a quick respond to network conditions, effectively avoiding endpoint congestion and reducing the average flow delay. However, PCRP is only suitable for short-flow-dominant traffic, as it performs poorly when facing other traffic. This is because PCRP can starve longer flows and thus introduces the unbearable tail delay. Therefore, we further propose the Packet-Chaining Reservation Protocol with Adaptive Framework (PCRP+), which is a reservation protocol that can flexibly adjust the scheduling strategy according to the network load. The PCRP+ can achieve and maintain low tail delay and desirable universality by adopting the adaptive framework. We conduct extensive experiments to evaluate the PCRP+ and compare it with the Speculative Reservation Protocol (SRP) and Bilateral Flow Reservation Protocol (BFRP), the two most typical proactive reservation-based protocols. Evaluation results demonstrate that our design can reduce the flow latency by an average of 25.71%, 21.21%, and 29.01% for hotspot traffic, uniform traffic, and GPCNeT traffic, respectively.

Delay-Guaranteeing Admission Control for Time-Sensitive Networking Using the Credit-Based Shaper

With real-time communication being a key part of the fourth industrial revolution, the need for Quality of Service (QoS) in industrial networks is gaining increasing importance. Time-Sensitive Networking (TSN) faces this need, for example, by introducing new scheduling mechanisms. The Credit-Based Shaper (CBS) has been introduced to TSN to offer low delays for multiple traffic classes by applying rate limitations. Currently, flows are reserved decentrally in CBS networks using a Stream Reservation Protocol (SRP). In contrast, the new TSN standard IEEE 802.1Qcc allows for a centralized architecture to favor short reconfiguration latencies. However, no online admission control scheme which offers safe delay bounds has been proposed for this central architecture. To close this gap, we propose two models for admission control in TSN networks using CBS. Both models offer deadline-guaranteeing flow allocation, including routing and prioritization of flows, and configure forwarding devices while eliminating packet loss. Our models utilize the mathematical framework of Network Calculus to calculate worst-case flow delays and buffer sizes. We show how our models allow for more reservations than the decentralized standard approach by improved resource utilization. We validate our models both in synthetic and industrial network scenarios. Additionally, we compare the effects and parameters of our two models, providing guidance on when to choose them.

Trading hardware with medium reservation to tackle scalability in low‐cost, single‐channel LoRa networks

LoRa is actually one of the most popular LPWAN technologies for IoT applications, due to its low‐power and long‐range transmissions. A single low‐cost, single‐channel LoRa Gateway is able to cover a large number of End‐Devices spread over a wide area. Gateway diversity is traditionally used to reduce the impact of packet losses: adding more Gateways can increase both delivery ratio and goodput, even when using a pure‐ALOHA access policy. However, such solution can be cost‐expensive and the adoption of control‐based medium access strategies, without violating the duty‐cycle constraints, can be, in some situations, a better option. In this letter, we compare the effectiveness of Gateway diversity against a medium access protocol with channel reservation. We evaluate if and in which scenarios, relatively to delivery ratio and goodput, in a single communication channel, it is better to add more Gateways to the system (hardware) or adopt a reservation protocol (software) for tackling the scaling‐up of the number of End‐Devices.

Hybrid Optimized Approaches for Routing and Resource Reservation Protocols in Optical Networks

We have proposed hybrid approaches to solve dynamic provisioning problems in fixed-grid and elastic optical networks (EON). The proposed approaches use the information from the optimization models, which normally are used to solve static problems, to guide the search for a good solution in dynamic networking. We have presented three models, i.e., Route-Model, RouteRes-Model, and RouteEON-Model. Route-Model computes routing information which is integrated with the first-fit algorithm. RouteRes-Model computes routes and a set of wavelengths for each end pair. Both models are utilized for dynamic provisioning of routing and wavelength assignment in fixed-grid networks. Similarly, RouteEON-Model considers the elastic characteristics of flexible networks and computes routing information. This is integrated with the first-fit algorithm for dynamic provisioning. The proposed solutions efficiently reduce the blocking probability (BP) in fixed-grid networks and the bandwidth BP in EON compared to the shortest path first (SPF) routing and alternate (k=2) routing. Similarly, RouteRes-Model achieved high wavelength utilization compared to other solutions. Finally, the proposed solutions utilized approximately equal number of paths compared to SPF routing. However, compared to SPF routing, Route-Model and RouteRes-Model supported approximately 43% and 66% more traffic respectively while alternate routing supported 36% more traffic for the same values of BPs.

Admission control mechanism for quality of service and security in H.323 voice gateway

AbstractThe rapid demand on the VOIP communication lead to the increase of the development of information security and the offered quality. Therefore, information technology has increased the deepening and developing of call admission control (CAC). In which, admission decisions and resource reservations are taken at the edge voice gateway, rather than resources or individual routers within the network. This means that, CAC decision is made before a voice call is established and it depends on the availability of the required call resources to provide suitable quality of service (QoS) for the new call. In this article, a new model for voice network, in order to achieve QoS along with security, is proposed. In the proposed model, the admission control decision is taken place at H.323 voice gateways using resource reservation protocol. It is shown that the admission control decision should be taken at edge H.323 voice gateways. This will lead to provide the accepted security for both, source and destination nodes which were previously authenticated through the identity services engine. It is concluded from the simulation results that the packet loss rate of call flows after implementing the mechanism is almost 0%. In addition, there is no jitter although there is some delay for packet delivery “Latency.” The latency observed by the proposed model is still accepted according to the ITU G.114 standard which recommends a maximum of a 150 ms one‐way latency. All results are tested in GNS3 based simulation to evaluate the performance of voice gateway based upon CAC.

Simplified Stream Reservation Protocol Over Software-Defined Networks for In-Vehicle Time-Sensitive Networking

As the automotive industry adopts Ethernet for in-vehicle network technology, automotive Ethernet has to handle bounded delay traffic. IEEE std 802.1Q introduces the stream reservation protocol (SRP) to reserve resources for time-sensitive traffics. SRP uses bridge-by-bridge propagation for its messages and registers VLAN ID and group address before making Audio-Video (AV) stream reservations. In this study, we propose a simplified SRP scheme over the Software-defined Network (SDN) for in-vehicle bridged networks. The proposed scheme exploits the topology and bridge information of bridged networks. A centralized stream reservation procedure in the scheme replaces the bridge-by-bridge propagation for SRP reservations. The reservation procedure does not require VLAN ID and group address registration. We implemented a prototype of the proposed scheme and showed that reserved flows are well protected when links of bridges are overloaded.

Modified Optical Burst Switching (OBS) Based Edge Node Architecture Using Real-Time Scheduling Techniques

Contention is the main problem in optical burst switching (OBS) systems that lead to loss more burst by dropping the contended burst. To deal with this problem, we propose a new proactive method which is based on the integration of Real-Time Scheduling Techniques: Earliest-deadline-first (EDF) and round-robin (RR). Based on this consideration, this paper proposes a series of novel coherent interdependence methods to propose a novel OBS edge node Architecture: (i) An adaptive priority system to obtain QoS guarantees, (ii) Admission control and bandwidth distribution to maximize the link throughput. The proposed technique classifies the incoming data packets into two categories: granted service (GS) for high priority and best effort (BE) for low priority. The RR technique is used for scheduling different BE and GS packets when they have the same deadlines while the EDF is used to manage GS packets with different deadlines. In addition, the admission and bandwidth assignment policies vary in function of traffic characteristics. For GS traffic, only the bandwidth used is needed, while the remaining bandwidth is assigned to best effort traffic. With the EDF and RR scheduling algorithms, the proposed edge node design obtains a brand new architecture. The proposed OBS architecture has been tested for dynamic traffic in which both BE and GS traffic arrives according to a Poisson distribution for different scenarios based on traffic distribution and switch resources reservation. In scenario#1, 90% GS traffic and 10% BE traffic and reserve 7% of the switch resources for BE traffic are considered. Therefore, the proposed architecture provides a higher grade of service to the end-users with the guaranteed service level of agreements than the existing architecture that does not implement resource reservation protocols. In addition, the modified OBS-edge node is designed and implemented on FPGA Virtex-11C2V40. The hardware performance analysis shows that the network dimension is a key factor in latency measurement. A 2×2 network dimension can serve approximately 230 Mbps throughput and approximately 400 Mbps in the case when the number of flits (segment of burst) is twice.

Разработка алгоритма многопутевой маршрутизации в программно-конфигурируемых сетях связи

The paper describes the development of routing algorithm in software-defined communication networks using the principle of multipath message delivery. The use of the OpenFlow protocol as the main one for connecting data- and control-plane devices between each other, that is, programmable switches with the controller, allows us to take the network topology presented in undirected weighted graph form as the initial data for the algorithm. There are known solutions to the problem of finding ways to transmit data in a communication network, as a rule, using the network resource reservation protocol, but additional restrictions are imposed on the network, since RSVP has a low degree of scalability, respectively, inappropriate consumption of computing resources and storage system resources of individual routers. In view of the above, an algorithm has been developed for finding a set of paths on a graph with the construction of an auxiliary graph based on the original one. Conditions are given under which an auxiliary graph can be constructed from the initial one. The algorithm takes into account the possibility of constructing several paths passing through one vertex, while meeting the requirements for the delay of the input data stream. To expand the functionality and possible areas of application of the algorithm for finding a set of paths, a criterion for the required total throughput by a set of data transmission paths is introduced. Conditions for constructing paths from a vertex to set of vertices are given. The algorithm presented in the work has an order of magnitude less time complexity, which allows you to quickly respond to changes in the data transmission network, while the most significant differences in the time spent on building a set of paths are noticeable with an increase in nodes in the data transmission network and the number of possible paths.

Adapting PBFT for Use With Blockchain-Enabled IoT Systems

This work proposes Practical Byzantine Fault Tolerance (PBFT) ordering service needed for block formation in permissioned blockchain environments. Contrary to current PBFT implementations that only provide a single point of entry to the ordering service, we allow each ordering node to act as an entry point that proposes and conducts the consensus process of including new record in the distributed ledger. To ensure atomicity of record insertion in distributed ledger, we have developed a bandwidth reservation protocol that uses a modification of CSMA/CA protocol to regulate access to the broadcast medium formed by the P2P network of TCP connections between orderers. We have modeled record insertion service time in a cluster where ordering nodes have random position within Cartesian coordinate system. We have also modeled total request access time to the ledger which includes waiting time in the orderer's queue and record insertion time. These models are used to evaluate system performance under variable request rate ordering service, variable number of nodes and variable physical cluster dimensions. Our results show the interaction between decreased request waiting time in orderer's queue and increased contention among orderers when the number of orderers increases for the given total request arrival rate. This interaction is also investigated for two different physical cluster sizes which affect record insertion time. The interplay of request rate, number of orderers and physical cluster size determines system capacity expressed in total request rate. Our model can be used to make the trade-off between the required system capacity, number of orderers, and physical cluster dimensions under constraints on Byzantine fault rate.

CSRP: An Enhanced Protocol for Consistent Reservation of Resources in AVB/TSN

The IEEE Audio Video Bridging (AVB) Task Group (TG) was created to provide Ethernet with soft real-time guarantees. Later on, the TG was renamed to Time-Sensitive Networking (TSN) and its scope broadened to support hard real-time and critical applications. The Stream Reservation Protocol (SRP) is a key work of the TGs as it allows reserving resources in the network, guaranteeing the required quality of service. AVB's SRP is based on a distributed architecture, whereas TSN's is based on centralized ones. The distributed version of SRP is supported and used in TSN. Nevertheless, it was not designed to provide properties that are important for critical applications. In this article, we model SRP using UPPAAL and we study the termination and consistency. We verify that SRP does not provide such properties. Furthermore, we propose an improved protocol called Consistent Stream Reservation Protocol (CSRP) and we formally verify its correctness using UPPAAL.

A Trusted Method For Early Data Link Failure Prediction

Mobile ad-hoc network was widely used in the various fields for several applications. In the field of the wireless sensor network the link failure prediction is still a baffling one. The proposal here provides clear facts about the concepts of the link failure. In this paper the Proficient Trusted Node ID Based Resource Reservation Protocol (PT-NIDBRRP) was used. Here the shortest path was detected by using the weighted end-to-end delay based approach. This algorithm will find the short cut route from the particular starting place to the target and can improve the detection rate. By starting the route detection process the sequence numeral and the hop address is added to the protocol. After detecting the shortest path the link failure was detected. The link failure localization structure in the implemented trusted protocol has the higher ability in predicting and fixing the link failure issues. Then to find out the cause attack for the link failure the posterior probability estimation was used to sort out the type of the attack. At last the performance of the proposed method was evaluated through simulation analysis. The simulation result confirms that the proposed methodology is highly effective in detecting the link breakage and the short path algorithm implemented here will reduces the time period of detecting the shortest path. This method provides trusted secure network time duration, energy values and trust scores play an important role between the source and destination in the network.