The Experts below are selected from a list of 102 Experts worldwide ranked by ideXlab platform

K. G. Ramakrishnan - One of the best experts on this subject based on the ideXlab platform.

  • On-line routing for permanent virtual circuits
    Computer Communications, 1996
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    This paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions is not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, this paper evaluates several different strategies for on-line permanent virtual circuit routing. We find that a strategy based on recent results in competitive analysis and ideas from combinatorial optimization consistently provides the best performance.

  • On-line Routing for virtual Private Networks
    1994
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    Today, large telecommunications customers are increasingly using virtual private networks to link geographically dispersed sites. A virtual private network is provided by provisioning a set of permanent (long term) virtual circuits between customer endpoints on a large backbone network. This paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions are not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, this paper evaluates several different strategies for on-line permanent virtual circuit routing. We find that a strategy base..

  • INFOCOM - On-line routing for permanent virtual circuits
    Proceedings of INFOCOM'95, 1
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    The paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions is not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, the paper evaluates several different strategies for on-line permanent virtual circuit routing. The authors find that a strategy based on results in competitive analysis and ideas from combinatorial optimization consistently provides the best performance. The problem of admission control is closely related to the problem of routing. The paper also provides a theoretical lower bound that suggests that non-greedy admission control is a fundamental component of an efficient on-line permanent virtual circuit routing algorithm.

Rainer Gawlick - One of the best experts on this subject based on the ideXlab platform.

  • On-line routing for permanent virtual circuits
    Computer Communications, 1996
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    This paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions is not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, this paper evaluates several different strategies for on-line permanent virtual circuit routing. We find that a strategy based on recent results in competitive analysis and ideas from combinatorial optimization consistently provides the best performance.

  • On-line Routing for virtual Private Networks
    1994
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    Today, large telecommunications customers are increasingly using virtual private networks to link geographically dispersed sites. A virtual private network is provided by provisioning a set of permanent (long term) virtual circuits between customer endpoints on a large backbone network. This paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions are not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, this paper evaluates several different strategies for on-line permanent virtual circuit routing. We find that a strategy base..

  • INFOCOM - On-line routing for permanent virtual circuits
    Proceedings of INFOCOM'95, 1
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    The paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions is not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, the paper evaluates several different strategies for on-line permanent virtual circuit routing. The authors find that a strategy based on results in competitive analysis and ideas from combinatorial optimization consistently provides the best performance. The problem of admission control is closely related to the problem of routing. The paper also provides a theoretical lower bound that suggests that non-greedy admission control is a fundamental component of an efficient on-line permanent virtual circuit routing algorithm.

Tibor Gyires - One of the best experts on this subject based on the ideXlab platform.

  • SMC - Performance prediction of smart permanent virtual circuits in ATM networks with CACI Comnet
    SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems Man and Cybernetics (Cat. No.98CH36218), 1998
    Co-Authors: Tibor Gyires
    Abstract:

    As networks become larger and more complex the design and management of systems become more and more difficult. New technologies, such as asynchronous transfer mode, new algorithms, and bandwidth demanding applications are implemented every day. How can network designers decide which combinations of connections, communication speeds, algorithms, and applications are the most appropriate for their business? A widely accepted answer is performance prediction through simulation. A model can be used to: evaluate various design alternatives or various operational policies; explore the behavior of proposed systems and connections before actually building them; and pre-test modifications. We apply simulation techniques to ATM networks. In an ATM network the basic data units, called cells, are routed through switched or permanent virtual circuits. A smart permanent virtual circuit is a connection that looks like a permanent virtual circuit at the local and remote endpoints with a switched virtual circuit in the middle. In an earlier paper the author (1997) presented a search algorithm for managing smart permanent virtual circuits. Our goal is to predict the performance of this search algorithm with the distributed software module of the simulation modeling system CACI Comnet.

  • Smart permanent virtual circuits in asynchronous transfer mode networks
    1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, 1997
    Co-Authors: Tibor Gyires
    Abstract:

    Asynchronous Transfer Mode (ATM) is a highspeed network technology that transmits various types of information across networks such as voice, video, image, data, etc. In an ATM network the basic data units, called cells, are routed through switched or permanent virtual circuits (virtual channels). A Smart permanent virtual circuit is a connection that looks like a permanent virtual circuit at the local and remote endpoints with a Switched virtual circuit in the middle. If a link carrying a Smart permanent virtual circuit goes down and there is an alternate route, then the network automatically reroutes the Smart permanent virtual circuit around the link. As a result of the rerouting, the network may not be able to deliver the guaranteed quality of services as it was negotiated. It may have to change the quality of service parameters negotiated for other connections. The objective of this paper is to apply Distributed Artificial Intelligence (DAI) methodologies, “intelligent agents”, in ATM network management. The paper presents a search algorithm that helps the agents learn from previous interactions and experience. Agents can evaluate alternate paths in order to maintain as many connections as possible with the quality of service guaranteed originally

Charles Robert Kalmanek - One of the best experts on this subject based on the ideXlab platform.

  • On-line routing for permanent virtual circuits
    Computer Communications, 1996
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    This paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions is not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, this paper evaluates several different strategies for on-line permanent virtual circuit routing. We find that a strategy based on recent results in competitive analysis and ideas from combinatorial optimization consistently provides the best performance.

  • On-line Routing for virtual Private Networks
    1994
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    Today, large telecommunications customers are increasingly using virtual private networks to link geographically dispersed sites. A virtual private network is provided by provisioning a set of permanent (long term) virtual circuits between customer endpoints on a large backbone network. This paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions are not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, this paper evaluates several different strategies for on-line permanent virtual circuit routing. We find that a strategy base..

  • INFOCOM - On-line routing for permanent virtual circuits
    Proceedings of INFOCOM'95, 1
    Co-Authors: Rainer Gawlick, Charles Robert Kalmanek, K. G. Ramakrishnan
    Abstract:

    The paper considers the problem of routing a set of permanent virtual circuit requests over a backbone network. Several factors make this routing problem complicated. Routing decisions must be made on-line without any knowledge of future request sets. Furthermore, frequent rerouting to correct inefficiencies that can result from the on-line routing decisions is not possible since rerouting creates a service disruption for the customer. Finally, the forward and reverse bandwidth of a virtual circuit must be routed over the same single path. Using an extensive set of simulations, the paper evaluates several different strategies for on-line permanent virtual circuit routing. The authors find that a strategy based on results in competitive analysis and ideas from combinatorial optimization consistently provides the best performance. The problem of admission control is closely related to the problem of routing. The paper also provides a theoretical lower bound that suggests that non-greedy admission control is a fundamental component of an efficient on-line permanent virtual circuit routing algorithm.

S. Phan - One of the best experts on this subject based on the ideXlab platform.

  • PMS: a PVC Management System for ATM Networks
    2001
    Co-Authors: Council Canada, C. Yang, S. Phan
    Abstract:

    . Reported in this paper is the developed PMS, a PVC management system for ATM networks. PMS provides a scalable, end-to-end path management solution required for managing todays complex ATM networks. It aims to assist the network operators to perform PVC operations with simplified procedures and automatic optimum route selection. It also aims to provide effective decision-making support for PVC fault identification and prevention to the network operators. 1 Introduction ATM communication network is playing more and more important role in todays telecommunication networks. It has been widely used in backbone networks, transmission networks, access networks, and even enterprise networks. Such emerging large heterogeneous ATM networks have raised many new challenges for researchers and developers in the area of network management. In the management of ATM communication networks that have increased dramatically in size and complexity, the PVC (permanent virtual circuit) managemen..

  • Fault identification and prevention for PVC management in ATM networks
    ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485), 1
    Co-Authors: C. Yang, S. Phan
    Abstract:

    In order to meet the need of network management for emerging large complex heterogeneous communication networks, a distributed proactive self-adjusting management (DPSAM) framework was developed. The framework facilitates the incorporation of artificial intelligence and distributed computing technologies in building advanced network management systems. PMS, a PVC (permanent virtual circuit) management system for ATM networks, is developed based on DPSAM framework. PMS provides a scalable, end-to-end path management solution required for today's ATM network and service management. It aims to assist network operators to perform PVC operations with simplified procedures and automatic optimum route selection. It also provides effective decision-making support for PVC fault identification and prevention. In this paper, PVC fault identification and prevention along with an overview of the DPSAM framework and PMS are presented.