Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 10 of 10 for “"Forwarding tables"”.

  1. Leveraging Programmable Data Plane For Compressing Forwarding Tables

    The Forwarding Information Base (FIB) resides in the data plane of a routing device and is used to forward packets to a next-hop, based on packets' destination IP addresses. The constant growth of a FIB forces network operators to spend more resources on maintaining memory with line-rate Longest …

    rit Repository record for Leveraging Programmable Data Plane For Compressing Forwarding Tables (opens in a new tab)

  2. A Novel Technique of Network Auditability with Managers in the Loop

    … can be determined by analyzing the mac address forwarding tables of layer-two devices. The layer-two topology can be merged with a layer-three topology to generate a complete topology of the network. This information is useless unless it is easily accessible to the network manager; therefore, a …

    utahstate Repository record for A Novel Technique of Network Auditability with Managers in the Loop (opens in a new tab)

  3. Predicting host level reachability via static analysis of routing protocol configuration

    … analysis. A system is built to infer the packet forwarding table of each router from the router configuration files. The scope of the work is confined to networks where OSPF is used exclusively for routing. The system is able to infer the exact forwarding tables of the Cisco routers for several …

    nps Repository record for Predicting host level reachability via static analysis of routing protocol configuration (opens in a new tab)

  4. ALGORITHMS FOR CONSISTENT NETWORK UPDATES

    … computer networks must continuously update their forwarding configurations to accommodate traffic engineering adjustments, policy changes, and failures. Performing these updates safely is challenging because intermediate states during the transition between configurations may violate network …

    jhu Repository record for ALGORITHMS FOR CONSISTENT NETWORK UPDATES (opens in a new tab) Embargoed until 2027-05-01

  5. Providing Predictable Performance during Network Contingencies

    … viable next hops when a link/router fails, ii) forwarding loops during network convergence, and iii) buffer overflows in case of congestion. Similarly, packets may be lost in wireless networks due to variations in signal strength between a pair of mobile nodes. This dissertation explores the …

    south-carolina Repository record for Providing Predictable Performance during Network Contingencies (opens in a new tab)

  6. Distributed Routing Bridges

    … traffic. Broadcast traffic populates all forwarding tables in network devices, and is delivered to and processed by all hosts in the network segment. Eliminating the major sources of broadcasting makes it possible to consider larger network segment sizes. This thesis presents the system …

    aalto Repository record for Distributed Routing Bridges (opens in a new tab)

  7. Handling Congestion and Routing Failures in Data Center Networking

    … for traffic to be quickly rerouted. Because forwarding table state limits both the fault tolerance and the largest network size that is implementable given local fast failover, this thesis introduces both a new forwarding table compression algorithm and Plinko, a compressible forwarding …

    rice Repository record for Handling Congestion and Routing Failures in Data Center Networking (opens in a new tab)

  8. ENDN: Towards an Enhanced NDN Architecture for Next Generation Internet

    … of IP addresses to achieve location-independent forwarding. Nevertheless, NDN's design is limited to offering hosted applications a simple content pull mechanism. As a result, increased complexity is needed in developing applications that require more sophisticated content delivery …

    ottawa-retro Repository record for ENDN: Towards an Enhanced NDN Architecture for Next Generation Internet (opens in a new tab)

  9. Meshed Trees: A Framework for Resilient Network Algorithms and Protocols

    … that are tasked with maintaining optimal data-forwarding paths. These protocols commonly rely on shortest-path algorithms to determine where network data should be propagated and how it should be analyzed for inclusion in forwarding tables. However, problems arise during reconvergence, the …

    rit Repository record for Meshed Trees: A Framework for Resilient Network Algorithms and Protocols (opens in a new tab)

  10. Efficient traffic trajectory error detection

    … including traffic deviating from its intended forwarding paths, traffic being mistakenly dropped and unauthorized traffic bypassing packet filters. These traffic trajectory errors are serious problems because they may cause network applications to fail and create security loopholes for network …

    rice Repository record for Efficient traffic trajectory error detection (opens in a new tab)