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

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

  • Distributed route computation and provisioning in shared mesh optical networks
    IEEE Journal on Selected Areas in Communications, 2004
    Co-Authors: Hang Liu, Jean‐françois Labourdette, Eric Bouillet, D. Pendarakis, N. Komaee, S. Chaudhuri
    Abstract:

    Optical mesh network infrastructure has emerged as the technology of choice for next-generation transport networks. At the same time, distributed, IP-based, control architecture has been proposed for intelligent optical networks, as a means to automate operations, enhance interoperability, and facilitate the deployment of new applications. While distributed control in general enhances scalability and flexibility, it has also been observed that the requisite network topology and Link-State information summarization may result in suboptimal path computation, especially for shared mesh restored paths. This paper presents a distributed control plane for optical mesh networks, focusing on distributed path computation and provisioning mechanisms. It discusses the tradeoffs between the path computation efficiency for shared mesh restored paths and the amount of network topology and Link-State information that is disseminated via routing protocols. We show that with appropriately aggregated Link resource availability and sharing information, the proposed distributed path computation algorithms are able to determine the shareability of restoration Links with remarkable accuracy. A local channel assignment scheme, which is used in conjunction with the distributed path computation algorithms to assign shared channels when provisioning restoration paths, is also proposed. The additional information that signaling messages are required to carry in order to perform the local channel assignment at each node along the restoration path is discussed. Furthermore, we specify the extensions to the open shortest-path first (OSPF) routing protocol in support of shared mesh restoration. We analyze the performance of the proposed distributed path computation algorithms and the local channel assignment scheme, as well as the overhead of OSPF extensions. In particular, we study the tradeoffs between network capacity utilization, restoration path computation complexity, OSPF extension overhead, and memory requirements for storing the modified Link-State Database.

Min Young Chung - One of the best experts on this subject based on the ideXlab platform.

  • a Link State update algorithm based on a statistical threshold for guarantee of bandwidth
    Journal of KIISE:Information Networking, 2008
    Co-Authors: Min Young Chung, Hyunseung Choo
    Abstract:

    In order to determine path(s) satisfied with bandwidth-guaranteed in the Internet, routers should have information on network topology and Link State. The information is stored in Link State Database (LSDB) located in each router and managed. If Link States information is changed, routers inform their neighbor of Link State information changed by sending Link State Update (LSU) messages. However, there is trade-off between reflection of actual Link State information on LSDB and cost of sending LSU messages. To find a bandwidth-guaranteed path effectively, it is important to decide whether LSU messages are sent or not for the change of Link sate. In this paper, we propose a threshold-based LSU algorithm using statistic to effectively decide for sending LSU messages and evaluates its performance by intensive simulations. Simulation results show that the performance of proposed scheme is superior to the existing LSU schemes.

  • simple adaptive Link State update algorithm for qos routing
    International Conference on Computational Science, 2006
    Co-Authors: Seunghyuk Choi, Myounghee Jung, Mijeong Yang, Min Young Chung, Jaehyung Park
    Abstract:

    To guarantee Quality of Service, routers should automatically determine routing paths in order to satisfy service requirements efficiently, based on Link State information as well as network topology. Link State Database (LSDB) in routers should be well managed in order to reflect the current State of all Links effectively. However, there is a trade-off between the exact reflection of the current Link status and its update cost. In this paper, a simple-adaptive LSU algorithm to adaptively control the generation of Link State update messages is proposed and its performance is compared with those of four existing algorithms by intensive simulations.

Jaehyung Park - One of the best experts on this subject based on the ideXlab platform.

  • simple adaptive Link State update algorithm for qos routing
    International Conference on Computational Science, 2006
    Co-Authors: Seunghyuk Choi, Myounghee Jung, Mijeong Yang, Min Young Chung, Jaehyung Park
    Abstract:

    To guarantee Quality of Service, routers should automatically determine routing paths in order to satisfy service requirements efficiently, based on Link State information as well as network topology. Link State Database (LSDB) in routers should be well managed in order to reflect the current State of all Links effectively. However, there is a trade-off between the exact reflection of the current Link status and its update cost. In this paper, a simple-adaptive LSU algorithm to adaptively control the generation of Link State update messages is proposed and its performance is compared with those of four existing algorithms by intensive simulations.

Hang Liu - One of the best experts on this subject based on the ideXlab platform.

  • Distributed route computation and provisioning in shared mesh optical networks
    IEEE Journal on Selected Areas in Communications, 2004
    Co-Authors: Hang Liu, Jean‐françois Labourdette, Eric Bouillet, D. Pendarakis, N. Komaee, S. Chaudhuri
    Abstract:

    Optical mesh network infrastructure has emerged as the technology of choice for next-generation transport networks. At the same time, distributed, IP-based, control architecture has been proposed for intelligent optical networks, as a means to automate operations, enhance interoperability, and facilitate the deployment of new applications. While distributed control in general enhances scalability and flexibility, it has also been observed that the requisite network topology and Link-State information summarization may result in suboptimal path computation, especially for shared mesh restored paths. This paper presents a distributed control plane for optical mesh networks, focusing on distributed path computation and provisioning mechanisms. It discusses the tradeoffs between the path computation efficiency for shared mesh restored paths and the amount of network topology and Link-State information that is disseminated via routing protocols. We show that with appropriately aggregated Link resource availability and sharing information, the proposed distributed path computation algorithms are able to determine the shareability of restoration Links with remarkable accuracy. A local channel assignment scheme, which is used in conjunction with the distributed path computation algorithms to assign shared channels when provisioning restoration paths, is also proposed. The additional information that signaling messages are required to carry in order to perform the local channel assignment at each node along the restoration path is discussed. Furthermore, we specify the extensions to the open shortest-path first (OSPF) routing protocol in support of shared mesh restoration. We analyze the performance of the proposed distributed path computation algorithms and the local channel assignment scheme, as well as the overhead of OSPF extensions. In particular, we study the tradeoffs between network capacity utilization, restoration path computation complexity, OSPF extension overhead, and memory requirements for storing the modified Link-State Database.

Huaimo Chen - One of the best experts on this subject based on the ideXlab platform.

  • intelligent ospf Link State Database exchange
    2019
    Co-Authors: Huaimo Chen
    Abstract:

    This document presents an intelligent Database exchange mechanism for the Database exchange procedure in OSPFv2 and OSPFv3. This mechanism is backward compatible. It eliminates the unnecessary Database exchanges through using the existing reachability information calculated from the Link State Database and the un-reachability information about routers recorded. It significantly speeds up the establishment of the full adjacency between two routers in some situations.