Fast topological design with simulated annealing for multicast networks

Takumi Miyoshi, Shintaro Shimizu, Yoshiaki Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper investigates topological designs for multicast networks using simulated annealing (SA) and proposes a new method for finding an effective initial solution to the problem of reducing the computational time of SA. Multicast communications can decrease network traffic due to branch connections. Accordingly, multicast services will be predominant in future traffic. Since the characteristics of multicast communications are quite different from those of unicast communications, it is necessary to find a suitable topology for future networks that accommodates both multicast and unicast services. Finding the optimal topology is generally known as an NP-hard problem, and so heuristic algorithms have been used in many cases. This paper optimizes the multicast network topology by simulated annealing, a well-known powerful heuristic. Even if SA were employed, however, more additional inventions would be required to compute and find the solution with the smallest possible number of iterations. Therefore, this paper proposes a method for finding an effective initial solution for SA. The results show that the computational time needed to reach the final solution becomes shorter if our proposed method is applied.

Original languageEnglish
Title of host publicationProceedings - ISCC 2002
Subtitle of host publication7th International Symposium on Computers and Communications
Pages959-966
Number of pages8
DOIs
Publication statusPublished - 2002 Dec 1
Event7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos, Italy
Duration: 2002 Jul 12002 Jul 4

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346

Conference

Conference7th International Symposium on Computers and Communications, ISCC 2002
CountryItaly
CityTaormina-Giardini Naxos
Period02/7/102/7/4

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Miyoshi, T., Shimizu, S., & Tanaka, Y. (2002). Fast topological design with simulated annealing for multicast networks. In Proceedings - ISCC 2002: 7th International Symposium on Computers and Communications (pp. 959-966). [1021788] (Proceedings - IEEE Symposium on Computers and Communications). https://doi.org/10.1109/ISCC.2002.1021788