Search

Mobile ad hoc networks (MANETs) are used worldwide due to their self-organizing nature. The MANET has some disadvantages such as decentralization and dynamic topology. So, the multi-protocol label switching (MPLS) is developed in the MANET to control the dynamic topology of the network. The network performances are affected due to the higher energy consumption of the nodes. The main goal of this research is to introduce an energy-efficient routing through the MPLS-MANET. In this paper, a combination of ant colony optimization (ACO) and harmony search algorithm (HSA) is used to discover optimal path in network. Here, three different parameters are considered in the fitness function such as residual energy, distance and number of hops. The performance of the ACO–HSA is analyzed in terms of alive nodes, dead nodes, residual energy, delay and bandwidth. The performance of the ACO–HSA is compared with one traditional optimization called ACO and also compared with one existing routing protocol called A-EEBLR. The residual energy of the ACO–HSA methodology for 50 nodes is 8J that is high when compared to the ACO and A-EEBLR.

Internet service providers and techno enterprises evolved with CISCO IOS called MPLS built a strong and diligent network for succeeding generations to utilize all sorts of full-fledged amnesties over a solitary structure. MPLS is considered as a routing method, and it is not a facility or a service. MPLS can be encased with any prevailing infrastructures, namely digital subscriber line, asynchronous transfer mode, frame relay, and IP. MPLS is not platform dependent. It can work seamlessly without making any change in the current environment of these technologies. But implementing MPLS is quite expensive, so with the support of SD-WAN, ISPs and enterprises are attempted to enhance its usages using inexpensive Internet connection. This survey articled aimed to compare the pros and cons of both the technologies MPLS and SD-WAN.

A Cloud Policy Enforcement Point (CPEP) provides a network security and access policy enforcement point between a public data center and an on-premises center or a remote office site or location. The network connectivity could be provided by a Direct Connect (DX) or a Multiprotocol Label Switching (MPLS) connection. A CPEP is primarily implemented using service control policies.

The article presents an analysis of the characteristics of operator`s equipment for the construction of MPLS networks, which will be important in assessing the proposed procurement units for network modernization. The main characteristics of the devices are considered in the work and the most significant of them are analyzed. Method: An analytical dependence is proposed for the characteristics of L2 VPN services. Core results: A practical experiment was carried out to confirm theoretical conclusions on such characteristic as the number of the LDP neighbors. Practical relevance: The results of the experiment are presented and conclusions are made about the significant characteristics for MPLS equipment for L2 VPN services.

The market prediction for network deployments has positioned Software-Defined Networks (SDN) as the first of the options for changing local, transport, or cloud networks. Since the OpenFlow protocol gained traction and evolved in the last versions, the possibilities for expanding network capabilities to deploy custom services have risen considerably. With next-generation SDN (NG-SDN), flexibility has grown as data plane programming languages, such as P4, and Data-Control Plane Interface (DCPI) protocols like P4Runtime have appeared. Furthermore, the ability to program the data plane has opened the possibilities to develop new network telemetry approaches, such as In-band Network Telemetry (INT). A transition to partially incorporated SDN, also known as hybrid SDN, often involves considerable complexity, especially when legacy devices implement non-open standards and protocols. Therefore, incorporating programmable SDN devices and deploying network telemetry protocols on top of existing legacy devices is still challenging. This research focuses on deploying and integrating the INT protocol using programmable P4 switches over a hybrid SDN network. We describe and implement the required control plane applications and data plane configuration, and discuss the constraints that need to be managed so that P4 programmable switches can interact with the rest of the MPLS legacy devices. In this sense, we discuss P4 switch placement alternatives to maximize their performance and usability in a hybrid SDN network. Then, we validate the INT-based monitoring system by ensuring traffic forwarding using several INT header placements. In these tests, we demonstrate the feasibility of merging P4 switches running INT traffic and legacy devices, presenting the requirements to accomplish hybrid next-generation SDN (HNG-SDN) architectures. Besides, we provide new monitoring features, such as MPLS label verification, and we also use telemetry data to feed back traffic forwarding applications for traffic engineering purposes. We finally show the time that packets spend in the pipeline comparing different parsing and actions performed in different cases.

In this paper an IP based network consisting of two separate IP networks - a virtual one, running MPLS and an experimental IP network, connected to the virtual one, have been studied. VoIP traffic is exchanged between the two networks. Both networks are connected to the Internet and exchange traffic with it. The virtual network is created by using GNS3. The purpose of this paper is to show a comparison in the performance between the two IP networks. In addition, mathematical distributions and approximations have been made to be used to further evaluate the performance of the two networks. The used methodology in the present work can be applied in the study of different IP networks through which different types of real-time traffic passes.

Scalability of the network layer mobility management solution is one of the most important requirements for the mobility control plane. Mobility Label Based Network (MLBN) is a new approach to the network layer mobility management problem that relies solely on MPLS to provide both macro- and micro-mobility for IPv4 and IPv6 mobile hosts and routers. This new approach does not rely on the existing IP mobility management protocols such as Mobile IP and is based on the combination of Multi-Protocol BGP (MP-BGP) and MPLS. In the context of the MLBN the scalable control plane should be capable of efficient Mobility Label distribution while allowing the MPLS-based forwarding plane to deliver mobile traffic in an optimal manner. This paper presents a hierarchical mobility management system capable of both macro- and micro-mobility support without the use of Mobile IP and its derivatives and allows scalable Mobility Label distribution and MPLS label stack based packet forwarding in support of optimal traffic delivery between the communicating mobile users.

Software-defined networking (SDN) is a valuable network management approach that facilitates the network configuration programmatically. It enriches the performance of the monitoring schemes and data transmission across the network. The innovations in the SD-WAN have embarked due to the advancement in network applications. Various operational scenarios and applications have necessitated long-range data transmission, whereas the transmission network is designed with the assistance of SD-WAN with a new perspective. The data transmission in wide area network has used multi-protocol label switching (MPLS), and it has a configuration issue. To overcome the drawbacks, the software-defined technique is incorporated into the WAN, and it is an adequate replacement for the MPLS. During data transmission, SD-WAN has faced various threats and vulnerabilities in the transmission channel. Numerous researches and solutions are articulated for SD-WAN network security. In this review article, SD-WAN characteristics, architectural design, attacks, and potential solutions are demystified.

RFC 8372 (MPLS Flow Identification Considerations) describes the requirement for introducing flow identities within the MPLS architecture. This document describes a method of accomplishing this by using a technique called Synonymous Flow Labels in which labels which mimic the behaviour of other labels provide the identification service. These identifiers can be used to trigger per-flow operations on the packet at the receiving label switching router.

A Software Product Line (SPL) is a family of similar programs (called variants) generated from a common artifact base. A Multi SPL (MPL) is a set of interdependent SPLs (i.e., such that an SPL's variant can depend on variants from other SPLs). MPLs are challenging to model and implement efficiently, especially when different variants of the same SPL must coexist and interoperate. We address this challenge by introducing variability modules (VMs), a new language construct. A VM represents both a module and an SPL of standard (variability-free), possibly interdependent modules. Generating a variant of a VM triggers the generation of all variants required to fulfill its dependencies. Then, a set of interdependent VMs represents an MPL that can be compiled into a set of standard modules. We illustrate VMs by an example from an industrial modeling scenario, formalize them in a core calculus, provide an implementation for the Java-like modeling language ABS, and evaluate VMs by case studies.

The increasing complexity of contemporary mobile and application-centric networks is pushing traditional WAN architectures to its limit. Due to the rise of Cloudbased services and Edge-computing, the inter-site data transfer volume in enterprise networks is rising rapidly. Moreover, enterprises are tending to integrate several communication technologies such as Broadband, LTE, MPLS, etc. for a high-available dynamic WAN connectivity, which a traditional WAN doesn’t support natively. Additionally, its distributed computing model results in the Control-plane traffic to consume a significant amount of backhaul bandwidth. Software-Defined WAN (SDWAN) is a generation shift that adapts the centralized model of SDN to WAN that fills the bottlenecks of its predecessor. It provides over twice the bandwidth having the same backhaul 1 with more managibility, autonomy, and security of the network. In this article, we propose a hybrid routing model for multi-controller SD-WANs that computes all-possible routes proactively and serve them on-demand. It results in a rapid convergence across the edge devices. The article further discusses the synchronization mechanism among several controllers and a testbed implementation to conduct the experiments.

In the present work, a comparison is made in the performance of a virtual IP network using MPLS and MPLS TE. Initially, the network working with MPLS was studied, and then the studies were performed with configured MPLS TE. For the purposes of the study, well-known tools for monitoring of IP networks were used, as well as mathematical distributions for the packet arrival times.

MPLS and SD-WAN are technologies which ensure the quality of service in a different way. MPLS is a network technology which, with its method of routing the network packets, ensures the end-to-end service to users. On the other hand, SD-WAN ensures the global overview of the entire network and central manag-ing thus enabling easy configuration or exchange of the already existing configu-ration system. The topic of this paper is analysis of these two network technolo-gies by having them configured and simulated in the software tool GNS3. After that the analysis of the traffic network has been carried out. Regarding the ever-increasing development of the network technologies, an overview of the SD-WAN technology has been provided, as the new paradigm and its potential future applications.

Cloud computing is generally believed to the most gifted technological revolution in computing and it will soon become an industry standard. It is believed that cloud will replace the traditional office setup. However a big question mark exists over the network performance when the cloud traffic explodes. We call it “explosion” as in future we know that various cloud services replacing desktop computing will be accessed via cloud and the traffic increases exponentially. This paper aims at addressing some of these doubts better called “dangers” about the network performance, when cloud becomes a standard globally. Our study concentrates on, that despite of offering better round-trip times and throughputs, cloud appears to consistently lose large amounts of the data that it is required to send to the clients. In this paper, we first give a concise survey on the research efforts in this area. Our survey findings show that the networking research community has converged to the common understanding that a measurement infrastructure is insufficient for the optimal operation and future growth of the cloud. Despite many proposals on building an network measurement infrastructure from the research community, we believe that it will not be in the near future for such an infrastructure to be fully deployed and operational, due to both the scale and the complexity of the network. We explore this problem, and offer deduction that might explain this erratic behavior. We also suggest a set of technologies to identify and manage cloud traffic using IP header DS field, QoS protocols and some high speed edge routers. Our solutions assume that cloud is being assessed via basic public network.

This paper represents the prime factors of MPLS over ATM method and compares results of delay variations. In this paper we will see how the MPLS will provide better results for media traffic over the ATM method. In Computer Networks, MPLS contributes high scalability so we will briefly analyze the working methodology of MPLS system. MPLS helps in removing the dependence on Layer 2 technology. Among all the challenges faced in the Net-work industry traffic routing is one the most important, traffic routing and traffic algorithm are equally important and need to be efficient. We also observe that MPLS outperforms ATM in terms of delay and response time.

International audience; Nowadays, materials with persistent luminescence (MPLs) have attracted growing attention in the photocatalytic field because they can act as an inner light source to irradiate the photocatalytic materials (PCMs) and sustain their photocatalytic activities in the absence of the external irradiation source. The motivation of the present work is to provide a review of the MPL@PCM composites that are of interest for both photocatalytic and lighting fields. In terms of the unique luminescence of MPLs and the principal optical properties of PCMs, the review is organized as follows: first, we categorize and discuss a number of rare-earth (RE)/non-RE-doped MPLs and bulk MPLs, along with their emission/persistent ranges and potentially-coupled PCM counterparts. Then, we present and discuss the intrinsic nature of the photocatalytic properties and the working principles of the MPLs that have been coupled with the PCMs. In the 4th section, we summarize the principal synthesis strategies that are reported for the MPL@PCM composites. At last, by taking advantages of some typical reported works, we exhibit the photocatalytic applications of the MPL@PCM composites, and give a summary, perspectives, potential challenges and future development directions to this review. With the profound impact of the persistent luminescence, we believe that this review will be not only of particular interest to the scientists in the lighting field, but can also attract those with backgrounds in the fields of the environmental science, materials and physics, chemistry, energy fuels, and their coupling subdivisions to jointly address some of the major environmental issues like degradation of organic waste, removal of gas-phased materials, etc.

The communication network context in actual systems like 5G, cloud and IoT (Internet of Things), presents an ever-increasing number of users, applications and services that are highly distributed with distinct and heterogeneous communications requirements. Resource allocation in this context requires dynamic, efficient and customized solutions and Bandwidth Allocation Models (BAMs) are an alternative to support this new trend. This paper proposes the BAMSDN (Bandwidth Allocation Model through Software-Defined Networking) framework that dynamically allocates resources (bandwidth) for a MPLS (MultiProtocol Label Switching) network using a SDN (Software-Defined Networking)/OpenFlow strategy with BAM. The framework adopts an innovative implementation approach for BAM systems by controlling the MPLS network using SDN with OpenFlow. Experimental results suggest that using SDN/OpenFlow with BAM for bandwidth allocation does have effective advantages for MPLS networks requiring flexible resource sharing among applications and facilitates the migration path to a SDN/OpenFlow network., {"references":["E. Rachkidi, D. Belaïd, N. Agoulmine, and N. Chendeb, \"Cloud of Things Modeling for Efficient and Coordinated Resources Provisioning,\" in OTM Confederated Int. Conf. Springer, Sep. 2017, pp. 175–193.","L. Zuo, M. Zhu, and Q. Wu, \"Fast and Efficient Bandwidth Reservation Algorithms for Dynamic Network Provisioning,\" Journal of Network and Syst. Manag., vol. 23, no. 3, pp. 420–444, Jul. 2015.","B. Fan, S. Leng, and K. Yang, \"A Dynamic Bandwidth Allocation Algorithm in Mobile Networks with Big Data of Users and Networks,\" IEEE Network, vol. 30, no. 1, pp. 6–10, Jan. 2016.","J. Martins, R. Bezerra, G. Durães, and R. Reale, \"Uma Visão Tutorial dos Modelos de Alocação de Banda como Mecanismo de Provisionamento de Recursos em Redes IP/MPLS,\" Revista de Sistemas e Computação, vol. 5, no. 2, pp. 144–155, Dec. 2015.","R. Trivisonno, R. Guerzoni, I. Vaishnavi, and A. Frimpong, \"Network Resource Management and QoS in SDN-Enabled 5g Systems,\" in IEEE GLOBECOM 2015. IEEE, Dec. 2015, pp. 1–7.","M. Pitek, M. Medvecký, and S. Kluik, \"A-MAR: A New Bandwidth Constraint Model for DS-TE Networks,\" in 38th Int. Conf. on Telecommunications and Signal Processing, Jul. 2015, pp. 1–5.","T. Onali and L. Atzori, \"Traffic Engineering in Next Generation Networks Using Genetic Algorithms,\" in GLOBECOM, Nov. 2008, pp. 1–5.","D. Kreutz, F. Ramos, P. Verissimo, C. Rothenberg, S. Azodolmolky, and S. Uhlig, \"Software-Defined Networking: A Comprehensive Survey,\" Proc. of IEEE, vol. 103, no. 1, pp. 14–76, Dec. 2014.","F. L. Faucher and W. Lai, \"Maximum Allocation Bandwidth Constraints Model for DSTE,\" Tech. Rep. RFC 4125, Jun. 2005.","W. Neto, S. Brito, and J. Martins, \"Algoritmos de Seleção de Caminho e Gerenciamento de Banda Compartilhada conforme ao Modelo RDM para Classes de Tráfego em Rede DS-TE,\" in SBRC 2008, Rio de Janeiro, May 2008, pp. 537–552.","R. F. Reale, W. d. C. P. Neto, and J. S. B. Martins, \"AllocTC-sharing: A New Bandwidth Allocation Model for DS-TE Networks,\" in LANOMS 2011. Equador: IEEE, Oct. 2011, pp. 1–4.","J. Martins, R. Reale, and R. Bezerra, \"G-BAM: A Generalized Bandwidth Allocation Model for IP/MPLS/DS-TE Networks,\" Int. Journal of Computer Information Systems and Industrial Management Applic., vol. 6, pp. 635–643, Dec. 2014.","R. Reale, R. Bezerra, and J. Martins, \"A Preliminary Evaluation of Bandwidth Allocation Model Dynamic Switching,\" Int. Journal of Computer Networks & Comm., vol. 6, no. 3, pp. 131–143, May 2014.","X. Hesselbach, J. Amazonas, and J. Botero, \"Management of resources under priorities in EON using a modified RDM based on the squattingkicking approach,\" in 18th Int. Conf. on Transparent Optical Networks, 2016, pp. 1–5.","R. Reale, R. Bezerra, G. Durães, A. Soares, and J. Martins, \"Evaluating the Applicability of Bandwidth Allocation Models for EON Slot Allocation,\" in IEEEANTS 2017, Dec. 2017, pp. 1–6.","J. B. Goldberg, S. Dasgupta, and J. C. d. Oliveira, \"Bandwidth Constraint Models: A Performance Study with Preemption on Link Failures,\" in IEEE Globecom 2006, Nov. 2006, pp. 1–5.","T. Shan and O. W. W. Yang, \"Bandwidth Preemption Algorithms for Differentiated Service aware Traffic Engineering,\" in GLOBECOM 2005, vol. 1, Nov. 2005, pp. 535–539.","S. Jain, A. Kumar, S. Mandal, J. Ong, L. Poutievski, A. Singh, S. Venkata, J. Wanderer, J. Zhou, M. Zhu, J. Zolla, U. Hölzle, S. Stuart, and A. Vahdat, \"B4: Experience with a Globally-deployed Software Defined Wan,\" in ACM SIGCOMM 2013, USA, 2013, pp. 3–14.","M. Tanha, D. Sajjadi, R. Ruby, and J. Pan, \"Traffic Engineering Enhancement by Progressive Migration to SDN,\" IEEE Communications Letters, vol. 22, no. 3, pp. 438–441, Mar. 2018."]}

We study the problem of using probabilistic network models to formally analyze their quantitative properties, such as the effect of different load-balancing strategies on the long-term traffic on a server farm. Compared to prior work, we explore a different design space in terms of tradeoffs between model expressiveness and analysis scalability, which we realize in a language we call Netter. Netter code is compiled to probabilistic automata, undergoing optimization passes to reduce the state space of the generated models, thus helping verification scale. We evaluate Netter on several case studies, including a probabilistic load balancer, a routing scheme reminiscent of MPLS, and a network defense mechanism against link-flooding attacks. Our results show that Netter can analyze quantitative properties of interesting routing schemes that prior work hadn’t addressed, for networks of small size (4–9 nodes and a few different types of flows). Moreover, when specialized to simpler, stateless networks, Netter can parallel the performance of previous state-of-the-art tools, scaling up to millions of nodes.

Network routing depends primarily on connectivity, which demands the insurance from protocol standards that even if one network path disconnects, the alternate path should be available in no time with minimum packet loss. The Network Path Restoration (NPR) mechanism is required after any link/node failure occurs in a network. These failures are frequent in core networks and must be handled in a quick and efficient manner with minimum packet loss. In this paper, it is proposed that augmenting Border Gateway Protocol (BGP) with Multiprotocol Label Switching (MPLS) technology can enhance the NPR mechanism with minimum packet loss. This research work made a significant contribution to NPR. In this study, hybridization of approaches have been performed to design a new mechanism for NPR.

This paper designed the stability and scalability of IXP by avoiding the complexity area notation with a high-speed data rate. The link redundancy and architecture of IS-IS (intermediate system to intermediate system) provides the link-state protocol. The IS-IS protocol had recommended less CPU usage of the routers and can support MPLS and BGP for the cascade backbone line. Moreover, the IS-IS topology had clarified unwanted and complex protocol and stubby or NSSA. Furthermore, the future of IXPs will mainly configure the IS-IS topology and multipath map solution system. The IXPs invented the upstream transit link out of possession of the international backbone line to gain the high-speed Internet to the national transit. Each IXPs administrative the international transit lines or backbone line to distribute for mobile data communication, the local service providers (LSP), and sub-vendors as peer to peer and IP transits. The IXPs exchange network reachable information sharing. The author described the implementation design and test results.

This document contains a specification of the MPLS base YANG model. The MPLS base YANG model serves as a base framework for configuring and managing an MPLS switching subsystem on an MPLS-enabled router. It is expected that other MPLS YANG models (e.g. MPLS Label Switched Path (LSP) Static, LDP or RSVP-TE YANG models) will augment the MPLS base YANG model.

In a shared software-defined network (SDN), the controller should provide isolation guarantees across flows (users) to predict network performance and minimize disruption from some malicious flows. In an SDN, packets are forwarded by flow rules installed in flow tables, and the capacity of flow tables is usually limited by power and cost constraints so that a limited number of flows can be accommodated. To date, OpenFlow 1.4.0 introduces the flow rule replacement, which allows replacing existing flow rules with new ones once the flow table is full. This is called flow table overflow. Although flow table overflow may lead to an increase in packet delay, our experiments on an SDN testbed show that the network performance could benefit by admitting more flows through slightly overbooking the flow table resource. In this paper, we address the Flow table Overbooking isoLation guArantees problem (FOLA), which aims to maximize minimum progress of flows and minimize maximum flow table overflow. To that end, an algorithm with guaranteed minimum progress and bounded maximum flow table overflow is proposed. Trace-driven experiments on an SDN testbed show that our solution outperforms state-of-the-art methods for maximizing minimum progress in terms of the minimum progress and network throughput.