Browsing by Author "Cardei, Ionut"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Approximation Solutions for the Resource Management Problem Using the General Cover Problem(2001-12-13) Cardei, Mihaela; MacCallum, David; Chen, Sai; Cardei, Ionut; Du, Ding-ZhuTime-critical applications and multimedia systems require a mechanism to arbitrate access to shared resources. Resource Management systems provide the necessary services to applications for admission control and adaptation. This paper defines a model for the Resource Management Problemand describes two near-optimal approximation methods for criticality-based selection scheduling of competing applications. The resource management allocation scheme is designed to follow a set of goals. In this paper we focus on maximizing the number of higher-criticality sessions admitted, where a session is an instance of an application executing on a system, using a set of resources, such as CPU, memory and disk IO. First we reduce the Resource Management Problem to the General Cover Problem and thenpresent two approximation solutions with their performance ratio. First solution uses a greedy algorithm and the second one a linear programming algorithm.Item Optimal Relay Location for Resource-Limited Energy-Efficient Wireless Communication(2002-03-26) Cardei, Ionut; Cardei, Mihaela; Wang, Lusheng; Xu, Baogang; Du, Ding-ZhuIn the design of wireless networks, techniques for improving energy efficiency and extending network lifetime have great importance, particularly for defense and civil/rescue applications where resupplying transmitters with new batteries is not feasible. In this paper we study a method for improving the lifetime of wireless networks by minimizing the length of the longest edge in the interconnecting tree with deploying additional relay nodes.Let P={p1, ..., pn} be a set of n terminals in the Euclideanplane. For a positive integer k, the bottleneck Steinertree problem (BSTP) asks to find a Steiner tree with atmost k Steiner points such that the length of the longest edge in the tree is minimized. We give a ratio - sqrt(3) + e polynomial time approximation algorithm for BSTP, where e is an arbitrary positive number.Keywords:wireless networks, power efficient, approximation algorithms, Steiner tree, bottleneck Steiner tree.