188宝金博页面版

  • 图案背景
  • 纯色背景
视图
标记
批注
批注本地保存成功，开通会员云端永久保存 去开通
zlmyl61

上传于：2015-12-31

粉丝量：0

该文档贡献者很忙，什么也没留下。


  • 相关
  • 目录
  • 笔记
  • 书签

188宝金博页面版:更多相关文档

  • 2nd POLISH-GERMAN TELETRAFFIC SYMPOSIUM PGTS 2002 9th Polish Teletraffic Symposium A HYBRID

    星级： 8 页

  • 2nd polish-german teletraffic symposium pgts 2002 9th polish teletraffic symposium a hybrid

    星级： 8 页

  • 【精品】2nd POLISH-GERMAN TELETRAFFIC SYMPOSIUM PGTS 2002 9th Polish Teletraffic Symposium AC ALGOR

    星级： 11 页

  • 2nd polish-german teletraffic symposium pgts 2002 9th polish teletraffic symposium ac algor

    星级： 11 页

  • 9th ifac symposium on

    星级： 2 页

  • 2nd annual symposium

    星级： 4 页

  • 2nd Gauss Symposium

    星级： 1 页

  • 9th Annual CERMM Symposium

    星级： 43 页

  • Polish-Soviet symposium

    星级： 4 页

  • icas 2002 symposium

    星级： 9 页

  • a symposium on “the

    星级： 33 页

  • A Symposium on

    星级： 25 页

  • What Is a Symposium

    星级： 2 页

  • symposium a

    星级： 56 页

  • （精品）SYMPOSIUM G（整理）

    星级： 10 页

暂无目录

点击鼠标右键菜单,创建目录

    暂无笔记

    选择文本，点击鼠标右键菜单，添加笔记

    暂无书签

    在左侧文档中，点击鼠标右键，添加书签

    188宝金博页面版: 【精品】2nd POLISH-GERMAN TELETRAFFIC SYMPOSIUM PGTS 2002 9th Polish Teletraffic Symposium A HYBRID

    下载积分： 900

    内容提示： 2nd POLISH-GERMAN TELETRAFFIC SYMPOSIUM PGTS 2002 9th Polish Teletraffic Symposium A HYBRID GENETIC ALGORITHM APPROACH FOR OSPF WEIGHT SETTING PROBLEM Eueung Mulyana, Ulrich Killat Department of Communication Networks, Technical University Hamburg-Harburg Denickestrasse 17, D-21073 Hamburg, Germany phone: (+49) 40-42878-2925, fax: (+49) 40-42878-2941 E-mail: mulyana@tu-harburg.de Abstract In this paper, a method based on hybrid genetic algorithm (GA), is presented to optimize administrative weights for O...

    文档格式：PDF | 页数：8 | 浏览次数：5 | 上传日期：2015-12-31 22:07:25 | 文档星级：
    2nd POLISH-GERMAN TELETRAFFIC SYMPOSIUM PGTS 2002 9th Polish Teletraffic Symposium A HYBRID GENETIC ALGORITHM APPROACH FOR OSPF WEIGHT SETTING PROBLEM Eueung Mulyana, Ulrich Killat Department of Communication Networks, Technical University Hamburg-Harburg Denickestrasse 17, D-21073 Hamburg, Germany phone: (+49) 40-42878-2925, fax: (+49) 40-42878-2941 E-mail: mulyana@tu-harburg.de Abstract In this paper, a method based on hybrid genetic algorithm (GA), is presented to optimize administrative weights for OSPF routing. This method can be seen as an alternative to the local-search method in [1] or another GA-based method in [8,10]. However, the GA as well as the objective function we use are different. Instead of minimizing a convex cost function we prefer to minimize the maximum and average utilization directly. This objective function is similar as one proposed in [6,7]. In addition we combine the population-based search feature of the GA with a search heuristic representing an individual-based search method and propose a new objective function to minimize weight changes for an existing operational network. We will demonstrate our method in a case of a small network and compare the results with MIP-based (Mixed Integer Programming) method from [6,7]. Afterwards we will show the results for a bigger network with increasing traffic demands, compared with the results of some conventional weight settings as well as with the lower bound of general optimal routing (linear program / LP solution). Keywords OSPF, genetic algorithm, traffic engineering, routing optimization 1. INTRODUCTION OSPF Routing. OSPF (Open Shortest Path First) is the most popular interior gateway protocol (IGP) used in today's IP networks. OSPF calculates routes as follows. Each link is assigned a dimensionless metric, called cost or weight. The cost of a path is the sum of link costs. Paths are selected using Dijkstra's shortest path algorithm. Given a network topology and predicted traffic demands, the OSPF weight setting problem is to find a set of OSPF weights that optimizes network performance. The chosen arc weights determine the shortest paths, which in turn completely determine the routing of traffic flows, the loads on the arcs and the

    阅读了该文档的用户还阅读了这些文档

    188宝金博页面版:关于我们

    188宝金博页面版:帮助中心

    188宝金博页面版:关注我们

    • 新浪微博

    关注188宝金博页面版公众号

    188宝金博页面版
    阅读
    APP
    阅读
    返回
    顶部
    188宝金博页面版官网登录在线平台入口（2026已更新）—江苏协昌电子科技股份有限公司