44,810 research outputs found

    A Comparative Analysis of Unicast Routing Protocols for MPLS-VPN

    Get PDF
    MPLS-VPN technology is introduced to provide secure transmission with minimum propagation delay. This paper presents a comparative analysis of unicast routing protocols for MPLSVPN enabled networks. The motive behind this analysis is to observe the consequence of unicast routing protocols on the performance of MPLS-VPN enabled networks and to choose most suitable routing protocol for such type of networks. To conduct the analysis, a test bed is established in GNS3 simulator. Three main unicast routing protocols i.e. Enhanced Interior Gateway Routing Protocol (EIGRP), Open Shortest Path First (OSPF) and Routing Information Protocol (RIP) has been considered in this work. Round-Trip-Time, Jitter and Administrative-distance are used as performance measure metrics. The experimental analysis indicates that EIGRP is the most suitable protocol among the aforementioned protocols for MPLS-VPN

    Performance Analysis of Protocol Independent Multicast (PIM)

    Get PDF
    This research was conducted for the purpose of analyzing the performance of a network through the use of a combination of Protocol Independent Multicast (PIM ) and a unicast routing protocol which is the Open Shortest Path First (OSPF).A physical and logical topology was built using the Graphical Network Simulator (GNS3). A Class B address was subnetted into eight (8) subnets, each of which are accorded with the appropriate addresses. The Wireshark Network Protocol Analyzer was used for the analysis part to interpret the behavior and performance of the network with the protocol used. The performance of the network was analyzed on the basis of the following parameters: length of packet, total packets captured. packets captured between first and last packet, average packet per second, average packet size in bytes, number of bytes , and average bytes per second. Based on the results, given the same number of packets captured, the links differ in the duration between the 1st and last packet captured. It shows that the link R3 to R1 shows a considerable delay of 245.19 secs while R4 to R3 shows the fastest duration. The average packets/sec and the average size in terms of bytes are almost close to each others on all the links except R3 to R1. This is so because the duration is directly proportional to the packet size and bytes. Keywords: packet; protocol; Protocol Independent Multicast; network; unicas

    Routing in a many-to-one communication scenario in a realistic VDTN

    Get PDF
    In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.Peer ReviewedPostprint (author's final draft

    Analysis of Performance of Dynamic Multicast Routing Algorithms

    Full text link
    In this paper, three new dynamic multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree, Topology Based Tree and Minimum Diameter Tree. A simulation analysis is presented showing various performance aspects of the algorithms, in which a comparison is made with the greedy and core based tree techniques. The effects of the tree source location on dynamic membership change are also examined. The simulations demonstrate that the Source Optimised Tree algorithm achieves a significant improvement in terms of delay and link usage when compared to the Core Based Tree, and greedy algorithm

    Low Cost Quality of Service Multicast Routing in High Speed Networks

    Get PDF
    Many of the services envisaged for high speed networks, such as B-ISDN/ATM, will support real-time applications with large numbers of users. Examples of these types of application range from those used by closed groups, such as private video meetings or conferences, where all participants must be known to the sender, to applications used by open groups, such as video lectures, where partcipants need not be known by the sender. These types of application will require high volumes of network resources in addition to the real-time delay constraints on data delivery. For these reasons, several multicast routing heuristics have been proposed to support both interactive and distribution multimedia services, in high speed networks. The objective of such heuristics is to minimise the multicast tree cost while maintaining a real-time bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient, although some perform better for small multicast groups and others perform better for larger groups. Firstly, we present a detailed analysis and evaluation of some of these heuristics which illustrates that in some situations their average performance is reversed; a heuristic that in general produces efficient solutions for small multicasts may sometimes produce a more efficient solution for a particular large multicast, in a specific network. Also, in a limited number of cases using Dijkstra's algorithm produces the best result. We conclude that the efficiency of a heuristic solution depends on the topology of both the network and the multicast, and that it is difficult to predict. Because of this unpredictability we propose the integration of two heuristics with Dijkstra's shortest path tree algorithm to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. These heuristics are based on Dijkstra's algorithm which maintains acceptable time complexity for the hybrid, and they rarely produce inefficient solutions for the same network/multicast. The resulting performance attained is generally good and in the rare worst cases is that of the shortest path tree. The performance of our hybrid is supported by our evaluation results. Secondly, we examine the stability of multicast trees where multicast group membership is dynamic. We conclude that, in general, the more efficient the solution of a heuristic is, the less stable the multicast tree will be as multicast group membership changes. For this reason, while the hybrid solution we propose might be suitable for use with closed user group multicasts, which are likely to be stable, we need a different approach for open user group multicasting, where group membership may be highly volatile. We propose an extension to an existing heuristic that ensures multicast tree stability where multicast group membership is dynamic. Although this extension decreases the efficiency of the heuristics solutions, its performance is significantly better than that of the worst case, a shortest path tree. Finally, we consider how we might apply the hybrid and the extended heuristic in current and future multicast routing protocols for the Internet and for ATM Networks.

    Pervasive intelligent routing in content centric delay tolerant networks

    Get PDF
    This paper introduces a Swarm-Intelligence based Routing protocol (SIR) that aims to efficiently route information in content centric Delay Tolerant Networks (CCDTN) also dubbed pocket switched networks. First, this paper formalizes the notion of optimal path in CCDTN and introduces an original and efficient algorithm to process these paths in dynamic graphs. The properties and some invariant features of these optimal paths are analyzed and derived from several real traces. Then, this paper shows how optimal path in CCDTN can be found and used from a fully distributed swarm-intelligence based approach of which the global intelligent behavior (i.e. shortest path discovery and use) emerges from simple peer to peer interactions applied during opportunistic contacts. This leads to the definition of the SIR routing protocol of which the consistency, efficiency and performances are demonstrated from intensive representative simulations

    An Approximate Inner Bound to the QoS Aware Throughput Region of a Tree Network under IEEE 802.15.4 CSMA/CA and Application to Wireless Sensor Network Design

    Full text link
    We consider a tree network spanning a set of source nodes that generate measurement packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count. We assume that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive sufficient conditions for the tree network to approximately satisfy certain given QoS targets such as end-to-end delivery probability and delay under a given rate of generation of measurement packets at the sources (arrival rates vector). The structures of our sufficient conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the network. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and BS) that meet the sufficient conditions, a shortest path tree achieves the maximum throughput

    Fuzzy based load and energy aware multipath routing for mobile ad hoc networks

    Get PDF
    Routing is a challenging task in Mobile Ad hoc Networks (MANET) due to their dynamic topology and lack of central administration. As a consequence of un-predictable topology changes of such networks, routing protocols employed need to accurately capture the delay, load, available bandwidth and residual node energy at various locations of the network for effective energy and load balancing. This paper presents a fuzzy logic based scheme that ensures delay, load and energy aware routing to avoid congestion and minimise end-to-end delay in MANETs. In the proposed approach, forwarding delay, average load, available bandwidth and residual battery energy at a mobile node are given as inputs to a fuzzy inference engine to determine the traffic distribution possibility from that node based on the given fuzzy rules. Based on the output from the fuzzy system, traffic is distributed over fail-safe multiple routes to reduce the load at a congested node. Through simulation results, we show that our approach reduces end-to-end delay, packet drop and average energy consumption and increases packet delivery ratio for constant bit rate (CBR) traffic when compared with the popular Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol
    corecore