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.
In this paper, we propose an algorithm for solving combinatorial resource allocation problems with mobile sites and resources. We consider the instantaneous coverage problem, which is formulated in a Maximum Entropy Principle (MEP) framework, and identify a metric for optimal coverage between mobile sites and resources. This metric, referred to as the Free Energy has been motivated by principles of...
In this paper we discussed an extension to security enhanced Linux (SELinux) to build a more available and secure system that has the capability to contain and mitigate denial of service (DoS) attacks by exercising rate control over resource usage. We presented an extended structure to compliment Mandatory Access Control policies of SELinux. Using this extension a system's resource usage by various...
In this paper, we propose a scalable algorithm for solving resource allocation problems on large datasets. This class of problems is posed as a multi-objective optimization problem in a maximum entropy principle framework. This algorithm solves a multi-objective optimization problem that minimizes simultaneously the coverage cost and the computational cost by appropriate recursive prescription of...
In this paper, QoS-guaranteed path selection algorithm for service composition is described. A heuristic algorithm, K-closest pruning (KCP), is used to solve the problem of multi-constraint service path selection for SON in polynomial time. The main feature of this algorithm is that the path selected by this algorithm meets all the QoS requirements specified by the user/application. The main idea...
In this paper, we develop a scalable algorithm for solving resource allocation problems on large datasets. The algorithm is based on the deterministic annealing (DA) algorithm presented in the work of Rose (1998). The capability of the DA algorithm to identify clusters at successive iteration steps is exploited to truncate certain large computations in the algorithm. These truncations are obtained...
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.