Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for integrating covering method to obtain service node in SDN based on greedy algorithm

A service node and greedy algorithm technology, applied in the field of computer networks, can solve problems affecting the control logic performance of the controller, achieve superior performance, simple algorithm thinking, and reduce load

Active Publication Date: 2014-06-25
XI AN JIAOTONG UNIV
View PDF5 Cites 26 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

SDN technology realizes the separation of control and data forwarding technology, but because network events may occur on any switch or end host, the delay between the controller and the switch will affect the control logic performance of the controller

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for integrating covering method to obtain service node in SDN based on greedy algorithm
  • Method for integrating covering method to obtain service node in SDN based on greedy algorithm
  • Method for integrating covering method to obtain service node in SDN based on greedy algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0050] In order to make the content, effects and advantages of the present invention clearer, the present invention will be further elaborated below in conjunction with the accompanying drawings and specific implementation examples.

[0051] The method of selecting service nodes in the SDN network based on the set coverage method of the greedy algorithm in the present invention refers to the selection algorithm of the super node in the mobile peer-to-peer network, and is used to select the service nodes in the SDN network on the basis of improving it. SDN technology realizes the separation of control and data forwarding technology, but because network events may occur on any switch or end host, the delay between the controller and the switch will affect the control logic performance of the controller.

[0052] like Figure 7 As shown, the present invention provides a kind of method based on the set coverage method of greedy algorithm to obtain the service node in the SDN netwo...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for integrating a covering method to obtain a service node in the SDN based on a greedy algorithm. The method comprises the steps that (1), the balance indexes of nodes are determined, and comprehensive ability values of the nodes in an autonomous domain are obtained according to a data fuzzy normalization method; (2), the node with the highest comprehensive ability value in the covering autonomous domain is selected through the greedy algorithm; (3), the node with the highest comprehensive ability value is determined as the service node, and adjacent nodes become sub-nodes of the service node; (4), a set, composed of the service node and the sub-nodes, in the network is removed; (5), the step (2), the step (3) and the step (4) are carried out repeatedly until no candidate network node exists in the network, wherein the determined service node is the final service node of the SDN. According to the method for integrating the covering method to select the service node, every time when the service node is selected, nodes adjacent to the service node do not need to participate in later selection, and thus the algorithm has the good performance in time complexity.

Description

technical field [0001] The invention relates to the field of computer networks, in particular to a method for obtaining service nodes in an SDN network by a set covering method based on a greedy algorithm. Background technique [0002] With the continuous expansion of the network scale and the increasingly rich types of applications, the functions and structures of the Internet have become more and more complex, which undoubtedly puts heavy pressure on the management and control layer, which is increasingly overwhelmed and the management and control capabilities continue to weaken. In particular, routers as the core of the network carry more and more functions, which makes the data forwarding unit very bloated, and it is difficult to return to the originally defined simple data forwarding unit. We urgently need to find a new, simple way to redeploy and design routers to solve many problems faced by the TCP / IP architecture, instead of performing performance on the existing ba...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/751H04L12/24H04L45/02
Inventor 曲桦赵季红张方戴慧珺
Owner XI AN JIAOTONG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products