22 research outputs found

    HIDRA: Hierarchical Inter-Domain Routing Architecture

    Get PDF
    As the Internet continues to expand, the global default-free zone (DFZ) forwarding table has begun to grow faster than hardware can economically keep pace with. Various policies are in place to mitigate this growth rate, but current projections indicate policy alone is inadequate. As such, a number of technical solutions have been proposed. This work builds on many of these proposed solutions, and furthers the debate surrounding the resolution to this problem. It discusses several design decisions necessary to any proposed solution, and based on these tradeoffs it proposes a Hierarchical Inter-Domain Routing Architecture - HIDRA, a comprehensive architecture with a plausible deployment scenario. The architecture uses a locator/identifier split encapsulation scheme to attenuate both the immediate size of the DFZ forwarding table, and the projected growth rate. This solution is based off the usage of an already existing number allocation policy - Autonomous System Numbers (ASNs). HIDRA has been deployed to a sandbox network in a proof-of-concept test, yielding promising results

    Analyses of least cost paths for determining effects of habitat types on landscape permeability: wolves in Poland

    Get PDF
    Determining ecological corridors is crucial for conservation efforts in fragmented habitats. Commonly employed least cost path (LCP) analysis relies on the underlying cost matrix. By using Ecological Niche Factor Analysis, we minimized the problems connected with subjective cost assessment or the use of presence/absence data. We used data on the wolf presence/absence in Poland to identify LCPs connecting patches of suitable wolf habitat, factors that influence patch occupancy, and compare LCPs between different genetic subpopulations. We found that a lower proportion of cities and roads surrounds the most densely populated patches. Least cost paths between areas where little dispersal takes place (i.e., leading to unpopulated patches or between different genetic subpopulations) ran through a higher proportion of roads and human settlements. They also crossed larger maximal distances over deforested areas. We propose that, apart from supplying the basis for direct conservation efforts, LCPs can be used to determine what factors might facilitate or hinder dispersal by comparing different subsets of LCPs. The methods employed can be widely applicable to gain more in-depth information on potential dispersal barriers for large carnivores

    HIDRA: Hierarchical Inter-Domain Routing Architecture

    Get PDF
    The size of the Internet’s forwarding table is growing rapidly, generating concerns about the ability for high performance routing equipment to economically keep pace. The primary contributors to this growth are end site multihoming, trafïŹc engineering, and in the foreseeable future, IPv6 deployment. This paper presents HIDRA, a hierarchal network architecture designed to reduce both the immediate size of the Internet’s forwarding table as well as its growth rate while maximizing compatibility with the existing In ternet architecture. This includes the ability to use exist ing high performance routers, existing routing protocols, and existing number allocation policies. HIDRA is prototyped on a small network testbed and shown to work in a limited set of circumstances, including normal network operation, link failures, traf ïŹc engineering, and mixed “legacy” Internet and HIDRA topologies. The potential reduction of the Internet’s for warding table is also analyzed

    HIDRA: HIERARCHICAL INTER-DOMAIN ROUTING ARCHITECTURE

    No full text
    The size of the Internet’s forwarding table is growing rapidly, generating concerns about the ability for high performance routing equipment to economically keep pace. The primary contributors to this growth are end site multihoming, traffic engineering, and in the foreseeable future, IPv6 deployment. This paper presents HIDRA, a hierarchal network architecture designed to reduce both the immediate size of the Internet’s forwarding table as well as its growth rate while maximizing compatibility with the existing Internet architecture. This includes the ability to use existing high performance routers, existing routing protocols, and existing number allocation policies. HIDRA is prototyped on a small network testbed and shown to work in a limited set of circumstances, including normal network operation, link failures, traffic engineering, and mixed “legacy” Internet and HIDRA topologies. The potential reduction of the Internet’s forwarding table is also analyzed
    corecore