Fifth generation of wireless cellular networks promise to enable better services anytime and anywhere. Non-orthogonal multiple access (NOMA) stands as a suitable accessing scheme due the ability allow users share same radio resource simultaneously via different domains (power, code, etc.). Through introduced power domain, multiplexed at within levels. This paper studies allocation in downlink N...

This work combines the Urn allocation and O’Brien Fleming multiple testing procedure to compare two treatments in clinical trials a novel way. It is shown that this approach overcomes constraints previously made it challenging apply original adaptive design trials. The method provides unique flexibility, enabling be stopped early if one treatment shows superior without compromising efficiency o...

This work considers the performance of the downlink channel of MIMO cellular networks serving multiple users with different statistical QoS requirements. The paper proposes resource allocation algorithms that aim to optimize the system performance over the sum of the optimal user utility functions by employing the effective capacity theory. Proportionally fair resource allocation among the user...

We consider the problem of resource allocation in a parallel environment where new incoming resources are arriving online in groups or batches. We study this scenario in an abstract framework of allocating balls into bins. We revisit the allocation algorithm GREEDY[2] due to Azar, Broder, Karlin, and Upfal (SIAM J. Comput. 1999), in which, for sequentially arriving balls, each ball chooses two ...

This paper studies the problem ol memory allocation and scheduling in a multiple query workload with widely varying resource requirements. Several memory allocation and scheduling schemes are presented and their performance is compared using a detailed simulation study. The results demonstrate the inadequacies of static schemes with fixed scheduling and memory allocation policies. A dynamic ada...

We present a physical-flow-based congestion management allocation mechanism for multiple transaction networks. We use the multiple transaction network framework constructed in [1] to characterize transmission congestion and then determine the contribution to congestion attributable to each transaction on a physical-flow basis. We present an adjustment auction-based congestion relief mechanism t...

The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. In this paper, the multiple multicast tree allocation problem is discussed and algorithms are proposed to solve the congestion problem in the IP net...