A Priority-based Genetic Algorithm for Solving OSPF Routing Problem

カテゴリ: 部門大会

論文No: OS6-1

グループ名: 【C】平成16年電気学会電子・情報・システム部門大会講演論文集

発行日: 2004/09/02

タイトル(英語): A Priority-based Genetic Algorithm for Solving OSPF Routing Problem

著者名: 林 林(早稲田大学),玄 光男(早稲田大学)

著者名(英語): Lin Lin(Waseda University),Mitsuo Gen(Waseda University)

キーワード: Open Shortest Path First|Shortest Path Routing Problem|Genetic Algorithm

要約(日本語): With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used protocol. In OSPF, traffic is routed using paths that are shortest with respect to a set of link costs. A problem that has been studied recently is the optimization of OSPF link costs. In this paper, we present a Genetic Algorithm (GA) approach to the Shortest Path Routing (SPR) problem in OSPF. The proposed method adopts priority-based encoding method to represent a path in the network. Numerical analysis shows the efficiency and effectiveness of the GA approach on the SPR problem.

PDFファイルサイズ: 9,675 Kバイト