• Title/Summary/Keyword: SDN Routing

Search Result 38, Processing Time 0.019 seconds

Violation Detection of Application Network QoS using Ontology in SDN Environment (SDN 환경에서 온톨로지를 활용한 애플리케이션 네트워크의 품질 위반상황 식별 방법)

  • Hwang, Jeseung;Kim, Ungsoo;Park, Joonseok;Yeom, Keunhyuk
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.6
    • /
    • pp.7-20
    • /
    • 2017
  • The advancement of cloud and big data and the considerable growth of traffic have increased the complexity and problems in the management inefficiency of existing networks. The software-defined networking (SDN) environment has been developed to solve this problem. SDN enables us to control network equipment through programming by separating the transmission and control functions of the equipment. Accordingly, several studies have been conducted to improve the performance of SDN controllers, such as the method of connecting existing legacy equipment with SDN, the packet management method for efficient data communication, and the method of distributing controller load in a centralized architecture. However, there is insufficient research on the control of SDN in terms of the quality of network-using applications. To support the establishment and change of the routing paths that meet the required network service quality, we require a mechanism to identify network requirements based on a contract for application network service quality and to collect information about the current network status and identify the violations of network service quality. This study proposes a method of identifying the quality violations of network paths through ontology to ensure the network service quality of applications and provide efficient services in an SDN environment.

Link Stability aware Reinforcement Learning based Network Path Planning

  • Quach, Hong-Nam;Jo, Hyeonjun;Yeom, Sungwoong;Kim, Kyungbaek
    • Smart Media Journal
    • /
    • v.11 no.5
    • /
    • pp.82-90
    • /
    • 2022
  • Along with the growing popularity of 5G technology, providing flexible and personalized network services suitable for requirements of customers has also become a lucrative venture and business key for network service providers. Therefore, dynamic network provisioning is needed to help network service providers. Moreover, increasing user demand for network services meets specific requirements of users, including location, usage duration, and QoS. In this paper, a routing algorithm, which makes routing decisions using Reinforcement Learning (RL) based on the information about link stability, is proposed and called Link Stability aware Reinforcement Learning (LSRL) routing. To evaluate this algorithm, several mininet-based experiments with various network settings were conducted. As a result, it was observed that the proposed method accepts more requests through the evaluation than the past link annotated shorted path algorithm and it was demonstrated that the proposed approach is an appealing solution for dynamic network provisioning routing.

Blocking Intelligent Dos Attack with SDN (SDN과 허니팟 기반 동적 파라미터 조절을 통한 지능적 서비스 거부 공격 차단)

  • Yun, Junhyeok;Mun, Sungsik;Kim, Mihui
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.1
    • /
    • pp.23-34
    • /
    • 2022
  • With the development of network technology, the application area has also been diversified, and protocols for various purposes have been developed and the amount of traffic has exploded. Therefore, it is difficult for the network administrator to meet the stability and security standards of the network with the existing traditional switching and routing methods. Software Defined Networking (SDN) is a new networking paradigm proposed to solve this problem. SDN enables efficient network management by programming network operations. This has the advantage that network administrators can flexibly respond to various types of attacks. In this paper, we design a threat level management module, an attack detection module, a packet statistics module, and a flow rule generator that collects attack information through the controller and switch, which are components of SDN, and detects attacks based on these attributes of SDN. It proposes a method to block denial of service attacks (DoS) of advanced attackers by programming and applying honeypot. In the proposed system, the attack packet can be quickly delivered to the honeypot according to the modifiable flow rule, and the honeypot that received the attack packets analyzed the intelligent attack pattern based on this. According to the analysis results, the attack detection module and the threat level management module are adjusted to respond to intelligent attacks. The performance and feasibility of the proposed system was shown by actually implementing the proposed system, performing intelligent attacks with various attack patterns and attack levels, and checking the attack detection rate compared to the existing system.

Multicast Tree Generation using Meta Reinforcement Learning in SDN-based Smart Network Platforms

  • Chae, Jihun;Kim, Namgi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3138-3150
    • /
    • 2021
  • Multimedia services on the Internet are continuously increasing. Accordingly, the demand for a technology for efficiently delivering multimedia traffic is also constantly increasing. The multicast technique, that delivers the same content to several destinations, is constantly being developed. This technique delivers a content from a source to all destinations through the multicast tree. The multicast tree with low cost increases the utilization of network resources. However, the finding of the optimal multicast tree that has the minimum link costs is very difficult and its calculation complexity is the same as the complexity of the Steiner tree calculation which is NP-complete. Therefore, we need an effective way to obtain a multicast tree with low cost and less calculation time on SDN-based smart network platforms. In this paper, we propose a new multicast tree generation algorithm which produces a multicast tree using an agent trained by model-based meta reinforcement learning. Experiments verified that the proposed algorithm generated multicast trees in less time compared with existing approximation algorithms. It produced multicast trees with low cost in a dynamic network environment compared with the previous DQN-based algorithm.

Design and Implementation of an Automated Inter-connection Tool for Multi-Point OpenFlow Sites (다지점 오픈플로우 사이트들을 위한 자동화된 연동 도구의 설계 및 구현)

  • Na, TaeHeum;Kim, JongWon
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.1-12
    • /
    • 2015
  • To realize futuristic services with agility, the role of the experimental facility (i.e., testbed) based on integrated resources has become important, so that developers can flexibly utilize the dynamic provisioning power of software-defined networking and cloud computing. Following this trend, an OpenFlow-based SDN testbed environment, denoted as OF@TEIN, connects multiple sites with unique SmartX Racks (i.e., virtualization-enabled converged resources). In this paper, in order to automate the multi-point L2 (i.e., Ethernet) inter-connection of OpenFlow islands, we introduce an automated tool to configure the required Network Virtualization using Generic Routing Encapsulation (NVGRE) tunneling. With the proposed automation tool, the operators can efficiently and quickly manage network inter-connections among multiple OpenFlow sites, while letting developers to control their own traffic flows for service realization experiments.

SD-ICN: Toward Wide Area Deployable Software Defined Information Centric Networking

  • Xing, Changyou;Ding, Ke;Hu, Chao;Chen, Ming;Xu, Bo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.5
    • /
    • pp.2267-2285
    • /
    • 2016
  • Information Centric Networking that uses content name instead of IP address as routing identifier can handle challenges such as traffic explosion and user mobility, but it also suffers from scalability and incompatibility problems. In this paper by combining the concept of software defined networking and Internet end to end arguments, we propose a wide area deployable software defined information centric networking service model named SD-ICN. SD-ICN employs a dual space structure that separates edge service network and core transmission network. The enhanced SDN techniques are used in edge service network in order to implement intelligent data routing and caching, while traditional IP technique is reserved in core transmission network so as to provide wide area high speed data transmission. Besides, a distributed name resolution system based on the cooperation of different controllers is also presented. The prototype experiments in our campus network show that SD-ICN can be deployed in a scalable and incremental way with no modification of the core network, and can support typical communication modes such as multicast, mobility, multihoming, load balancing, and multipath data transmission effectively.

A Dynamic Placement Mechanism of Service Function Chaining Based on Software-defined Networking

  • Liu, Yicen;Lu, Yu;Chen, Xingkai;Li, Xi;Qiao, Wenxin;Chen, Liyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.10
    • /
    • pp.4640-4661
    • /
    • 2018
  • To cope with the explosive growth of Internet services, Service Function Chaining (SFC) based on Software-defined Networking (SDN) is an emerging and promising technology that has been suggested to meet this challenge. Determining the placement of Virtual Network Functions (VNFs) and routing paths that optimize the network utilization and resource consumption is a challenging problem, particularly without violating service level agreements (SLAs). This problem is called the optimal SFC placement problem and an Integer Linear Programming (ILP) formulation is provided. A greedy heuristic solution is also provided based on an improved two-step mapping algorithm. The obtained experimental results show that the proposed algorithm can automatically place VNFs at the optimal locations and find the optimal routing paths for each online request. This algorithm can increase the average request acceptance rate by about 17.6% and provide more than 20-fold reduction of the computational complexity compared to the Greedy algorithm. The feasibility of this approach is demonstrated via NetFPGA-10G prototype implementation.

A Network-based Locator-Identifier Separation Scheme using DHT in SDN (SDN환경에서 DHT를 이용한 네트워크 기반 위치자-식별자 분리 기술)

  • Lee, Chan-Haeng;Min, Sung-Gi;Choi, Chang-Won
    • Journal of Internet of Things and Convergence
    • /
    • v.2 no.2
    • /
    • pp.37-49
    • /
    • 2016
  • An IP address is used as a host identifier and a locator to bind hosts and applications to their location in existing Internet. Several protocols are proposed to eliminate this binding. Most of these protocols use IPv6-based host identifiers to maintain compatibility with existing Internet, but these identifiers cannot be handled by standard IPv6 routers because such identifiers are unroutable. Therefore, host identifiers need to be usually converted to locators at hosts, and the standard IPv6 protocol should be modified to interoperate with these protocols. In this paper, we propose a network-based host identifier locator separating scheme in software-defined networking. The proposed scheme separates the underlying network into Host Identity and IP domains in order to directly forward unroutable identifiers. The Host Identity domain operates as an overlaid network over IP domain, and it makes the unroutable identifiers to be routable using distributed hash table based routing strategy. For the evaluation, we compared the proposed scheme with the previous scheme using signaling costs and packet delivery costs. The result shows that the proposed scheme is more suitable in the recent mobile-based environments.

Weight Adjustment Scheme Based on Hop Count in Q-routing for Software Defined Networks-enabled Wireless Sensor Networks

  • Godfrey, Daniel;Jang, Jinsoo;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.1
    • /
    • pp.22-30
    • /
    • 2022
  • The reinforcement learning algorithm has proven its potential in solving sequential decision-making problems under uncertainties, such as finding paths to route data packets in wireless sensor networks. With reinforcement learning, the computation of the optimum path requires careful definition of the so-called reward function, which is defined as a linear function that aggregates multiple objective functions into a single objective to compute a numerical value (reward) to be maximized. In a typical defined linear reward function, the multiple objectives to be optimized are integrated in the form of a weighted sum with fixed weighting factors for all learning agents. This study proposes a reinforcement learning -based routing protocol for wireless sensor network, where different learning agents prioritize different objective goals by assigning weighting factors to the aggregated objectives of the reward function. We assign appropriate weighting factors to the objectives in the reward function of a sensor node according to its hop-count distance to the sink node. We expect this approach to enhance the effectiveness of multi-objective reinforcement learning for wireless sensor networks with a balanced trade-off among competing parameters. Furthermore, we propose SDN (Software Defined Networks) architecture with multiple controllers for constant network monitoring to allow learning agents to adapt according to the dynamics of the network conditions. Simulation results show that our proposed scheme enhances the performance of wireless sensor network under varied conditions, such as the node density and traffic intensity, with a good trade-off among competing performance metrics.

Contents Routing in the OpenFlow-based Wireless Mesh Network Environment (OpenFlow기반 무선 메쉬 네트워크 환경에서의 컨텐츠 라우팅)

  • Kim, Won-Suk;Chung, Sang-Hwa;Choi, Hyun-Suk;Do, Mi-Rim
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.810-823
    • /
    • 2014
  • The wireless mesh network based on IEEE 802.11s provides a routing based on a destination address as it inherits legacy internet architecture. However, this architecture interested in not 'what' which is originally the users goal but 'where'. Futhermore, because of the rapid increase of the number of mobile devices recently, the mobile traffic increases geometrically. It reduces the network effectiveness as increasing many packets which have same payload in the situation of many users access to the same contents. In this paper, we propose an OpenFlow-based contents routing for the wireless mesh network(WMN) to solve this problem. We implement contents layer to the legacy network layer which mesh network uses and the routing technique based on contents identifier for efficient contents routing. In addition we provide flexibility as we use OpenFlow. By using this, we implement caching technique to improve effectiveness of network as decreasing the packet which has same payload in WSN. We measure the network usage to compare the flooding technique, we measure the delay to compare environment using caching and non caching. As a result of delay measure it shows 20% of performance improve, and controller message decrease maximum 89%.