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 177 for “"routers"”.

  1. Fast arbitration in dilated routers

    Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.

    mit Repository record for Fast arbitration in dilated routers (opens in a new tab)

  2. Designing fast and programmable routers

    Historically, the evolution of network routers was driven primarily by performance. Recently, owing to the need for better control over network operations and the constant demand for new features, programmability of routers has become as important as performance. However, today's fastest routers, …

    mit Repository record for Designing fast and programmable routers (opens in a new tab)

  3. Energy efficient links and routers for multi-processor computer systems

    … in today's computer industry, it is clear that routers and interconnection networks are critical components of these multi-processor systems. Therefore, there is a need to obtain accurate area and power models for these critical components so that we can better understand the area and power …

    mit Repository record for Energy efficient links and routers for multi-processor computer systems (opens in a new tab)

  4. Towards a Common System Architecture for Dynamically Deploying Network Services in Routers and End Hosts

    … there is little difference between servers and routers for the purpose of running network services. Services can run anywhere on the Internet. Application service providers will have the freedom to choose the best place to run their code. This thesis presents NetServ, our first step to realize …

    columbia-diss Repository record for Towards a Common System Architecture for Dynamically Deploying Network Services in Routers and End Hosts (opens in a new tab)

  5. Network layer support for overlay networks

    … implementation in the network layer (i.e., the routers of the physical network). These primitives support the efficient operation and construction of overlay networks. Packet Reflection allows end hosts to request that routers perform specialized routing and duplication for certain packets. Path …

    mit Repository record for Network layer support for overlay networks (opens in a new tab)

  6. Virtualized dynamic resource allocation algorithm for the internet Diffserv domains

    … resources among service classes within the edge routers of the DiffServ domains dynamically according to their traffic conditions and manages these resources between the DiffServ domains in the event of congestion based on their traffic conditions at the egress routers of the upstream domain and …

    salford Repository record for Virtualized dynamic resource allocation algorithm for the internet Diffserv domains (opens in a new tab)

  7. On constructing correct and scalable iBGP configurations

    … about external destinations to other BGP routers within an AS). Full-mesh iBGP and iBGP with route reflection are the two most common methods of configuring iBGP. Although a full-mesh iBGP guarantees correct and predictable routing, it requires a large number of iBGP sessions-approximately …

    mit Repository record for On constructing correct and scalable iBGP configurations (opens in a new tab)

  8. Trading structure for randomness in wireless opportunistic routing

    … MAC with routing, imposing a strict schedule on routers' access to the medium. Although the scheduler delivers opportunistic gains, it eliminates the clean layering abstraction and misses some of the inherent features of the 802.11 MAC. In particular, it prevents spatial reuse and thus may …

    mit Repository record for Trading structure for randomness in wireless opportunistic routing (opens in a new tab)

  9. The design of a fast and flexible Internet subscription system using content graphics

    … for example, F3 uses an overlay network of routers to distribute messages to subscribers. F3 differs from other systems, however, in its use of preprocessors to analyze messages before routing begins. Preprocessors carry out analyses of the relationships between subscription topics, and …

    mit Repository record for The design of a fast and flexible Internet subscription system using content graphics (opens in a new tab)

  10. Hop integrity: a defense against denial-of-service attacks

    … three conditions hold for every pair of adjacent routers p and q in the network. First, p does not forward any message to q if q has not been up and reachable. Second, when q receives a message m supposedly from p, then q can check that m was not modified after it was sent. Third, when q receives …

    texas Repository record for Hop integrity: a defense against denial-of-service attacks (opens in a new tab)

  11. Adaptive communication networks for heterogeneous teams of robots

    … and a fixed subset of the agents act as mobile routers. Our goal is to position the team of robotic routers to provide communication coverage to the remaining client robots, while allowing clients maximum freedom to achieve their primary coordination task. We develop algorithms and performance …

    mit Repository record for Adaptive communication networks for heterogeneous teams of robots (opens in a new tab)

  12. Systematically controlling the error rates in variation-prone networks-on-chip for energy efficiency

    … that dynamically minimizes the Vdd of groups of routers in a variation-prone NoC using formal control-theory methods. The scheme, called Contra, saves substantial energy while guaranteeing the stability and convergence of error rates. Moreover, the scheme is enhanced with a low-cost secondary …

    uiuc Repository record for Systematically controlling the error rates in variation-prone networks-on-chip for energy efficiency (opens in a new tab)

  13. The application of network coding to multicast routing in wireless networks

    … in wireless networks. Network coding allows routers to randomly mix packets before forwarding them. This randomness ensures that routers that hear the same transmission are unlikely to forward the same packets, which permits routers to exploit wireless opportunism with minimal coordination. …

    mit Repository record for The application of network coding to multicast routing in wireless networks (opens in a new tab)

  14. A Study of Locator ID Separation Protocol

    … 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 Separation Protocol (LISP) is a recently proposed approach that provides a solution to these …

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

  15. An Analytical Approach to Inventory Management for Telecommunications Network Equipment

    Verizon’s core network relies on routers that use expensive plug-in cards (PICs) to function. PIC failures can cause disruptions to FiOS or wireless service in the surrounding area. Maintaining an appropriate level of spare PICs is important to maintaining high service levels. Due to the high cost …

    mit Repository record for An Analytical Approach to Inventory Management for Telecommunications Network Equipment (opens in a new tab)

  16. Integrated Mobility and Service Management for Future All-IP Based Wireless Networks

    … future all-IP based wireless networks. If access routers in future all-IP based wireless networks are restricted to perform network layer functions only, we investigate the design of intelligent routers, called dynamic mobility anchor points (DMAPs), to implement per-user regional management in IP …

    vt Repository record for Integrated Mobility and Service Management for Future All-IP Based Wireless Networks (opens in a new tab)

  17. Decoupling congestion control and bandwidth allocation policy with application to high bandwidth-delay product networks

    … XCP does not maintain any per-flow state in routers and requires only a few CPU cycles per packet making it implementable in high-speed routers. Its flexible architecture facilitates the design and implementation of quality of service, such as guaranteed and proportional bandwidth …

    mit Repository record for Decoupling congestion control and bandwidth allocation policy with application to high bandwidth-delay product networks (opens in a new tab)

  18. MicroCuckoo Hash Engine for High-Speed IP Lookup

    … due to the exponential growth in the number of routers. Routers implement the packet classification methodology by determining the flow of the packet, based on various rule checking mechanisms that are performed on the packet headers. However, the memory components like TCAMs used by these …

    vt Repository record for MicroCuckoo Hash Engine for High-Speed IP Lookup (opens in a new tab)

  19. Network coded wireless architecture

    … fundamental switch in network design: instead of routers just storing and forwarding received packets, they mix (or code) packets' content before forwarding. We show through practical systems how routers can exploit this new functionality to harness the intrinsic characteristics of the wireless …

    mit Repository record for Network coded wireless architecture (opens in a new tab)

  20. Robustness of bus overlays in optical networks

    … Our approach allows optical bypass of some routers during normal operation, thus reducing the load on routers, but makes use of routers in case of failures. We analyze the behavior of our linear and T-shaped systems under average use and failure conditions. We show that certain simple …

    mit Repository record for Robustness of bus overlays in optical networks (opens in a new tab)

Page 1 of 9