Heuristic Approach to the Problem ofMinimal Extension of a Communication Network and Its AssessmentBased on a Specialized Class of Weighted Digraphs

Cover Page

Abstract


In the paper we are presenting a heuristic approach to solve the problem of changing network topology by minimally extending a digraph G′ through adding edges from a given spanning supergraph G of G', such that the sum of the costs of the new edges is minimum, and in the new graph the end-to-end delay between two distinguished vertices s and t meets a predefined time constraint (ME problem). We develop a heuristic based upon the Genetictype algorithm technique. Moreover, the application of this heuristic is justified and is shown that the solution of ME problem belongs to the NP-hard computational class.

About the authors

A Gordonov

College of Staten Island, City University of New York

Кафедра вычислительной техники; Колледж Стейтен Айленда, Нью-Йоркский городской университет; College of Staten Island, City University of New York

L Petingi

College of Staten Island, City University of New York

; College of Staten Island, City University of New York

References

Statistics

Views

Abstract - 23

PDF (English) - 4

Cited-By



Copyright (c) 2008 Гордонов А., Петинжи Л.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies