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

Federico Silla - One of the best experts on this subject based on the ideXlab platform.

  • lsom a Link State Protocol over mac addresses for metropolitan backbones using optical ethernet switches
    Network Computing and Applications, 2003
    Co-Authors: R. Garcia, José Duato, Federico Silla
    Abstract:

    This paper presents a new Protocol named "Link State Over MAC" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.

  • NCA - LSOM: A Link State Protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches
    Second IEEE International Symposium on Network Computing and Applications 2003. NCA 2003., 1
    Co-Authors: R. Garcia, José Duato, Federico Silla
    Abstract:

    This paper presents a new Protocol named "Link State Over MAC" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.

R. Garcia - One of the best experts on this subject based on the ideXlab platform.

  • lsom a Link State Protocol over mac addresses for metropolitan backbones using optical ethernet switches
    Network Computing and Applications, 2003
    Co-Authors: R. Garcia, José Duato, Federico Silla
    Abstract:

    This paper presents a new Protocol named "Link State Over MAC" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.

  • NCA - LSOM: A Link State Protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches
    Second IEEE International Symposium on Network Computing and Applications 2003. NCA 2003., 1
    Co-Authors: R. Garcia, José Duato, Federico Silla
    Abstract:

    This paper presents a new Protocol named "Link State Over MAC" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.

Marcelo Spohn - One of the best experts on this subject based on the ideXlab platform.

  • Routing in the internet using partial Link State information
    2001
    Co-Authors: Marcelo Spohn, J. Jose San Mateo Garcia-luna-aceves
    Abstract:

    This thesis focuses on routing in wired and wireless segments of the Internet using partial Link-State information. Although efficient algorithms have been proposed based on both Link-State and distance-vector information, Link-State routing is more efficient than distance-vector routing when constraints are placed on the paths offered to destinations, which is the case for QoS routing offering paths with required delay, bandwidth, reliability, cost, or other parameters. We present a new Link-State routing Protocol for wired internetworks called ALP (adaptive Link-State Protocol). In ALP, a router sends updates to its neighbors regarding the Links in its preferred paths to destinations. Each router decides which Links to report to its neighbors based on its local computation of preferred paths. A router running ALP does not ask its neighbors to delete Links; instead, a router simply updates its neighbors with the most recent information about those Links it decides to take out of its preferred paths. We introduce and analyze two routing algorithms for wireless networks: the source-tree adaptive routing (STAR) Protocol, and the neighborhood-aware source routing (NSR) Protocol. STAR is the first example of a table-driven routing Protocol that is more efficient than prior table-driven and on-demand routing Protocols by exploiting Link-State information to allow paths taken to destinations to deviate from the optimum in order to save bandwidth without creating loops. NSR is an on-demand routing Protocol based on partial topology information and source routing. STAR is shown to be more efficient than the dynamic source routing (DSR) Protocol in small ad hoc networks, and NSR is shown to outperform STAR and DSR in large wireless networks with mobile nodes.

  • ICNP - Scalable Link-State Internet routing
    Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256), 1998
    Co-Authors: J.j. Garcia-luna-aceves, Marcelo Spohn
    Abstract:

    We present and verify the adaptive Link-State Protocol (ALP), a new Link-State routing Protocol that does not require the State of each Link to be flooded to the entire internetwork, or to entire areas if hierarchical routing is used. A router in ALP disseminates Link-State updates incrementally to its neighbors for only those Links along paths used to reach destinations. Link-State updates are validated using time stamps and contain the same information used in other Link-State Protocols. For the case of neighbor routers connected through a broadcast medium, a designated router is distributedly elected for each Link State reported over the medium, rather than requiring a designated router to report every topology change over the broadcast medium, like OSPF does. Simulation experiments illustrate that ALP is as efficient as the distributed-Bellman Ford algorithm when distances to destinations do not increase and resources do not fail, and more efficient than traditional Link-State Protocols based on flooding after distances increase or resources fail. ALP also outperforms the Link-vector algorithm (LVA), which is the only prior routing algorithm based on selective dissemination of Link States.

José Duato - One of the best experts on this subject based on the ideXlab platform.

  • lsom a Link State Protocol over mac addresses for metropolitan backbones using optical ethernet switches
    Network Computing and Applications, 2003
    Co-Authors: R. Garcia, José Duato, Federico Silla
    Abstract:

    This paper presents a new Protocol named "Link State Over MAC" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.

  • NCA - LSOM: A Link State Protocol Over MAC addresses for metropolitan backbones using Optical Ethernet switches
    Second IEEE International Symposium on Network Computing and Applications 2003. NCA 2003., 1
    Co-Authors: R. Garcia, José Duato, Federico Silla
    Abstract:

    This paper presents a new Protocol named "Link State Over MAC" (LSOM) for Optical Ethernet switches to allow the use of active loop topologies, like meshes, in Metropolitan Area Networks (MAN) or even Wide Area Networks (WAN) backbone. In this respect, LSOM is an alternative to a ring topology as proposed in draft IEEE 802.17 Resilient Packet Ring (RPR) or a tree topology using IEEE802. 1D Rapid Spanning Tree Protocol (RSTP). LSOM provides higher scalability and is able to achieve better bandwidth utilization and lower latency than RSTP and RPR. Simulation results for 4-node and 9-node topologies show that LSOM can improve throughput over RPR by a factor of up to 1.7. Furthermore, full freedom to choose any MAN active topology allows an effective use of the available dark fiber resources.

J.j. Garcia-luna-aceves - One of the best experts on this subject based on the ideXlab platform.

  • ICNP - Scalable Link-State Internet routing
    Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256), 1998
    Co-Authors: J.j. Garcia-luna-aceves, Marcelo Spohn
    Abstract:

    We present and verify the adaptive Link-State Protocol (ALP), a new Link-State routing Protocol that does not require the State of each Link to be flooded to the entire internetwork, or to entire areas if hierarchical routing is used. A router in ALP disseminates Link-State updates incrementally to its neighbors for only those Links along paths used to reach destinations. Link-State updates are validated using time stamps and contain the same information used in other Link-State Protocols. For the case of neighbor routers connected through a broadcast medium, a designated router is distributedly elected for each Link State reported over the medium, rather than requiring a designated router to report every topology change over the broadcast medium, like OSPF does. Simulation experiments illustrate that ALP is as efficient as the distributed-Bellman Ford algorithm when distances to destinations do not increase and resources do not fail, and more efficient than traditional Link-State Protocols based on flooding after distances increase or resources fail. ALP also outperforms the Link-vector algorithm (LVA), which is the only prior routing algorithm based on selective dissemination of Link States.

  • EIGRP--A Fast Routing Protocol based on Distance Vectors - eScholarship
    1994
    Co-Authors: R. Albrightson, J.j. Garcia-luna-aceves, J. Boyle
    Abstract:

    EIGRP{A FAST ROUTING Protocol BASED ON DISTANCE VECTORS Bob Albrightson Cisco Systems Menlo Park, CA 94025 albright@cisco.com J.J. Garcia-Luna-Aceves University of California Santa Cruz, CA 95064 jj@cse.ucsc.edu Joanne Boyle Cisco Systems Menlo Park, CA 94025 boyle@cisco.com Abstract Early routing Protocols were based on distance vectors; they were very simple and easy to implement but had the severe drawbacks of counting to innity and routing loops. These problems were reduced using such techniques as split horizon and hold-downs; however, for these techniques to work in practice, long convergence times are introduced. Routing Protocols based on Link States have been implemented to address the problem of slow convergence in distance-vector Protocols, but they add complexity in conguration and troubleshooting. We present a new distance-vector Protocol that converges as quickly as current Link-State Protocols, while maintaining loop freedom at every instant. The Protocol is based on three main elements: a transport algorithm that supports the reliable exchange of messages among routers, the diusing update algorithm, which computes shortest paths distributedly, and modules that permit the operation of the new routing Protocol in a multiProtocol environment. 1 INTRODUCTION Today's intradomain routing Protocols can be classied as distance-vector or Link-State Protocols. In a distance-vector Protocol, a router knows the length of the shortest path from each neighbor node to every network destination, and uses this information to compute the shortest path and next router in the path to each destination. A router sends update messages to its neighbors, who in turn process the messages and send messages of their own, if needed. Each update message contains a vector of one or more entries, each of which species, as a minimum, the distance to a given destination. In contrast, in a Link-State Protocol a router must receive information about the entire topology to compute the shortest path to each destination using a local shortest-path algorithm such as Dijkstra's algorithm [1]. Each router broadcasts update messages, containing the State of each of the router's adjacent Links, to every other router in the network. The distance vector Protocols used in the Internet thus far are based on variants of the distributed Bellman-Ford algorithm (DBF) for shortest-path computation [1]. The primary disadvantage of DBF is that incorrect entries in routing tables may form routing-table loops for one or more destinations whenever Link costs increase [9]. Because a router chooses as its successor to a destination any neighbor router who appears to oer the shortest path to that destination, the router may choose paths that lead to loops for as long as those neighbor routers with viable paths to the destination oer path lengths longer than those paths leading to loops. The worst case of this problem is rather severe: when routers fail or the network partitions, a router can detect such events only after it has considered all possible path lengths to the one or more destinations that have become unreachable through any of its neighbors. Accordingly, this

  • INFOCOM - Using minimal source trees for on-demand routing in ad hoc networks
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societ, 1
    Co-Authors: Soumya Roy, J.j. Garcia-luna-aceves
    Abstract:

    The on-demand routing Protocols that have been proposed to date use either path information (e.g., DSR) or distance information (e.g., AODV). We present SOAR, an on-demand Link-State Protocol based on partial Link-State information in which a wireless router communicates to its neighbors the Link States of only those Links in its source tree that belong to the paths it chooses to advertise for reaching destinations with which it has active flows, SOAR does not require periodic Link-State advertisements when there are no Link connectivity changes in the network. Simulation studies for several scenarios of node mobility and traffic flows reveal that SOAR performs more efficiently than DSR, which is one of the best performing on-demand routing approaches based on path information.