No description available.

No description available.

No / Visinet is a trans-European 3D collaborative design project that brings together computer scientists, application developers, design specialists, and users in the context of shared environments supported by ATM networks. Experiments and trials have been conducted for the key application domains of architectural and industrial design. Different types of virtual representation and computer-supported collaborative work are applied to real-life projects between partners at different locations in Europe. Measurements of network requirements have enabled cost/benefits to be quantified. Measurements of user satisfaction and speed of completion of the design to product cycle have also been made, resulting in a greater understanding of the ways in which collaborative design environments linked by high-speed networks affect this cycle. Additional experiments are currently being conducted on the way in which an ATM backbone between principal partners in a project can be complemented with ISDN links to partners in a local area.

In our work, we have proposed a new framework for the classification and comparative study of ATM congestion control schemes. The different aspects on which we have classified the algorithms are control theoretic approach, action and congestion notification. These three aspects present of the classification present a coherent framework on which congestion control algorithms are to be classified. Such a classification will also help in developing new algorithms.

This dissertation focuses on the problem of providing mechanisms for routing point to point and multipoint connections in ATM networks. In general the notion of multipoint connection refers to connections that involve a group of users with more than two members. The main objective of this dissertation is to contribute to design efficient routing protocols with alterative routes in fully connected VP-based ATM Networks for call establishment of point to point and multipoint VC connections. An efficient route should be computed during this connection establishment phase.

Most proposed regulation methods do not take advantage of the state information of the underlying scheduler, resulting in a waste of resources. We propose a dynamic regulation approach in which the regulation function is modulated by both the tagged stream's characteristics and the state information fed-back from the scheduler. The transmission speed of a regulator is accelerated when too much traffic has been sent to the scheduler by the other regulators or when the scheduler's queue is empty. As a result, the mean delay of the traffic can be reduced and the scheduler's throughput can be increased. Since no complicated computation is involved, our approach is suitable for the use in high-speed networks.

Data traffic has emerged as a big challenge for the standardization of traffic management mechanisms in ATM networks. In April 1996 the ATM Forum published the first version of the Available Bit Rate Service Category (ABR) to give support to this kind of traffic. ABR was designed with ambitious objectives: high network efficiency, fairness and inter-operability of different ABR switch mechanisms.The major part of this PhD Thesis has been devoted to ABR. Instead of focusing on one aspect of ABR, the main research topics involved in ABR have been covered, namely: (i) switching mechanisms, (ii) conformance definition, (iii) charging, (iv) ABR support to TCP traffic. In the following the main conclusions are summarized. Maybe, switch algorithms have been the most investigated topic of ABR. This has happened because the specification of ABR given by the ATM Forum allows a diversity of switch algorithms to be implemented. These range from the simplest binary switches to the more complex ER switches. In the PhD Thesis three of these switch algorithms are analyzed by means of simulation, showing the different degree of performance and complexity that can be achieved. The behavior of ER switches is also analyzed by means of real traces obtained with a commercial ER switch. The conformance definition is the formalism established to decide whether the source transmits according to the traffic contract. The conformance algorithm standardized for ABR is the Dynamic Generic Cell Rate Algorithm (DGCRA). The PhD Thesis gives a detailed description of the DGCRA. Furthermore, traces obtained by simulation are depicted showing that the algorithm given by the ATM Forum has a decreasing accuracy of the rate conformance with increasing feedback delay. A "UPC based on the CCR" is proposed to solve this drawback. The parameter dimensioning of the DGCRA is addressed in the PhD Thesis by means of two analytical approaches. Numerical results calculated with the analytical models are also obtained by simulation for validation. The analytical approaches are based on a novel queuing model of the DGCRA. The first analytical approach is based on a renewal assumption of the cell inter-arrival process at the UPC. This approach gives a simple but coarse approximation of the cell rejection probability at the UPC. The second analytical method consists of a Markov chain that accurately describes the stochastic variables involved in the queuing model of the DGCRA. The Markov chain is solved applying the matrix geometric technique. The complexity of this mathematical approach only allows investigating a simple network topology. However, the accuracy of the model allows taking into account the influence of the delay bounds that are negotiated with the DGCRA. This study shows that a major degradation of the cell rejection probability may be obtained if these delay bounds are not properly set. Another issue investigated in the PhD Thesis is the charging of ABR. Charging may have a decisive impact on the deployment, success and growth of a network. In fact, the research community has paid a great attention to this topic in recent years. Furthermore, pricing may be an essential condition for the users when submitting traffic. Some authors have used this fact to propose congestion control mechanisms based on a dynamic pricing. In such schemes, prices vary according to the demand of network resources by the sources. New prices are conveyed to the sources by means of a feedback mechanism. This charging scheme seems to fit well with ABR, since the RM-cells can be used to dynamically communicate the prices. In the PhD Thesis a dynamic pricing scheme is proposed and an analytical model is used to find out the evolution of the prices. Additionally, several charging schemes are confronted by simulation. This comparison shows that the dynamic pricing gives the best expected charging. Finally, the support of ABR to the traffic generated with the TCP protocol used in the Internet is investigated by simulation. Currently, the data communications are dominated by the Internet traffic transported by a variety of networks. The deployment of ATM technology has been located in the backbone networks and the end-to-end ATM systems appear remote. In fact, it is not clear whether the universal multi-service network will be built on the Internet rather than the B-ISDN. Simulations performed in the PhD Thesis confront the transport of TCP traffic in different scenarios using ABR and the simpler UBR Service Category. The main conclusion is that ABR can solve the severe fairness problems that can arise using UBR.

Este trabalho apresenta um estudo dos mecanismos de policiamento de tráfego ATM (Asynchronous Transfer Mode) mais conhecidos e uma analise das condições de seu gerenciamento utilizando o protocolo SNMP (Simple Network Management Protocol). Para este fim foram considerados os objetos gerenciados integrantes de MIBs (Management Information Base) propostas por vários grupos de trabalho com o objetivo de averiguar a viabilidade de gerenciar o processo de policiamento de trafego mediante manipulação de tais objetos. Realizando este gerenciamento pode-se acompanhar o estado da rede e utilizar estas informações no planejamento da capacidade da rede, pois muitas vezes, o congestionamento não ocorre apenas por excesso de trafego e sim pelo mau dimensionamento dos componentes da rede de computadores. Foram estudados diversos mecanismos de controle de trafego e congestionamento. Estes mecanismos pertencem basicamente a dois procedimentos sugeridos pelo Fórum ATM: controle dos mecanismos de use/rede e controle de realimentação de fluxo. Os algoritmos estudados no processo de controle dos mecanismos de use/rede foram: balde furado, balde furado virtual, balde furado com memória, janelas saltitantes, janelas deslizantes, contadores de pico, escalonamento virtual, balde furado de estado continuo. No processo de controle de realimentação do fluxo existem dois mecanismos básicos: o credit-based e o rate-based. Como o segundo mecanismo foi melhor aceito internacionalmente, surgiram vários algoritmos que seguiam seus princípios. Entre eles pode-se citar: controle de fluxo baseado na taxa, controle de taxa explicita, VS/VD (Virtual Source Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). Este trabalho estuda os dois mecanismos básicos assim como os algoritmos que seguem a filosofia rate-based. As MIBs inspecionadas para este trabalho foram: MIB da RFC 1695 [AHM 94], MIB dos objetos suplementares [LY 96], MIB da especificação UNI 3.1 do Fórum ATM[CHA 96], MIB da interface M4 do Fórum ATM [ATM 96] MIB da empresa Bay Networks [BAY 96] e MIBs da empresa Cisco [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. Em resultado ao estudo dos mecanismos de controle de trafego e congestionamento e a análise das MIBs selecionadas, foram construídas tabelas que tentam relacionar os parâmetros necessários para controlar os mecanismos de tráfego e congestionamento com os objetos das MIBs selecionadas. A cada parâmetro de controle é verificado se existe um objeto gerenciado ou uma combinação de objetos que podem fornecer o valor do parâmetro. A partir desta análise é verificado se os objetos gerenciados podem monitorar os mecanismos de tráfego e congestionamento. / This work presents a study of the best known ATM traffic policing mechanism and an analysis of management conditions using the SNMP (Simple Network Management Protocol). For this reason the managed objects were considerated pertaining to MIBs (Management Information Base) proposed by many working groups. This work inquires the possibility of managing the traffic policing process using the objects of this selected MIBs. Realizing this management, it can follow the network state and to utilize these informations in the planning of network capacity, because many times, the congestion only not happen for traffic excess but it occurs by worse dimension of the computer networks components. It was studied many traffic and congestion control mechanisms. These mechanisms belong to two procedures proposed by the ATM Forum: usage/network parameter control and feedback control mechanism. The algorithms studied for the usage/network parameter control were: leaky bucket, virtual leaky bucket, buffered leaky bucket, jumping window, moving window, peak counters and generic cell rate algorithm. The feedback control has two variations: credit-based and rate-based. The second mechanism was better accepted internationally, and many algorithms followed its principles. The algorithms were: rate based flow control, explicit rate control, VS/VD (Virtual Source / Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). This work studies the two basic mechanism and the rate-based algorithms. The inspected MIBs for this work were: RFC I695's MIB [AHM 94], definitions of supplemental managed objects for ATM management [LY 96], ATM Forum ATM UNI 3.1 Specification's MIB [CHA 96], ATM Forum M4 interface's MIB [ATM 96] , Bay Networks enterprise's MIB [BAY 96] and Cisco enterprise's MIB [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. As a result of the study of the traffic and congestion control mechanisms and the analysis of selected MIBs, table were built that try to relate the necessary parameters to control traffic and congestion mechanisms with the managed objects. Each control parameter is examined if it has a managed object or a object arrangement that can supply the parameter value. This analysis will verify if managed objects can control traffic and congestion control.

Este trabalho apresenta um estudo dos mecanismos de policiamento de tráfego ATM (Asynchronous Transfer Mode) mais conhecidos e uma analise das condições de seu gerenciamento utilizando o protocolo SNMP (Simple Network Management Protocol). Para este fim foram considerados os objetos gerenciados integrantes de MIBs (Management Information Base) propostas por vários grupos de trabalho com o objetivo de averiguar a viabilidade de gerenciar o processo de policiamento de trafego mediante manipulação de tais objetos. Realizando este gerenciamento pode-se acompanhar o estado da rede e utilizar estas informações no planejamento da capacidade da rede, pois muitas vezes, o congestionamento não ocorre apenas por excesso de trafego e sim pelo mau dimensionamento dos componentes da rede de computadores. Foram estudados diversos mecanismos de controle de trafego e congestionamento. Estes mecanismos pertencem basicamente a dois procedimentos sugeridos pelo Fórum ATM: controle dos mecanismos de use/rede e controle de realimentação de fluxo. Os algoritmos estudados no processo de controle dos mecanismos de use/rede foram: balde furado, balde furado virtual, balde furado com memória, janelas saltitantes, janelas deslizantes, contadores de pico, escalonamento virtual, balde furado de estado continuo. No processo de controle de realimentação do fluxo existem dois mecanismos básicos: o credit-based e o rate-based. Como o segundo mecanismo foi melhor aceito internacionalmente, surgiram vários algoritmos que seguiam seus princípios. Entre eles pode-se citar: controle de fluxo baseado na taxa, controle de taxa explicita, VS/VD (Virtual Source Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). Este trabalho estuda os dois mecanismos básicos assim como os algoritmos que seguem a filosofia rate-based. As MIBs inspecionadas para este trabalho foram: MIB da RFC 1695 [AHM 94], MIB dos objetos suplementares [LY 96], MIB da especificação UNI 3.1 do Fórum ATM[CHA 96], MIB da interface M4 do Fórum ATM [ATM 96] MIB da empresa Bay Networks [BAY 96] e MIBs da empresa Cisco [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. Em resultado ao estudo dos mecanismos de controle de trafego e congestionamento e a análise das MIBs selecionadas, foram construídas tabelas que tentam relacionar os parâmetros necessários para controlar os mecanismos de tráfego e congestionamento com os objetos das MIBs selecionadas. A cada parâmetro de controle é verificado se existe um objeto gerenciado ou uma combinação de objetos que podem fornecer o valor do parâmetro. A partir desta análise é verificado se os objetos gerenciados podem monitorar os mecanismos de tráfego e congestionamento. / This work presents a study of the best known ATM traffic policing mechanism and an analysis of management conditions using the SNMP (Simple Network Management Protocol). For this reason the managed objects were considerated pertaining to MIBs (Management Information Base) proposed by many working groups. This work inquires the possibility of managing the traffic policing process using the objects of this selected MIBs. Realizing this management, it can follow the network state and to utilize these informations in the planning of network capacity, because many times, the congestion only not happen for traffic excess but it occurs by worse dimension of the computer networks components. It was studied many traffic and congestion control mechanisms. These mechanisms belong to two procedures proposed by the ATM Forum: usage/network parameter control and feedback control mechanism. The algorithms studied for the usage/network parameter control were: leaky bucket, virtual leaky bucket, buffered leaky bucket, jumping window, moving window, peak counters and generic cell rate algorithm. The feedback control has two variations: credit-based and rate-based. The second mechanism was better accepted internationally, and many algorithms followed its principles. The algorithms were: rate based flow control, explicit rate control, VS/VD (Virtual Source / Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). This work studies the two basic mechanism and the rate-based algorithms. The inspected MIBs for this work were: RFC I695's MIB [AHM 94], definitions of supplemental managed objects for ATM management [LY 96], ATM Forum ATM UNI 3.1 Specification's MIB [CHA 96], ATM Forum M4 interface's MIB [ATM 96] , Bay Networks enterprise's MIB [BAY 96] and Cisco enterprise's MIB [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. As a result of the study of the traffic and congestion control mechanisms and the analysis of selected MIBs, table were built that try to relate the necessary parameters to control traffic and congestion mechanisms with the managed objects. Each control parameter is examined if it has a managed object or a object arrangement that can supply the parameter value. This analysis will verify if managed objects can control traffic and congestion control.

Este trabalho apresenta um estudo dos mecanismos de policiamento de tráfego ATM (Asynchronous Transfer Mode) mais conhecidos e uma analise das condições de seu gerenciamento utilizando o protocolo SNMP (Simple Network Management Protocol). Para este fim foram considerados os objetos gerenciados integrantes de MIBs (Management Information Base) propostas por vários grupos de trabalho com o objetivo de averiguar a viabilidade de gerenciar o processo de policiamento de trafego mediante manipulação de tais objetos. Realizando este gerenciamento pode-se acompanhar o estado da rede e utilizar estas informações no planejamento da capacidade da rede, pois muitas vezes, o congestionamento não ocorre apenas por excesso de trafego e sim pelo mau dimensionamento dos componentes da rede de computadores. Foram estudados diversos mecanismos de controle de trafego e congestionamento. Estes mecanismos pertencem basicamente a dois procedimentos sugeridos pelo Fórum ATM: controle dos mecanismos de use/rede e controle de realimentação de fluxo. Os algoritmos estudados no processo de controle dos mecanismos de use/rede foram: balde furado, balde furado virtual, balde furado com memória, janelas saltitantes, janelas deslizantes, contadores de pico, escalonamento virtual, balde furado de estado continuo. No processo de controle de realimentação do fluxo existem dois mecanismos básicos: o credit-based e o rate-based. Como o segundo mecanismo foi melhor aceito internacionalmente, surgiram vários algoritmos que seguiam seus princípios. Entre eles pode-se citar: controle de fluxo baseado na taxa, controle de taxa explicita, VS/VD (Virtual Source Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). Este trabalho estuda os dois mecanismos básicos assim como os algoritmos que seguem a filosofia rate-based. As MIBs inspecionadas para este trabalho foram: MIB da RFC 1695 [AHM 94], MIB dos objetos suplementares [LY 96], MIB da especificação UNI 3.1 do Fórum ATM[CHA 96], MIB da interface M4 do Fórum ATM [ATM 96] MIB da empresa Bay Networks [BAY 96] e MIBs da empresa Cisco [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. Em resultado ao estudo dos mecanismos de controle de trafego e congestionamento e a análise das MIBs selecionadas, foram construídas tabelas que tentam relacionar os parâmetros necessários para controlar os mecanismos de tráfego e congestionamento com os objetos das MIBs selecionadas. A cada parâmetro de controle é verificado se existe um objeto gerenciado ou uma combinação de objetos que podem fornecer o valor do parâmetro. A partir desta análise é verificado se os objetos gerenciados podem monitorar os mecanismos de tráfego e congestionamento. / This work presents a study of the best known ATM traffic policing mechanism and an analysis of management conditions using the SNMP (Simple Network Management Protocol). For this reason the managed objects were considerated pertaining to MIBs (Management Information Base) proposed by many working groups. This work inquires the possibility of managing the traffic policing process using the objects of this selected MIBs. Realizing this management, it can follow the network state and to utilize these informations in the planning of network capacity, because many times, the congestion only not happen for traffic excess but it occurs by worse dimension of the computer networks components. It was studied many traffic and congestion control mechanisms. These mechanisms belong to two procedures proposed by the ATM Forum: usage/network parameter control and feedback control mechanism. The algorithms studied for the usage/network parameter control were: leaky bucket, virtual leaky bucket, buffered leaky bucket, jumping window, moving window, peak counters and generic cell rate algorithm. The feedback control has two variations: credit-based and rate-based. The second mechanism was better accepted internationally, and many algorithms followed its principles. The algorithms were: rate based flow control, explicit rate control, VS/VD (Virtual Source / Virtual Destination), PRCA (Proportional Rate Control Algorithm), EPRCA (Enhanced Proporcional Rate Control Algorithm), ERICA (Explicit Rate Indication for Congestion Avoidance) e CAPC (Congestion Avoidance using Proportional Control). This work studies the two basic mechanism and the rate-based algorithms. The inspected MIBs for this work were: RFC I695's MIB [AHM 94], definitions of supplemental managed objects for ATM management [LY 96], ATM Forum ATM UNI 3.1 Specification's MIB [CHA 96], ATM Forum M4 interface's MIB [ATM 96] , Bay Networks enterprise's MIB [BAY 96] and Cisco enterprise's MIB [WAN 96] [CHA 96a], [GRO 96], [GRO 96a], [RBH 96] e [BAK 96]. As a result of the study of the traffic and congestion control mechanisms and the analysis of selected MIBs, table were built that try to relate the necessary parameters to control traffic and congestion mechanisms with the managed objects. Each control parameter is examined if it has a managed object or a object arrangement that can supply the parameter value. This analysis will verify if managed objects can control traffic and congestion control.