Flow-Based Routing for Flow Entry Aggregation in Software-Defined Networking

• YOSHIOKA Koichi

  Graduate School of Science and Engineering, Kansai University

• HIRATA Kouji

  Faculty of Engineering Science, Kansai University

• YAMAMOTO Miki

  Faculty of Engineering Science, Kansai University

抄録

In recent years, software-defined networking (SDN), which performs centralized network management with software, has attracted much attention. Although packets are transmitted based on flow entries in SDN switches, the number of flow entries that the SDN switches can handle is limited. To overcome this difficulty, this paper proposes a flow-based routing method that performs flexible routing control with a small number of flow entries. The proposed method provides mixed integer programming. It assigns common paths to flows that can be aggregated at intermediate switches, while considering the utilization of network links. Because it is difficult for mixed integer programming to compute large-scale problems, the proposed method also provides a heuristic algorithm for them. Through numerical experiments, this paper shows that the proposed method efficiently reduces both the number of flow entries and the loads of congested links.

収録刊行物

• IEICE Transactions on Communications

  IEICE Transactions on Communications E101.B (1), 49-57, 2018

  一般社団法人 電子情報通信学会

キーワード

• software-defined networking
• flow entry
• routing
• optimization

詳細情報

• CRID: 1390282679353343616
• NII論文ID: 130006301133
• DOI: 10.1587/transcom.2017itp0007
• ISSN: 17451345
• ISSN: 09168516
• Web Site: https://www.jstage.jst.go.jp/article/transcom/E101.B/1/E101.B_2017ITP0007/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可