Method and system for scheduling middle boxes in software defined network

A software-defined network and scheduling method technology, applied in the field of middlebox scheduling, can solve the problems of increasing network packet delay, not being able to cope with dynamically changing flows, increasing flow delay, etc., and achieving good delay performance

Inactive Publication Date: 2015-07-22
SHENZHEN GRADUATE SCHOOL TSINGHUA UNIV
View PDF1 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0014] Before the emergence of the concept of network function virtualization, most Middlebox scheduling solutions were aimed at hardware Middlebox. In such an environment, the position of Middlebox is fixed and cannot be dynamically arranged according to the dynamic changes of traffic.
So in most of the previous solutions, the first problem was not solved
[0015] In addition, for the second question, the static configuration met

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 and system for scheduling middle boxes in software defined network
  • Method and system for scheduling middle boxes in software defined network
  • Method and system for scheduling middle boxes in software defined network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0119] This embodiment proposes a Middlebox dynamic deployment method to solve the above problems, which includes the following steps:

[0120] 1) Obtain a series of parameters: the distribution TList of the given flow, the network G, and the list MBNumList of the number of each Middlebox required.

[0121] Stream distribution TList is a list of streams, and each stream f can be expressed as a list, such as (src,dst,(MB a ,MB b ,MB c )) indicates that the flow f starts from the source point src to the destination point dst, and must be sequentially processed by Middleboxes of types a, b, and c. This processing sequence (service chain) can be represented by f.chain. For network G, G.plist represents a list of resource pools, and each resource pool can run N Middleboxes.

[0122] 2) Maintain a score table corresponding to all Middlebox types of all resource pools, and determine the placement position of Middlebox by simulating K rounds of voting. i resource pool p i The x-t...

Embodiment 2

[0139] A Middlebox flow scheduling method

[0140] In Embodiment 1, the Middlebox dynamic placement problem is described and related solutions are given. On this basis, flow scheduling is performed, and each flow is assigned to a specific Middlebox according to the processing sequence. Given the specific traffic distribution TList, the placement scheme pl, and the maximum tolerated delay r, the flow scheduling problem is calculated through the modified Viterbi algorithm (Masked-Viterbi). For each flow f, we call the optimal scheduling path the minimum delay path (Minimum Delay Path, MDP), and the scheduling problem is to find the minimum delay path for each flow in the TList.

[0141] Stream Scheduling Algorithm

[0142]The flow scheduling algorithm is divided into two stages. In the first stage, the minimum possible delay for each stream is calculated regardless of the Middlebox load. At this stage, we consider the processing delay of each Middlebox to be the basic delay, ...

Embodiment 3

[0173] In this embodiment, the main part is implemented in the controller in the software-defined network, and the Middlebox software needs to be modified to allow the Middlebox software to accept the control of the controller. The realization of the whole scheme is composed of the algorithm module in the controller, the Middlebox control module and the controller adaptation module in the Middlebox, such as image 3 shown. The algorithm is implemented in the algorithm module, the controller controls the Middlebox through the Middlebox control module, and the interaction between the Middlebox and the controller is realized through the controller adaptation module. This process is as follows: Figure 10 shown. The client sends a packet to the switch, and the switch queries the flow table. If the switch cannot find the corresponding flow table, it sends the packet to the controller. The controller runs an algorithm, calculates the flow table corresponding to the packet, and send...

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 and system for scheduling middle boxes in a software defined network. The method comprises the followings steps of obtaining a stream list and using the middle boxes to conduct corresponding processing on streams; obtaining the needed number n of each type of middle boxes; obtaining the network, wherein resource pools are distributed on the network; maintaining one score list, wherein the scores of all middle boxes in each resource pool are recorded in the score list, the x-type middle boxes MBx of the ith recource pool pi is represented by <pi, MBx>; rating the middle boxes, wherein each stream arriving at the shortest path possibly passed by the resource pools passes by the middle boxes, the score of the current middle box is in inverse correlation with the distance of the current stream from a current starting point to the current middle box, and the scores of the middle boxes are accumulated according to <pi, MBx>; sorting the aggregate scores of the middle boxes <pi, MBx> from big to small, and selecting the top five middle boxes MBx in the x-type middle boxes MBx as the middle boxes for processing streams.

Description

【Technical field】 [0001] The invention relates to the field of computer networks, in particular to a middlebox scheduling method and system in a software-defined network. 【Background technique】 [0002] With the rapid development of the Internet, network management and control has gradually become a major challenge restricting its development. Middlebox is a dedicated network management and control device for complex packet processing, including proxy server (Proxy), deep packet inspection (IDS) equipment, load balancer (Load Balancer), dedicated firewall (Fire Wall), etc. However, in traditional networks, the configuration and management of these devices is very complicated work, because the processing sequence (service chain) of Middlebox of different streams, the configuration must ensure that the processing of packets follows the corresponding Middlebox sequence; the difference is because of the configuration of these Middleboxes There may be some connection, with figu...

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
IPC IPC(8): H04L12/24
Inventor 李清江勇夏树涛段鹏飞
Owner SHENZHEN GRADUATE SCHOOL TSINGHUA UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap