A method of network deployment

A network deployment and all-in-one technology, applied in the field of computer networks, can solve the problems of not considering the connection degree of nodes and the additional burden of the network, so as to reduce the cost of network deployment and realize the effect of load balancing

Active Publication Date: 2019-05-10
BEIJING UNIV OF POSTS & TELECOMM
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0013] From the description of the k-means-based clustering algorithm, it can be seen that it uses distance as the main basis for domain division. Although the distance between nodes in each control domain is as close as possible, it does not consider the actual network topology. The degree of connectivity of nodes, that is to say, it is very likely that after the division is completed, each control domain can include multiple isolated nodes, that is, there are no nodes connected to it in this domain, and it needs to be indirectly connected to the nodes actually connected to it in the neighborhood Send a request to the domain controller, which will inevitably cause an additional burden on the network

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
  • A method of network deployment
  • A method of network deployment
  • A method of network deployment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] Specific embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings. It should be understood that the specific embodiments described here are only used to illustrate and explain the present invention, and are not intended to limit the present invention.

[0030] In the present invention, "neighbor" refers to direct access through one-hop transmission; two adjacent domains refer to that at least one controlled node in one domain is a neighbor node of at least one controlled node in another domain; The shortest path refers to the path with the least number of intermediate nodes passing through from the source node to the destination node, and the shortest path distance between nodes refers to the sum of the lengths of the links included in the shortest path between nodes.

[0031] figure 1 is a schematic diagram of a network deployment method according to an embodiment of the present invention.

[0032] In S101, ...

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 present invention relates to the field of computer networks and discloses a network deployment method. The method comprises: determining a number N of domains for a plurality of controlled nodes; dividing the plurality of controlled nodes into N domains based on topological relations and loads of the controlled nodes; fine-tuning the divided domains on the basis of the load capacity; and optimizing deployment location of the controlled nodes corresponding to each domain. According to the method, the connectivity of the controlled nodes in the domains can be improved, the processing efficiency of the controlled nodes can be improved and the network reliability can be improved.

Description

technical field [0001] The present invention relates to the field of computer networks, in particular to a network deployment method. Background technique [0002] Software Defined Network (Software Defined Network, SDN) is a new network innovation architecture proposed by the CleanSlate research group of Stanford University in the United States. Its core technology, OpenFlow, separates the data plane and control plane of network equipment, and the data plane can be passed through The control plane (including the function of determining the forwarding mode and business logic) can be implemented by the controller, so as to realize the flexible control of the network traffic and provide a good foundation for the innovation of the core network and applications. platform. However, in recent years, with the expansion of the network scale, SDN has many problems to be solved in many aspects, especially the scalability of the control plane encounters many problems. [0003] As we ...

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 Patents(China)
IPC IPC(8): H04L12/803H04L12/24
Inventor 李莉石靖陈建亚刘韵洁
Owner BEIJING UNIV OF POSTS & TELECOMM
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