Intermediate System To Intermediate System Research Articles

ANALISIS KINERJA PROTOKOL ROUTING DINAMIS IS-IS UNTUK MENINGKATKAN PERFORMANSI JARINGAN HYBRID KAMPUS UNUD DENPASAR

As a center for Information and Communication Technology services, the Global Distance Learning Network (GDLN) of Udayana University must reconsider the implementation of static routing protocols that have been applied to meet the increasing demands of computer networks. Dynamic routing protocols, such as Intermediate System to Intermediate System (IS-IS), can be used to address the challenges currently faced with static routing, and serve as a more viable option for larger network requirements. This research evaluates the implementation of static routing protocols and IS-IS at the UNUD Denpasar campus using Graphical Network Simulator-3 to assess the future utilization of the IS-IS routing protocol. Quality of Service (QoS) parameters are used to assess network performance, while the scenarios include PING intervals with settings close to streaming YouTube videos. The research findings reveal that both routing protocols exhibit good service quality, meeting TIPHON criteria with excellent evaluations for packet loss, throughput, and delay, in addition to satisfactory criteria for jitter. Simulation tests demonstrate the superiority of the IS-IS routing protocol compared to static routing when transmitting data in high-resolution streaming video formats like 480p, 720p, and 1080p. On the other hand, static routing is more suitable for disseminating data consisting of lower-resolution streaming videos (360p). Based on the research results, it can be inferred that the dynamic routing protocol IS-IS is more suitable for meeting network demands on a larger scale.

Performance analysis and evaluation of distance vector and link state routing protocols over a large area networks

Routing protocols are extremely important incredibly significant in data communication and computer networks. The high performance, reliability, stability, and security of the networks depend primarily on choosing the best type of dynamic routing protocol. In this paper, we evaluate and investigate the network performance for routing information protocol (RIP), enhanced interior gateway routing protocol (EIGRP), open shortest path first (OSPF), and intermediate system-to-intermediate system (IS-IS) routing protocols with three different scenarios of routes failure using the optimized network engineering tools (OPNET) simulator to determine which of the protocols is the most appropriate and effective in achieving high network performance. The results show that for large area networks, the EIGRP routing protocol gives the best network performance when all network routers are working with no failing, but when some network routers were failing to work and path failure is happening, the IS-IS link-state routing protocol works efficiently and gives the best performance. The obtained results for IS-IS protocol when failing seven routers is as: the hypertext transfer protocol (HTTP) page response time is (247.8 msec), voice delay variation is (4.19 µsec) , video delay variation is (8.83 µsec) and ping request and response time is (115 msec).

Analysis and Simulation of IPv4 and IPv6 Protocol

In this modern technology where the growth of the network is increasing rapidly. This paper covers the analysis of different routing protocols, it specifies and identifies that how routers communicate with each other by sharing data also provides the infrastructural view of a network, where routing protocols are used to transmit data packets over wired and wireless networks. There are multiple ways to design routing protocols depend on IPv4 and IPv6 version being widely used as follow RIP (Routing information protocol), IGRP (Interior Gateway Routing Protocol), OSPF (Open Shortest Path First), EIGRP (Enhanced Interior Gateway Routing Protocol) and IS-IS (Intermediate System to Intermediate System) [1]. In this paper, we are analyzed and simulate wired/wireless topological area network simulation using routing protocols. Analysis, simulation, and configuration of this different routing protocol are done by using the CISCO packet tracer.

Performance Analysis of Route Redistribution among Diverse Dynamic Routing Protocols based on OPNET Simulation

Routing protocols are the fundamental block of selecting the optimal path from a source node to a destination node in internetwork. Due to emerge the large networks in business aspect thus; they operate diverse routing protocols in their infrastructure. In order to keep a large network connected; the implementation of the route redistribution is needed in network routers. This paper creates the four scenarios on the same network topology by using Optimized Network Engineering Tools Modeler (OPNET 14.5) simulator in order to analyze the performance of the route redistribution among three routing protocols by configuring three protocols from a set of Routing Information Protocol (RIPv2), Enhanced Interior Gateway Routing Protocol (EIGRP), Open Shortest Path First (OSPF), and Intermediate System to Intermediate System (IS-IS) dynamic routing protocols on each scenario. The first scenario is EIGRP_OSPF_ISIS, the second scenario is EIGRP_OSPF_RIPv2, the third scenario is RIPv2_EIGRP_ISIS, and the fourth scenario is RIPv2_OSPF_ISIS. The simulation results showed that the RIPv2_EIGRP_ISIS scenario outperforms the other scenarios in terms of network convergence time, the hops number, jitter, packet delay variation, packet end to end delay; therefore, it fits real time applications such as voice and video conferencing. In contrast, the EIGRP_OSPF_ISIS scenario has better results compared with other scenarios in terms of response time in case of using web browsing, database query, and Email services.

CentFlow: Centrality-Based Flow Balancing and Traffic Distribution for Higher Network Utilization

Next-generation networks (NGNs) are embracing two key principles of software defined networking (SDN) paradigm functional segregation of control and forwarding plane, and logical centralization of the control plane. A centralized control enhances the network management significantly by regulating the traffic distribution dynamically and effectively. An eagle-eye view of the entire topology opens up the opportunity for an SDN controller to refine the routing. Optimizing the network utilization in terms of throughput is majorly dependent on the routing decisions. Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS) are well-known traditional link state routing protocols proven with operation over operator networks for a long time. However, these classical protocols deployed distributively fall short of expectation in addressing the current routing issues due to the lack of a holistic view of the network topology and situation, whereas handling enormous traffic and user quality of experience (QoE) requirements are getting critical. IP routing in NGN is widely expected to be supported by SDN to enhance the network utilization in terms of throughput. We propose a novel routing algorithm–CentFlow, for an SDN domain to boost up the network utilization. The proposed weight functions in CentFlow achieve smart traffic distribution by detecting highly utilized nodes depending on the centrality measures and the temporal node degree that changes based on node utilization. Furthermore, the frequently selected edges are penalized thereby augmenting the flow balancing and dispersion. CentFlow reaps greater benefits on an SDN controller than the classical OSPF due to its comprehensive view of the network. Experimental results show that CentFlow enhances the utilization of up to 62% of nodes and 49% of links, respectively, compared to an existing Dijkstra algorithm-based routing scheme in SDN. Furthermore, nearly 6.5% more flows are processed networkwide.

Congestion Aware Multipath Routing: Aggregation Network Applicability and IPv6 Implementation

Currently, the service provider network capacity utilization is low due to the shortest multipath based routing protocols Opens Shortest Path First (OSPF) and Intermediate System-to-Intermediate System (ISIS). Due to inefficient routing approach, certain paths can be overloaded and link capacity is required while alternative paths are unused. The overall network has to be dimensioned with higher link bandwidth requirements introducing additional line, linecard, routing engine and overall solution cos. This paper provides improved Congestion Aware Multipath Routing (CAMRv2) algorithm overview. The new network routing algorithm allows higher throughput, network load-balancing and stability to ensure lower congestion and data drop on critical links. The algorithm discovers unused network resources and dynamically adapts to the actual traffic load and displacement. The focus in this paper is on new parameters for path computation performance improvement. Additionally, detailed IPv6 source routing CAMRv2 implementation for parallel coexistence with present networks is presented. Finally, the new routing algorithm is simulated in several scenarios over aggregation network. The result of simulations have proved better performance and resource utilization of the proposed algorithm in sparse aggregation network in terms of load-balancing between uplinks to the core network

IMPACT OF NETWORK SCALABILITY ON THE PERFORMANCE OF RIP AND IGRP FOR EMAIL SERVICES

Dynamic routing is one of the major areas in computer networks, in which routing protocols are used to automate the process of routing. Routing protocols dynamically determine best path(s) to every network. Routing protocols are classifed as distance vector and link-state routing protocols. Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP) are examples of distance vector while Open Shortest Path First (OSPF) and Intermediate System to Intermediate System (IS-IS) are link-state routing protocols. Both RIP and IGRP are using different metrics to evaluate best route to a destination in the network. RIP uses a simple metric value of hop-count while IGRP uses a composite metric. A composite metric consists of several attributes like bandwidth, delay, reliability, Maximum Transmission Unit (MTU) and load. Usually it is considered that because of the simple metric value, RIP produces better results for any application in simple network architectures. This paper studies the performance of RIP and IGRP in simple networks of different sizes, using email application as evaluation entity. The objective is to fnd that where, in simple network architectures, RIP with its simple metric will produce better email services or IGRP will win the race with the help of its composite metric. This study also investigates the effect of scalability on both of the routing protocols when the size of the network grows. The behavioural study of RIP and IGRP for email, in different sizes of networks, will also help in evaluating the behaviour of simple and composite metrics. Simulations and experiments results indicate that IGRP produces better results for email services as the size of the network becomes more scalable and the number of hops between source and destination increases, even if simple network architecture is followed. The results also indicate that IGRP consumes relatively less CPU pulses of email server.

A comparison between two routing protocols: OSPF and IS-IS

A comparison is made of the open shortest path first (OSPF) and intermediate system-to-intermediate system (IS-IS) routing protocols in terms of their ability to route internet protocol (IP) traffic. Common characteristics of the two protocols are briefly indicated. The differences between the two are explored with respect to packet encoding, area partitions, level 2 partitions, injection of level 2 information, authentication, designated router election, link state packet propagation, synchronized parameter setting, and neighbor initialization.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>