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 22 for “"Buffer Sizing"”.

  1. An End User QoS View of Buffer Sizing and Bandwidth Sharing Protocols

    … flow completion times. We study the problem of sizing router buffers and show some pitfalls in some of the recent claims, which were based on a static network (network with a fixed number of end-users). From our analysis, it follows that small buffers can be used in high-speed routers only if …

    uiuc Repository record for An End User QoS View of Buffer Sizing and Bandwidth Sharing Protocols (opens in a new tab)

  2. Development of an Accurate Clock Delay Model with Application in Clock Network Buffer Sizing

    … in geometric programming gate and clock network sizing optimization frameworks. The experimental results demonstrate the effectiveness of the proposed delay model in predicting the delay at the timing critical clock sinks in the clock network, i.e. sinks with minimum and maximum delays, and the …

    calgary Repository record for Development of an Accurate Clock Delay Model with Application in Clock Network Buffer Sizing (opens in a new tab)

  3. Stable and scalable congestion control for high-speed heterogeneous networks

    … This imposes a severe challenge on traditional buffer sizing mechanisms, which are derived using the simplistic model of a single or multiple synchronized long-lived TCP flows. To overcome this problem, we take a control-theoretic approach and design a new intelligent buffer sizing scheme called …

    tamu Repository record for Stable and scalable congestion control for high-speed heterogeneous networks (opens in a new tab)

  4. Clock tree synthesis under aggressive buffer insertion

    … clock tree routing algorithm integrated with buffer insertion, buffer sizing, and topology generation that is able to consider general buffer insertion locations. While previous work on buffered clock tree synthesis restricts potential buffer locations on merge nodes in the clock tree …

    uiuc Repository record for Clock tree synthesis under aggressive buffer insertion (opens in a new tab)

  5. Post-layout interconnect optimization algorithms

    … The interconnect optimization techniques of wire sizing and buffer insertion/sizing have gained widespread acceptance in deep sub-micron design. In this thesis, we present two algorithms for post-layout interconnect optimization. The first algorithm is designed to minimize the maximum delay of a …

    iastate Repository record for Post-layout interconnect optimization algorithms (opens in a new tab)

  6. Buffer Techniques For Stochastic Resource Constrained Project Scheduling With Stochastic Task Insertions Problems

    … within deterministic task times or an extra time buffer may be allotted at the end of the project schedule to protect the final project completion milestone. Little scientific guidance is available to better integrate buffers strategically into the project schedule. Motivated by the Critical Chain …

    ucf Repository record for Buffer Techniques For Stochastic Resource Constrained Project Scheduling With Stochastic Task Insertions Problems (opens in a new tab)

  7. Improving Performance for CSMA/CA Based Wireless Networks

    … close interaction between the MAC layer and the buffer above it to improve performance for real world traffic such as TCP. Surprisingly, the issue of buffer sizing in 802.11 wireless networks has received little attention in the literature yet it poses fundamentally new challenges compared to …

    maynooth Download PDF for Improving Performance for CSMA/CA Based Wireless Networks (opens in a new tab)

  8. An evolutionary approach to improve end-to-end performance in TCP/IP networks

    … These problems include poorly dimensioned socket buffer sizes at the end-hosts, suboptimal buffer sizing at routers and switches, and congestion unresponsive TCP traffic aggregates. We propose solutions that can address these issues, without any modification to TCP. <br> <br> In network paths with …

    gatech Repository record for An evolutionary approach to improve end-to-end performance in TCP/IP networks (opens in a new tab)

  9. Heterogeneous internet traffic control for P2P applications and TCP protocols

    … traffic control mechanism, called router buffer sizing, which is to set an appropriate router buffer size so that the utilization of the Internet links and the performance of TCP flows are optimized. Different from many traditional and recent studies on the router buffer sizing problem …

    nebraska Repository record for Heterogeneous internet traffic control for P2P applications and TCP protocols (opens in a new tab)

  10. K-PERIODIC SCHEDULING FOR THROUGHPUT-BUFFERING TRADE-OFF EXPLORATION OF CSDF

    … memory usage. Nonetheless, determining optimal buffer sizing of dataflow applications remains difficult: existing methods offer either approximate solutions, or fail to provide solutions for complex instances. We propose a throughput-buffering trade-off exploration that uses K-periodic …

    nus Repository record for K-PERIODIC SCHEDULING FOR THROUGHPUT-BUFFERING TRADE-OFF EXPLORATION OF CSDF (opens in a new tab) Download file for K-PERIODIC SCHEDULING FOR THROUGHPUT-BUFFERING TRADE-OFF EXPLORATION OF CSDF (opens in a new tab)

  11. Simultaneous statistical delay and slew optimization for interconnect pipelines

    … of all the nets in the circuit. Also, a buffer sizing and re-placement algorithm is developed to minimize the area of interconnect pipelines while meeting the delay and slew constraints. Experiments show that ignoring location dependent variation can cause timing yield loss of 8.8% in a …

    texas Repository record for Simultaneous statistical delay and slew optimization for interconnect pipelines (opens in a new tab) Restricted access

  12. Routers with small buffers: impact of packet size on performance for mixed TCP and UDP traffic.

    Recent research results on buffer sizing challenged the widely used assumption that routers should buffer millions of packets. These new results suggest that when smooth Transmission Control Protocol (TCP) traffic goes through a single tiny buffer of size O(logW), then close-to-peak throughput can …

    uvic Repository record for Routers with small buffers: impact of packet size on performance for mixed TCP and UDP traffic. (opens in a new tab)

  13. MAXIMIZING THROUGHPUT USING DYNAMIC RESOURCE ALLOCATION AND DISCRETE EVENT SIMULATION

    … and separate. Additionally, the effect of buffer allocation and buffer sizing are studied, and it is shown that buffer allocation is not sensitive to changes in buffer ratio as long as there is buffer space available at each station while adding buffer space has a diminishing rate of return.

    clemson Repository record for MAXIMIZING THROUGHPUT USING DYNAMIC RESOURCE ALLOCATION AND DISCRETE EVENT SIMULATION (opens in a new tab)

  14. Evaluating alternative network configurations and resource allocations for deployed Marine Corps aviation logistics units

    … an Enroute Support Base--sing four inventory buffer sizing policies. We use two measures of effectiveness (MOE): PackUp Effectiveness and PartShort. Packup Effectiveness is the current metric used by the Marine Corps to evaluate aviation logistics performance in a deployed setting. It …

    nps Repository record for Evaluating alternative network configurations and resource allocations for deployed Marine Corps aviation logistics units (opens in a new tab)

  15. Synthesis Methodologies for Robust and Reconfigurable Clock Networks

    … and in multiple operating modes. Synthesizing such clock networks is becoming increasingly difficult with the complex power management methodologies and severe manufacturing variations. Clock network synthesis is an important problem because it has a direct impact on the functional …

    ucf Repository record for Synthesis Methodologies for Robust and Reconfigurable Clock Networks (opens in a new tab)

  16. Power and Timing Driven Optimal Gate, Clock Buffer and Clock Wire Sizing in High Performance Digital Integrated Circuits

    Gate sizing and clock buffer and wire sizing are intertwined problems that greatly impact the trade-off between the power consumption and timing metrics of digital integrated circuits. With the increasing demands for mobile devices and low power technologies, the power consumption has become as …

    calgary Repository record for Power and Timing Driven Optimal Gate, Clock Buffer and Clock Wire Sizing in High Performance Digital Integrated Circuits (opens in a new tab)

  17. On Using Storage and Genset for Mitigating Power Grid Failures

    … on recent results, we model both problems as buffer sizing problems that can be ad- dressed using stochastic network calculus. We show that this approach greatly improves battery sizing in contrast to prior approaches. Specifically, a numerical study shows that, for a neigh- bourhood of 100 …

    waterloo Repository record for On Using Storage and Genset for Mitigating Power Grid Failures (opens in a new tab)

  18. An Analysis of NoCs in FPGAs

    … and pipelined designs with arbitrary amounts of buffering. The analytic models are compared with extensive experimental results, and shown to be very accurate. Using these router models, accurate analytic models for the area, delay and power of graph-based and hypergraph-based NoC topologies …

    mcmaster Repository record for An Analysis of NoCs in FPGAs (opens in a new tab)

  19. Network coding for next-generation networks

    … consider network coding at the source, with no buffers at intermediate nodes, as an alternative to traditional buffering of transient packets at intermediate nodes in multi-hop networks, thereby virtually sharing memory between links on a flow path. We call this spatial buffer multiplexing: …

    texas Repository record for Network coding for next-generation networks (opens in a new tab)

Page 1 of 2