The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Latent Dirichlet Allocation has been developed as topic-based method which uses reasoning to determine the topics of a document. There are many methods of reasoning used for Latent Dirichlet Allocation, including the Gibbs Sampling and Mean Variational Inference, the most widely used in research. However, there have not been many studies that discuss the implementation of these methods on the Indonesian...
Networked systems are common and crucial. One of the canonical problems in such systems is distributed resource allocation. From this rather broad class of problems, we consider a convex non-smooth resource allocation problem with a global resource constraint. Specifically, the objective function is separable and consists of a sum of convex functions, each associated with a node in a given network...
The coexistence of multimedia services in e-communication systems, with varying bandwidth utilization characteristics, impedes the efficiency of rate control and thereby impacts on the Quality of Service (QoS), in terms of low throughput. As such, the rate control for multimedia flows remains an open problem. This paper proposes a memetic optimization approach to rate allocation of multiclass services...
First, a quantized progressive second price (PSP) auction mechanism called the Unique Limit Quantized - PSP (UQ-PSP) is presented for the allocation of fixed or timevarying quantities of a resource among arbitrary populations of agents. It is shown that (i) the states (i.e. bid prices and quantities) of the corresponding iterative dynamical auction system converge to a unique quantized (Nash) equilibrium...
We present a network-assisted scheme for media-aware bandwidth sharing among multiple video streaming sessions. Departing from the conventional paradigm of fair-rate allocation among data traffic flows, our scheme allocates the bottleneck bandwidth among the video streams according to their rate-distortion (R-D) characteristics, with the objective of minimizing the total video distortion of all streams...
Resource allocation is an important issue in cognitive radio systems. It can be done by carrying out negotiation among secondary users. However, significant overhead may be incurred by the negotiation since the negotiation needs to be done frequently due to the rapid change of primary users' activity. In this paper, a channel selection scheme without negotiation is considered for multi-user and multi-channel...
Power allocation with relay selection with incomplete channel state information is considered. Particularly, the utility function is based on the rate and adds the different pricing schemes to reflect the cost of each node according to the different status of each node. We decide if and which relay node to take part in cooperative communication based on the SNR of each node. Then the source and the...
Network utility maximization (NUM) provides an important perspective to conduct rate allocation where optimal performance, in terms of maximal aggregate bandwidth utility, is generally achieved such that each source adaptively adjusts its transmission rate. Behind most of the recent literature on NUM, common assumptions are that traffic flows are elastic and that their utility functions are strictly...
Next Generation Networks (NGN) are envisaged to see a vast and inevitable convergence of diverse multimedia and mobile services with versatile bandwidth utilities. As such, a design challenge for NGN is to allow efficient rate allocation without compromising Quality of Service (QoS) provisioning to any service and thereby enable a global welfare gain. However, the traditional rate allocation schemes...
In the price-based allocation scheme, the resource should be allocated fairly among users, and the system must reach a steady state. Users access resource according to the price in time slots. But when users determine their demand at the start of time slot, the resource price of that slot isn't yet known, it needs to be estimated. After the aggregate demand and the real price are computed, the price...
This work investigates the problem of dynamic, intra-query load balancing in parallel database queries across heterogeneous nodes in a way that takes into account the inherent cost of adaptations and thus avoids both over-reacting and deciding when to adapt in a completely heuristic manner. The latter may lead to serious performance degradation in several cases, such as periodic and random imbalances...
The main aim of this study is managing robot tasks to minimize the deviation between the resource requirements and stated desirable levels. An improved adaptive immune clone selection algorithm (ICSA) is proposed. In this study resource leveling methods are used to solve task scheduling problems in autonomous multi robot group. Robots are considered as resources. The experimental results show that...
This paper investigates the non-convexity of utility-based resource allocation problems in orthogonal frequency division multiple access (OFDMA) networks with heterogeneous traffic classes. Efficient transmission in OFDMA networks requires optimal resource allocation to users based on their current channel states. Also, utility-based resource allocation improves the network resource utilization and...
This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multicast rate requirement for each destination in the network. In essence, this paper aims to achieve network capacity while ensuring that the cost of...
First, a quantized progressive second price auction mechanism called UQ-PSP is developed to allocate a divisible resource among arbitrary populations of agents. It is shown that (i) the states (i.e. bid prices and quantities) of the corresponding iterative dynamical auction system converge to a unique quantized (Nash) equilibrium with a common limit price for all agents, and (ii) the dynamics are...
The explicit control protocol (XCP) is a novel and promising congestion control protocol that outperforms TCP in terms of efficiency, fairness, queue length, packet loss rate and convergence speed. However, the latest research found a weakness of XCP, in a multi-bottleneck environment, a bottleneck link may have a significantly decline in utilization, and some flows may not receive their fair bandwidth...
In this paper, we study the distributed multichannel spectrum sharing problem for the cognitive radio networks (CRNs). We are interested in dynamic spectrum sharing schemes that maximize the spectrum utilization of the cognitive network while appropriately protecting primary users. Existence and optimality of the Nash Equilibrium (N.E.) are investigated. Distributed Multichannel Spectrum Sharing (MCSS)...
A model for wireless networks with slotted-Aloha-type random access and with multihop flow routes is considered. The goal is to devise distributed algorithms for utility-optimal end-to-end throughput allocation and queueing stability. A class of queue back-pressure random access algorithms (QBRAs), in which actual queue lengths of the flows in each node's close neighborhood are used to determine the...
In this paper, we study a utility based flow control problem for a communication network. In most previous works on utility based flow control, the utility function of each user, which represents its satisfaction to the allocated data rate, is assumed to be fixed. This implies that the degree of the rate requirement of each user is assumed to be fixed over the entire duration of its session. However,...
We consider a scenario consisting of two transmit-receive pairs coexisting in the same area and communicating using the same portion of the spectrum. Applying a game theoretic framework, each pair is regarded as a player whose payoff function is the individual link rate and power is allocated using the iterative water-filling algorithm. We study the dynamics of such a game and find properties of the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.