Efficient service management in home gateway

In this paper, we present two algorithms for service replacement in home gateways.. The algorithms take into consideration the priority value and dependencies in addition to the amount of memory occupied by each service. One algorithm uses dynamic programming techniques and gives an optimal solution for the above service replacement problem. However, this algorithm might require non-trivial CPU and memory resources. The second algorithm is based on heuristics and requires less time and space than the first one. We carry. simulation experiments to evaluate the effectiveness of our proposals and compare the performance between the two suggested algorithms