Search

Currently, the multiprotocol label switching (MPLS) standard is extremely prevalent. By exploiting the features provided by MPLS technology, a range of services, including IP telephony, have enhanced their overall performance. However, due to the size of the packet header, the IP telephony service consumes a significant portion of the MPLS network's available bandwidth. For instance, in IP telephony over MPLS networks, the packet header might account for as much as 80% of lost time and bandwidth. Designers working on IP telephony are making substantial efforts to address this issue. This study contributes to current efforts by proposing a novel approach called Tel-MPLS, which involves IP telephony over MPLS. TelMPLS approach uses the superfluous fields in the IP telephony packet's header to retain the packet data, therefore lowering or zeroing the IP telephony packet's payload. Tel-MPLS is an approach that significantly reduces the bandwidth of IP telephony MPLS networks. According to the findings, the Tel-MPLS approach is capable of reducing the amount of bandwidth that is lost by 12% when using the G.729 codec. [ABSTRACT FROM AUTHOR]

Generalized multiprotocol Label Switching (GMPLS) is a set of rules which is used in various layers like the Wavelength Division Multiplexing (WDM) layer, Time Division Multiplexing (TDM) layer, etc. to generalize the concepts of labels of Multiprotocol Label Switching networks. A block in call occurs when number of requests is more than the servers and waiting rooms. This call blocking is the very important parameter and can be calculated in terms of probability. There are a number of models to calculate the call blocking probability like Erlang B, Erlang C, etc. This paper suggests a novel, efficient and less – complex model which minimize the call blocking to very much extent for GMPLS networks. This model deals with the factors like number of wavelengths, number of links, traffic intensity, etc. which can help in reducing the call blocking probability and give better results. In this paper, the call-blocking probability is also compared with number of links by considering different wavelengths. A comparison of call-blocking probability of proposed model is also analysed. This paper deals with blocking probability optimization in GMPLS Networks using Fredericks approach. We have used peakedness factor from Fredericks approach in Engset's formula for this optimization." [ABSTRACT FROM AUTHOR]

In this paper, we have proposed a Multiservice Provisioning Optical Code Switching (OCS) method for GMPLS networks, which uses Optical-Code-Division-Multiplexing (OCDM) across every lightpath of a wavelength division multiplexing system. We also presented the router architecture for the GMPLS multiservice network. In this method, the Multi Length Variable Weight Optical Orthogonal Code (MLVW-OOC) is used to multiplex each class (two-class system) service connection to a wavelength as an OCDM signature series. First, the fiber bandwidth has been classified into several wavebands, whose wavelengths are considered for a specific service class depending on the characteristics of that service class. The codes corresponding to the service class are also given in this manuscript. Erlang's traffic behavior of the network model is used to evaluate the system performance as well as to obtain the probability density functions (PDF) of the number of labels oocupied by a link. We have also evaluated the PDF for the number of labels occupied in each wavelength. Further, we have evaluated the performance of the network in terms of the probability of outage, blocking probability, and the end-to-end (EE) bit error rate (BER) of a connection. The results indicate that interfering users perform better with longer-weight code words. Moreover, with the increase in the number of intermediate OCS routers, EE BER is increased, and it is found that by constraining the number of connected paths, performance can be improved. [ABSTRACT FROM AUTHOR]

In future generation networks, data protection is a crucial necessity particularly when information is sent on a system. Network protection has three objectives known as discretion, reliability and accessibility. The most common procedure exploited to attain this ambition is encryption. The Generalized Multi Protocol Label Switched (GMPLS) optical networks are designed to survive Internet Protocol's (IPʹs) unreliable delivery. In this paper, GMPLS network is proposed with random users and then the data protection algorithms have been analyzed on proposed GMPLS optical network. The various algorithms involve Rivest Shamir Adleman (RSA) algorithm and Advanced Encryption Standard (AES) algorithm. The considered algorithms are very popular but have not been implemented on GMPLS optical networks in the literature which shows the novelty of the presented work. The network performance is compared for these algorithms in terms of various parameters like blocking probability and latency. The results reveal that RSA reduces the blocking probability < 0.005 and latency < 0.007 ms. This shows that RSA gives better performance than AES algorithm and enhance the quality of service considering blocking probability, latency and overheads in GMPLS optical networks leading to enhanced data protection. [ABSTRACT FROM AUTHOR]

This research problem discusses the occurrence during the MPLS service tunneling process which often looping during the data transmission process, especially in Layer 2-OSI, where data packets will be sent back to the recipient so that data packets do not reach their destination or because of problems with the traffic of sending data. Looping Prevention is one of the proposed methods in this research that occur in tunnel service causes looping. This method is applied by analyzing traffic based on MAC addresses obtained from service verification results so that the cause of looping is known. The results of looping protection methods get an average throughput and delay, when the process of uploading traffic of 16 MB gets 119.3 bps for throughput and delay of 5.9 ms, and when downloading gets throughput of 185.33 bps and delay 6.5 ms. Then, the process of uploading traffic of 32 MB get upload throughput of 129 bps and delay 5.2 ms, and when downloading gets a throughput of 232.66 bps and gets a delay of 4.13 ms. All values obtained are in the category very well based on the standard category TIPHON. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The Next Generation Network (NGN) architecture was proposed for delivering various multimedia services with guaranteed quality. For this reason, the elements of the IP Multimedia Subsystem (IMS) concept (an important part of 4G/5G/6G mobile networks) are used in its service stratum. This paper presents comprehensive research on how the parameters of an IMS/NGN network and traffic sources influence mean Call Set-up Delay (E(CSD)) and mean Call Disengagement Delay (E(CDD)), a subset of standardized call processing performance (CPP) parameters, which are significant for both network users and operators. The investigations were performed using our analytical traffic model of a multidomain IMS/NGN network with Multiprotocol Label Switching (MPLS) technology applied in its transport stratum, which provides transport resources for the services requested by users. The performed experiments allow grouping network and traffic source parameters into three categories based on the strength of their effect on E(CSD) and E(CDD). These categories reflect the significance of particular parameters for the network operator and designer (most important, less important and insignificant). [ABSTRACT FROM AUTHOR]

The magnon propagation length (MPL) is one of the crucial factors to govern spin transport in a magnetic material. Here, we determine MPL ($\xi$) in compensated ferrimagnetic Gd3Fe5O12 (GdIG) thin films at room temperature by investigating longitudinal spin Seebeck effect (LSSE) in Gd3Ga5O12 (GGG)/GdIG($t$)/Pt (5 nm) heterostructures with different thicknesses ($t$) of the GdIG film. All films possess in-plane (IP) magnetic easy axis, and the compensation temperature shifts down to lower temperature with decreasing GdIG thickness. At room temperature, the LSSE signal is rather constant with thickness between $t = 221$ and 89 nm, but drops significantly below $t = 50$ nm. By fitting the thickness dependence of the LSSE voltage to a modified atomistic spin model considering the influence of saturation magnetization, we obtain $\xi $ = 45 nm ± 8 nm for GdIG thin films at room temperature. The MPL of GdIG is much shorter than that of Y3Fe5O12 films ($\xi $ ~90–140 nm), but higher than that of Fe3O4 films ($\xi $ ~20 nm). The obtained value of $\xi $ explains the drop in the LSSE voltage in GdIG films when the film thickness is reduced below 50 nm, knowledge of which is also essential to the design of spincaloritronic devices based on GdIG films. [ABSTRACT FROM AUTHOR]

Summary: This paper proposes a solution to the problem of switching between different network paths. We choose to switch between multiprotocol label switching (MPLS) and software‐defined wide area networking (SD‐WAN) connections specifically as they are the mainstream currently. The solution should maintain a service license agreement (SLA) while choosing SD‐WAN as long as possible to save cost. Therefore, a deep reinforcement learning solution is proposed that predicts when to switch based on bandwidth availability and quality of service (QoS) parameters like jitter and delay. Results show that double deep Q learning in combination with these parameters are suitable to make a sophisticated decision on link switching between MPLS and SD‐WAN. [ABSTRACT FROM AUTHOR]

Compositional Optimization (CompOpt) was recently proposed for optimization of discrete-event systems of systems. A modular optimization model allows CompOpt to divide the optimization into separate sub-problems, mitigating the state space explosion problem. This paper presents the Modular Optimization Learner (MOL), a method that interacts with a simulation of a system to automatically learn these modular optimization models. MOL uses a modular learning that takes as input a hypothesis structure of the system and uses the provided structural information to split the acquired learning into a set of modules, and to prune parts of the search space. Experiments show that modular learning reduces the state space by many orders of magnitude compared to a monolithic learning, which enables learning of much larger systems. Furthermore, an integrated greedy search heuristic allows MOL to remove many sub-optimal paths in the individual modules, speeding up the subsequent optimization. Note to Practitioners—Automation systems are becoming increasingly large and complex and the automation of more and more advanced tasks often requires the coordination of multiple subsystems. Optimization can have a great impact on the efficiency of these systems in terms of cost and operation speed. Finding optimal solutions is, however, a difficult task. As the number of tasks and subsystems of the automation system increases, the search space of the optimization problems tends to grow exponentially. Compositional Optimization (CompOpt) is a method specifically designed for the optimization of large-scale automation systems. A challenge with the application of CompOpt is that it takes as input a specific type of optimization model that divides the system into subsystems; like machines, vehicles, etc. Formulating these models requires a high level of expertise and system knowledge. This paper addresses this challenge with an algorithm that learns these models from a simulation of the system. The simulation can be implemented in any software as long as a suitable interface exists or can be constructed. To divide the learning into subsystems, the algorithm uses an initial plant structure hypothesis (PSH). This can be viewed as a meta-model that includes known structural information, such as the number of subsystems and which actions that affect each subsystem. The more structural information that is added to PSH, the more efficient the learning and subsequent optimization will be. The purpose of this is to reduce the level of expertise and system knowledge needed in the application of optimization, to simplify the transition to Industry 4.0. [ABSTRACT FROM AUTHOR]

Coverage performance is very important for operators when commercializing NR networks due to its direct impact on service quality as well as CAPEX and OPEX. Compared to LTE, NR systems may operate at higher frequency bands, resulting in larger path loss and worse coverage performance. In this article, potential coverage issues for NR networks are discussed. Through link budget analysis, the gaps between baseline and target performance for typical NR physical channels are described; then the bottleneck channels are identified, including PUSCH, PUCCH, and PRACH. This article mainly focuses on PUSCH coverage enhancement, and potential solutions are discussed in a comprehensive manner. On top of the potential solutions, four joint schemes, which take feasibility as well as specification impact into consideration, are proposed for VoIP and eMBB services to further improve the coverage performance. [ABSTRACT FROM AUTHOR]

This article shows the quality of services in a wireless swarm of drones that form an ad hoc network between them Fly Ad Hoc Networks (FANET). Each drone has the ability to send and receive information (like a router); and can behave as a hierarchical node whit the intregration of three protocols: Multiprotocol Label Switch (MPLS), Fast Hierarchical AD Hoc Mobile (FHAM) and Internet Protocol version 6 (IPv6), in conclusion MPLS + FHAM + IPv6. The metrics analyzed in the FANET are: delay, jitter, throughput, lost and sent packets/received. Testing process was carried out with swarms composed of 10, 20, 30 and 40 units; In this work, the stage with 40 drones was analyzed showing registration processes, and sent messages sequences between different drones that were part of the same swarm. A special analysis about the traffic between drones (end-to-end) was carried out, as well as the possible security flaws in each drone and the current status and future trends in real services. Regarding future trends, in a real environment, we took as a starting point, metrics results obtained in the simulation (positive according to the obtained results). These results gave us a clear vision of how the network will behave in a real environment with the aim to carry out the experiment on a physical level in the near future. This work also shows the experience quality from the service quality metrics obtained through a mathematical model. This quality of experience model will allow us to use it objectively in the agricultural sector, which is a great interest area and is where we are working with drones. Finally in this article we show our advances for a business model applied to the aforementioned agricultural sector, as well as the data analysis and services available to the end customer. These services available to the end customer have been classified into a basic, medium, advanced and plus level. [ABSTRACT FROM AUTHOR]

Recently, there has been an increasing need for new applications and services such as big data, blockchains, vehicle-to-everything (V2X), the Internet of things, 5G, and beyond. Therefore, to maintain quality of service (QoS), accurate network resource planning and forecasting are essential steps for resource allocation. This study proposes a reliable hybrid dynamic bandwidth slice forecasting framework that combines the long short-term memory (LSTM) neural network and local smoothing methods to improve the network forecasting model. Moreover, the proposed framework can dynamically react to all the changes occurring in the data series. Backbone traffic was used to validate the proposed method. As a result, the forecasting accuracy improved significantly with the proposed framework and with minimal data loss from the smoothing process. The results showed that the hybrid moving average LSTM (MLSTM) achieved the most remarkable improvement in the training and testing forecasts, with 28% and 24% for long-term evolution (LTE) time series and with 35% and 32% for the multiprotocol label switching (MPLS) time series, respectively, while robust locally weighted scatter plot smoothing and LSTM (RLWLSTM) achieved the most significant improvement for upstream traffic with 45%; moreover, the dynamic learning framework achieved improvement percentages that can reach up to 100%. [ABSTRACT FROM AUTHOR]

Future communication networks are expected to be highly automated, disburdening human operators of their most complex tasks. While the first powerful and automated network analysis tools are emerging, existing tools provide only limited and inefficient support of reasoning about failure scenarios. We present P-REX, a fast what-if analysis tool, that allows us to test important reachability and policy-compliance properties even under an arbitrary number of failures and in polynomial-time, i.e., without enumerating all failure scenarios (the usual approach today, if supported at all). P-REX targets networks based on Multiprotocol Label Switching (MPLS) and its Segment Routing (SR) extension which feature fast rerouting mechanisms with label stacks. In particular, P-REX allows to reason about recursive backup tunnels, by supporting potentially infinite state spaces. As P-REX directly operates on the actual dataplane configuration, i.e., forwarding tables, it is well-suited for debugging. Our tool comes with an expressive query language based on regular expressions. We also report on an industrial case study and demonstrate that our tool can perform what-if reachability analyses on average in about 5 seconds for a 24-router network with over 250,000 MPLS forwarding rules. This is a significant improvement to an earlier prototype of our tool presented in the conference version of our paper where the verification took on average about 1 hour. [ABSTRACT FROM AUTHOR]

Many organizations nowadays have multiple sites at different geographic locations. Typically, transmitting massive data among these sites relies on the interconnection service offered by ISPs. Segment Routing over IPv6 (SRv6) is a new simple and flexible source routing solution which could be leveraged to enhance interconnection services. Compared to traditional technologies, e.g., physical leased lines and MPLS-VPN, SRv6 can easily enable quick-launched interconnection services and significantly benefit from traffic engineering with SRv6-TE. To parse the SRv6 packet headers, however, hardware support and upgrade are needed for the conventional routers of ISP. In this paper, we study the problem of SRv6 incremental deployment to provide a more balanced interconnection service from a traffic engineering view. We formally formulate the problem as an SRID problem with integer programming. After transforming the SRID problem into a graph model, we propose two greedy methods considering short-term and long-term impacts with reinforcement learning, namely GSI and GLI. The experiment results using a public dataset demonstrate that both GSI and GLI can significantly reduce the maximum link utilization, where GLI achieves a saving of 59.1% against the default method. [ABSTRACT FROM AUTHOR]

Traffic engineering in the Internet is responsible for the optimization and evaluation of the performance of IP networks to avoid congestion. One of the most accepted proposals is MPLS (Multiprotocol Label Switching), which provides an efficient paradigm for traffic optimization. Other proposals include the adjustment of link weights of interior gateway protocols (IGPs), the LISP protocol (Locator/ID Separation Protocol), and segment routing (SR). Currently, work is still being done on the topic and updates to existing recommendations are being proposed. [Extracted from the article]

In the last twenty years, optical networks have witnessed recurrent changes in their management and control architecture. In this paper, we present a historical timeline and a future perspective of the evolution of optical network management and control deployed for Wavelength Switched Optical Networks (WSON), Elastic Optical Networks (EON) and (multilayer) Data Center Networks. Early implementations of WSON envisaged a static and centralized provisioning approach supported by the Management Plane only. Gradually, the requirement of accommodating more network dynamicity in WSON, and later in EON, pushed the adoption of a distributed control, mostly supported by vendor-dependent implementations of the Generalized MultiProtocol Label Switching (GMPLS) protocol suite. The drawbacks of the fully distributed GMPLS-based control, such as resource contention, suboptimal resource usage, and complex computations (e.g., to account for physical layer constraints) showed the necessity to bring back some of the routing/provisioning functions to a centralized Path Computation Element (PCE) capable of accounting for e.g. physical impairments and interworking with GMPLS. The centralized control then gained its momentum and brought a radical change in network control, through the separation of data and control plane introduced by the paradigm of Software Defined Networking (SDN). Such an approach has been gradually extended to optical network control. The paper, eventually, presents the most advanced control techniques, namely the intent-based networking, the observe/decide/act state-based approach providing for autonomic optical network and the (closed-loop) zero-touch service management approach. Advanced traffic conditioning techniques are also detailed, namely the in-band telemetry and the exploitation of Programming Protocol-Independent Packet Processors (P4) language capabilities as well as solutions tailored for data center networks: all of them are still in a research stage and to be integrated within future optical network architectures. [ABSTRACT FROM AUTHOR]