Edge-based traffic engineering for OSPF networks
作者: Jun WangYaling YangLi XiaoKlara Nahrstedt
作者单位: 1Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801-2302, United States
刊名: Computer Networks, 2004, Vol.48 (4), pp.605-625
来源数据库: Elsevier Journal
DOI: 10.1016/j.comnet.2004.11.008
关键词: Traffic engineeringOSPFEdge-basedTraffic setMathematical programming/optimization
英文摘要: Abstract(#br)This paper proposes and evaluates a novel, edge-based approach, which we call the k -set Traffic Engineering (TE) method, to perform traffic engineering in OSPF networks by partitioning traffic into uneven k -traffic sets. The traffic partitioning and splitting takes place only at network edges, leaving the core simple. We theoretically prove that if k is large enough, the k -set TE method achieves the general optimal traffic engineering where full-mesh overlaying and arbitrary traffic splitting, such as in MPLS, have to be used. We give an upper bound of the smallest k that achieves such a general optimum. In addition, we provide a constant worst case performance bound if k is smaller than the optimal k . Finding the optimal traffic splitting and routing for a given k is...
全文获取路径: Elsevier  (合作)
影响因子:1.231 (2012)

  • Edge 边缘滤器
  • engineering 工程
  • optimization 最佳化
  • traffic 话务量
  • based 基于
  • programming 程序设计