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 20 for “"routing table"”.
-
Tragedy of the routing table : an analysis of collective action amongst Internet network operators
… in order to manage the growth of the Internet routing table. The size and rate of growth of the Internet routing table is an acknowledged challenge impeding the scalability of our BGP interdomain routing architecture. While most of the work towards a solution to this problem has focused on …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
Routing tradeoffs in dynamic peer-to-peer networks
Distributed Hash Tables (DHTs) are useful tools for building large scale distributed systems. DHTs provide a hash-table-like interface to applications by routing a key to its responsible node among the current set of participating nodes. DHT deployments are characterized by churn, a continuous …
-
Traffic Engineering for LISP-Enabled Networks
… serious limitations because of the current IP routing and addressing architecture. This coupled with Border Gateway Protocol’s (BGP’s) way of selecting performance-blind paths forces ISPs to de-aggregate IP prefixes to control the flow of packets between ASes. Advertising such de-aggregated, …
-
Survivability Analysis of Two Specific 16-Node, 24-Link Communication Networks
… Enough insight is given to devise an optimal re-routing strategy when a network failure takes place. A new idea of static routing strategy called the Static Disjoint Routing Strategy is introduced. This disjoint routing strategy is proven to be close in performance to that of traditional Dynamic …
-
Self-stabilizing interval routing algorithm with low stretch factor
A compact routing scheme is a routing strategy which suggests routing tables that are space efficient compared to traditional all-pairs shortest path routing algorithms. An Interval Routing algorithm is a compact routing algorithm which uses a routing table at every node in which a set of …
-
Using current uptime to improve failure detection in peer-to-peer networks
… should be monitored and maintained to ensure the routing table is kept up-to-date. Typically P2P networks predefine a fixed keep-alive period, a maximum interval in which connected nodes must exchange messages. If no other message has been sent within this interval then keep-alive messages are …
-
Design and applications of a secure and decentralized Distributed Hash Table
Distributed Hash Tables (DHTs) are a powerful building block for highly scalable decentralized systems. They route requests over a structured overlay network to the node responsible for a given key. DHTs are subject to the well-known Sybil attack, in which an adversary creates many false identities …
-
Efficient Routing in the CityMesh Decentralized Fallback Wireless Network
… challenges. This thesis presents a new routing protocol for CityMesh, designed to operate efficiently at city scale. We first identify the limitations of traditional shortest-path source routing in CityMesh’s context, including the use of unreliable links and overhead from redundant …
-
ANTMANET: a novel routing protocol for mobile ad-hoc networks based on ant colony optimisation
… this research is to present “ANTMANET” a novel routing protocol for Mobile Ad-Hoc networks. The proposed protocol aims to reduce the network overhead and delay introduced by node mobility in MANETs. There are two techniques embedded in this protocol, the “Local Zone” technique and the “North …
-
Intelligent based Packet Scheduling Scheme using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) Technology for 5G. Design and Investigation of Bandwidth Management Technique for Service-Aware Traffic Engineering using Internet Protocol/Multi-Protocol Label Switching (IP/MPLS) for 5G
… Area Network (WAN). Unlike IP networks in which routing decision has to be made through header analysis on a hop-by-hop basis, MPLS makes use of a short bit sequence that indicates the forwarding equivalence class (FEC) of a packet and utilises a predefined routing table to handle packets of a …
-
Distributed routing algorithms for interconnected FDDI LANS
… one LAN to another across the leased line, a routing algorithm is required. Much research has been done on the Bellman-Ford algorithm and many implementations of it exist in computer networks. However, due to its instability and problems with routing table loops it is an unsatisfactory …
-
Cross-layer optimizations in multi-hop ad hoc networks
… between different protocol layers (MAC, routing, transport). In particular, MAC and routing protocols could be considered mutually cooperative protocol layers. When a route is established, the exposed and hidden terminal problems at MAC layer may decrease the end-to-end performance …
-
Software pro podporu výuky znázorňující principy směrovačů
… kterými jsou Open Shortest Path First (OSPF) a Routing Information Protocol (RIP). Všechny aplety jsou vloženy na webové stránky, které svým návštěvníkům přibližují problematiku směrování i s tím souvísející informace.