Genetic Algorithms for Network Optimization

被引：1

作者：

Kosinski, Witold ^{[1
]}

Mikolajewski, Daniel ^{[2
]}

机构：

[1] Polish Japanese Inst Informat Technol, Dept Comp Sci, Koszykowa Str 86, PL-02008 Warsaw, Poland

[2] Kazimierz Wielki Univ, Fac Math Phys & Technol, PL-85064 Bydgoszcz, Poland

来源：

2009 INTERNATIONAL CONFERENCE ON COMPUTATIONAL ASPECTS OF SOCIAL NETWORKS, PROCEEDINGS | 2009年

关键词：

D O I：

10.1109/CASoN.2009.19

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Whereas multicast transmission in one-to-many communications allows the operator to save drastically network resources, it also makes the routing of the traffic flows more complex than in unicast transmissions. The use of the genetic algorithms (GA) is presented, which can considerably reduce the number of solutions to be evaluated and helps to find the appropriate combination of the frees to comply with the bandwidth needs of the group of point-to-point links and then of the group of multicast sessions.

引用

页码：171 / +

页数：3

共 23 条

[1]

Banerjee N, 2001, 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, P2588, DOI 10.1109/ICC.2001.936617

[2]

Bartlett C, 2005, HEALTH TECHNOL ASSES, V9, P1

[3]

Bertsekas D., 1992, DATA NETWORK, VSecond

[4]

DENGIZ B, 1997, P 7 INT C GEN ALG IC, P650

[5]

DEO N, 1980, TEORIA GRAFW JEJ ZAS

[6] Topological design of local-area networks using genetic algorithms [J].

Elbaum, R ;

Sidi, M .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1996, 4 (05) :766-778

[7] COMPUTING NEAR-OPTIMAL SOLUTIONS TO THE STEINER PROBLEM IN A GRAPH USING A GENETIC ALGORITHM [J].

ESBENSEN, H .

NETWORKS, 1995, 26 (04) :173-185

[8]

Goldberg D. E., 1989, Genetic algorithms in machine learning, search and optimization

[9]

Hakimi S. L., 1971, Networks, V1, P113, DOI 10.1002/net.3230010203

[10]

Holland I.H., 1975, ADAPTATION NATURAL A

← 1 2 3 →