Rules Placement with Delay Guarantee in Combined SDN Forwarding Element = Rules Placement with Delay Guarantee in Combined SDN Forwarding Element

다국어 초록 (Multilingual Abstract)

Recent studies have shown that the flow table size of hardware SDN switch cannot match the number of concurrent flows. Combined SDN Forwarding Element (CFE), which comprises several software switches and a hardware switch, becomes an alternative approach to tackle this problem. Due to the limited capacity of software switch, the way to route concurrent flows in CFE can largely affect the maximum delay that a flow suffers at CFE. As delay-guarantee is a nontrivial task for network providers with the increasing number of delay-sensitive applications, we propose an analytical model of CFE to evaluate a rules placement solution first. Next, we formulate the problem of Rules Placement with delay guarantee in CFE (RPCFE), and present the genetic-based rules placement (GARP) algorithm to solve the RPCFE problem. Further, we validate the analytical model of CFE through simulations in NS-3 and compare the performance of GARP with three benchmark algorithms.

참고문헌 (Reference)

1 M. Ku´zniar, "What you need to know about sdn flow tables" 347-359, 2015

2 L D. Whitley, "The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best" 116-123, 1989

3 "Tcams and openflow: What every sdn practitioner must know"

4 A. Lazaris, "Tango: Simplifying sdn control with automatic switch property inference, abstraction, and optimization" 199-212, 2014

5 A. Lazaris, "Tango: Simplifying sdn control with automatic switch property inference, abstraction, and optimization" 199-212, 2014

6 S. Banerjee, "Tag-in-tag: Efficient flow table management in sdn switches" 109-117, 2014

7 X. Cao, "Synchronized multi-hop scheduling for real-time traffic on sdns" 1-8, 2015

8 T. Maksymyuk, "Software defined optical switching for cloud computing transport systems" 1-2, 2015

9 X. N. Nguyen, "Rules placement problem in openflow networks: a survey" 18 (18): 1273-1286, 2015

10 M. Klymash, "Research and development the methods of quality of service provision in Mobile Cloud systems" 160-164, 2014

11 N. Mehravari, "Queueing Theory" John Wiley and Sons, Inc. 2001

12 F. Ciucu, "Perspectives on network calculus: no free lunch, but still good value" 311-322, 2012

13 C.S. Chang, "Performance guarantees in communication networks" Springer Science & Business Media 2012

14 "OpenFlow 1.0.0 Specification"

15 X. N. Nguyen, "OFFICER: A general optimization framework for OpenFlow rule allocation and endpoint policy enforcement" 478-486, 2015

16 J. L. Boudec, "Network calculus: a theory of deterministic queuing systems for the internet" Springer-Verlag 2001

17 J. L. Boudec, "Network calculus: a theory of deterministic queuing systems for the internet" Springer-Verlag 2001

18 Y. Jiang, "Network calculus and queueing theory: Two sides of one coin: Invited paper" 37:1-37:12, 2009

19 K. Phemius, "Monitoring latency with openflow" 122-125, 2013

20 M. Kobayashi, "Maturing of openflow and software-defined networking through deployments" 61 : 151-175, 2014

21 J. Y. Leung, "Handbook of scheduling: algorithms, models, and performance analysis" CRC Press 2004

22 K. Kannan, "Flowmaster: Early eviction of dead flow on sdn switches" 484-498, 2014

23 X. Wang, "Dutycon: a dynamic duty cycle control approach to end-to-end delay guarantees in wireless sensor networks" 9 (9): 42-, 2013

24 M. Selmchenko, "Development of monitoring system for end-to-end packet delay measurement in software-defined networks" 667-670, 2016

25 N. Katta, "Cacheflow: Dependency-aware rule-caching for software-defined networks" 6:1-6:12, 2016

26 J. Y. L. Boudec, "Application of network calculus to guaranteed service networks" 44 (44): 1087-1096, 1998

27 "ACL and QoS Command Reference"

28 E. J. Rosensweig, "A network calculus for cache networks" 85-89, 2013