In this paper we propose heuristic and efficient algorithm to minimize the dropped connections in real time congested communication networks. This problem can be classified as combinatorial optimization problem. It is well known that there is no general closed form solution for this type of problems. Furthermore finding the optimal solutions in medium and large size cases of these problems is usually very expensive. Our proposed heuristic algorithm is very simple to implement and gives a close solution to the optimum in many different cases.
|Number of pages||4|
|Journal||Report - Helsinki University of Technology, Signal Processing Laboratory|
|Publication status||Published - 2004|
ASJC Scopus subject areas