TY - GEN

T1 - Fast topological design with simulated annealing for multicast networks

AU - Miyoshi, Takumi

AU - Shimizu, Shintaro

AU - Tanaka, Yoshiaki

PY - 2002/12/1

Y1 - 2002/12/1

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

T3 - Proceedings - IEEE Symposium on Computers and Communications

SP - 959

EP - 966

BT - Proceedings - ISCC 2002

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

Y2 - 1 July 2002 through 4 July 2002

ER -