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 21 for “"Rate Allocation"”.

  1. An algorithm for rate allocation in a packet-switching network with feedback

    Thesis (Elec. E.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1994.

    mit Repository record for An algorithm for rate allocation in a packet-switching network with feedback (opens in a new tab)

  2. Corelite: A Quality of Service Architecture for Wireline and Wireless Networks

    … core routers equipped with a look-ahead fair rate allocation scheme, Corelite provides Intserv-like rate services to a diverse class of applications, both mobile and static, in a scalable and stable manner.

    uiuc Repository record for Corelite: A Quality of Service Architecture for Wireline and Wireless Networks (opens in a new tab)

  3. A Comparison of Control Allocation Methods for the F-15 ACTIVE Research Aircraft Utilizing Real-Time Piloted Simulations

    A comparison of two control allocation methods is performed utilizing the F-15 ACTIVE research vehicle. The control allocator currently implemented on the aircraft is replaced in the simulation with a control allocator that accounts for both control effector positions and rates. Validation of the …

    vt Repository record for A Comparison of Control Allocation Methods for the F-15 ACTIVE Research Aircraft Utilizing Real-Time Piloted Simulations (opens in a new tab)

  4. Topics in Routing and Network Coding for Wireless Networks

    … packet encoding algorithm that can easily integrate a routing scheme with network coding. We also discuss max-min fair rate allocation and scheduling algorithms for the flows in a wireless network that utilizes coding. We propose Polar Coordinate Routing (PCR) to create multiple paths between a …

    columbia-diss Repository record for Topics in Routing and Network Coding for Wireless Networks (opens in a new tab)

  5. Fair resource allocation in multiple access channels

    We consider the problem of resource allocation in a multiple access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates over the information theoretic capacity region of the multiple-access channel. We …

    mit Repository record for Fair resource allocation in multiple access channels (opens in a new tab)

  6. Robust and efficient video/image transmission

    … of this task, error burst correction, efficient rate allocation and random error protection are investigated in this dissertation. A novel technique, called successive packing, is proposed for combating multi-dimensional (M-D) bursts of errors. A new concept of basis interleaving array is …

    njit Repository record for Robust and efficient video/image transmission (opens in a new tab)

  7. An Implementation of Utility-Based Traffic Shaping on Android Devices

    … (LTE) was designed to provide fast data rates to replace 3G service for mobile devices. As LTE networks and the user base for those networks grow, it becomes necessary for the resources used for those networks to be used as efficiently as possible. This thesis presents an implementation …

    vt Repository record for An Implementation of Utility-Based Traffic Shaping on Android Devices (opens in a new tab)

  8. Fault Tolerant Broadcast in Bandwidth-Constrained Networks

    … We further explore the problem of optimal rate allocation in heterogeneous node-constrained networks and provide concrete theoretical results for determining the optimal system throughput rate. Additionally, we propose the MaxMin Rate Controller (MaxMin-RC) protocol as a feedback-based …

    mit Repository record for Fault Tolerant Broadcast in Bandwidth-Constrained Networks (opens in a new tab)

  9. Congestion control, energy efficiency and virtual machine placement for data centers

    … called fair QCN (FQCN), is proposed to improve rate allocation fairness of multiple flows sharing one bottleneck link in data center networks. Detailed analysis on FQCN and simulation results is provided to validate the fair share rate allocation while maintaining the queue length stability. …

    njit Repository record for Congestion control, energy efficiency and virtual machine placement for data centers (opens in a new tab)

  10. Video Communications over Dynamic Ad Hoc Networks

    … (1) concurrent routing, (2) path selection and rate allocation, and (3) multipath routing for multiple description video. Each component addresses one or more unique challenges that hinder video communications in multihop wireless networks. Although we expect that a cross-layer approach will be …

    vt Repository record for Video Communications over Dynamic Ad Hoc Networks (opens in a new tab)

  11. Generalizations of permutation source codes

    … simplicity but yield improved operational rate-distortion performance. In the first approach, the new class of vector quantizers has a codebook comprising several permutation codes as subcodes. Methods for designing good code parameters are given. One method depends on optimizing the rate

    mit Repository record for Generalizations of permutation source codes (opens in a new tab)

  12. Recovery of primal solution in dual subgradient schemes

    … method with averaging to estimate the rate allocation for individual users in a distributed manner, due to its decomposability structure. Unlike the existing literature on primal recovery schemes, we use a constant step-size rule in view of its simplicity and practical significance. …

    mit Repository record for Recovery of primal solution in dual subgradient schemes (opens in a new tab)

  13. Resource Allocation for Smart Phones in 4G LTE-Advanced Carrier Aggregation

    … to the Frank Kelly algorithm allows resource allocation to take into account devices with multiple applications. The second topic introduces the idea of scheduling resources in a carrier aggregation scenario assuming the carriers are scheduled sequentially.

    vt Repository record for Resource Allocation for Smart Phones in 4G LTE-Advanced Carrier Aggregation (opens in a new tab)

  14. Centralized performance control for datacenter networks

    … allow operators to specify policy for resource allocation between users or applications, while providing several properties, including low median and tail latency, high utilization (throughput), and congestion (loss) avoidance. Current datacenter networks inherit the principles that went into …

    mit Repository record for Centralized performance control for datacenter networks (opens in a new tab)

  15. Algorithms and Optimization for Wireless Networks

    … a multi-hop network. An ad hoc network can operate in a stand-alone fashion or could possibly be connected to a larger network such as the Internet (also known as mesh networks). For these new wireless networks, a number of advanced physical layer techniques, e.g., ultra wideband (UWB), …

    vt Repository record for Algorithms and Optimization for Wireless Networks (opens in a new tab)

  16. Mcmc- Based Optimization And Application

    … While slice sampling has a merit to generate samples based on the underlying distribution with adjustable step size, simulated annealing can facilitate samples to jump out of local optima and converge quickly to the global optimum. With this MCMC method, we then solve two practical …

    mississippi Repository record for Mcmc- Based Optimization And Application (opens in a new tab)

  17. A Solution to optimal and fair rate adaptation in wireless mesh networks

    … deals with nding an optimal solution to resource allocation in wireless mesh networks. These networks require a solution to fair and optimal resource allocation that is decentralised and self-con guring, as users in such networks do not submit to a central authority. The solution presented is …

    pretoria Repository record for A Solution to optimal and fair rate adaptation in wireless mesh networks (opens in a new tab)

  18. Enhancing QoS provisioning and granularity in next generation internet

    … is studied, so that fairness in the bandwidth allocation among the flows can be achieved in a scalable fashion. A dual-rate grouping architecture is proposed in this dissertation, in which the granularity in rate allocation can be enhanced, while the scalability of the one-rate grouping …

    njit Repository record for Enhancing QoS provisioning and granularity in next generation internet (opens in a new tab)

  19. Efficient cross-layer routing and congestion control architectures for distributed systems

    … from a source to a destination and the optimal rate at which content is transmitted. In general networks such as the Internet, per user, there is usually one possible content source/destination such as a web server. There can be multiple possible paths to/from the destination/source (server). In …

    uiuc Repository record for Efficient cross-layer routing and congestion control architectures for distributed systems (opens in a new tab)

  20. Distributed algorithms for networked multi-agent systems: optimization and competition

    … primal-dual and dual schemes in which the iterate computations are distributed naturally across the users, i.e., each user updates its own decision only. We observe that a generalization of this result is also available when users choose their stepsize and regularization parameters …

    uiuc Repository record for Distributed algorithms for networked multi-agent systems: optimization and competition (opens in a new tab)

Page 1 of 2