16 research outputs found

    Performance modeling and analysis of IP switching

    Get PDF
    IP switching is a new routing technology proposed to improve the performance of IP routers. In this paper, we study the performance modeling and analysis of IP switching. Our proposed performance models can be used to evaluate the percentage of flows switched and the ratio of the switched path delay to the forwarded path delay in an IP switch. Based on these models, the impacts of different system parameters on the performance are also investigated. Our objective is to develop a design tool for IP switches.published_or_final_versio

    Performance Issues in VC-Merge Capable ATM LSRs

    Full text link

    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.

    IP and ATM - a position paper

    Get PDF
    This paper gives a technical overview of different networking technologies, such as the Internet, ATM. It describes different approaches of how to run IP on top of an ATM network, and assesses their potential to be used as an integrated services network

    IP and ATM - current evolution for integrated services

    Get PDF
    Current and future applications make use of different technologies as voice, data, and video. Consequently network technologies need to support them. For many years, the ATM based Broadband-ISDN has generally been regarded as the ultimate networking technology, which can integrate voice, data, and video services. With the recent tremendous growth of the Internet and the reluctant deployment of public ATM networks, the future development of ATM seems to be less clear than it used to be. In the past IP provided (and was though to provide) only best effort services, thus, despite its world wide diffution, was not considered as a network solution for multimedia application. Currently many of the IETF working groups work on areas related to integrated services, and IP is also proposing itself as networking technology for supporting voice, data, and video services. This paper give a technical overview on the competing integrated services network solutions, such as IP, ATM and the different available and emerging technologies on how to run IP over ATM, and tries to identify their potential and shortcomings

    Multimedia Transmission in MPLS Network

    Get PDF
    Práca uvádza prednostné črty MPLS technológie voči ostatným prenosovým WAN mechanizmom, poukazuje na jej výhody. V ďalšej časti práce je opísaný princíp smerovania a prepínania v MPLS s dôrazom na porovnávanie s IP sieťou. Nasledujúca sekcia práce sa zameriava na problematiku riadenie a smerovania premávky, jej metódy a praktiky. Naväzujúca časť opisuje možnosti riadenia premávky v MPLS. Posledná časť práce opisuje návrh, impementáciu a riadenie experimentálnej MPLS siete. Záver zhŕňa dosiahnuté výsledky a vytyčuje finálne ciele k úplnému naplneniu zadania práce.Thesis introduces positive traits of MPLS technology comparing to other transportation mechanisms in WAN environment, refers to its cons. The next section of thesis describes fundamentals of routing and switching in MPLS trying to make accent of different methods between routing in IP network and MPLS network. Following part focuses on topic about Traffic Engineering, its methods and practices. Another part of thesis is about Traffic Engineering in MPLS and its posibilities of controling data flow. Last section describes planning, implementation and operation of experimental MPLS network. Conclusion summarizes achieved results and sets further goals to complete whole fulfillment of thesis assignment.

    A Hybrid Approach to Quality of Service Multicast Routing in High Speed Networks

    Get PDF
    Multimedia services envisaged for high speed networks may have large numbers of users, require high volumes of network resources and have real-time delay constraints. For these reasons, several multicast routing heuristics that use two link metrics have been proposed with the objective of minimising multicast tree cost while maintaining a bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient. This thesis presents a detailed analysis and evaluation of these heuristics which illustrate that in some situations their average performance is prone to wide variance for a particular multicast in a specific network. It concludes that the efficiency of an heuristic solution depends on the topology of both the network and the multicast, which is difficult to predict. The integration of two heuristics with Dijkstras shortest path tree algorithm is proposed, to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. The evaluation results show good performance over a wide range of networks (flat and hierarchical) and multicast groups, within differing delay bounds. The more efficient the multicast tree is, the less stable it will be as multicast group membership changes. An efficient heuristic is extended to ensure multicast tree stability where multicast group membership is dynamic. This extension decreases the efficiency of the heuristics solutions, although they remain significantly cheaper than the worst case, a shortest delay path tree. This thesis also discusses how the hybrid and the extended heuristic might be applied to multicast routing protocols for the Internet and ATM Networks. Additionally, the behaviour of the heuristics is examined in networks that use a single link metric to calculate multicast trees and concludes one of the heuristics may be of benefit in such networks

    Avaliação das propostas de integração IP sobre ATM

    Get PDF
    Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.ATM (Asynchronous Transfer Mode) é uma das tecnologias de rede de alta velocidade mais adotada nos dias atuais, sendo que um dos principais diferenciais desta tecnologia é o provimento de Qualidade de Serviço. Atualmente, a tecnologia ATM deve conviver com o protocolo IP, devido principalmente ao grande volume de aplicações. Existem algumas alternativas em termos de integração do IP com ATM, por exemplo IPOA (Internet Protocol Over ATM), LANE (Lan Emulation), MPOA (MultProtocol Over ATM) e MPLS (MultProtocol Label Switch). Este trabalho apresenta estas propostas de integração IP sobre ATM, fazendo também uma análise comparativa. Outra contribuição deste trabalho é a definição de linhas guias para a seleção de uma destas opções de integração de IP sobre ATM durante o projeto de uma rede

    Análise de tráfego na integração de redes IP e ATM usando simulação

    Get PDF
    Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Computação
    corecore