### 抄録

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.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Proceedings - IEEE Symposium on Computers and Communications |

ページ | 959-966 |

ページ数 | 8 |

DOI | |

出版物ステータス | Published - 2002 |

イベント | 7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos 継続期間: 2002 7 1 → 2002 7 4 |

### Other

Other | 7th International Symposium on Computers and Communications, ISCC 2002 |
---|---|

市 | Taormina-Giardini Naxos |

期間 | 02/7/1 → 02/7/4 |

### Fingerprint

### ASJC Scopus subject areas

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

### これを引用

*Proceedings - IEEE Symposium on Computers and Communications*(pp. 959-966). [1021788] https://doi.org/10.1109/ISCC.2002.1021788

**Fast topological design with simulated annealing for multicast networks.** / Miyoshi, Takumi; Shimizu, Shintaro; Tanaka, Yoshiaki.

研究成果: Conference contribution

*Proceedings - IEEE Symposium on Computers and Communications.*, 1021788, pp. 959-966, 7th International Symposium on Computers and Communications, ISCC 2002, Taormina-Giardini Naxos, 02/7/1. https://doi.org/10.1109/ISCC.2002.1021788

}

TY - GEN

T1 - Fast topological design with simulated annealing for multicast networks

AU - Miyoshi, Takumi

AU - Shimizu, Shintaro

AU - Tanaka, Yoshiaki

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84883863791&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883863791&partnerID=8YFLogxK

U2 - 10.1109/ISCC.2002.1021788

DO - 10.1109/ISCC.2002.1021788

M3 - Conference contribution

AN - SCOPUS:84883863791

SN - 0769516718

SN - 9780769516714

SP - 959

EP - 966

BT - Proceedings - IEEE Symposium on Computers and Communications

ER -