Browse > Article

Implementation of a QoS routing path control based on KREONET OpenFlow Network Test-bed  

Kim, Seung-Ju (Chungnam National University)
Min, Seok-Hong (Chungnam National University)
Kim, Byung-Chul (Chungnam National University)
Lee, Jae-Yong (Chungnam National University)
Hong, Won-Taek (Korea Institute of Science and Technology Information)
Publication Information
Journal of the Institute of Electronics Engineers of Korea TC / v.48, no.9, 2011 , pp. 35-46 More about this Journal
Abstract
Future Internet should support more efficient mobility management, flexible traffic engineering and various emerging new services. So, lots of traffic engineering techniques have been suggested and developed, but it's impossible to apply them on the current running commercial Internet. To overcome this problem, OpenFlow protocol was proposed as a technique to control network equipments using network controller with various networking applications. It is a software defined network, so researchers can verify their own traffic engineering techniques by applying them on the controller. In addition, for high-speed packet processing in the OpenFlow network, programmable NetFPGA card with four 1G-interfaces and commercial Procurve OpenFlow switches can be used. In this paper, we implement an OpenFlow test-bed using hardware-accelerated NetFPGA cards and Procurve switches on the KREONET, and implement CSPF (Constraint-based Shortest Path First) algorithm, which is one of popular QoS routing algorithms, and apply it on the large-scale testbed to verify performance and efficiency of multimedia traffic engineering scheme in Future Internet.
Keywords
Future Internet; OpenFlow; NetFPGA; NOX controller; QoS routing; CSPF;
Citations & Related Records
연도 인용수 순위
  • Reference
1 NOX 컨트롤러, http://noxrepo.org
2 D. Awduche, J. Malcolm, J. Agogbua and J. McManus, "Requirements for Traffic Engineering Over MPLS", IETF RFC2702, September 1999.
3 Ziegelmann and Mark, "Constrained Shortest Paths and Related Problems : Constrained Network Optimization", VDM Verlag Dr. Muller. ISBN 978-3-8364-4633-4. December 2007
4 OpenFlow, http://OpenFlow.org
5 NetFPGA, http://netfpga.org
6 DVTS, http://www.internet2.edu/communities/dvts/
7 Spanning Tree protocol 어플리케이션, http://www.openflowswitch.org/wk/index.php/Basic_Spanning_Tree
8 Dijkstra, E. W. (1959). "A note on two problems in connexion with graphs". Numerische Mathematik 1: 269-271   DOI   ScienceOn
9 iperf, http://sourceforge.net/projects/iperf/
10 OpenWRT, http://www.openwrt.org/