Resource Reservation Protocol Research Articles

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.

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

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.

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.

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.

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.

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.

Enhanced signaling crankback scheme in multi-domain and complex optical networks

In optical networks lightpath setup problems, researchers usually assume the optical networks to be a single domain. However, the optical networks develop toward to multi-domain and larger scale in practice. However, with the optical networks develop toward to complexity, conventional resource reservation protocol traffic engineering (RSVP-TE) protocol crankback schemes cannot meet the requirements of these new applications for real-time dynamic services and fast restoration with long propagation delays. In this letter, we focus on lightpath setup problems in multi-domain optical networks, mixed integer linear programming (MILP) formulations is presented. A heuristic algorithm base on network virtualization and source backtracking region re-routing (SBRR) crankback scheme is proposed. Simulation results show that, under different traffic patterns, the proposed algorithm achieves significant improvement on network resources occupation and lightpath setup latency in contrast with the conventional algorithms which were proposed base on a single domain network environment.

SDN-Based Resource Reservation Protocol for IoT applications in Constrained Networks

Constrained netwrks like Wireless Sensor Networks have been identified as a promising scheme for next-generation wireless networks. These networks are capable of capturing data from the physical world without human intervention possessing applications such as IoT in various fields of life that require reliable and précised end to end delivery. However, Wireless Sensor Networks inevitably suffers from severe resource constraints and hence promising the provision of desired QoS is a challenge. In most of the applications like military, medical surveillance. Data captured are critical and hence the transmission of such data entails a minimal end to end delay. In constrained networks achieving minimal delay with effective utilization of resources are important cost factors for achieving an end to end delivery. In this Paper, a Software-defined Networking (SDN), based resource reservation protocol, which leverages SDN to centrally process the whole control logic and accordingly decides the amount of resources to be allocated for each data flow alleviating the processing overhead of all other nodes thus minimizing the energy consumption is proposed. The proposed algorithm is evaluated through simulation and the results obtained proved the efficiency of the proposed protocol by effectively minimizing the system’s energy consumption and end to end delay.

RSVP-TE Bilateral-Recursive Region Re-Routing Crankback Mechanism for Large-Scale Optical Networks

Abstract Cloud computing services and real-time Internet applications have spawned a large variety of potential requirements for quality of service (QoS), especially the latency and connection setup time. However, with the optical networks develop toward to larger scale, wider coverage and more users access, conventional resource reservation protocol traffic engineering (RSVP-TE) signal hop by hop transmission scheme cannot meet the requirements of these new applications for real-time dynamic services and fast restoration with long propagation delays. This paper proposes a novel RSVP-TE bilateral-recursive region re-routing crankback mechanism (BRCB) base on distributed path computation element (PCE) for generalized multiprotocol label switching (GMPLS) optical networks. In this mechanism, the backtracking nodes re-route and update the region routing paths which bypass the crankback and re-routing failure nodes when crankback occurs. It not only reduces the influencing factors of the scale of network, signaling crankback position and frequency to path connection setup time, but also avoids the backtracking of teardown messages.

Responsive high throughput congestion control for interactive applications over SDN-enabled networks

New interactive video applications are increasingly emerging over the Internet; these interactive applications are characterized by high bandwidth requirements that fluctuates depending on end-user actions (e.g. less bandwidth is usually needed for stationary scenes). More importantly, this interactive class of services also involves a requirement for high responsiveness (i.e. low latency) from the network, in order to respond in real-time to end-user actions. One emerging service of this nature is 360° video streaming; another example is cloud-based gaming services. In this paper, we focus specifically on JPIP (JPEG 2000 Interactive Protocol) applications that support remote interactive video browsing with dynamic pan and zoom capabilities, as a highly representative example of the interactive service class. Existing network communication services are mostly agnostic to latency implications, and hence are not well adapted to such interactive applications. Meanwhile, explicit resource reservation protocols have not been widely deployed, and do not consider the time-varying dependencies that naturally arise in interactive applications. In this work, we leverage software defined networking (SDN) principles to support a proposed “interactive service” class. The main contributions of this work are a network-exposed application programming interface (API) that provides visibility into the state of the network, an SDN-assisted congestion control algorithm that utilizes network state information to achieve the desired low latency and high bandwidth utilization requirements, and a fair resource assignment algorithm that shares available bandwidth among interactive and non-interactive traffic dynamically – all without a reservation protocol.

Fuzzy Logic based Approach for VoIP Quality Maintaining

Voice communication is an emerging technology and has great importance in our routine life. Perceptual, Voice over Internet Protocol quality is an important issue for VoIP Apps services because VoIP Apps require real-time support. Many network factors (packet loss, packet delay, and jitter) affect to VoIP quality, to achieve this objective we used an approach based on Fuzzy Logic. We configure Resource Reservation Protocol application to control Token Bucket Algorithm and the simulation experiments are carried out with Opnet. In addition, compare Token Bucket with and without Quality of Service for measure network factors. In this paper, building Fuzzy Token Bucket System consists of three variables (Bandwidth Rate, Buffer Size, and New Token) in order to improve Token Bucket Shaper output variable (New Token) by Fuzzy Stability model for Voice over IP quality maintaining.

Signaling and Scheduling WIMAX Gateway Design Based on Resource Reservation Protocol

Objectives: As a result of signal transmission in WiMAX too long distance, and because there are many request packets arrive at WiMAX gateway request handovers, this cost a congestion which may result in loss or delay in packet time sensitive. The objectives of this paper are to investigate the delay when packets with real time sensitive handover in WiMAX gateway and to measure and enhance the handover performance. Methods/Statistical Analysis: To overcome this problem, and achieve the objectives is propose a new scheme Resource Reservation Protocol & Random Early Detection with Weighted Fair Queuing (RR-WFQ) in order to analyze and enhance delay for real time packet in WiMAX gateway. This schema applies all Resource Reservation Protocol (RSVP), Random Early Detection (RED), and Weighted Fair Queuing (WFQ) as a Scheduling, RED as a mechanism and RSVP as a signaling protocol. Findings: The proposed scheme enhances the QoS by minimizing the delay in WiMAX gateway and BS. The scheme enhances the delay in all queues in a gateway, and video conferencing. The result of the scheme shows an enhancement delay in the WiMAX gateway. Application/Improvements: Mathematical analysis and modeling have been done using queuing theory. Simulation has been done using OPNET simulation. Simulation results for the new approach confirms that has minimized delay in WiMAX gateway and BS the gateway and enhances the QoS.

Analysis of Link State Resource Reservation Protocol for Congestion Management in Smart Web Hotspot Environments

With the wide spread of WiFi hotspots, concentrated traffic workload on Smart Web (SW) can slow down the network performance. This paper presents a congestion management strategy considering real time activities in today’s smart web. With the SW context, cooperative packet recovery using resource reservation procedure for TCP flows was adapted for mitigating packet losses. This is to maintain data consistency between various access points of smart web hotspot. Using a real world scenario, it was confirmed that generic TCP cannot handle traffic congestion in a SW hotspot network. With TCP in scalable workload environments, continuous packet drops at the event of congestion remains obvious. This is unacceptable for mission critical domains. An enhanced Link State Resource Reservation Protocol (LSRSVP) which serves as dynamic feedback mechanism in smart web hotspots is presented. The contextual behaviour was contrasted with the generic TCP model. For the LS-RSVP, a simulation experiment for TCP connection between servers at the remote core layer and the access layer was carried out while using selected benchmark metrics. From the results, under realistic workloads, a steady-state throughput response was achieved by TCP LS-RSVP to about 3650Bits /secs compared with generic TCP plots in a previous study. Considering network service availability, this was found to be dependent on fault-tolerance of the hotspot network. From study, a high peak threshold of 0.009 (i.e. 90%) was observed. This shows fairly acceptable service availability behaviour compared with the existing TCP schemes. For packet drop effects, an analysis on the network behaviour with respect to the LS-RSVP yielded a drop response of about 0.000106 bits/sec which is much lower compared with the case with generic TCP with over 0.38 bits/sec. The latency profile of average FTP download response was found to be 0.030secs, but with that of FTP upload response, this yielded about 0.028 sec. The results from the study demonstrate efficiency and optimality for realistic loads in Smart web contexts.

Signaling in IP-Based Networks: Retrospect and Prospect

Protocols have been developed to provide various signaling services in IP-based networks - for example, for quality-of-service (QoS) reservations, or configuring middleboxes such as Network Address Translators (NATs) and firewalls. This article presents a retrospective view on the development of the IETF Next Steps in Signaling protocols, with a more flexible signaling framework than the traditional Resource ReSerVation Protocol (RSVP). The challenges are discussed for signaling in emerging network architectures like software-defined networking, network function virtualization, and service function chaining, as well as ongoing standardization efforts.

Links Utilization in MPLS Networks Operating with Traffic Engineering Signal Protocols

Multiprotocol Label Switching (MPLS) is a technology that ensures efficient transmission with high speed and lower delays. Traffic Engineering (TE) signal protocols are usually used for active management of the MPLS networks for efficient utilization of resources. This paper presents performance investigation of MPLS TE signal protocols to get a guideline to utilize transmission links efficiently. Comparison is made between two TE signal protocols, namely Resource Reservation Protocol (RSVP) and Constraint-based Routing Label Distribution Protocol (CR-LDP). Simulation results are presented for three MPLS networks having different topologies which are implemented in OPNET (version 14.5) environment to support different applications in the absence and presence of quality of service (QoS) algorithms. The results reveal that MPLS network with CR-LDP TE signal protocol has better performance in the term of link utilization. The RSVP reserves certain paths for transmission while the CR-LDP utilizes almost all of the available links.

Multipartner Demonstration of BGP-LS-Enabled Multidomain EON Control and Instantiation With H-PCE [Invited

The control of multidomain elastic optical networks (EONs) is possible by combining Hierarchical Path Computation Element (H-PCE)-based computation, Border Gateway Protocol with Extensions for Traffic Engineering Link State Information (BGP-LS) topology discovery, remote instantiation via Path Computation Element Communication Protocol (PCEP), and signaling via Resource Reservation Protocol with Extensions for Traffic Engineering (RSVP-TE). Two evolutionary architectures are considered, one based on stateless H-PCE, PCEP instantiation, and end-to-end RSVP-TE signaling (SL-E2E), and a second one based on stateful active H-PCE with perdomain instantiation and stitching. This paper presents the first multiplatform demonstration that fully validates both control architectures achieving multiprotocol interoperability. SL-E2E leads to slightly faster provisioning but needs to keep the state of the stitching of the end-to-end label-switched paths in the parent PCE.

Control and Orchestration of Multidomain Optical Networks With GMPLS as Inter-SDN Controller Communication [Invited

Emerging use cases, such as the orchestration of heterogeneous domains or the interconnection of remote data centers, require the design of new network control, management, and orchestration architectures that are adapted to the requirements associated with end-to-end services. This heterogeneity, stemming from actual deployments, is related to the involved data and control technologies or due to network segmentation. It is acknowledged that, in these scenarios, the deployment of a single software- defined networking (SDN) controller may not be practical or may have fundamental limitations, in terms of either scalability, complexity, or interoperability. To address this trend, and as a means to cope with the complexity growth, research in this area is considering the concept of SDN orchestration (the coordinated control of heterogeneous systems), abstraction (the selection of entityrelevant attributes), and the use of multiple controllers, commonly arranged in hierarchical or flat configurations. In this paper, we consider a hybrid approach combining elements from distributed control with elements from centralized control, relying on the concepts of abstraction and aggregation and hierarchical traffic engineering (TE). We propose a multidomain and multivendor network control architecture organized in layers, the abstract network layer and the control-specific layer, resulting in a mesh of generic SDN controllers that use generalized multiprotocol label switching (GMPLS) protocols as their east/west interfaces (open shortest path first TE and Resource Reservation Protocol with extensions for TE as inter- SDN controller communications protocols), forming an abstracted topology. To validate the approach, and to evaluate factors such as end-to-end network service deployment delay or control overhead, the proposed architecture is implemented and validated in a control plane testbed. While emphasis is given to the control of optical (flexi-grid) networks, the proposed approach can be generalized to other transport technologies.

Comparison between resource reservation protocol and next steps in signalling in mobile IP networks

Providing an acceptable level of quality of service (QoS) for critical applications is one of the interesting topics in next generation wireless networks. Confronting the major criticisms of resource reservation protocol (RSVP), the next steps in signalling (NSIS) was introduced as a general framework to include not only the resource reservation protocol but other signalling services in IP based networks. It attempts to address the RSVP shortcomings and to offer additional features. It is widely believed that NSIS can be considered as a suitable alternative for RSVP. However, it worsens the scalability issue in the RSVP operation, inherits the RSVP problem in mobile environments and its appealing features come with a significant cost. This paper develops an analytical framework to evaluate the RSVP and NSIS performances in proxy mobile IPv6 (PMIPv6) environment. The results obtained showed a significant increase in network signalling cost, more bandwidth consumption by resource reservation signalling messages and a high resource re-establishment latency in NSIS operations. We believe these outcomes raise doubts over the NSIS eligibility as a suitable replacement for RSVP.