Paper Info
Title
Distributed meta-heuristic method for network optimization problems in information network
Abstract
This paper deals with a network optimization problem with the response-time limitation that minimizes the total capacities of communication channels for a broadcast communication from a given source disseminating information in a network. The solving method and the solution of this problem are defined as E-Transformation and E-Tree. But finding E-Tree that is the minimum cost tree-shaped network essentially belongs to class NP-hard, and we propose meta-heuristic approaches, i.e. Local Search and Tabu Search, with the restriction of the height of a tree for precise approximate solutions. The condition of the height of a tree, which is a property of the network topology, restricts the searching range considerably. We also propose a distributed algorithm of E-Tree search for the sake of an application as an intelligent protocol in a practical large scale information network
Year
DOI
Venue
1999
10.1109/ISCAS.1999.780159
Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE International Symposium
Keywords
Field
DocType
broadcasting,channel capacity,distributed algorithms,information networks,optimisation,protocols,tree searching,E-Transformation,E-Tree,Local Search,NP-hard problem,Tabu Search,broadcast system,communication channel capacity,distributed meta-heuristic algorithm,information network,intelligent protocol,network optimization
Computer science,Network simulation,Network topology,Theoretical computer science,Distributed algorithm,Local search (optimization),Intelligent Network,Optimization problem,Tabu search,Broadcast communication network
Conference
Volume
ISBN
Citations 
6
0-7803-5471-0
0
PageRank 
References 
Authors
0.34
1
2
Name
Order
Citations
PageRank
Shinomiya, N.100.34
Hitoshi Watanabe2244.87