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 20 of 61 for “"routing table"”.

  1. IP Routing Table Compression Using TCAM and Distance-one Merge

    … (IP) address space, Class-less Inter-Domain Routing (CIDR) was proposed and adopted. However, the decision to utilize CIDR also increases the size of the routing table, since it allows an arbitrary partitioning of the routing space. We propose a scheme to reduce the size of routing table in …

    tamu Repository record for IP Routing Table Compression Using TCAM and Distance-one Merge (opens in a new tab)

  2. Towards more power efficient IP lookup engines

    … The software or hardware implementations of routing trie based approaches require several memory accesses in order to perform a single memory lookup, which limits the throughput considerably. On the other hand, IP lookup throughput requirements have been continuously increasing. This has led …

    tamu Repository record for Towards more power efficient IP lookup engines (opens in a new tab)

  3. Harnessing Tunnels For Dirty-Slate Network Solutions

    … solutions to address them. The first problem is routing scalability and includes the growing size of the Internet routing table. We note that routing table size is problematic since every router is required to maintain the entire table. Consequently, we propose ViAggre (Virtual Aggregation), a …

    cornell Repository record for Harnessing Tunnels For Dirty-Slate Network Solutions (opens in a new tab)

  4. A Study of Locator ID Separation Protocol

    … at solving the issues in the current Internet Routing Architecture. The growth of the BGP routing table and Forwarding Information bases on core routers is very high. In addition, the number of BGP messages that are currently being processed by the BGP routers is a worrisome issue. Locator/ID …

    umkc Repository record for A Study of Locator ID Separation Protocol (opens in a new tab)

  5. An algorithm for fast route lookup and update

    Increase in routing table sizes, number of updates, traffic, speed of links and migration to IPv6 have made IP address lookup, based on longest prefix matching, a major bottleneck for high performance routers. Several schemes are evaluated and compared based on complexity analysis and simulation …

    njit Repository record for An algorithm for fast route lookup and update (opens in a new tab)

  6. Enhancing multicast communications with data-in-work schemes

    … and optimize large inter-domain multicast routing table entries. Four specific solutions have been proposed to achieve each of the above namely, Video-In-Network (VIN), DINCast, DINPeer, and (G)MPLS-based DINloop_Net. VIN enables multicast across both space and time by circulating video …

    nus Repository record for Enhancing multicast communications with data-in-work schemes (opens in a new tab) Download file for Enhancing multicast communications with data-in-work schemes (opens in a new tab)

  7. IP routing lookup: hardware and software approach

    … address of the incoming packet in the forwarding table. Besides increased inter-packet arrival rates, the increasing routing table sizes and complexity of forwarding algorithms have made routers a bottleneck in the packet transmission across the Internet. A number of solutions have been proposed …

    tamu Repository record for IP routing lookup: hardware and software approach (opens in a new tab)

  8. Load-balancing and secure routing for wireless mobile ad hoc

    … transmission range of wireless interface, a routing protocol is needed to enable communication between mobile nodes. The first part of our work focuses on the load-balancing routing protocol in mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more …

    ubc Repository record for Load-balancing and secure routing for wireless mobile ad hoc (opens in a new tab) Download PDF for Load-balancing and secure routing for wireless mobile ad hoc (opens in a new tab)

  9. ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS

    … and high-speed information exchange between portable devices. To harvest the available bandwidth efficientlyin a wireless network, they employ multiple orthogonal channels over multiple ra-dios at the nodes. In addition, nodes in these networks employ directional antennasas radios to improve …

    arizona-thes Repository record for ALGORITHMS FOR ROUTING AND CHANNEL ASSIGNMENT IN WIRELESS INFRASTRUCTURE NETWORKS (opens in a new tab)

  10. The delay performance of adaptive routing and scheduling in communication networks

    … have designed a number of network-layer routing algorithms and MAC-layer scheduling algorithms to deliver good QoS performance under various network conditions. In this dissertation, we study the delay performance of routing and scheduling algorithms in communication networks. A …

    uiuc Repository record for The delay performance of adaptive routing and scheduling in communication networks (opens in a new tab)

  11. Fundamental Design Issues in Anonymous Peer-to-peer Distributed Hash Table Protocols

    … anonymous peer-to-peer (ANP2P) distributed hash table (DHT). These protocols are considered efficient, scalable, decentralized, and practical. However, the anonymity properties of these protocols are not well understood and difficult to quantify. As a result, users may have a false sense of …

    hawaii Repository record for Fundamental Design Issues in Anonymous Peer-to-peer Distributed Hash Table Protocols (opens in a new tab)

  12. RootChord

    … knowledge, this is the first distributed hash table which is able to adapt to changes in the size of the network and answer lookup queries within a guaranteed two hops while maintaining a routing table of size Theta(sqrt(N)). We provide pseudocode and analysis for all aspects of the protocol …

    waterloo Repository record for RootChord (opens in a new tab)

  13. Measuring Effectiveness of Address Schemes for AS-level Graphs

    … however, has been reached that today's Internet routing and addressing system is facing serious scaling problems: multi-homing which causes finer granularity of routing policies and finer control to realize various traffic engineering requirements, an increased demand for provider-independent …

    uky-thes Repository record for Measuring Effectiveness of Address Schemes for AS-level Graphs (opens in a new tab)

  14. Building shape-shifting tries for fast IP lookup

    … by looking up their IP destination address in a routing table which then determines the output link on which the packet is sent. To achieve a competitive advantage, many routers today choose to do additional processing for a specific subset of packets, which requires that routers are able to …

    missouri Repository record for Building shape-shifting tries for fast IP lookup (opens in a new tab)

  15. Self-stabilizing distributed algorithms for acyclic graphs

    … uses this information to build a shortest path routing table in each node in the system to all accessible nodes from that node. The second protocol determines the rank of the individual processors in a distributed tree network based on the values possessed by them. Due to the self-stabilizing …

    unlv Repository record for Self-stabilizing distributed algorithms for acyclic graphs (opens in a new tab) Download PDF for Self-stabilizing distributed algorithms for acyclic graphs (opens in a new tab)

  16. Enabling architectures for QoS provisioning

    … and on distributed software architectures for routing devices providing desired QoS at the underlying communication layer. At the application layer, the QoS architecture we propose, based on the Quality Driven Delivery (QDD) framework, deals with the increasing amount of QoS information of a …

    concordia Download PDF for Enabling architectures for QoS provisioning (opens in a new tab)

  17. An improved MultiAnts-Aodv routing protocol for ad hoc wireless networks

    Compared to the conventional table-driven and on-demand routing protocols, a hybrid routing protocol [71], which uses mobile agents and reactive route discovery, introduced a more realistic solution to this problem. However, the mobile agents were not fully exploited in this protocol. In this …

    unlv Repository record for An improved MultiAnts-Aodv routing protocol for ad hoc wireless networks (opens in a new tab) Download PDF for An improved MultiAnts-Aodv routing protocol for ad hoc wireless networks (opens in a new tab)

  18. Distributed true string B-tree peer-to-peer overlay networks

    … data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called Distributed True String B-tree (DTSBT) P2P overlay network. Unlike popular Distributed Hash Table (DHT)-based P2P overlay networks which use DHT as their core data structure, …

    ottawa-retro Repository record for Distributed true string B-tree peer-to-peer overlay networks (opens in a new tab)

  19. A self-stabilizing interval routing scheme in general networks

    The Pivot Interval Routing (PIR) scheme [EGP98] divides the nodes in the network into pivots and clients of the pivots. A pivot acts as a center for the partition of the network formed by its clients. Each node can send messages directly only to a small subset of vertices in its nearby vicinity or …

    unlv Repository record for A self-stabilizing interval routing scheme in general networks (opens in a new tab) Download PDF for A self-stabilizing interval routing scheme in general networks (opens in a new tab)

  20. Compact routing in fault-tolerant distributed systems

    A compact routing algorithm is a routing algorithm which reduces the space complexity of all-pairs shortest path routing. Compact routing protocols in distributed systems have been studied extensively as an attractive alternative to the traditional method of all-pairs shortest path routing. The use …

    unlv Repository record for Compact routing in fault-tolerant distributed systems (opens in a new tab) Download PDF for Compact routing in fault-tolerant distributed systems (opens in a new tab)

Page 1 of 4