Application of genetic algorithms to VOD network topology optimization

Yoshiaki Tanaka, Olivier Berlage

    Research output: Contribution to journalArticle

    5 Citations (Scopus)

    Abstract

    In this paper, we point out an architecture optimization problem for networks delivering services such as Video-On-Demand or, more precisely, two intertwined problems, i.e., the storage allocation of the videos among the storage nodes of the network and the choice of the network topology. We present and investigate the properties of a genetic algorithm which can handle such problems. This algorithm, as well as a greedy heuristics and simulated annealing, are then used to derive solutions in function of link and node cost parameters in a 36-node network. The results show that genetic algorithms are an effective class of algorithms for such problems, and possibly many other topology optimization problems.

    Original languageEnglish
    Pages (from-to)1046-1052
    Number of pages7
    JournalIEICE Transactions on Communications
    VolumeE79-B
    Issue number8
    Publication statusPublished - 1996

    Fingerprint

    Shape optimization
    Genetic algorithms
    Video on demand
    Simulated annealing
    Topology
    Costs

    Keywords

    • \ideo-on-demand
    • Genetic
    • Network, topology
    • VOD

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Networks and Communications

    Cite this

    Application of genetic algorithms to VOD network topology optimization. / Tanaka, Yoshiaki; Berlage, Olivier.

    In: IEICE Transactions on Communications, Vol. E79-B, No. 8, 1996, p. 1046-1052.

    Research output: Contribution to journalArticle

    @article{a40ec156371743fc8532b29905eb54f9,
    title = "Application of genetic algorithms to VOD network topology optimization",
    abstract = "In this paper, we point out an architecture optimization problem for networks delivering services such as Video-On-Demand or, more precisely, two intertwined problems, i.e., the storage allocation of the videos among the storage nodes of the network and the choice of the network topology. We present and investigate the properties of a genetic algorithm which can handle such problems. This algorithm, as well as a greedy heuristics and simulated annealing, are then used to derive solutions in function of link and node cost parameters in a 36-node network. The results show that genetic algorithms are an effective class of algorithms for such problems, and possibly many other topology optimization problems.",
    keywords = "\ideo-on-demand, Genetic, Network, topology, VOD",
    author = "Yoshiaki Tanaka and Olivier Berlage",
    year = "1996",
    language = "English",
    volume = "E79-B",
    pages = "1046--1052",
    journal = "IEICE Transactions on Communications",
    issn = "0916-8516",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "8",

    }

    TY - JOUR

    T1 - Application of genetic algorithms to VOD network topology optimization

    AU - Tanaka, Yoshiaki

    AU - Berlage, Olivier

    PY - 1996

    Y1 - 1996

    N2 - In this paper, we point out an architecture optimization problem for networks delivering services such as Video-On-Demand or, more precisely, two intertwined problems, i.e., the storage allocation of the videos among the storage nodes of the network and the choice of the network topology. We present and investigate the properties of a genetic algorithm which can handle such problems. This algorithm, as well as a greedy heuristics and simulated annealing, are then used to derive solutions in function of link and node cost parameters in a 36-node network. The results show that genetic algorithms are an effective class of algorithms for such problems, and possibly many other topology optimization problems.

    AB - In this paper, we point out an architecture optimization problem for networks delivering services such as Video-On-Demand or, more precisely, two intertwined problems, i.e., the storage allocation of the videos among the storage nodes of the network and the choice of the network topology. We present and investigate the properties of a genetic algorithm which can handle such problems. This algorithm, as well as a greedy heuristics and simulated annealing, are then used to derive solutions in function of link and node cost parameters in a 36-node network. The results show that genetic algorithms are an effective class of algorithms for such problems, and possibly many other topology optimization problems.

    KW - \ideo-on-demand

    KW - Genetic

    KW - Network, topology

    KW - VOD

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

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

    M3 - Article

    VL - E79-B

    SP - 1046

    EP - 1052

    JO - IEICE Transactions on Communications

    JF - IEICE Transactions on Communications

    SN - 0916-8516

    IS - 8

    ER -