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 - IEEE Symposium on Computers and Communications
    Pages959-966
    Number of pages8
    DOIs
    Publication statusPublished - 2002
    Event7th International Symposium on Computers and Communications, ISCC 2002 - Taormina-Giardini Naxos
    Duration: 2002 Jul 12002 Jul 4

    Other

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

    Fingerprint

    Simulated annealing
    Multicast
    Simulated Annealing
    Topology
    Communication
    Patents and inventions
    Heuristic algorithms
    Network Traffic
    NP-hard Problems
    Computational complexity
    Network Topology
    Heuristic algorithm
    Design
    Branch
    Optimise
    Traffic
    Heuristics
    Iteration
    Decrease
    Necessary

    ASJC Scopus subject areas

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

    Cite this

    Miyoshi, T., Shimizu, S., & Tanaka, Y. (2002). Fast topological design with simulated annealing for multicast networks. In 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.

    Proceedings - IEEE Symposium on Computers and Communications. 2002. p. 959-966 1021788.

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

    Miyoshi, T, Shimizu, S & Tanaka, Y 2002, Fast topological design with simulated annealing for multicast networks. in 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
    Miyoshi T, Shimizu S, Tanaka Y. Fast topological design with simulated annealing for multicast networks. In Proceedings - IEEE Symposium on Computers and Communications. 2002. p. 959-966. 1021788 https://doi.org/10.1109/ISCC.2002.1021788
    Miyoshi, Takumi ; Shimizu, Shintaro ; Tanaka, Yoshiaki. / Fast topological design with simulated annealing for multicast networks. Proceedings - IEEE Symposium on Computers and Communications. 2002. pp. 959-966
    @inproceedings{6a40c59e5d4b431f87179591c865d5da,
    title = "Fast topological design with simulated annealing for multicast networks",
    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.",
    author = "Takumi Miyoshi and Shintaro Shimizu and Yoshiaki Tanaka",
    year = "2002",
    doi = "10.1109/ISCC.2002.1021788",
    language = "English",
    isbn = "0769516718",
    pages = "959--966",
    booktitle = "Proceedings - IEEE Symposium on Computers and Communications",

    }

    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 -