Minimizing Link Utilization in Selfish Overlay Routing

Routing is an important process in computer networks, which involves selecting a path for packet data. The routing mechanism is governed by protocols at layer three of the OSI model or layer two of the TCP/IP model. Routing can be static or dynamic, with dynamic routing algorithms automatically determining the best path in the network. One commonly used dynamic routing protocol is Open Shortest Path First (OSPF), which automatically selects the optimal route for data packets based on received network topology information. The need for more advanced and scalable routing solutions led to the development of Multi-Protocol Label Switching (MPLS), introducing the concept of label switching for faster and more efficient data forwarding. This research aims to analyze the performance of OSPF and OSPF MPLS routing scenarios regarding TCP and UDP services. Through evaluation of Quality of Service (QoS) parameters, including throughput, packet loss, delay, and jitter. This study simulates the network using GNS3 software, with TCP and UDP services transmitted for durations of 15, 30, and 60 seconds. The results showed performance for both scenarios with an average index value of 3.75, indicating "good" network performance according to TIPHON standards across all measurement sessions. Although MPLS OSPF showed slightly lower throughput compared to non-MPLS OSPF, both scenarios showed very low packet loss, low delay, and stable jitter. The evaluation also highlights that the use of OSPF MPLS for UDP services reduces the time delay. Both non-MPLS OSPF and MPLS OSPF effectively support TCP and UDP services, with MPLS OSPF showing advantages in certain QoS parameters, especially for UDP services.

Technological developments in the field of fiber optic telecommunications with the media of the backbone network is faster in comparison with other technologies. In the process, the telecommunications industry use the metro ethernet configuration with Multi Protocol Label Switching (MPLS) network and Open Shortest Path First (OSPF) as the backbone network. This study aims to answer the question of how much the effect of adding the MPLS network protocol on OSPF network. So from this research can be known the value of the efficiency of the addition MPLS network protocol on OSPF network based on network performance using a software simulator GNS3 as its backbone through a step-test. From the test results concluded that based on the delay by the load, MPLS makes network performance more efficient by 67.04%, based on the packet loss and link failure conditions, MPLS makes network performance more efficient by 1.1%, but based on the no-load delay, OSPF has more efficient network performance by 41.96%, and based on the transfer rate, OSPF has a more efficient network performance by 5.2%, to delay normal conditions both have a performance with an average value of 0% packet loss. DOI: http://dx.doi.org/10.11591/telkomnika.v15i1.7600

Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet forwarding to achieve any network optimization objective. Because of the high cost of network assets and commercial and competitive nature of Internet service provisioning, service providers are interested in performance optimization of their networks. This helps in reducing congestion hotspots and improving resource utilization across the network, which, in turn, results in an increased revenue collection. One way of achieving this is through Traffic Engineering. Currently traffic engineering is mostly done by using MPLS. But legacy networks running OSPF would need to be upgraded to MPLS. To achieve better resource utilization without upgrading OSPF network to MPLS is a challenge. In this paper we present a simple but effective algorithm, called Smart OSPF (S-OSPF) to provide traffic engineering solution in an OSPF based best effort network. We formulate an optimization problem based on the traffic demand to minimize the maximum link utilization in the network. Routing of the traffic demand is achieved using OSPF. We have simulated S-OSPF on real networks of two service providers. Simulation results show that S- OSPF based traffic engineering solution performance very closely follows the optimal solution.

MPLS has been in the forefront of high-speed Wide Area Networks (WANs), for almost two decades [1], [12]. The performance advantages in implementing Multi-Protocol Label Switching (MPLS) are mainly its superior speed based on fast label switching and its capability to perform Fast Reroute rapidly when failure(s) occur - in theory under 50 ms [16], [17], which makes MPLS also interesting for real-time applications. We investigate the aforementioned advantages of MPLS by creating two real testbeds using actual routers that commercial Internet Service Providers (ISPs) use, one with a ring and one with a partial mesh architecture. In those two testbeds we compare the performance of MPLS channels versus normal routing, both using the Open Shortest Path First (OSPF) routing protocol. The speed of the Fast Reroute mechanism for MPLS when failures are occurring is investigated. Firstly, baseline experiments are performed consisting of MPLS versus normal routing. Results are evaluated and compared using both single and dual failure scenarios within the two architectures. Our results confirm recovery times within 50 ms.

enterprise networks. This research focuses on combining advantages from Frame Relay, MPLS and OSPF into a modeled multi-site network. The combination is compared to th original OSPF network and analyzed for its throughput, packet loss, and delay. To meet the demand for efficient and resilient network, and to emphasize the advantages of MPLS-OSP as well as to avoid traffic shifting, specific network topology models are applied: full mesh with virtual circuit in core network connected to OSPF nodes for the rest. From analysis and comparison of network quality values obtained at, this combination attests to be reliable and robust network architecture without trading off its efficiency. The average throughput value of the combination networks was 18.47 bps, which is better compared to the OSPF. The average delay and packet loss from combination network also show better results, which are 59.90ms and 2.01% respectively. The results shows that the combination of Frame Relay, OSPF andMPLS generates better performance as well as significant improvement in networksecurity.

Voice over internet protocols (VoIP)'s quality communication relies significantly on the network; however guarantee the best quality of the traffic is difficult. This paper analyzes the performance of VoIP traffic in Border Gateway Protocol (BGP) -Multiprotocol Label Switching (MPLS) IP Virtual Private Network (VPN) between two interior routing protocols namely Enhanced Interior Gateway Protocol (EIGRP) and Open Shortest Path First (OSPF). The combination of MPLS and conventional routing improve the forwarding mechanism, scalability and overall network performance. OPNET Modeler 14.5 is used to simulate both scenarios and metrics such as delay, jitter and mean opinion score (MOS) value are measured. The simulation result shows OSPF and BGP-MPLS VPN provides better infrastructure for VoIP VPN application.

Multi-protocol label switching (MPLS) technology is useful for IP Virtual Private Networks (IP-VPNs), guaranteeing bandwidth in IP (Internet Procotol) networks, and carrying out traffic engineering with explicit routing. The advantage of MPLS is its high capability to achieve of reliable networks when used with Fast Rerouting. However, Fast Rerouting requires a lot of network resources. This is because, for the rapid recovery of end-to-end communications after dtectoin of failures, secondary LSPs must already have been reserved as detours in case there are failures on primary node-of-node links. The sharing of bandwith among secondary LSPs is thus significant as a way of reducing the usage of network resources when Fast Rerouting is applied.In this paper, we propose a new routing algorithm in which bandwidth is shared among the secondary LSPs for multiple primary LSPs. This algorithm produces efficient network-level LSP designs. Three approaches to the dynamical changing of Open Shortest Path First (OSPF) link-cost metrics are applied in the algorithm. Each approach improves efficiency in the sharing of LSPs. The approaches are (1) the broader distribution of primary LSPs to reduce the need for detours in cases of single failures, (2) the concentration of secondary LSPs on links to increase the possibilities for bandwidth sharing, and (3) the distribution of secondary LSPs that cater to a certain failure, thus increasing the numbers of detouring LSPs which are independent of each other on the respective links. The scheme provides a slight improvement over the results of the conventional Dijkstra-algorithm calculation which is used in conventional OSPF. The proposed algorithms are applied with various network models that have been proposed in IETF Internet drafts, e.g., Haskin, to egress, and Next-Next-Hop; the results are evaluated on the basis of parameters that indicate the consumption of network resources, including the numbers of labels per node, usage of the network's bandwidth capacity, and round-trip times for the secondary LSPs. Application of algorithm (1) led to a 10% lower total LSP cost of the network than the result for the conventional form of bandwidth sharing, i.e., for sharing among the secondary LSPs of a single primary LSP.

The purpose of this paper is to examine how the Multiprotocol Label Switching (MPLS) technology affects to the latency in an IP network when using different dynamic routing protocols. For the purposes of the study, a virtual IP network was created, in which was sequentially configured to work with Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP) and Open Shortest Path First (OSPF). The studies were performed without configured and then with configured MPLS. Techniques, methods and tools used in the monitoring of IP networks were used during the study of the network.

This paper addresses the problem of traffic engineering (TE) to evaluate the performance of evolutionary algorithms when used as IP routing optimizers and assess the relevance of using gene expression programming (GEP) as a new fine-tuning algorithm in destination- and flow-based TE. We consider a TE scheme where link weights are computed using GEP and used as either fine-tuning parameters in open shortest path first (OSPF ) routing or static routing cost in constraint based routing (CBR ). The resulting OSPF and CBR algorithms are referred to as OSPFgep and CBRgep. The GEP algorithm is based on a hybrid optimisation model where local search complements the global search implemented by classical evolutionary algorithms to improve the genetic individuals fitness through hill-climbing. We apply the newly proposed TE scheme to compute the routing paths for the traffic offered to a 23-, 28- and 30-node test networks under different traffic conditions and differentiated services situations. We evaluate the performance achieved by the OSPFgep, CBRgep algorithms and OSPFma, a destination-based routing algorithm where OSPF path selection is driven by the link weights computed by a memetic algorithm (MA ). We compare the performance achieved by the OSPF gep algorithm to the performance of the OSPFma and OSPF algorithms in a simulated routing environment using NS. We also compare the quality of the paths found by the CBRgep algorithm to the quality of the paths computed by the constraint shortest path first (CSPF ) algorithm when routing bandwidth-guaranteed tunnels using connection-level simulation. Preliminary results reveal the relative efficiency of (1) the OSPFgep algorithm compared to both the OSPFma and OSPF algorithms and (2) the CBRgep algorithm compared to CSPF routing

An essential solution is available in Multi-protocol label switching (MPLS), which solve the problems faced by present-day networks: speed, scalability, quality-of-service (QoS) management, and traffic engineering. This paper is an extension of work on Fuzzy based Packet Scheduling Algorithm (FPSA) combined with Packets Processing Algorithm (PPA) in an Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) networks. This will make provision for an intelligent service to the Label Switched Path (LSP) in MPLS networks. Several research work have been proposed on the MPLS Traffic Engineering. However, it is still imperative to further research on the effect of bandwidth increment on the core network using different mechanisms such as the analytical model of MPLS, expert-based packet scheduling algorithm for MPLS QoS support. Since MPLS is not able to provide intelligent routing, it is necessary to propose an intelligent expert system of FPSA combined with PPA. And analytical model of packet forwarding in the MPLS network would be given to provide suitable solution to traffic congestion and reliable services. Furthermore, the network model created using Network Simulator (NS 2), which carries non-real time application such as File Transfer Protocol (FTP) with bandwidth variations. The results obtained from trace files are interpreted by AWK script and used for the further analysis.

Multi-Protocol Label Switching (MPLS) can efficiently support the explicit routes setup by the use of Label Switched Paths (LSPs) between an ingress Label Switched Router (LSR) and an egress LSR. Hence it is possible to distribute the network traffic among several paths to achieve load balancing, thus improving the network utilization, and minimizing the congestion. The packet-level traffic characteristics in the Internet is so complex that it is natural to do traffic engineering (TE) and control at the flow level. The emerging Multi-Protocol Label Switching (MPLS) has introduced an attractive solution to TE in IP networks. The main objective of this paper is to balance traffic at the flow level among the parallel Label Switched Paths (LSPs) in MPLS networks. We introduce a multipath load-balancing model at the flow level. In this model, each LSP is modeled as an M/G/1 processor-sharing queue. The load-balancing problem is then considered as an optimization problem. Based on the analysis of the model, we propose a heuristic but efficient mechanism that can make good use of the traffic characteristics at the flow level. Packet disorder is avoided effectively by dispatching packets belonging to one flow to the same path. This mechanism only need to be implemented in the ingress LSRs and the egress LSRs, while the intermediate LSRs only forward the packets. Apart from discussing the traffic allocation granularity, and the implementation issues in details, we have also performed extensive simulations using NS-2 with MPLS modules. The simulation results show that the load through the network is well balanced so that the network throughput is improved and the delay is decreased efficiently.

In the past few years, new types of Internet applications that require performance guarantees beyond the best effort service have emerged. These applications have spread to include voice, video teleconferencing, and a new set of pervasive computing devices that demand hard delay bound guarantees. The Differentiated services model when combined with traffic engineering can provide a suitable architecture for ensuring QoS guarantees to such applications, especially when multiple parallel paths to the same destination exist in a provider's network. Multiprotocol label switching (MPLS) is a new technology that facilitates significantly the process of traffic engineering in IP networks. With MPLS and differentiated services traffic engineering (DS-TE), it is possible to define explicit routes with different performance guarantees on each route to ensure QoS constraints are met. We introduce a probe packet approach to measure the delay on established label switched paths (LSPs) between ingress/egress edge routers pair. These measurements are then used in a delay estimation algorithm to provide the measure of the expected delay within the path. We demonstrate, through simulations, that our proposed model provides a better service to higher priority traffic classes.

This section introduces MultiProtocol Label Switching (MPLS) an alternative for regular IP forwarding and routing in IP networks. MPLS allows the setup of Label Switched Paths (LSPs) between IP routers to avoid the IP forwarding in the intermediate routers. This sections compares IP forwarding with MPLS forwarding. It gives an example of LSP setup. Then more details about the MPLS forwarding and signaling layers are given. The important MPLS signaling protocols: Label Distribution Protocol (LDP), Constraint‐Based LDP (CR‐LDP), RSVP extensions for LSP tunnels (RSVP‐TE) and carrying labels in BGP‐4 are described. Combing Quality of Service (QoS) (both integrated service and differentiated services) and MPLS is described. Finally, this section describes three important applications for MPLS: Traffic Engineering, Virtual Private Networks (VPN) and resilience.

Fast setup of end-to-end paths for bandwidth constrained applications in an IP/MPLS–ATM integrated environment

OSPF (open shortest path first) is a widely used intra-domain routing protocol in IP networks. The performance of OSPF implementations is impacted by internal packet processing time. In this paper, we study OSPF scalability and propose an evaluation method based on white-box measurements. Compared with black-box OSPF measurement, our method can be used to design a network, because the implementation performance and scalability limitation can be calculated based on the parameters measured.