An Integrated Approach for Monitoring Service Level Parameters of Software-Defined Networking

Transcription

1 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15), pp An Integrated Approach for Monitoring Service Level Paraeters of Software-Defined Networking Hui Xu and Hongwei Chen School of Coputer Science, Hubei University of Technology, Wuhan, China uhui@ail.hbut.edu.cn Abstract Software-Defined Networking (SDN) is a new-generation network that decouples the control plane and the data plane, and an additional anageent plane still lacks a ature ipleentation solution. In this case, onitoring service level paraeters is of great significance to study issues related to service anageent for SDN. This paper then ais to apply the queuing theory and the etension theory to onitor service level paraeters of SDN and propose an integrated approach based on both two theories fro the foralization point of view. Siulation result and scenario analysis validate that, the proposed integrated approach prospects a feasible way of foralizing the solution to onitor service level paraeters of SDN. Keywords: Software-Defined Networking, service level paraeters, queuing theory, etension theory, integration 1. Introduction Copared to coputer networking, Software-Defined Networking (SDN) tries to decouple the control plane and the data plane, and an additional anageent plane for SDN sees to be in need, but this anageent plane still lacks a ature ipleentation solution [1]. In this case, SDN services are provided by SDN service providers to eet the requireents of SDN service users, and as for SDN service users and providers, the specification of services in SDN needs to be seriously considered by ters of a targeted service level. Service Level Agreeent (SLA) is then introduced to define specific perforance etrics and acceptable levels of network-provider perforance with respect to these etrics []. SLA consists of service level objectives, and one ain subject of service level objects is to onitor service level paraeters. Siilar to coputer networking, service level paraeters of SDN are used to describe the level of service provided by SDN service providers for SDN service users. Thus, onitoring service level paraeters is of great iportance to study issues related to service anageent for SDN. This paper then tries to propose an integrated approach based on both the queuing theory and the etension theory, in order to proote the foralization on onitoring service level paraeters of SDN. The reainder of this paper is organized as follows. Section considers the use of Manageent Inforation Base (MIB) for onitoring service level paraeters of SDN. Section 3 then proposes an integrated approach based on both the queuing theory and the etension theory to proote the foralization on onitoring service level paraeters of SDN. Section 4 provides siulation result and scenario analysis in order to validate the feasibility of proposed integrated approach for foralizing the solution to onitor service level paraeters of SDN. Section 5 concludes this paper. ISSN: IJFGCN Copyright c 15 SERSC

2 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15). Manageent Inforation Base for Monitoring Service Level Paraeters of SDN Open Networking Foundation (ONF) is an organization to proote SDN standardizations, and it proposes the OpenFlow anageent and configuration protocol (OF-CONFIG, the newest version is 1. up to now) [3] for SDN anageent. OF-CONFIG adopts NETCONF [4] as the transport protocol, and current version 1. of OF-CONFIG uses the copanion YANG odule to realize its data odel. As the new-generation anageent inforation specification language proposed by Internet Engineering Task Force (IETF), YANG [5] can be used to define MIB as the data odel for onitoring service level paraeters of SDN. Figure 1 shows an eaple of anageent inforation definition using YANG fro ietf-interfaces MIB as specified in RFC 73 [6]. Figure 1. An Eaple of Manageent Inforation Definition fro Ietf- Interfaces Mib As is indicated in Figure 1, when YANG is utilized to specify MIBs related to service level paraeters of SDN, soe lessons ay be learned fro eisting anageent inforation definitions using Structure of Manageent Inforation version (SMIv), and in this eaple, the referred one is ifadinstatus in the Interfaces Group MIB fro RFC Proposed Integrated Approach for Monitoring Service Level Paraeters of SDN As for onitoring service level paraeters of SDN, the queuing theory is in favor of studying the regularity of the queuing odel to onitor service level paraeters of SDN. And based on this, the etension theory is integrated to prospect a proising solution to the quantitative change in this contradictory proble for 198 Copyright c 15 SERSC

3 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15) onitoring service level paraeters of SDN. An integrated approach based on both two theories above is then proposed fro the foralization point of view Application of the Queuing Theory When applying the queuing theory [7], the assuptions are that SDN assigns anageent processes independent of each other for job requests fro SDN service users, and both job requests and anageent processes are supposed to be negative eponential distribution, epressed as Definition 1. Definition 1 Assue that is a rando variable and its probability density function is f t e, t, t t, then it indicates that follows the negative eponential distribution, with its distribution function as (1) F t 1 e, t, t t () If follows the negative eponential distribution as Definition 1, the atheatical 1 epectation of is, and the variance of is. As for the case of onitoring service level paraeters of SDN, job requests fro SDN users are supposed to be negative eponential distribution of paraeter, and anageent processes fro SDN service providers independent of each other are supposed to be negative eponential distribution of paraeter. Thus fro the viewpoint of the queuing theory, onitoring service level paraeters of SDN can be seen as the M / M / / FCFS queuing odel, in which M eans eponential distribution, is the assued nuber of anageent processes independent of each other assigned by SDN for job requests fro SDN service users, and FCFS indicates the First Coe First Serve principle. In this queuing odel for onitoring service level paraeters of SDN, p P X,1,,... is introduced to define the possibility distribution for the nuber of SDN service users naed as X. And since there are anageent processes assigned by SDN for job requests fro SDN service users, then 1,,1,,... (3),1 1, (4) Suppose and, when 1, according to the queuing theory, the possibility of idle state for anageent processes is p 1!! 1 1 (5) Copyright c 15 SERSC 199

4 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15) Based on Forula (5), p can be calculated as p p!!,1 1 p, As is indicated in Forula (6), when, the net job request fro SDN service users ust wait, thus the Erlang waiting Forula then provides the possibility of the request waiting for anageent processes assigned by SDN as w, p (6) (7)! 1 The average queue length for this queuing odel to onitor service level paraeters of SDN can then be defined as L q p! 1 w, 1 Based on Forula (8), the average length for this queuing odel to onitor service level paraeters of SDN can be defined as L L q According to Little Forula, the average waiting tie T w tie T s can then be calculated as (8) (9) and the average staying L q T (1) w L T (11) s 3.. Integration with the Etension Theory Based on the proposed queuing odel for onitoring service level paraeters of SDN, the quantitative change in this contradictory proble ust be seriously considered fro the viewpoint of foralization. Thus in this case, the etension theory etends the concept of distance to the concept of etension distance [8], and the etension distance uses the negative value to indicate the distance between the point in a section and the section itself. Definition and Definition 3 respectively epress the etension distance between a detected value fro onitoring the service level paraeter of SDN and one value doain or two value doains. Definition Assue that V, y is the acceptable value doain of a service level paraeter of SDN in the real field, and v is a detected value fro onitoring this service level paraeter, then the etension distance between v and V is defined as d v, V v (1) y y Copyright c 15 SERSC

5 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15) Definition 3 Assue that V, y and V, y are respectively the acceptable value doain and the coplete value doain of a service level paraeter of SDN in the real field, V V and v is a detected value fro onitoring this service level paraeter, then the etension distance between v and these two related value doains V and V is defined as D v, V, V d v, V d v V (13), Based on the etension distance forally specified by Definition and Definition 3, the dependent function is then introduced by the etension theory to describe the degree of which things have a certain property according to historical data or professional standards [8]. As for the case of onitoring service level paraeters of SDN, the dependent function is utilized to avoid subjective judgent, and with the use of the acceptable value doain and the coplete value doain, the association degree can be confired by the dependent function, epressed as Definition 4. Definition 4 Assue that V, y and V, y are respectively the acceptable value doain and the coplete value doain of a service level paraeter of SDN in the real field, and v is a detected value fro onitoring this service level paraeter, then the dependent function between v and these two related doains V and V is defined as v d v, V, D v, V, V, v V D, V, V, D v, V, V, v V, v V a v d v, V 1, D v, V, V, v V (14) As is indicated in Definition 4, the dependent function is utilized to ipleent the quantitative description of the association degree for the detected value fro onitoring the specific service level paraeter of SDN with its acceptable value doain and its coplete value doain. If a v, it eans that the detected value satisfies the acceptable value doain of this service level paraeter, and if a v, it reveals that the detected value is not related to the acceptable value doain of this service level paraeter. However, when 1 a v, this unrelated situation can be iproved by eans of etension transforations based on the etension theory for the value of this service level paraeter relating to its acceptable value doain. 4. Validation In order to validate the feasibility of proposed integrated approach for prooting the foralization on onitoring service level paraeters of SDN, this section first siulates a queuing odel to onitor a specific service level paraeter that is the waiting tie, and then based on this, analyzes the corresponding scenario integrated with the etension theory. Copyright c 15 SERSC 1

6 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15) 4.1. Siulation Result As for proposed queuing odel to onitor the validated service level paraeter that is waiting tie, Node no. represents as an integrated anageent controller in SDN, and Node no. 1-1 are used for the purpose of distributed anageent in SDN. If at least one of Node no. 1-1 is changed in the service rate, it ay play a great influence on onitoring the waiting tie. Here, take Node no. 8 for eaple, and the nuber of jobs is set to 6. When the service rate for Node no. 8 varies fro.1 to 1., the waiting tie for Node no. will change accordingly, as deonstrated in Figure. Figure. Waiting Tie for Node No. with the Changing Service Rate For Node No Scenario Analysis Based on the siulation result above, this part discusses validation of proposed approach integrated with the etension theory. Consider the scenario of the waiting tie for Node no. above. Assue that, the acceptable value doain and the coplete value doain of the waiting tie for Node no. are respectively V,4 andv,1, and current detected value of the waiting tie for Node no. fro onitoring SDN is v a) According to Forula (1), d v, V 6 and 1 1 d v, V 6 6. b) In this scenario v V, then according to Forula (13), v V, V d v, V d v, V 6 8 D., c) In this scenario D v, V, V, v V, hence according to Forula (14), d v, V 1 a v, which reveals that current detected value is not D v, V, V 8 4 related to the acceptable value doain of the waiting tie for Node no.. However, Copyright c 15 SERSC

7 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15) 1 since 1 a v, this unrelated situation can be iproved by eans of 4 etension transforations based on the etension theory for the value of the waiting tie for Node no. relating to its acceptable value doain. 5. Conclusions The ain contribution of this paper is to study issues related to service anageent for SDN fro the viewpoint of onitoring service level paraeters, and to propose an integrated approach based on both the queuing theory and the etension theory, so as to proote the foralization on onitoring service level paraeters of SDN. Siulation result and scenario analysis validate the feasibility of proposed integrated approach for foralizing the solution to onitor service level paraeters of SDN. Acknowledgents This work has been supported by the Eergency Manageent Progra for National Natural Science Foundation of China (No ), the Provincial Teaching Refor Research Project of Education Departent of Hubei Province in China (No. 173), the Doctoral Scientific Research Fund fro Hubei University of Technology (No. BSQD19), the National Natural Science Foundation of China for Young Scholars (No. 6187, No ) and the General Progra for National Natural Science Foundation of China (No ). The authors would like to thank all project partners for their valuable contributions and feedbacks. References [1] S. Kuklinski and P. Cheouil, Network Manageent Challenges in Software-Defined Networks, IEICE Transactions on Counications, vol. E97-B, no. 1, (14), pp. -9. [] G. Huston, Interconnection, Peering, and Settleents-Part I The Internet Protocol Journal, vol., no. 1, (1999), pp [3] Open Networking Foundation, OpenFlow Manageent and Configuration Protocol 1. (OF-CONFIG 1.), Available: (15). [4] R. Enns, M. Bjorklund, J. Schoenwaelder and A. Bieran, eds, Network Configuration Protocol (NETCONF), RFC641, (11). [5] M. Bjorklund ed, YANG-A Data Modeling Language for the Network Configuration Protocol (NETCONF), RFC6, (1). [6] M. Bjorklund and A. Yang, Data Model for Interface Manageent, RFC73, (14). [7] D. Gross, J.F. Shortle, J.M. Thopson and C.M. Harris, Fundaental of Queuing Theory (Fourth Edition), Wiley Press, (8). [8] C. Y. Yang and W. Cai, Recent Research Progress in Dependent Functions in Etension Sets, Journal of Guangdong University of Technology, vol. 9, no., (1), pp Authors Hui Xu, she received a bachelor's degree in Coputer Science and Technology fro Huazhong Noral University, Wuhan, China in 5, a aster's degree in Coputer Application Technology fro Huazhong Noral University, Wuhan, China in 8, and a doctor's degree in Radio Physics fro Huazhong Noral University, Wuhan, China in 1. Since 6, she has been a certified coputer syste analyst in China. Now, she is an Associate Professor at the School of Coputer Science in Hubei University of Technology, Wuhan, China. Copyright c 15 SERSC 3

8 International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15) Currently, her ajor field of study is network and service anageent. Dr. Xu becae a Meber of Institute of Electrical and Electronics Engineers (IEEE) in 7, a Meber of Association for Coputing Machinery (ACM) in 7 and a Meber of China Coputer Federation (CCF) in 8. She has authored or coauthored 1 book and book chapters in the field of network anageent, about 1 papers published by Chinese journals, ore than 1 papers published by international journals, and ore than papers published by international conferences. In April 8, she was awarded by International Association of Engineers (IAENG) for her firstauthored paper presented to 8 IAENG International Conference on Counication Systes and Applications. Additionally, she was a Session Co-Chair or a Paper Reviewer for nd&3rd&7th&8th International Conference on Coputer Science and Education (ICCSE 7&8&1&13), a Session Chair for 1st International Syposiu on Electronic Coerce and Security (ISECS 8), a Paper Reviewer for 4th IEEE Conference on Industrial Electronics and Applications (ICIEA 9), a Paper Reviewer for 3rd International Conference on Coputer and Network Technology (ICCNT 11), a Paper Reviewer for 3nd Chinese Control Conference (CCC 13), and a Paper Reviewer for Security and Counication Networks, an international journal published by Wiley Press. Hongwei Chen, he is a Professor at the School of Coputer Science in Hubei University of Technology, Wuhan, China. Currently, his ajor field of study is distributed anageent. 4 Copyright c 15 SERSC