Quorumcast routing by multispace search
Tsang, Danny H.K.
|Source||Conference Record / IEEE Global Telecommunications Conference , v. 2, 1996, p. 1069-1073|
|Summary||In this paper, we present a multispace search algorithm, MUSQ, for the quorumcast routing problem. We first prune the candidate set to reduce the original search space. Some of the unqualified links for the optimal tree are removed from the network. Then a multispace search algorithm is used to solve the quorumcast routing problem. By altering the original objective function, the original problem instance is transformed into a series of gradually more simplified problem instances with smoother terrain surfaces. A local search algorithm is used to solve each problem instance, from the simplest structure to the original structure, and the solutions of the more simplified problem instances are used to guide the search of more complicated ones. Experimental results showed that this new method improved the performance of the existing heuristic algorithms.|
|Rights||© 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.|
View full-text via DOI
View full-text via Scopus
Files in this item: