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 6 of 6 for “"Input queued switches"”.

  1. Joint buffer management and scheduling for input queued switches

    Input queued (IQ) switches are highly scalable and they have been the focus of many studies from academia and industry. Many scheduling algorithms have been proposed for IQ switches. However, they do not consider the buffer space requirement inside an IQ switch that may render the scheduling …

    njit Repository record for Joint buffer management and scheduling for input queued switches (opens in a new tab)

  2. Throughput analysis of input-queued packet switches : multicasting and speedup

    … to several gigabits/sec, thus causing packet switches and routers to become potential bottlenecks of the network. There is also an increasing need to support services with different QoS requirements over a single integrated network. The support of such capabilities will require an even higher …

    mit Repository record for Throughput analysis of input-queued packet switches : multicasting and speedup (opens in a new tab)

  3. Design of a scheduling mechanism for an ATM switch

    … proposes a novel scheduling mechanism for an input queued ATM switch. In order to evaluate the performance of the scheduling mechanism in terms of throughput and fairness, the use of various metrics, initially proposed in the literature to evaluate output buffered switches are evaluated, …

    cape-town Repository record for Design of a scheduling mechanism for an ATM switch (opens in a new tab)

  4. Resource allocation in stochastic processing networks : performance and scaling

    … packet-level dynamics in systems such as input-queued switches and wireless networks. Bandwidth-sharing networks have primarily been used to capture the long-term behavior of the flow-level dynamics in the Internet. In this thesis, we develop novel methods to analyze the performance of …

    mit Repository record for Resource allocation in stochastic processing networks : performance and scaling (opens in a new tab)

  5. Efficient distributed medium access algorithm

    … processing networks, including scheduling in input-queued switches and optical core network.

    mit Repository record for Efficient distributed medium access algorithm (opens in a new tab)

  6. Design and analysis of scalable scheduling schemes for high-speed input-queued packet switches

    Single-stage input-queued (IQ) switches are attractive for implementation of high performance routers because they require no speedup in the used memory. It has been shown that IQ switches can provide 100% throughput under admissible traffic when using either maximum-weight matching schemes or …

    njit Repository record for Design and analysis of scalable scheduling schemes for high-speed input-queued packet switches (opens in a new tab)