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 120 for “"buffer size"”.

  1. 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)

  2. 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)

  3. Congestion control using dynamic routing and flow control in store-and-forward computer networks.

    … routing policy that minimizes the delay, and buffer management schemes to control the flow of data. These schemes include (1) Complete Sharing, (2) Square Root Sharing, and (3) Sharing with Minimum Allocation. A dynamic model for a computer queueing network with finite buffer size, stochastic …

    ottawa-retro Repository record for Congestion control using dynamic routing and flow control in store-and-forward computer networks. (opens in a new tab)

  4. Performance prediction of packet switched multistage interconnection networks in an execution-driven environment

    … of inputs and outputs of the network switches, sizes of the switch buffers, switch transmission and arbitration delays, bus sizes in the case of a hybrid switch-bus network, packet size, and software overhead. The study used three algorithms to test the performance. The tested delta networks …

    rice Repository record for Performance prediction of packet switched multistage interconnection networks in an execution-driven environment (opens in a new tab)

  5. A stochastic geometry analysis of cooperative wireless networks powered by energy harvesting

    … such as the energy harvesting rate, the energy buffer size and the cluster size for a given cluster geometry. The analysis is further extended to characterize the delay due to transmission failure. The developed framework is flexible in that it allows the in-cluster transmitters to have possibly …

    texas Repository record for A stochastic geometry analysis of cooperative wireless networks powered by energy harvesting (opens in a new tab)

  6. Economic approach for determining the size of the time buffer in the theory of constrainst

    … need for models that can determine the time buffer (TB) in applications of the theory of constraints (TOC) for production control, in particular the drum-buffer-rope (DBR) and the simplified drum-buffer-rope (S-DBR) applications. Several recent studies have emphasized the importance of …

    wichita-thes Repository record for Economic approach for determining the size of the time buffer in the theory of constrainst (opens in a new tab)

  7. Reducing Communication Through Buffers on a SIMD Architecture

    … tracks the path of data through the network and buffers data in each processor to eliminate redundant communication. With a buffer size of 5, the compiler was able to eliminate 96 percent of the redundant communication for a 9x9 convolution and 8x8 DCT algorithms. With 5x5 convolution, only 89 …

    gatech Repository record for Reducing Communication Through Buffers on a SIMD Architecture (opens in a new tab)

  8. An Information-Theoretic and Game-Theoretic Study of Timing Channels

    … well for maximum delay constrained or maximum buffer size constrained jammers, while batch inputs with batch arrival times chosen at random perform well for average delay constrained jammers.

    uiuc Repository record for An Information-Theoretic and Game-Theoretic Study of Timing Channels (opens in a new tab)

  9. Application of the Distributed Lag Models for Examining Associations Between the Built Environment and Obesity Risk in Children (QUALITY cohort)

    … Studies commonly use a fixed, pre-specified buffer size for the spatial scale to construct environment measures and apply traditional methods of linear regression to calculate risk estimates. However, incorrect spatial scales can introduce biases. Whether the spatial scale changes depending …

    concordia Download PDF for Application of the Distributed Lag Models for Examining Associations Between the Built Environment and Obesity Risk in Children (QUALITY cohort) (opens in a new tab)

  10. Design and stability analysis of high performance packet switches

    … and high speed rates. Combined input-crosspoint buffered (CICB) switches are an alternative to input-buffered (IB) packet switches to provide high-performance switching and to relax arbitration timing for packet switches with high-speed ports. A maximum weight matching (MWM) scheme can provide …

    njit Repository record for Design and stability analysis of high performance packet switches (opens in a new tab)

  11. Simulation of ATM multiplexer for bursty sources

    … are the cell loss and the cell delay at the buffer queue in the ATM multiplexer. Therefore, the performance parameters of an ATM multiplexer are specifically focused on the cell loss probability, the cell delay, and the distribution of queueing length at buffer m this study. The performance …

    dcu Download PDF for Simulation of ATM multiplexer for bursty sources (opens in a new tab)

  12. Optimal control of queueing systems with non-collaborating servers

    … (flexible) servers are analyzed. For finite-buffered Markovian tandem networks with two stations, non-collaborative flexible servers, and no setups; the optimal server assignment policy is identified. For larger tandem networks, myopic server assignment heuristics are developed. It is also …

    gatech Repository record for Optimal control of queueing systems with non-collaborating servers (opens in a new tab)

  13. Performance analysis of star architecture packet-switched VSAT networks using random code division multiple access

    … generating function of the station queue size. Then, a discussion of the effect of finite buffer size, and an analysis relating the probability of buffer overflow to packet statistics and buffer size is presented. Because of the bursty nature of a traffic originating from the VSAT’s, the …

    vt Repository record for Performance analysis of star architecture packet-switched VSAT networks using random code division multiple access (opens in a new tab)

  14. Application-level optimization of end-to-end data transfer throughput

    … multiple parallel TCP streams, tuning the TCP buffer size and I/O block size) is one way of improving the network transfer throughput. On the other hand, end-to-end data transfer throughput bottleneck on high performance networking systems occur mostly at the participating storage systems …

    lsu-thes Repository record for Application-level optimization of end-to-end data transfer throughput (opens in a new tab)

  15. Design of bridge inter-connecting token ring & token bus local area networks

    … in the design. Initially it is assumed that the buffer size at the Bridge is infinite. Further it is assumed that the arrival rate of the messages is Markovian and the service rate is General, Le it is an M/G/1 system. Expressions for the average waiting time at the Bridge and the size of the …

    njit Repository record for Design of bridge inter-connecting token ring & token bus local area networks (opens in a new tab)

  16. SIMULATION AND ANALYSIS OF THE G/G/1/K QUEUE

    … queue to investigate how traffic intensity and buffer size affect critical performance measures, including average waiting time, queue length, and blocking probabilities. This analysis considers a wide range of interarrival and service distributions, including deterministic, exponential, gamma, …

    cornell Repository record for SIMULATION AND ANALYSIS OF THE G/G/1/K QUEUE (opens in a new tab)

  17. The effect of workload dependence in systems: Experimental evaluation, analytic models, and policy development

    … This analysis considers (a) systems with finite buffers (e.g., systems with admission control that effectively operate as closed systems) and (b) systems with infinite buffers (i.e., systems that operate as open systems).;For multi-tiered systems with a finite buffer size, experimental …

    wm-mary Repository record for The effect of workload dependence in systems: Experimental evaluation, analytic models, and policy development (opens in a new tab)

Page 1 of 6