CN110198543A - Network resource planning method, apparatus, computer-readable medium and electronic equipment - Google Patents

Network resource planning method, apparatus, computer-readable medium and electronic equipment Download PDF

Info

Publication number
CN110198543A
CN110198543A CN201810251249.8A CN201810251249A CN110198543A CN 110198543 A CN110198543 A CN 110198543A CN 201810251249 A CN201810251249 A CN 201810251249A CN 110198543 A CN110198543 A CN 110198543A
Authority
CN
China
Prior art keywords
domain
path
bandwidth
interior nodes
planning
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201810251249.8A
Other languages
Chinese (zh)
Other versions
CN110198543B (en
Inventor
刘志伟
肖继珑
樊顺兴
周轩敏
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to CN201810251249.8A priority Critical patent/CN110198543B/en
Publication of CN110198543A publication Critical patent/CN110198543A/en
Application granted granted Critical
Publication of CN110198543B publication Critical patent/CN110198543B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0876—Network utilisation, e.g. volume of load or congestion level
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0289—Congestion control

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment provides a kind of network resource planning method, apparatus, computer-readable medium and electronic equipments.This method is applied to network structure, the network structure includes at least one domain, each domain includes at least one domain interior nodes and network switching node, at least one domain interior nodes are separately connected the network switching node by path in domain, each domain interior nodes include server, at least one domain interior nodes include the first domain interior nodes, the first domain interior nodes are separately connected an at least external node by least one external path, this method comprises: obtaining the planning bandwidth of each external path of the first domain interior nodes respectively according to the newly-increased server info of external path information and the first domain interior nodes；The external of the first domain interior nodes, which is obtained, according to the planning bandwidth of each external path of the first domain interior nodes plans bandwidth.

Description

Network resource planning method, apparatus, computer-readable medium and electronic equipment
Technical field
This application involves field of computer technology, in particular to a kind of network resource planning method, apparatus, calculate Machine readable medium and electronic equipment.
Background technique
The method of conventional network resources planning is typically all based on offering statistics on client or business department oneself.Industry Business department calculates the future network bandwidth demand of each business, network money based on the operational indicator development of following (as 1 year following) Plan that the future network bandwidth demand data summarization of all business is obtained overall network resource planning data by side in source.
As shown in Figure 3, it is assumed that each business department reports the business of business 1 according to operational indicator development in following 1 year respectively 1 bandwidth, 2 bandwidth of business of business 2,3 bandwidth of business of business 3 ..., business n (n is positive integer more than or equal to 1 here) Business n bandwidth, at this point, network resource planning side only needs 1 bandwidth of business, 2 bandwidth of business, 3 bandwidth ... of business, is somebody's turn to do Business n bandwidth, which directly adds up, can be obtained the overall network bandwidth in 1 year future.
The method of this network resource planning is easy to operate, and network resource planning side is not necessarily to be responsible for business result, institute Usually this scheme can be all used with planning side.
But when business scale is larger, for example, for Large-Scale Interconnected net company it is this have magnanimity business and reached To for tens T grades of bandwidth, this mode the prior art has at least the following problems:
First, the network bandwidth accuracy planned by this method is low.Due to the program planning Internet resources completely according to Rely in traffic forecast accuracy, and Internet service is fast changing, development and change are too fast, and traffic forecast accuracy is low, to lead Cause the network bandwidth accuracy of planning low.
Second, the people for being responsible for business is not generally to be well aware of network bandwidth resources can be how many, and many people can be using a People understands that calculate network bandwidth index, there are biggish errors when so that operational indicator being converted to network bandwidth index.
The bandwidth characteristic of third, different business is different, has plenty of peak on daytime, has plenty of night peak, merely by each industry The planning network bandwidth that the network bandwidth of business is overlapped acquisition is inaccurate.
Therefore, it is necessary to a kind of new network resource planning method, apparatus, computer-readable medium and electronic equipments.
It should be noted that information is only used for reinforcing the reason to background of the invention disclosed in above-mentioned background technology part Solution, therefore may include the information not constituted to the prior art known to persons of ordinary skill in the art.
Summary of the invention
The embodiment of the present invention be designed to provide a kind of network resource planning method, apparatus, computer-readable medium and Electronic equipment, and then overcome the network bandwidth accuracy of planning present in the relevant technologies is low to ask at least to a certain extent Topic.
Other characteristics and advantages of the invention will be apparent from by the following detailed description, or partially by the present invention Practice and acquistion.
One side according to an embodiment of the present invention provides a kind of network resource planning method, is applied to network structure, should Network structure includes at least one domain, and each domain includes at least one domain interior nodes and network switching node, at least one domain Node is separately connected the network switching node by path in domain, and each domain interior nodes include server, at least one domain internal segment Point includes the first domain interior nodes, which is separately connected an at least outside segments by least one external path Point, which comprises be somebody's turn to do respectively according to the newly-increased server info of external path information and the first domain interior nodes The planning bandwidth of each external path of first domain interior nodes；It is obtained according to the planning bandwidth of each external path of the first domain interior nodes It obtains the external of the first domain interior nodes and plans bandwidth.
One side according to an embodiment of the present invention provides a kind of network resource planning device, is applied to network structure, should Network structure includes at least one domain, and each domain includes at least one domain interior nodes and network switching node, at least one domain Node is separately connected the network switching node by path in domain, and each domain interior nodes include server, at least one domain internal segment Point includes the first domain interior nodes, which is separately connected an at least outside segments by least one external path Point, described device include: external path Bandwidth plan module, for according to external path information and the first domain interior nodes Newly-increased server info obtains the planning bandwidth of each external path of the first domain interior nodes respectively；External bandwidth planning module, The external of the first domain interior nodes, which is obtained, for the planning bandwidth according to each external paths of the first domain interior nodes plans bandwidth.
One side according to an embodiment of the present invention provides a kind of computer-readable medium, is stored thereon with computer journey Sequence realizes such as above-mentioned network resource planning method as described in the examples when described program is executed by processor.
One side according to an embodiment of the present invention, provides a kind of electronic equipment, comprising: one or more processors；It deposits Storage device, for storing one or more programs, when one or more of programs are executed by one or more of processors When, so that one or more of processors realize such as above-mentioned network resource planning method as described in the examples.
In the technical solution provided by some embodiments of the present invention, by according to external path information and this first The newly-increased server info of domain interior nodes obtains the planning bandwidth of each external path of the first domain interior nodes, and then basis respectively The planning bandwidth of each external path of the first domain interior nodes obtains the external of the first domain interior nodes and plans bandwidth, makes it possible to Determine that the external of the domain interior nodes in network structure plans bandwidth, based on historical traffic data and newly-increased server data with true Guarantor obtains accurately external planning band data, so that planning band data according to the outside to instruct construction future External network bandwidth, meet the operational indicator growth requirement of business, to be conducive to the development preferably promoted business.
It should be understood that above general description and following detailed description be only it is exemplary and explanatory, not It can the limitation present invention.
Detailed description of the invention
The drawings herein are incorporated into the specification and forms part of this specification, and shows and meets implementation of the invention Example, and be used to explain the principle of the present invention together with specification.It should be evident that the accompanying drawings in the following description is only the present invention Some embodiments for those of ordinary skill in the art without creative efforts, can also basis These attached drawings obtain other attached drawings.In the accompanying drawings:
Fig. 1, which is shown, can apply the network resource planning method of the embodiment of the present invention or showing for network resource planning device The schematic diagram of example property system architecture；
Fig. 2 shows the structural schematic diagrams of the computer system of the electronic equipment suitable for being used to realize the embodiment of the present invention；
Fig. 3 shows the schematic diagram of network resource planning method in the prior art；
Fig. 4 diagrammatically illustrates the network structure of the application network resource planning method of an embodiment according to the present invention Schematic diagram；
Fig. 5 diagrammatically illustrates the flow chart of the network resource planning method of an embodiment according to the present invention；
Fig. 6 shows the treatment process schematic diagram of step S510 shown in Fig. 5 in one embodiment；
Fig. 7 diagrammatically illustrates the schematic diagram in the first domain of an embodiment according to the present invention；
Fig. 8 diagrammatically illustrates the flow chart of network resource planning method according to another embodiment of the present invention；
Fig. 9 shows the treatment process schematic diagram of step S810 shown in fig. 8 in one embodiment；
Figure 10 shows the treatment process schematic diagram of step S812 shown in Fig. 9 in one embodiment；
Figure 11 diagrammatically illustrates the schematic diagram in the second domain of an embodiment according to the present invention；
Figure 12 diagrammatically illustrates the flow chart of network resource planning method according to still another embodiment of the invention；
Figure 13 diagrammatically illustrates the network knot of application network resource planning method according to another embodiment of the present invention The schematic diagram of structure；
Figure 14 diagrammatically illustrates the flow chart of the network resource planning method of another embodiment according to the present invention；
Figure 15 shows the treatment process schematic diagram of step S1410 shown in Figure 14 in one embodiment；
Figure 16 diagrammatically illustrates the network knot of the application network resource planning method of another embodiment according to the present invention The schematic diagram of structure；
Figure 17 diagrammatically illustrates the network knot of the application network resource planning method of another embodiment according to the present invention The schematic diagram of structure；
Figure 18 diagrammatically illustrates the block diagram of the application network resource planning method of an embodiment according to the present invention；
The trend that Figure 19 diagrammatically illustrates the single server MAN Intranet flow value of an embodiment according to the present invention becomes Change figure；
The trend that Figure 20 diagrammatically illustrates the single server DCI Intranet flow value of an embodiment according to the present invention becomes Change figure；
Figure 21 diagrammatically illustrates the trend of the single server public network outlet stream magnitude of an embodiment according to the present invention Variation diagram；
Figure 22 diagrammatically illustrates the schematic diagram of the computer room traffic trends of an embodiment according to the present invention；
Figure 23 diagrammatically illustrates the schematic diagram of operator's proportionality coefficient of an embodiment according to the present invention；
Figure 24 diagrammatically illustrates the schematic diagram of the industry growth base of an embodiment according to the present invention；
Figure 25 diagrammatically illustrates the schematic diagram of the path coefficient of the data center of an embodiment according to the present invention；
Figure 26 diagrammatically illustrates the schematic diagram of the Internet resources topological model of an embodiment according to the present invention；
Figure 27 diagrammatically illustrates the block diagram of the network resource planning device of an embodiment according to the present invention.
Specific embodiment
Example embodiment is described more fully with reference to the drawings.However, example embodiment can be with a variety of shapes Formula is implemented, and is not understood as limited to example set forth herein；On the contrary, thesing embodiments are provided so that the present invention will more Fully and completely, and by the design of example embodiment comprehensively it is communicated to those skilled in the art.
In addition, described feature, structure or characteristic can be incorporated in one or more implementations in any suitable manner In example.In the following description, many details are provided to provide and fully understand to the embodiment of the present invention.However, It will be appreciated by persons skilled in the art that technical solution of the present invention can be practiced without one or more in specific detail, Or it can be using other methods, constituent element, device, step etc..In other cases, it is not shown in detail or describes known side Method, device, realization or operation are to avoid fuzzy each aspect of the present invention.
Block diagram shown in the drawings is only functional entity, not necessarily must be corresponding with physically separate entity. I.e., it is possible to realize these functional entitys using software form, or realized in one or more hardware modules or integrated circuit These functional entitys, or these functional entitys are realized in heterogeneous networks and/or processor device and/or microcontroller device.
Flow chart shown in the drawings is merely illustrative, it is not necessary to including all content and operation/step, It is not required to execute by described sequence.For example, some operation/steps can also decompose, and some operation/steps can close And or part merge, therefore the sequence actually executed is possible to change according to the actual situation.
Fig. 1, which is shown, can apply the network resource planning method of the embodiment of the present invention or showing for network resource planning device The schematic diagram of example property system architecture 100.
As shown in Figure 1, system architecture 100 may include one of terminal device 101,102,103 or a variety of, network 104 and server 105.Network 104 between terminal device 101,102,103 and server 105 to provide communication link Medium.Network 104 may include various connection types, such as wired, wireless communication link or fiber optic cables etc..
It should be understood that the number of terminal device, network and server in Fig. 1 is only schematical.According to realization need It wants, can have any number of terminal device, network and server.For example server 105 can be multiple server compositions Server cluster etc..
User can be used terminal device 101,102,103 and be interacted by network 104 with server 105, to receive or send out Send message etc..Terminal device 101,102,103 can be the various electronic equipments with display screen, including but not limited to intelligent hand Machine, tablet computer, portable computer and desktop computer etc..
Server 105 can be to provide the server of various services.Such as user (is also possible to using terminal device 103 Terminal device 101 or 102) uploaded to server 105 some domain interior nodes in network structure each external path history The newly-increased server info of flow information and the domain interior nodes (such as may include newly-increased number of servers, newly-increased server The first bandwidth service indication), (these information are also possible to server 105 and collect for the Bandwidth plan information of each external node It arrives).Server 105 can the historical traffic information of Bandwidth plan information and each external path based on each external node obtain Respective external path path coefficient, so as to based on each external path historical traffic information, the domain interior nodes it is new Increasing server info and the path coefficient in respective external path obtain the planning bandwidth of each external path of the domain interior nodes respectively, And calculated result is fed back into terminal device 103, and then user can determine the domain based on the content shown on terminal device 103 The planning bandwidth of each external path of interior nodes, so as to preferably instruct following network bandwidth construction.
For another example user uploads this to server 105 using terminal device 103 (being also possible to terminal device 101 or 102) (these information can also be with for the historical traffic information of multiple domain interior nodes in the first domain in network structure and newly-increased server info It is that the collection of server 105 obtains).Server 105 is in the historical traffic information and server for getting this multiple domain interior nodes After information, the planning bandwidth in path in multiple corresponding domain of domain interior nodes can be obtained.? 105 can obtain the path coefficient in path in a certain domain according to the server info, then according to the history stream in path in the domain The server info of two domain interior nodes of path opposite end obtains the rule in path in the domain in amount information and its path coefficient, the domain Bandwidth is drawn, and calculated result is fed back into terminal device 103, and then user can be based on the content shown on terminal device 103 The planning bandwidth in path in the domain of the domain interior nodes is determined, so as to preferably instruct following network bandwidth construction.
Fig. 2 shows the structural schematic diagrams of the computer system of the electronic equipment suitable for being used to realize the embodiment of the present invention.
It should be noted that Fig. 2 shows the computer system 200 of electronic equipment be only an example, should not be to this hair The function and use scope of bright embodiment bring any restrictions.
As shown in Fig. 2, computer system 200 includes central processing unit (CPU) 201, it can be read-only according to being stored in Program in memory (ROM) 202 or be loaded into the program in random access storage device (RAM) 203 from storage section 208 and Execute various movements appropriate and processing.In RAM 203, it is also stored with various programs and data needed for system operatio.CPU 201, ROM 202 and RAM 203 is connected with each other by bus 204.Input/output (I/O) interface 205 is also connected to bus 204。
I/O interface 205 is connected to lower component: the importation 206 including keyboard, mouse etc.；It is penetrated including such as cathode The output par, c 207 of spool (CRT), liquid crystal display (LCD) etc. and loudspeaker etc.；Storage section 208 including hard disk etc.； And the communications portion 209 of the network interface card including LAN card, modem etc..Communications portion 209 via such as because The network of spy's net executes communication process.Driver 210 is also connected to I/O interface 205 as needed.Detachable media 211, such as Disk, CD, magneto-optic disk, semiconductor memory etc. are mounted on as needed on driver 210, in order to read from thereon Computer program be mounted into storage section 208 as needed.
Particularly, according to an embodiment of the invention, may be implemented as computer below with reference to the process of flow chart description Software program.For example, the embodiment of the present invention includes a kind of computer program product comprising be carried on computer-readable medium On computer program, which includes the program code for method shown in execution flow chart.In such reality It applies in example, which can be downloaded and installed from network by communications portion 209, and/or from detachable media 211 are mounted.When the computer program is executed by central processing unit (CPU) 201, executes and limited in the system of the application Various functions.
It should be noted that computer-readable medium shown in the present invention can be computer-readable signal media or meter Calculation machine readable storage medium storing program for executing either the two any combination.Computer readable storage medium for example can be --- but not Be limited to --- electricity, magnetic, optical, electromagnetic, infrared ray or semiconductor system, device or device, or any above combination.Meter The more specific example of calculation machine readable storage medium storing program for executing can include but is not limited to: have the electrical connection, just of one or more conducting wires Taking formula computer disk, hard disk, random access storage device (RAM), read-only memory (ROM), erasable type may be programmed read-only storage Device (EPROM or flash memory), optical fiber, portable compact disc read-only memory (CD-ROM), light storage device, magnetic memory device, Or above-mentioned any appropriate combination.In the present invention, computer readable storage medium can be it is any include or storage journey The tangible medium of sequence, the program can be commanded execution system, device or device use or in connection.And at this In invention, computer-readable signal media may include in a base band or as carrier wave a part propagate data-signal, Wherein carry computer-readable program code.The data-signal of this propagation can take various forms, including but unlimited In electromagnetic signal, optical signal or above-mentioned any appropriate combination.Computer-readable signal media can also be that computer can Any computer-readable medium other than storage medium is read, which can send, propagates or transmit and be used for By the use of instruction execution system, device or device or program in connection.Include on computer-readable medium Program code can transmit with any suitable medium, including but not limited to: wireless, electric wire, optical cable, RF etc. are above-mentioned Any appropriate combination.
Flow chart and block diagram in attached drawing are illustrated according to the system of various embodiments of the invention, method and computer journey The architecture, function and operation in the cards of sequence product.In this regard, each box in flowchart or block diagram can generation A part of one module, program segment or code of table, a part of above-mentioned module, program segment or code include one or more Executable instruction for implementing the specified logical function.It should also be noted that in some implementations as replacements, institute in box The function of mark can also occur in a different order than that indicated in the drawings.For example, two boxes succeedingly indicated are practical On can be basically executed in parallel, they can also be executed in the opposite order sometimes, and this depends on the function involved.Also it wants It is noted that the combination of each box in block diagram or flow chart and the box in block diagram or flow chart, can use and execute rule The dedicated hardware based systems of fixed functions or operations is realized, or can use the group of specialized hardware and computer instruction It closes to realize.
Being described in module and/or unit and/or subelement involved in the embodiment of the present invention can be by software Mode is realized, can also be realized by way of hardware, and described module and/or unit and/or subelement can also be set It sets in the processor.Wherein, these modules and/or the title of unit and/or subelement are not constituted to this under certain conditions The restriction of module and/or unit and/or subelement itself.
As on the other hand, present invention also provides a kind of computer-readable medium, which be can be Included in electronic equipment described in above-described embodiment；It is also possible to individualism, and without in the supplying electronic equipment. Above-mentioned computer-readable medium carries one or more program, when the electronics is set by one for said one or multiple programs When standby execution, so that method described in electronic equipment realization as the following examples.For example, the electronic equipment can be real Now such as each step of Fig. 5 or Fig. 6 or Fig. 8 or Fig. 9 or Figure 10 or Figure 12 or Figure 14 or shown in figure 15.
The network resource planning method of the embodiment of the present disclosure can be applied to network structure.The network structure may include to A few domain, each domain may include at least one domain interior nodes and network switching node, which can lead to It crosses path in domain and is separately connected the network switching node, each domain interior nodes may include server, at least one domain interior nodes It may include the first domain interior nodes, which can be separately connected outside at least one by least one external path Portion's node.
It should be noted that the concept in " domain " in the embodiment of the present disclosure can be a city, for example, Beijing, Shanghai, Shenzhen and Guangzhou etc.；The concept of " domain interior nodes " can be garden or data center in city, such as company A is built in Beijing A vertical garden or data center may include again one or more in each garden when domain, interior nodes represent garden A data center can be by all data centers of the garden as in a total data when domain, interior nodes represent garden The heart is treated, so being hereinafter only illustrated by taking data center as an example, each data center may include one or more clothes Business device；" network switching node " is the network switch for connecting each domain interior nodes in a domain, such as be can be Super or core is the same as city data center network switching centre；" external node ", which can refer to, provides the operator of network service, Such as in telecommunications, connection, movement etc. any one or it is a variety of.But it's not limited to that for the disclosure.
Below by the schematic diagram of Fig. 4 to the network structure of the application network resource planning method of one embodiment of the invention It is illustrated.
As shown in figure 4, network structure provided in this embodiment may include domain 1, domain 2, domain ..., up to domain n, (n is here Positive integer more than or equal to 1).
It wherein, again may include domain interior nodes 1, domain interior nodes 2, domain interior nodes ..., until domain interior nodes m is (here in domain 1 M is greater than the positive integer equal to 1).
Wherein, it again may include x11 platform server in the domain interior nodes 1, may include again x12 platform in the domain interior nodes 2 Server may include again x1m platform server in the interior nodes m of the domain, and x11, x12 and x1m are greater than just whole equal to 1 here Number.
Wherein, each domain interior nodes such as domain interior nodes 1 in the domain 1, domain interior nodes 2, domain interior nodes ..., domain interior nodes M can be connected to network switching node by path in corresponding domain respectively again.
In the present embodiment, when only one external node, by taking the domain interior nodes 1 in domain 1 as an example, domain interior nodes 1 again can To connect external node 1 by the first external path.
In some embodiments, when there are two external node, domain interior nodes 1 can also be connected by the second external path External node 2.
In further embodiments, when there are three external node, domain interior nodes 1 can also be connected by third external path Connect external node 3.
In other embodiments, domain interior nodes 1 can be separately connected each external node by corresponding external path.This public affairs It opens to the quantity of external node and its corresponding external path without limitation.Other domain interior nodes such as domain interior nodes 2 ..., domain Interior nodes m and each external node are connected to that this is similar, and this will not be detailed here.
In the present embodiment, when each external node represents each operator, domain interior nodes 1 can be exported by corresponding public network Switching centre (Internet eXchange, IX), which is connected to, provides each operator of Internet, here by taking T company as an example, The public network egress switch center of T company is represented with TIX.It should be noted that " outlet " mentioned in the embodiment of the present disclosure is Refer to the public network outlet of connection Internet.
Other domains such as domain 2 ..., the composition and connection structure of domain n are referred to the composition and connection structure in the domain 1, This is no longer described in detail.
Each data in the present embodiment, when each domain interior nodes represent each data center in city, in the same city Center can be connected to network exchange by same city data center network special line (Metropolitan Area Network, MAN) Center (hereinafter referred to as SMAN).
In some embodiments, across city data center network special line (Data Center can be passed through between different cities again Interconnection, DCI) it is connected with each other.
It should be noted that " special line " mentioned in the embodiment of the present disclosure refers to for communicating between Liang Ge data center Network link.
Fig. 5 diagrammatically illustrates the flow chart of the network resource planning method of an embodiment according to the present invention.
As shown in figure 5, the network resource planning method can be applied to network structure described in above-mentioned Fig. 4, the present embodiment The network resource planning method of offer may comprise steps of.
In step S510, obtained respectively according to the newly-increased server info of external path information, the first domain interior nodes The planning bandwidth of each external path of the first domain interior nodes.
In some embodiments, which may include the historical traffic information of at least one external path With the path coefficient in respective external path.
In some embodiments, which may include the newly-increased number of servers of the first domain interior nodes With the first bandwidth service indication of newly-increased server.
In some embodiments, the historical traffic information of at least one external path may include the first domain interior nodes The historical traffic and flow growth rate of each external path of (here by taking the domain interior nodes 1 in Fig. 4 as an example).It can in domain interior nodes 1 To include storage server, storage server in the embodiment of the present disclosure, which refers to, have been put into operation in data with existing center Server.It in other embodiments, can also include increment server in domain interior nodes 1, the increment clothes in the embodiment of the present disclosure Business device refers to that within project period, (such as 1 year following) plans the server increased newly in data with existing center, or in project period The newly-increased server being arranged in the newly-built data center of interior plan (hereinafter referred to as newly-increased data center).
Wherein, domain interior nodes 1 may be one does not have the data with existing center of newly-increased server within project period, at this point, The newly-increased number of servers of domain interior nodes 1 is 0.Domain interior nodes 1 are also likely to be one newly-increased server within the project period Data with existing center, at this point, the newly-increased number of servers of domain interior nodes 1 is assumed to be y11, (y11 is one just whole more than or equal to 1 Number).Domain interior nodes 1 are also likely to be a newly-increased data center within the project period, and the newly-increased clothes of the newly-increased data center Device quantity of being engaged in is it can also be assumed that be y11, at this point, the historical traffic information of each external path of domain interior nodes 1 is 0.
For example, connecting external node 1 and outside with the second external path by the first external path respectively with domain interior nodes 1 For node 2, it is assumed that the domain internal segment that be planned is following such as 2016 1 year (or years ahead, such as 3 years following) First external path of point 1 and the planning bandwidth of the second external path, it is assumed here that according to such as 2013,2014 years first 3 years The first bandwidth service with historical traffic information in 2015 and newly-increased number of servers in 2016 and newly-increased server refers to Mark (acquisition of the first bandwidth service indication is with reference to hereafter) is come the first external path and second for the domain interior nodes 1 for planning 2016 The planning bandwidth of external path.
In the embodiment of the present disclosure, which can indicate that the newly-increased server in the project period can mention The outlet bandwidth service ability BDwidth_TIX of confession.
For example, can be according to the historical traffic traffic2013_1_1 of 2013 of the first external path of domain interior nodes 1 With stream in 2014 of the first external path of historical traffic traffic2014_1_1 calculating acquisition domain interior nodes 1 in 2014 Growth rate fg2014_1_1 is measured, specific calculation formula can be with are as follows:
Fg2014_1_1=(traffic2014_1_1-traffic2013_1_1)/traffic2013_1_1 (1)
It should be noted that above-mentioned formula (1) is only used for the first external path for example, specific domain interior nodes 1 Flow growth rate can be calculated accordingly according to different application scenarios.And above example is to increase in the year of flow For rate, but actually can also according to flow the moon growth rate, all growth rates even daily progression rate etc. calculate, the disclosure This is not construed as limiting.
Similar, it can be according to the historical traffic traffic2014_ of 2014 of the first external path of domain interior nodes 1 1_1 and 2015 year historical traffic traffic2015_1_1 calculates 2015 of the first external path for obtaining domain interior nodes 1 Flow growth rate fg2015_1_1.
In some embodiments, can be obtained according to the flow growth rate of the preceding many years of this year to be predicted it is to be predicted this 1 year flow growth rate, for example, can according to the flow growth rate fg2014_1_1 of the first external path of domain interior nodes 1 and Fg2015_1_1 come calculate obtain domain interior nodes 1 the first external path storage server in 2016 flow growth rate fg2016_1_1。
For example, arithmetic mean of instantaneous value can be asked fg2014_1_1 and fg2015_1_1 as outside the first of domain interior nodes 1 The flow growth rate fg2016_1_1 of path storage server in 2016.
Different weights can also be for example added according to the different times again, wherein closer to the flow in time to be predicted The weight of growth rate is bigger, it is assumed that and the weight of fg2014_1_1 is w2014_1_1, and the weight of fg2015_1_1 is w2015_1_1, Then w2015_1_1 > w2014_1_1, and w2014_1_1+w2015_1_1=1, it is then possible to be calculated by the following formula acquisition Fg2016_1_1:
Fg2016_1_1=(fg2014_1_1*w2014_1_1+fg2015_1_1*w2015_1_1) (2)
Due in actual conditions, for the Internet enterprises that a business increases, annual service traffics all with Faster speed increases, and the flow that the flow growth rate in previous year most can reflect next year of this enterprise increases Rate, accordingly it is also possible to the flow growth rate with an annual flow growth rate as next annual storage server, example It such as, can also be directly using fg2015_1_1 as the flow of the first external path storage server in 2016 of domain interior nodes 1 Growth rate fg2016_1_1.
Similar, the flow increasing for obtaining the second external path storage server in 2016 of domain interior nodes 1 can be calculated Long rate fg2016_1_2.When there are third external node, the third external path 2016 for obtaining domain interior nodes 1 can also be calculated The flow growth rate fg2016_1_3 of the storage server in year.
In the present embodiment, the path coefficient of external path is intended to indicate that the external of domain interior nodes plans bandwidth toward each outside The proportionality coefficient distributed on path.For example, when domain interior nodes 1 only exist external path such as first external path, then The path coefficient of first external path can be, for example, 1 for the constant of a setting.When there are two external roads for domain interior nodes 1 When diameter such as the first external path and the second external path, then the path coefficient of first external path and second external path The sum of path coefficient can be, for example, 1 for the constant of a setting.When domain interior nodes 1 are there are when three external paths, then should The sum of the path coefficient of first external path, the path coefficient of second external path and path coefficient of the third external path The constant being arranged for one is, for example, 1.Meeting the sum of path coefficient of each external path of domain interior nodes 1 is a setting Constant is, for example, 1, and the path coefficient of each external path shows that the external planning bandwidth of domain interior nodes 1 is distributed toward each external path Accounting situation.The acquisition of the path coefficient of specific each external path is referred to hereafter.
In step S520, which is obtained according to the planning bandwidth of each external path of the first domain interior nodes The external of point plans bandwidth.
It, can will be in domain after obtaining the planning bandwidth of each external path of domain interior nodes 1 according to above-mentioned steps S510 The planning bandwidth summation of each external path of node 1 can be obtained the external of domain interior nodes 1 and plan bandwidth.
In the exemplary embodiment, other in acquisition domain 1 can also be calculated using the method for similar above-mentioned domain interior nodes 1 The external of each domain interior nodes plans bandwidth, then can obtain the external planning bandwidth summation of each domain interior nodes in domain 1 It obtains the external of domain 1 and plans bandwidth.Further, the external planning in each domain in the network structure can be obtained using similar method Bandwidth can be obtained the external of the network structure to the external planning bandwidth summation in each domain in the network structure and plan bandwidth.
In the exemplary embodiment, the method can also include: to adjust the first domain internal segment using industry growth base The planning bandwidth of each external path of point.
In the embodiment of the present disclosure, when the network resource planning method is applied to for example different company of different target objects When, which kind of industry can be according to the said firm to obtain its corresponding industry growth base, such as T company is that internet is public Department, then adjust the planning bandwidth of each external path of the first domain interior nodes using the industry growth base of internet industry.
It in some embodiments, can be according to the external planning bandwidth of the network structure and the history stream of the network structure Amount information (such as the sum of historical traffic of the previous year project period of each external path of each domain interior nodes) obtains the network structure Bandwidth plan speedup within the project period rises one when the Bandwidth plan speedup is less than the sector growth base For phase company, illustrate that the external planning bandwidth of the network structure may be unable to satisfy actual demand, at this point it is possible to using the row Industry growth base carrys out the corresponding external planning bandwidth for adjusting the network structure to the ratio of outside planning bandwidth, similar, The ratio of bandwidth can be planned come the corresponding each domain interior nodes for adjusting the network structure to the outside using the sector growth base Each external path planning bandwidth.
When the Bandwidth plan speedup is more than or equal to the sector growth base, illustrate that the external of the network structure plans bandwidth It can satisfy actual demand, at this point it is possible to directly adopt the external planning bandwidth of the network structure to instruct actual net The construction of network bandwidth.
Wherein, industry growth base indicates network flow growth rate of some industry within the project period, specific row The acquisition of industry growth base is referred to hereafter.
A kind of network resource planning method that disclosure embodiment provides, by according at least one external path Historical traffic information, the newly-increased number of servers of the first domain interior nodes and newly-increased server the first bandwidth service indication, with And the path coefficient in respective external path obtains the planning bandwidth of each external path of the first domain interior nodes, and then basis respectively The planning bandwidth of each external path of the first domain interior nodes obtains the external of the first domain interior nodes and plans bandwidth, makes it possible to Determine that the external of the domain interior nodes in network structure plans bandwidth, based on historical traffic data and newly-increased server data with true Guarantor obtains accurately external planning band data, so that planning band data according to the outside to instruct construction future External network bandwidth, meet the operational indicator growth requirement of business, to be conducive to the development preferably promoted business.
Fig. 6 shows the treatment process schematic diagram of step S510 shown in Fig. 5 in one embodiment.
As shown in fig. 6, the step S510 of above-mentioned Fig. 5 embodiment may further include following steps.
In step S511, each of the first domain interior nodes is obtained according to the historical traffic information in respective external path respectively The storage of external path plans bandwidth.
For example, by taking three above-mentioned external paths as an example, according to 2015 of the first external path of domain interior nodes 1 go through History flow traffic2015_1_1 and the flow growth rate fg2016_1_1 of storage server in 2016, the second external path Historical traffic traffic2015_1_2 in 2015 and storage server in 2016 flow growth rate fg2016_1_2, And historical traffic traffic2015_1_3 in 2015 of third external path and the flow of storage server in 2016 increase Long rate fg2016_1_3 obtain this first to third external path storage plan bandwidth s_plan_1_1, s_plan_1_2 and s_ Plan_1_3, specific calculation formula for example can be with are as follows:
S_plan_1_1=traffic2015_1_1* (1+fg2016_1_1) (3)
S_plan_1_2=traffic2015_1_2* (1+fg2016_1_2) (4)
S_plan_1_3=traffic2015_1_3* (1+fg2016_1_3) (5)
In step S512, obtained according to the newly-increased number of servers of the first domain interior nodes and the first bandwidth service indication The increment for obtaining the first domain interior nodes plans bandwidth.
For example, it is assumed that the newly-increased number of servers of domain interior nodes 1 is y11, the first bandwidth service indication of server is increased newly BDwidth_TIX, then the increment planning bandwidth i_plan_1 of domain interior nodes 1 can be calculated by the following formula acquisition:
I_plan_1=y11*BDwidth_TIX (6)
In step S513, planned in bandwidth and first domain according to the storage of each external path of the first domain interior nodes The increment planning bandwidth of node and the path coefficient in respective external path obtain each external road of the first domain interior nodes respectively The planning bandwidth of diameter.
For example, the storage according to the first of above-mentioned domain interior nodes 1 to third external path plans bandwidth s_plan_1_1, s_ The plan_1_2 and s_plan_1_3 and increment of domain interior nodes 1 planning bandwidth i_plan_1 obtains the external rule of domain interior nodes 1 Bandwidth o_plan_1 is drawn, such as can be obtained by following formula:
O_plan_1=s_plan_1_1+s_plan_1_2+s_plan_1_3+i_plan_1 (7)
Further according to the external planning bandwidth o_plan_1 of the domain interior nodes 1 and path coefficient e_ of the first external path Path_1_1 obtains the planning bandwidth plan_1_1 of first external path, such as can be obtained by following formula:
Plan_1_1=o_plan_1*e_path_1_1 (8)
Similar, it can be in the hope of the planning bandwidth plan_1_2 of the second external path of domain interior nodes 1:
Plan_1_2=o_plan_1*e_path_1_2 (9)
Plan_1_3=o_plan_1*e_path_1_3 (10)
In above-mentioned formula, e_path_1_2 and e_path_1_3 respectively represent the second external path and of domain interior nodes 1 The path coefficient of three external paths.
In above-mentioned embodiment illustrated in fig. 6, be according to the historical traffic information of each external path of the first domain interior nodes, should The newly-increased number of servers of first domain interior nodes and the first bandwidth service indication of newly-increased server are calculated and are obtained in first domain The external of node plans bandwidth, then, advises the external of the first domain interior nodes further according to the path coefficient in respective external path It draws bandwidth and is respectively allocated to each external path.
In other embodiments, can also according to the historical traffic information in the respective external path in path in first domain, The newly-increased number of servers of the first domain interior nodes and the first bandwidth service indication of newly-increased server and respective external path Path coefficient calculate obtain the first domain interior nodes each external path planning bandwidth.
For example, by taking the first external path of domain interior nodes 1 as an example, according to the 2015 of the first external path of domain interior nodes 1 The historical traffic traffic2015_1_1 in year, the flow of the first external path storage server in 2016 of domain interior nodes 1 increase The first bandwidth service indication of long rate fg2016_1_1, the newly-increased number of servers y11 of domain interior nodes 1 and newly-increased server The BDwidth_TIX and path coefficient e_path_1_1 of the first external path calculates the first outside road for obtaining domain interior nodes 1 The planning bandwidth plan_1_1 of diameter, specific calculation formula can be with are as follows:
Plan_1_1=traffic2015_1_1* (1+fg2016_1_1)
+y11*BDwidth_TIX*e_path_1_1 (11)
Similar, the planning bandwidth of the second external path and third external path that obtain domain interior nodes 1 can be calculated Plan_1_2 and plan_1_3:
Plan_1_2=traffic2015_1_2* (1+fg2016_1_2)
+y11*BDwidth_TIX*e_path_1_2 (12)
Plan_1_3=traffic2015_1_3* (1+fg2016_1_3)
+y11*BDwidth_TIX*e_path_1_3 (13)
It, can be in the hope of the planning bandwidth of each external path of each domain interior nodes using similar method.
It should be noted that the calculation formula of the planning bandwidth of each external path of above-mentioned each domain interior nodes of calculating is only to use In what is illustrated, appropriate variations can be done to calculation formula as the case may be, arbitrarily according at least one external path Historical traffic information, the newly-increased number of servers of the first domain interior nodes and newly-increased server the first bandwidth service indication, And the method that the path coefficient in respective external path obtains the planning bandwidth of each external path of the first domain interior nodes respectively It is required within the protection scope of the disclosure.
In the exemplary embodiment, which includes the first domain, which includes multiple domain interior nodes, this is more A domain interior nodes include the first domain interior nodes and the second domain interior nodes connected by path in the first domain.
Fig. 7 diagrammatically illustrates the schematic diagram in the first domain of an embodiment according to the present invention.
As shown in fig. 7, network structure provided in this embodiment may include the first domain, which may include the first domain Interior nodes and the second domain interior nodes, the first domain interior nodes can connect the second domain interior nodes by path in the first domain, should First domain interior nodes can also connect the network switching node by path in the second domain；The second domain interior nodes can pass through Three paths in domain connect the network switching node.
With continued reference to embodiment shown in Fig. 7, which can also include third domain interior nodes, the third domain interior nodes The network switching node can also be connected by path in a domain.
In other embodiments, which can also include kth (k is the positive integer more than or equal to 2) domain interior nodes.It should Kth domain interior nodes can also connect the network switching node by path in a domain.
Fig. 8 diagrammatically illustrates the flow chart of network resource planning method according to another embodiment of the present invention.
As shown in figure 8, network resource planning method provided in this embodiment can be applied to the first domain shown in Fig. 7.Institute Stating network resource planning method may include above-mentioned steps S510 and S520, can also include step S810.
In step S810, according to the historical traffic information in path in first domain and path coefficient, the first domain internal segment Point and the newly-increased number of servers of the second domain interior nodes and the second bandwidth service index of newly-increased server obtain this first The planning bandwidth in path in domain.
In the present embodiment, in first domain historical traffic information in path include in first domain historical traffic in path and Flow growth rate.Wherein, the second bandwidth service index for increasing server newly can indicate the newly-increased server energy in the project period The same city bandwidth service ability BDwidth_MAN enough provided, specific calculation can be with reference to hereafter.
In the present embodiment, when first domain interior nodes pass through respectively path in the first domain connected with path in the second domain this When two domain interior nodes and the network switching node, for the first domain interior nodes, (it is with two here there are a plurality of Example, but in fact, the first domain interior nodes can also be directly connected to other domain interior nodes by path in other domains) road Yu Nei Diameter, by taking each domain interior nodes are data center as an example, that is, there are direct-connected accesses for the Liang Ge data center being directly connected to, and there are direct-connected logical The Liang Ge data center on road can no longer can be communicated by network switch with direct communication, improved communication efficiency, subtracted Network congestion is lacked.At this point, being related to that there are the planning bandwidth of the first domain interior nodes in path in a plurality of domain toward a plurality of domain The problem of how interior path is distributed.Likewise, there is also path and thirds in the second domain for the second domain interior nodes Path in domain, also relate to the planning bandwidth of the second domain interior nodes in path in second domain and the third domain path how The problem of distribution.
In the exemplary embodiment, in first domain path coefficient in path include in first domain path about this first Second path coefficient of the path about the second domain interior nodes in the first path coefficient of domain interior nodes and first domain.
In the exemplary embodiment, the method can also include: according to non-first domain interior nodes in first domain The number of servers of other domain interior nodes obtain the first path coefficient.
In the exemplary embodiment, the first path coefficient can for be directly connected to the first domain interior nodes this second The server count of other domain interior nodes in the number of servers of domain interior nodes and first domain in addition to the first domain interior nodes The ratio of the sum of amount.
For example, by taking the first domain interior nodes as an example, it is assumed that first domain only includes first to third domain interior nodes, this first Other domain interior nodes in domain may include that (assuming that its number of servers is z12, z12 is more than or equal to 1 to the second domain interior nodes Positive integer) and third domain interior nodes (assuming that its number of servers is z13, z13 is the integer more than or equal to 0), it needs to illustrate It is that number of servers here can refer to the sum of storage server and increment server of other domain interior nodes, such as:
Z12=x12+y12 (14)
Z13=x13+y13 (15)
X12 and x13 respectively represents the second domain interior nodes in first domain in above-mentioned formula and the third domain interior nodes exist Storage number of servers in the project period, y12 and y13 respectively represent the second domain interior nodes and the third domain in first domain Increment number of servers of the interior nodes within the project period.
Wherein, when interior nodes are not directly connected to the third domain interior nodes with first domain, which is somebody's turn to do The first path coefficient i_path_1_1_1 in the first path in domain can be obtained by following formula:
I_path_1_1_1=z12/ (z12+z13) (16)
It, can be in the hope of when interior nodes are not directly connected to the third domain interior nodes with second domain according to similar method Second path coefficient i_path_2_1_2 in path in first domain of the second domain interior nodes:
I_path_2_1_2=z11/ (z11+z13) (17)
For another example assume in first domain there is also other domain interior nodes that interior nodes are not directly connected to first domain, Such as the 4th domain interior nodes (assuming that its number of servers is z14, z14 is the positive integer more than or equal to 1), the 5th domain interior nodes (assuming that its number of servers is z15, z15 is the positive integer more than or equal to 1), at this time in first domain of the first domain interior nodes The first path coefficient i_path_1_1_1 in path can be obtained by following formula:
I_path_1_1_1=z12/ (z12+z13+z14+z15) (18)
It, can be in the hope of when interior nodes are not directly connected to the third domain interior nodes with second domain according to similar method Second path coefficient i_path_2_1_2 in path in first domain of the second domain interior nodes:
I_path_2_1_2=z11/ (z11+z13+z14+z15) (19)
Wherein the path coefficient i_path_1_2 in path can be in the second domain of the first domain interior nodes are as follows:
I_path_1_2=1-i_path_1_1_1 (20)
I.e. for the first domain interior nodes, the sum of each path coefficient in path is equal to a constant for example in a plurality of domain It can be 1.
Similar, the path coefficient i_path_2_3 in path can be in the third domain of the second domain interior nodes are as follows:
I_path_2_3=1-i_path_2_1_2 (21)
According to above-mentioned similar method, when the first domain interior nodes have three or more than domain in path when, can be with Path coefficient of the path about the first domain interior nodes in its each domain is found out respectively.Similar method can also be used, is acquired In first domain in all domains path path coefficient.
It should be noted that the calculation formula in path is only for illustrating in above-mentioned the first domain of calculating, this field skill Art personnel can carry out deformation appropriate according to its concrete application, and the disclosure is not construed as limiting this.
In the exemplary embodiment, the method can also include: when other domain interior nodes include newly-increased server, Adjust the first path coefficient.
For example, when the second domain interior nodes have newly-increased server, path in first domain of the first domain interior nodes First path coefficient i_path_1_1_1 can be obtained by following formula:
I_path_1_1_1=z12* (1+10%)/[z12* (1+10%)+z13] (22)
For another example when the third domain interior nodes have newly-increased server, the road the first Yu Nei of the first domain interior nodes The first path coefficient i_path_1_1_1 of diameter can be obtained by following formula:
I_path_1_1_1=z12/ [z12+z13* (1+10%)] (23)
It should be noted that ratio of the above-mentioned number of servers with the newly-increased corresponding domain interior nodes of server in 10% Increase number of servers weight and is only for the server count for example, specific proportionality coefficient or increase corresponding field interior nodes It's not limited to that for the method for amount weight.Due to generally it can be thought that the ability that newly-increased server provides network service takes than storage Be engaged in device provide network service ability it is strong, therefore, when first domain interior nodes be directly connected to or be indirectly connected with other are any When there is newly-increased server in the interior nodes of domain, bandwidth allocation can be planned to the tool more MAN of the first domain interior nodes There is path in the corresponding domain of domain interior nodes of newly-increased server.
Fig. 9 shows the treatment process schematic diagram of step S810 shown in fig. 8 in one embodiment.
As described in Figure 9, the step S810 in above-mentioned Fig. 8 may further include following steps.
In step S811, according in first domain in the historical traffic information acquisition in path first domain path storage Plan bandwidth.
In the present embodiment, it can be obtained in first domain according to the historical traffic and flow growth rate in path in first domain The storage in path plans bandwidth, it is assumed for example that in first domain path historical traffic in 2015 be traffic2015_1, this The flow growth rate in one path in domain 2015 is that fg2015_1 (is deposited using flow growth rate in 2015 as 2016 here The flow growth rate of server is measured, but it's not limited to that for the disclosure, for example, it is also possible to pass through the several years before 2016 Flow growth rate obtain 2016 storage server flow growth rate), can be calculated by the following formula acquisition this first The storage of path storage server in 2016 plans bandwidth s_plan_1 in domain:
S_plan_1=traffic2015_1* (1+fg2015_1) (24)
In step S812, according to the newly-increased number of servers of the first domain interior nodes and the first path coefficient, this The newly-increased number of servers of two domain interior nodes and second path coefficient and the second bandwidth service index obtain first domain The increment in interior path plans bandwidth.
In the present embodiment, it is assumed that the newly-increased number of servers of the first domain interior nodes be y1, the second domain interior nodes it is new Increasing number of servers is y2, which is that the second bandwidth service index of newly-increased server is BDwidth_MAN, then The increment planning bandwidth in path is i_plan_path_1 in first domain.The increment in path plans bandwidth i_ in first domain The specific calculation of plan_path_1 is referred to hereafter.
In step S813, according in first domain path storage planning bandwidth and increment planning bandwidth obtain this first The planning bandwidth in path in domain.
In the present embodiment, bandwidth s_plan_1 is planned according to the storage of path storage server in 2016 in first domain The planning in path in first domain can be obtained with path increment in 2016 planning bandwidth i_plan_path_1 in first domain Bandwidth plan_path_1, such as acquisition can be calculated by the following formula:
Plan_path_1=s_plan_1+i_plan_path_1 (25)
In the exemplary embodiment, the increment planning bandwidth plan_path_1 in path includes first domain in first domain Interior path is about path in the first increment planning bandwidth of the first domain interior nodes and first domain about the second domain interior nodes The second increment plan bandwidth.
Figure 10 shows the treatment process schematic diagram of step S812 shown in Fig. 9 in one embodiment.
As described in Figure 10, step S812 described in above-mentioned Fig. 9 may further include following steps.
In step S8121, according to the newly-increased number of servers of the first domain interior nodes, the first path coefficient and this Two bandwidth service indexs obtain first increment planning bandwidth.
In step S8122, according to the newly-increased number of servers of the second domain interior nodes, second path coefficient and this Two bandwidth service indexs obtain second increment planning bandwidth.
In step S8123, the greater chosen in first increment planning bandwidth and second increment planning bandwidth is made Bandwidth is planned for the increment in path in first domain.
For example, it is assumed that the newly-increased number of servers of the first domain interior nodes is y1, the newly-increased service of the second domain interior nodes Device quantity is y2, and the second bandwidth service index for increasing server newly is BDwidth_MAN, then the increment in path is advised in first domain Acquisition can be calculated by the following formula by drawing bandwidth i_plan_path_1:
I_plan_path_1=MAX (y1*BDwidth_MAN*i_path_1_1_1,
y2*BDwidth_MAN*i_path_2_1_2) (26)
Calculate separately the first increment planning bandwidth y1* in path in first domain for obtaining the first domain interior nodes BDwidth_MAN*i_path_1_1_1, second increment in path plans bandwidth y2* in first domain of the second domain interior nodes Then BDwidth_MAN*i_path_2_1_2 selects increment rule of the numerical value the greater as path in first domain in the two Draw bandwidth i_plan_path_1.
For another example the increment planning bandwidth i_plan_ for obtaining path in first domain can also be calculated by the following formula Path_1:
I_plan_path_1=(y1*BDwidth_MAN*i_path_1_1_1
+y2*BDwidth_MAN*i_path_2_1_2)/2 (27)
The increment planning bandwidth i_plan_path_1 in path is also possible to first increment planning bandwidth i.e. in first domain With the arithmetic mean of instantaneous value of second increment planning bandwidth.The disclosure can to the solution of the increment planning bandwidth in path in first domain To carry out any suitable deformation.
In the exemplary embodiment, which may include the second domain, which may include domain interior nodes And network switching node, the domain interior nodes can connect the network switching node by path in domain.
Figure 11 diagrammatically illustrates the schematic diagram in the second domain of an embodiment according to the present invention.
As shown in figure 11, network structure provided in this embodiment may include the second domain, may include in second domain One domain interior nodes and network switching node, the first domain interior nodes can connect the network exchange section by path in corresponding domain Point.
In other embodiments, which can also include the second domain interior nodes, third domain interior nodes even the 4th domain Interior nodes, the second domain interior nodes, the third domain interior nodes and the 4th domain interior nodes pass through path in corresponding domain respectively and connect Connect the network switching node.The disclosure is not construed as limiting the quantity for the domain interior nodes having in second domain.
In the embodiment shown in fig. 11, regardless of having how many a domain interior nodes in second domain, each domain interior nodes are equal By path in respective domain it is connected to the network switching node, and two domain interior nodes are not present are directly connected between each other Path in domain, at this point, each domain interior nodes in second domain only have path in a domain, it is believed that there is no path coefficient or Person's path coefficient is 1.
Figure 12 diagrammatically illustrates the flow chart of network resource planning method according to still another embodiment of the invention.This reality Applying the example network resource planning method can be applied to the second domain shown in above-mentioned Figure 11.
As shown in figure 12, network resource planning method provided in this embodiment include the steps that in above-described embodiment S510 and S520 can also include step S1210.
In step S1210, according to the newly-increased number of servers of the historical traffic information, the domain interior nodes in path in the domain The planning bandwidth in path in the domain is obtained with the second bandwidth service index of newly-increased server.
Here by taking the first domain interior nodes in second domain as an example, the first domain interior nodes connect the net by path in a domain Network switching node, at this time, it is assumed that path historical traffic in 2015 is traffic2015_1 in the domain, in the domain path Flow growth rate in 2015 is fg2015_1 (here using flow growth rate in 2015 as storage server in 2016 Flow growth rate, but it's not limited to that for the disclosure, for example, it is also possible to pass through the flow growth rate of the several years before 2016 Obtain the flow growth rate of storage server in 2016), it can be calculated by the following formula and obtain path 2016 in the domain Storage server storage plan bandwidth s_plan_1:
S_plan_1=traffic2015_1* (1+fg2015_1) (28)
For example, it is assumed that the newly-increased number of servers of the first domain interior nodes is y1, the second bandwidth service of server is increased newly Index is BDwidth_MAN, then the increment planning bandwidth i_plan_path_1 in path can be calculated by the following formula in the domain It obtains:
I_plan_path_1=y1*BDwidth_MAN (29)
In the present embodiment, according to the storage planning bandwidth s_plan_1 of path storage server in 2016 in the domain and it is somebody's turn to do Path increment in 2016 planning bandwidth i_plan_path_1 can obtain the planning bandwidth plan_ in path in the domain in domain Path_1, such as acquisition can be calculated by the following formula:
Plan_path_1=s_plan_1+i_plan_path_1 (30)
Similar, the planning bandwidth in path in other corresponding domains of domain interior nodes in second domain can be obtained.
In the exemplary embodiment, the planning band in path in all domains in the network structure can be obtained using the above method It is wide.
In the exemplary embodiment, the planning bandwidth summation in path in each domain in the network structure can also be somebody's turn to do The MAN of network structure plans bandwidth.
In the exemplary embodiment, which may include the first domain and the second domain, which can pass through First inter-domain path connects second domain.
Figure 13 diagrammatically illustrates the network knot of application network resource planning method according to another embodiment of the present invention The schematic diagram of structure.
As shown in figure 13, network structure provided in this embodiment may include the first domain and the second domain, which can be with Second domain is connected by the first inter-domain path.
In other embodiments, which can also include third domain, which can pass through the second road Yu Jian Diameter connects first domain.
In some embodiments, which can also connect second domain by third inter-domain path.
Figure 14 diagrammatically illustrates the flow chart of the network resource planning method of another embodiment according to the present invention.
As shown in figure 14, network resource planning method provided in this embodiment can be applied to network knot shown in Figure 13 Structure.The network resource planning method may include step S510 and S520 in above-described embodiment, can also include step S1410。
In step S1410, according to the historical traffic information and path coefficient of first inter-domain path, first domain and it is somebody's turn to do The newly-increased number of servers in the second domain and the third bandwidth service index of newly-increased server obtain the rule of first inter-domain path Draw bandwidth.
In the present embodiment, the historical traffic information of first inter-domain path may include the history stream of first inter-domain path Amount and flow growth rate, such as first inter-domain path historical traffic m_traffic2015_1 in 2015 and stream in 2015 Growth rate m_fg2015_1 is measured, wherein m_fg2015_1 can be calculated by the following formula acquisition:
M_fg2015_1=(m_traffic2015_1-m_traffic2014_1)/m_traffic2014_1 (31)
In above-mentioned formula, m_traffic2014_1 indicates the first inter-domain path historical traffic in 2014.
In the present embodiment, the third bandwidth service index BDwidth_DCI for increasing server newly indicates new within project period Increase across the city bandwidth service ability of server, the circular of third bandwidth service index BDwidth_DCI is referred to Hereafter.
Wherein, when first domain is only directly connected to second domain, the path coefficient of first inter-domain path can be 1.At this time, it is assumed that the newly-increased number of servers in first domain is O1, and the newly-increased number of servers in second domain is O2, increases service newly The third bandwidth service index of device is BDwidth_DCI, then can be calculated by the following formula and obtain first inter-domain path Plan bandwidth m_plan2016_1:
M_plan2016_1=m_traffic2015_1 (1+m_fg2015_1)
+ MAX (O1*BDwidth_DCI, O2*BDwidth_DCI) (32)
The increment in the first domain can be selected to plan the increment planning bandwidth O2* in bandwidth O1*BDwidth_DCI and the second domain The larger value in BDwidth_DCI plans bandwidth as the increment of first inter-domain path.
Alternatively, the planning bandwidth m_plan2016_1 for obtaining first inter-domain path can also be calculated by the following formula:
M_plan2016_1=m_traffic2015_1 (1+m_fg2015_1)
+(O1*BDwidth_DCI+O2*BDwidth_DCI)/2 (33)
It can seek the increment planning bandwidth O1*BDwidth_DCI in the first domain and the increment planning bandwidth O2* in the second domain The arithmetic mean of instantaneous value of BDwidth_DCI plans bandwidth as the increment of first inter-domain path.
It should be noted that be in above-described embodiment with the previous year in this year (being assumed to be 2016) to be predicted here Flow for first inter-domain path flow growth rate in 2015 as first inter-domain path storage server in 2016 Growth rate, but in fact, this year to be predicted can also be obtained according to the flow growth rate of this several years the year before to be predicted The flow growth rate of storage server, for example, before the several years flow growth rate arithmetic mean of instantaneous value, in another example the preceding several years The weighted sum etc. of flow growth rate, the disclosure is not construed as limiting this.
In the exemplary embodiment, when first domain also passes through the second inter-domain path connection third domain, between first domain The path coefficient in path includes that first inter-domain path is closed about the third path coefficient in first domain and first inter-domain path The 4th path coefficient in second domain.
I.e. when first domain is there are when a plurality of inter-domain path, which is directed to the third path system in first domain Number reflects the distribution accounting situation of the planning bandwidth in first inter-domain path in first domain.Meanwhile first domain is a plurality of The sum of each path coefficient of inter-domain path is 1.
Similar, if second domain only corresponds to an inter-domain path, the 4th path coefficient in second domain is 1. If second domain also corresponds to a plurality of inter-domain path, for example, second domain, which also passes through third inter-domain path, connects the third domain, then Need to acquire the path coefficient of first inter-domain path and the third inter-domain path in second domain at this time, and second domain should The sum of path coefficient of first inter-domain path and the third inter-domain path is 1.
In the exemplary embodiment, the method can also include: according to direct with first domain at least one domain The number of servers in other domains for connecting and/or being indirectly connected with obtains the third path coefficient.
Or by taking first domain of Figure 13 as an example, it is assumed that (number of servers here is equal for the number of servers in first domain Refer to the sum of increment server and the newly-increased number of servers in project period) be P1, be directly connected to first domain this second The number of servers in domain is P2, and the number of servers in the third domain being directly connected to first domain is P3, at this time regardless of this Whether three domains are directly connected between second domain, third path coefficient m_ of first inter-domain path about first domain Path1_1_3 can be with are as follows:
M_path1_1_3=P2/ (P2+P3) (34)
At this point, if second domain is not directly connected to, then other than being directly connected between the first domain with any other domain First inter-domain path is 1 about the 4th path coefficient m_path1_2_4 in second domain.If second domain in addition to this One domain is also directly connected to third domain, then fourth path coefficient of first inter-domain path about second domain outside being directly connected to M_path1_2_4 can be with are as follows:
M_path1_2_4=P1/ (P1+P3) (35)
Figure 15 shows the treatment process schematic diagram of step S1410 shown in Figure 14 in one embodiment.
As shown in figure 15, step S1410 described in above-mentioned Figure 14 may further include following steps.
In step S1411, according to depositing for historical traffic information acquisition first inter-domain path of first inter-domain path Gauge draws bandwidth.
In the present embodiment, the historical traffic information of first inter-domain path may include the history stream of first inter-domain path Amount and flow growth rate.Assuming that the first inter-domain path historical traffic in 2015 is m_traffic2015_1, between first domain Path flow growth rate in 2015 is m_fg2015_1, then the storage of first inter-domain path plans bandwidth s_m_ Plan2016_1 can be calculated by the following formula acquisition:
S_m_plan2016_1=m_traffic2015_1 (1+m_fg2015_1) (36)
In step S1412, according to the newly-increased number of servers in first domain and the third path coefficient, second domain Newly-increased number of servers and the 4th path coefficient and the third bandwidth service index obtain the increment of first inter-domain path Plan bandwidth.
For example, it is assumed that the newly-increased number of servers in first domain is O1, the newly-increased number of servers in second domain is O2, newly The third bandwidth service index for increasing server is BDwidth_DCI, then can be calculated by the following formula between obtaining first domain The increment in path plans bandwidth i_m_plan2016_1:
I_m_plan2016_1=MAX (O1*BDwidth_DCI*m_path1_1_3,
O2*BDwidth_DCI*m_path1_2_4) (37)
The increment that first inter-domain path can be chosen about first domain plans bandwidth O1*BDwidth_DCI*m_ The increment planning bandwidth O2*BDwidth_DCI*m_path1_2_4 of path1_1_3 and first inter-domain path about second domain The larger value plans bandwidth i_m_plan2016_1 as the increment of first inter-domain path in the two.
For another example the increment planning bandwidth i_m_ of first inter-domain path can also be obtained by following formula Plan2016_1:
I_m_plan2016_1=(O1*BDwidth_DCI*m_path1_1_3+
O2*BDwidth_DCI*m_path1_2_4)/2 (38)
First inter-domain path can also be planned into bandwidth O1*BDwidth_DCI*m_ about the increment in first domain The increment planning bandwidth O2*BDwidth_DCI*m_path1_2_4 of path1_1_3 and first inter-domain path about second domain The arithmetic mean of instantaneous value of the two plans bandwidth i_m_plan2016_1 as the increment of first inter-domain path.
In step S1413, according to the storage of first inter-domain path plan bandwidth and increment planning bandwidth obtain this The planning bandwidth of one inter-domain path.
In the present embodiment, bandwidth s_m_plan2016_1 and first domain can be planned to the storage of first inter-domain path Between path increment planning bandwidth i_m_plan2016_1 summation obtain first inter-domain path planning bandwidth.
Using similar method, the planning bandwidth of any bar inter-domain path in the network structure can be obtained.
In the exemplary embodiment, the planning bandwidth of each inter-domain path in the network structure can also be summed and is somebody's turn to do The DCI of network structure plans bandwidth.
Figure 16 diagrammatically illustrates the network knot of the application network resource planning method of another embodiment according to the present invention The schematic diagram of structure.
As shown in figure 16, it on the basis of network structure provided in this embodiment network structure shown in Figure 13, can also wrap The 4th domain is included, the 4th domain connects the third domain by one article of inter-domain path.
When the network structure further includes the 4th domain, and the 4th domain is directly connected to by one article of inter-domain path and the third domain When, it is assumed that the number of servers in the 4th domain is P4, then third path coefficient m_ of first inter-domain path about first domain Path1_1_3 can be with are as follows:
M_path1_1_3=P2/ (P2+P3+P4) (39)
Then second inter-domain path can be (P3+P4)/(P2+P3+P4) about the path coefficient in first domain.
In the exemplary embodiment, the method can also include: and work as to be directly connected to or be indirectly connected with first domain Other domains in when including newly-increased server, increase the number of servers weight of corresponding field.
For example, it is assumed that there is newly-increased server in the second domain, then third path of first inter-domain path about first domain Coefficient m _ path1_1_3 can be with are as follows:
M_path1_1_3=P2/ [P2* (1+10%)+P3+P4] (40)
For another example assume there is newly-increased server in the 4th domain, then third road of first inter-domain path about first domain Diameter Coefficient m _ path1_1_3 can be with are as follows:
M_path1_1_3=P2/ [P2+P3+P4* (1+10%)] (41)
It should be noted that the above-mentioned number of servers with the newly-increased corresponding domain of server increases clothes in 10% ratio Business device quantity weight is only for the method for example, specific proportionality coefficient or the number of servers weight for increasing corresponding field It's not limited to that.Due to generally it can be thought that the ability that newly-increased server provides network service provides network than storage server The ability of service is strong, therefore, increases server newly when having in other any domains that first domain is directly connected to or is indirectly connected with When, more DCI in first domain can be planned that bandwidth allocation has the corresponding inter-domain path in the domain of newly-increased server to this.
Figure 17 diagrammatically illustrates the network knot of the application network resource planning method of another embodiment according to the present invention The schematic diagram of structure.
As shown in figure 17, on the basis of network structure provided in this embodiment network structure shown in Figure 16, the 4th domain First domain is also connected by an inter-domain path.
When the 4th domain also passes through the 5th inter-domain path and first domain is directly connected to, then first inter-domain path about The third path coefficient m_path1_1_3 in first domain is P2/ (P2+P3+P4), and second inter-domain path is about first domain Path coefficient is P3/ (P2+P3+P4), and the 5th inter-domain path is P4/ (P2+P3+P4) about the path coefficient in first domain.
By the above content it is found that third path coefficient=second domain server of i.e. the first inter-domain path about the first domain The sum of the number of servers in the every other domain that quantity/and first domain are directly connected to or are indirectly connected with, and first domain The sum of path coefficient of each inter-domain path is 1.It, can be in the hope of the road Yu Jian of arbitrarily-shaped domain in the network structure using similar method The path coefficient of diameter.
For example, the 4th domain in above-mentioned Figure 16 is to be indirectly connected with by third domain and the first domain.
Illustrate the network resource planning method of above-described embodiment below by the example of Figure 18-26.
Figure 18 diagrammatically illustrates the block diagram of the application network resource planning method of an embodiment according to the present invention.
The present embodiment carries out the planning of network bandwidth, Model of network traffic master by one Model of network traffic of building If being increased according to server single machine (i.e. single server in other words every server) mean value (outlet/DCI/MAN), server single machine Long rate (speedup trend), the bandwidth service ability (BDwidth_TIX/BDwidth_DCI/BDwidth_MAN) for increasing server newly Etc. indexs or the planning bandwidth because network structure is usually calculated.In other embodiments, path system can also be comprehensively considered Number the indexs such as (path in external path/inter-domain path/domain) and industry development (such as industry growth base), operator's accounting or Because usually COMPREHENSIVE CALCULATING obtains the planning bandwidth of network structure.
As shown in figure 18, the server delta (i.e. newly-increased number of servers) in project period such as following 1 year, basis are referred to Mark (such as may include in server single machine mean value, server single machine growth rate, bandwidth service ability of newly-increased server etc. Any one is a variety of) and differentiation index (such as may include in path coefficient, industry development, operator's accounting etc. Any one is a variety of) it is input in Model of network traffic, the output of Model of network traffic and business demand are connected to net Network resource requirement obtains the outlet bandwidth of TIX product, the DCI bandwidth and MAN product of DCI product according to network resource requirement MAN bandwidth, finally according to outlet bandwidth, DCI bandwidth and MAN bandwidth export network resource planning.
Wherein it is possible to the calculated result obtained will be calculated according to the Model of network traffic and according to the business demand meter of input The business overall network bandwidth obtained is calculated to be compared, it should when using the calculated result of Model of network traffic calculating acquisition to be greater than When business overall network bandwidth, the calculated result obtained can be calculated using the Model of network traffic；When using the network flow When model calculates the calculated result obtained less than the business overall network bandwidth, it can go to verify each business that business department submits Whether band data has calculating deviation, then determines the planning band data finally used according to result is verified.
Network resource planning scheme provided in this embodiment for example can be used for Internet company's yearly budget establishment and system Determine medium-term and long-term plans use, usually can be per for example August part start in every year, it can be compared with by the network resource planning scheme Network bandwidth layout data that is fast and being accurately obtained such as following 1 to 3 year, in particular for instructing the network budget of next year to compile System.
The network resource planning method that disclosure embodiment provides, is to establish network by magnanimity historical traffic data Discharge model to obtain the planning bandwidth of network structure by the Model of network traffic, and does not completely depend on business offer Band data avoids the business of believing one side only, and the accuracy of network resource planning can be improved.It on the other hand, can also be outer by introducing Portion's factor such as operator's accounting and/or industry data such as industry growth base carry out the planning band of further corrective networks structure Width obtains and more accurately plans bandwidth.
The preparation method of above-mentioned base values and differentiation index is introduced separately below.
The preparation method of base values
(1) acquisition of list server traffic mean value xTPS and single server traffic growth rate
It in some embodiments, can be the national total flow of T company (or annual peak value) divided by director server quantity Single server traffic mean value xTPS (Traffic per Server) is calculated.Wherein, heterogeneous networks bandwidth types are based on, it can To divide into different mean values, such as every server public network rate of discharge mean value ITPS (Internet Traffic per Server), every server is with city Intranet flow mean value MTPS (MAN Traffic per Server) and every server across city Intranet flow mean value DTPS (DCI Traffic per Server), and calculate respective annual flow growth rate.
For example, can be by T company same city Intranet MAN total flow in 2015 divided by T company director server number in 2015 T company MTPS in 2015 can be obtained in amount.Similar, it can be by T company across city Intranet DCI total flow in 2015 divided by T T company DTPS in 2015 can be obtained in company's director server quantity in 2015.T company public network in 2015 can also be gone out T company ITPS in 2015 can be obtained divided by T company director server quantity in 2015 in mouth TIX total flow.
The trend that Figure 19 diagrammatically illustrates the single server MAN Intranet flow value of an embodiment according to the present invention becomes Change figure.
As shown in figure 19, there is illustrated every server MAN Intranet flow values, wherein 2013.12,2014.12 and 2015.12 representatives are historical traffic datas, and what 2016.12e was represented is the Internet resources rule provided according to the embodiment of the present disclosure The predicted flow rate data that the method for drawing obtains.
It should be noted that due to be when the usual annual end of the year Internet enterprises the peak flow time, Figure 19- It has selected the peak flow in annual December as annual total flow in 21, but in fact, also can choose other annual The peak flow in month increases to calculate single machine (i.e. single server or being referred to as single server) flow mean value and single machine flow Rate.
The trend that Figure 20 diagrammatically illustrates the single server DCI Intranet flow value of an embodiment according to the present invention becomes Change figure.
As shown in figure 20, there is illustrated every server DCI Intranet flow value, 2013.12,2014.12 and 2015.12 What is represented is historical traffic data, and what 2016.12e was represented is that the network resource planning method provided according to the embodiment of the present disclosure obtains The predicted flow rate data obtained.
Figure 21 diagrammatically illustrates the trend of the single server public network outlet stream magnitude of an embodiment according to the present invention Variation diagram.
As shown in figure 21, there is illustrated every server public network outlet stream magnitude, 2013.12,2014.12 and 2015.12 representatives are historical traffic datas, and what 2016.12e was represented is the Internet resources rule provided according to the embodiment of the present disclosure The predicted flow rate data that the method for drawing obtains.
Available 2015 12 as shown in table 1 below of MAN/DCI/TIX historical traffic data based on above-mentioned Figure 19-21 Existing the whole network single machine flow mean value (being abbreviated as " single machine mean value ") of the moon and existing the whole network single machine flow growth rate (are abbreviated as " single Machine growth rate "):
Citing: Single machine mean value Single machine growth rate
MAN MTPS:28M Year increases by 39%
DCI DTPS:5.3M Year increases by 88%
TIX ITPS:13M Year increases by 25%
Table 1: existing the whole network single machine flow mean value and growth rate
The single machine growth rate for obtaining ITPS can be calculated according to the following formula by taking TIX as an example, in above-mentioned table 1:
The single machine growth rate of ITPS=(ITPS single machine mean value -2014 years ITPS single machine mean values in 2015)/2014 ITPS single machine mean value * 100%
Similar, the single machine growth rate of the single machine growth rate and DTPS that obtain MTPS can be calculated.
It should be noted that " the whole network " in the present embodiment refers to the existing all storages in the whole nation of T company to be planned Server.The whole nation that single machine mean value and single machine growth rate in i.e. above-mentioned Figure 19-21 are all based on T company to be planned is existing For all storage servers.
In some embodiments, can choose in table 1 calculate obtain near this year (such as 2016) to be planned Existing the whole network single machine flow growth rate in 2015 as following 2016 1 year flow growth rates, that is, assume 2016 It is 88%, TIX single machine growth rate is 25% that MAN single machine growth rate, which is 39%, DCI single machine growth rate,.
(2) acquisition of bandwidth service index
In the present embodiment, the bandwidth service index expression Netowrk tape that a newly-increased server has within this year to be planned Wide service ability BDwidthAbility can pass through the single machine to heterogeneous networks bandwidth types (such as TIX/MAN/DCI) Historical traffic analyze and count, such as can choose respective network bandwidth type covering 80% (this numerical value can basis Actual demand is independently arranged) numerical value of quantity is as bandwidth service ability benchmark.
Wherein, network bandwidth service ability BDwidthAbility refers to the standard that network architecture service-oriented can support Traffic service ability level means to run 100M or following when every server of business if bandwidth service ability is 100M When flow, there is no problem for network support.
It is as shown in table 2 below by taking the bandwidth service ability benchmark of TIX as an example:
Table 2: the MAN single machine average flow rate of each data center
Assume that the T company whole nation one in 2015 shares 100 data centers in above-mentioned table 2,100 data centers here It is only for the purpose of illustration, it may be more than 100 or fewer than 100 in actual conditions.It calculates separately out in this 100 data centers Each data center single machine average flow rate (ITPS of each data center), such as the TIX single machine mean flow of data center 1 TIX historical traffic/data center 1 storage number of servers of amount=data center 1, here for 2015, data The TIX historical traffic at center 1 can be obtained by the TIX historical traffic of every server in 2015 annual data centers 1 of adding up.Meter Calculation obtain the TIX single machine average flow rate of this 100 data centers after, by its according to numerical values recited descending arrangement (it is of course also possible to Arranged according to ascending order, the disclosure is not construed as limiting this), select predetermined percentage (be exemplified as 20% here, but the disclosure to this not Limit) the TIX bandwidth service ability benchmark of the TIX single machine average flow rate of data center at position as the whole network.Here it selects The value (20.11M) for having selected 100 Qian20Ge data centers, data center wants the standard that can be supported as usual construction bandwidth Rate of discharge.
It should be noted that selection calculates TIX single machine average flow rate as unit of each data center in above-mentioned table 2, In fact, may include again one or more computer room in each data center, accordingly it is also possible to be each computer room of statistical analysis Single machine average flow rate obtain the TIX bandwidth service ability benchmark of the whole network, the disclosure is not construed as limiting this.
Using similar method, the DCI bandwidth service ability benchmark and MAN bandwidth service ability base of the whole network can be obtained It is quasi-.
According to each network bandwidth type obtained in the TIX/MAN/DCI bandwidth service ability benchmark of acquisition and above-mentioned (one) Following 1 year single machine growth rate calculates following 1 year bandwidth service index (such as the first bandwidth service indication BDwidth_ TIX/ the second bandwidth service index BDwidth_MAN/ third bandwidth service index BDwidth_DCI).
Or illustrate by taking TIX as an example, TIX single machine growth rate in 2016 is 25%, TIX bandwidth service ability in 2016 Benchmark is 20.11, can be calculated by the following formula the first bandwidth service indication for obtaining the newly-increased server of T company in 2016 BDwidth_TIX:
BDwidth_TIX=20.11 (1+25%) ≈ 25M (42)
Similar, it can calculate and obtain the second bandwidth service index BDwidth_MAN and third bandwidth service index BDwidth_DCI, as shown in table 3 below:
Network bandwidth type Bandwidth service ability BDwidthAbility
MAN 50M
DCI 8M
Public network TIX 25M
Table 4: bandwidth service index
(3) computer room growth stage index DCyears
It, can be to time (the i.e. computer room friendship that all network of computer room modules are established according to data center machine room in the present embodiment The time that the business of paying uses) length and network flow feature (such as flow growth feature), set up growth stage and stationary phase.
Common, after data center machine room is delivered for use, rate of discharge (being equally applicable to MAN and DCI) just starts can be fast Speed increases, and stability of flow slowly increases or even steady later, and the previous stage can be referred to as the growth stage, and latter stage can be with Referred to as stationary phase.
Figure 22 diagrammatically illustrates the schematic diagram of the computer room traffic trends of an embodiment according to the present invention.
As shown in figure 22, it is shown that the life cycle flow diagram of a data center machine room.The data center machine room is delivered N (N is the positive integer more than or equal to 1) annual flow tends towards stability, i.e. the data center machine room is in growth stage, N before N The data center machine room is in stationary phase later.
In the present embodiment, the time span of the data center machine room of different scales, growth stage can be different, such as 20,000 rule After the data center machine room delivery of mould in 2 years, flow increases obviously, and stationary phase is entered after 2 years；The data center of 5000 scales After computer room is delivered 1 year, data center machine room enters stationary phase.I.e. under normal circumstances, count available according to the observation, in data Scheming room scale is bigger, and corresponding time computer room growth stage is longer.
For simplicity, a time threshold can be set, such as be used as within 2 years and divide in growth stage and stationary phase data The time threshold in scheming room, such as the computer room being delivered for use in 2 years are considered the computer room in the growth stage, are delivered for use after 2 years Computer room be considered the computer room in stationary phase, without considering server in machine room scale.
When having multiple servers in same computer room, first in the multiple servers was delivered for use in 2010, Second batch was delivered for use in 2011, and third batch was delivered for use in 2012, can be according to the first delivery time The initial time that is delivered for use as the computer room in 2010, because the server in actual conditions in general computer room does not exceed 1 Nian Douhui is finished.
The preparation method of differentiation index
In the present embodiment, the differentiation index refers mainly to the index that part of the manufacturer needs differentiation to refine, including operation Quotient's accounting (operator's proportionality coefficient), industry calibration coefficients and path coefficient etc..
It should be noted that the differentiation index in the embodiment of the present disclosure is mainly with network architecture variation, operator The corresponding adjustment for the network bandwidth planning that the needs such as variation, industry variation are done, if these differentiation indexs do not change, nothing It needs to adjust.
(1) TIX: operator accounting ISPRatio (Internet Service Provider Ratio, Internet service Provider's accounting)
It, can be based on the history operator rate of discharge accounting and operator's layout data of network structure in the present embodiment To obtain operator's proportionality coefficient.Wherein, the history operator rate of discharge accounting of network structure can such as refer to such as 2015 The TIX historical traffic Zhong Ge operator of year network structure respectively shared by ratio.Operator's layout data can refer to each fortune The data such as the network bandwidth construction quotas in 2016 that battalion quotient will for example externally announce in the end of the year in 2015 or 2016 beginning of the years, root The planning flow proportional for obtaining each operator can be calculated according to operator's layout data.Here operator's proportionality coefficient refer to Plan each operator's allocation proportion of the TIX planning flow of such as 2016 this year network structure.
Figure 23 diagrammatically illustrates the schematic diagram of operator's proportionality coefficient of an embodiment according to the present invention.
As shown in figure 23, it is assumed that altogether there are three operator, the first operator here: the second operator: third operator Operator's historical traffic ratio be 18%:30%:52%；First operator: the second operator: the operator of third operator Planning flow proportional is 40%:20%:40%；Assuming that operator's historical traffic ratio and operator's planning flow proportional are according to 3: The distribution weight of 1 (numerical value can be independently arranged according to actual needs), can obtain the first operator: the second operator: Operator's proportionality coefficient of three operators is about 24%:27%:49%, can specifically be obtained by following calculation formula:
Operator's proportionality coefficient=historical traffic ratio * 3/4+ operator, operator plans flow proportional * 1/4
=(18%:30%:52%) * 3/4+ (40%:20%:40%) * 1/4
≈ 24%:27%:49% (43)
(2) TIX: industry calibration coefficients Hmin
It, can (such as the number of users of Internet user be in increasing in following 1 year in conjunction with terminal user's scale in the present embodiment Long speed, the number of users of Internet user is user's total number of persons of the terminal such as using mobile phone, tablet computer, computer here), User network (such as the home network bandwidth of each user, cell phone network etc. in following 1 year growth rate, i.e. internet is used The single user rate at family), operator's construction scale (such as operator following 1 year backbone bandwidth growth rate and/or Metropolitan Area Network (MAN) bandwidth growth rate etc.) and industry growth trend (such as corresponding industry was in following 1 year bandwidth growth rate) etc., Determine the i.e. industry calibration coefficients Hmin of industry bandwidth speedup calibration coefficients.When the corporate network planned according to above-mentioned Model of network traffic Network resource annual growth rate be lower than the sector calibration coefficients when, then can by company network resource (herein refer to TIX planning bandwidth, Not including the planning bandwidth of MAN and DCI) annual growth rate is modified to the sector calibration coefficients Hmin.
Figure 24 diagrammatically illustrates the schematic diagram of the industry calibration coefficients of an embodiment according to the present invention.
As shown in figure 24, the various data in diagram that can be obtained by industry report, carrier data.Here with T company to be planned be Internet company for, plan the network bandwidth of T company in 2016, it is assumed that Internet user 2016 Number of users growth rate be 6%, single user rate (network bandwidth of i.e. single Internet user) growth rate of Internet user For 80%-90%, Internet user in 2016 can be obtained according to the number of users growth rate and the single user rate growth rate User network bandwidth speedup, refer to that the comprehensive of number of users and user rate increases；The backbone bandwidth speedup of carrier network is 50%-60%, carrier network here are, for example, the backbone bandwidth of integral telecommunication, connection, movement etc.；Since T company belongs to In internet industry, therefore, select several key industrys of internet industry for reference, such as emphasis internet industry society Friendship, multimedia, the network bandwidth speedup of cloud and finance are respectively 50%, 80%, 130% and 60%, emphasis interconnection here Net industry refers to crucial Internet service, can select as the case may be, such as selects in conjunction with each operational plate accounting of T company Corresponding business is selected as emphasis internet industry.
Wherein, such as industry calibration coefficients Hmin can be obtained by following formula:
Hmin=Min (user network bandwidth speedup, backbone bandwidth speedup, industry network bandwidth speedup) (44)
For example, the Hmin=50% in Figure 24.
Select the minimum value in above-mentioned three as industry calibration coefficients Hmin, because of the interconnection for a growth form For net company, generally it can be thought that the network bandwidth speedup of the said firm can be greater than the user network of Internet user under normal circumstances Minimum value in network bandwidth speedup, backbone bandwidth speedup and industry network bandwidth speedup.It is in down conversely, for a business For the company of drop phase, it is also assumed that the network bandwidth speedup of the said firm is less than industry calibration coefficients Hmin, the disclosure is to this It is not construed as limiting.
It should be noted that above-mentioned be illustrated by taking internet industry as an example, but the network resource planning method It can be applied to other industry, therefore, when variation has occurred in the industry attribute of target object to be planned, can choose corresponding The network bandwidth speedup of industry is as reference.
Figure 25 diagrammatically illustrates the schematic diagram of the path coefficient of the data center of an embodiment according to the present invention.
In the present embodiment, when multipath situation occurs in network structure, need to provide the planning that each path respectively undertakes Bandwidth specific gravity carries out the distribution of planning bandwidth according to the path coefficient in each path.
In some embodiments, when the current data center (or current garden) in network structure has multipath (this In refer to path in multiple domains) when, can according to the current data center interconnection (including be directly connected to and/or be indirectly connected with) Opposite end data center each domain of the number of servers to calculate the current data center in path path coefficient.
In further embodiments, can also further whether be had according to the opposite end data center of the current data center Increase server newly, the path coefficient in path in each domain to adjust the current data center.I.e. generally it can be thought that having newly-increased Path can carry more network bandwidths in the corresponding domain of opposite end data center of server, at this point it is possible to accordingly increase The planning bandwidth in path in the domain.
For example, when there is newly-increased server corresponding opposite end data center then to be given to increase by 10% weight for opposite end data center, If opposite end data center is not increase server newly in more than 2 years (numerical value can be independently arranged according to actual needs), then it is assumed that phase Reply end data center is full configuration data center (or full configuration garden), reduces by 10% weight.
As shown in figure 25, the opposite end data center server quantity accounting in path is in each domain of the current data center 30%:30%:40%, the opposite end data center traffic bandwidth factor in path is respectively 0.9 in each domain of the current data center, 1.1 and 1.1, it is hereby achieved that the path coefficient in path is respectively 26% in each domain of the current data center, 32% He 42%.
For example, i.e. the current data center is M1, M1 is directly connected to by path in the first domain with M2, and M1 also passes through second Path is directly connected to M3 in domain, and M1 also passes through path in third domain and is directly connected to M4, it is assumed that the number of servers of M2 (such as The sum of newly-increased number of servers in 2016 and storage number of servers) it is 300,000, the number of servers of M3 is 300,000, M4 Number of servers be 400,000, when full configuration data center, M3 and the M4 that M2 is 2 years newly-increased servers are with newly-increased service When the opposite end data center of device, then it is 1.1, Ke Yitong that the service bandwidth coefficient of M2, which is the service bandwidth coefficient of 0.9, M3 and M4, Cross the path coefficient that following formula calculates path in the first domain for obtaining M1 are as follows:
* 100% ≈ 26% (45) of path coefficient=30*0.9/ (30*0.9+30*1.1+40*1.1) in the first path in domain
The path coefficient in path is respectively 32% and 42% (46) in the path coefficient in path and third domain in the second domain of M1
Similar, when the current field (here by taking city as an example) in network structure has multipath, (this refers to multiple domains Between path) when, can according to the current city interconnection (including being directly connected to and/or being indirectly connected with) opposite end city service Device quantity calculates the path coefficient of each inter-domain path of the current city.
In further embodiments, whether newly-increased service further can also be had according to the opposite end city of the current city Device, come adjust the current city each inter-domain path path coefficient.Specific method of adjustment is referred to above-mentioned current data The path coefficient method of adjustment in path in each domain at center.
Figure 26 diagrammatically illustrates the schematic diagram of the Internet resources topological model of an embodiment according to the present invention.
In the present embodiment, according to above-mentioned base values and differentiation index, can calculate Internet resources in MAN, DCI and Standard network resource model on TIX, net needed for which can show a newly-built standard garden Network plans bandwidth.
It should be noted that herein for DCI as unit of city, it (can also be in data with garden unit for MAN The heart is unit), for outlet TIX (can also be as unit of data center) as unit of computer room.
Here network resource planning includes storage Bandwidth plan and incremental bandwidth planning, and newly-built garden is exactly incremental bandwidth One kind of planning can increase the increment number of servers (being equivalent to storage number of servers is 0) of garden newly and be increased newly based on this The bandwidth service index (the first bandwidth service indication/the second bandwidth service index/third bandwidth service index) of server obtains Standard planning flow is then based on the standard planning flow it can be concluded that standard planning bandwidth.
It should be noted that being calculated in the embodiment of the present disclosure based on planning flow (such as following 1 year predicted flow rate) Planning bandwidth be by flow rate calculation can the algorithm of redundancy bandwidth obtains, such as can by following formula to planning flow with Planning bandwidth is converted:
Plan bandwidth B dwidth=planning flow/0.45 (47)
0.45 in above-mentioned formula is calculated according to the 90% of the half of bandwidth.It is exactly generally that flow/0.45 is exactly Available bandwidth, but to meet construction gradient.It doing so and is primarily due to, network is all active/standby devices dual link in actual conditions, when One equipment fault, when interrupting half link, theoretically remaining link is also that can support flow.Then, it is based on network skill Art specification is calculated above-mentioned formula the planning bandwidth obtained and is rounded up using 40G or 200G etc..
It is as shown in table 4 below:
Table 4: standard network resource model
The topological structure of standard network resource model shown in table 4 is as shown in figure 26, passes through bone between city 1 and city 2 Dry router (Backbone Routers, BR) is directly connected to, the planning bandwidth of DCI (all directions) are as follows: 6T.The MAN core in city 1 The heart connects the BR.MAN core is connected to the planning bandwidth between the MAN of garden 1 are as follows: 12T, city 1 have 300,000 servers, garden altogether Area 1 has 100,000 servers altogether, includes that M1 and M2, M1 and M2 are respectively connected to TIX1 in garden 1, and TIX1 is connected to operator, The planning bandwidth of the outlet TIX are as follows: 6T.
It should be noted that the city in the embodiment of the present disclosure is not necessarily meant to refer to the city of executive division, city and city Rank, the only difference in number of servers itself are not distinguished between city.The MAN core refers to mutual between the different gardens in same city The metro core of connection.The garden can refer to the data center in a building or continuous several buildings.And the operator in Figure 26 is Refer to that operator is whole, i.e., does not distinguish each different operator.
The output of Internet resources medium-term and long-term plans
In the present embodiment, by above-mentioned base values and differentiation index, can relatively accurately it calculate 1 year following The outlet TIX, the network resource plannings data such as MAN special line and DCI special line.
In the exemplary embodiment, for the outlet the TIX of network structure planning bandwidth, in the network structure For data with existing center/existing garden/existing computer room storage server, planning bandwidth in storage outlet can be gone through based on outlet History flow and historical traffic growth rate calculate；For data with existing center ,/existing garden/has the newly-increased server of computer room, Or for newly-increased data center/newly-increased garden/newly-increased computer room, the increment outlet planning bandwidth of the network structure can be according to meter The outlet bandwidth service indication and newly-increased number of servers for calculating the newly-increased server obtained obtain.
In the exemplary embodiment, when there are multiple operators, it is also necessary to consider operator's accounting, be accounted for according to operator Than the outlet the TIX obtained planning bandwidth allocation will be calculated to each operator.
In the exemplary embodiment, for the MAN special line of network structure plans bandwidth, in the network structure For data with existing center/existing garden/existing computer room storage server, storage MAN planning bandwidth can be based on MAN history Flow and historical traffic growth rate calculate；For the newly-increased server of data with existing center/existing garden/existing computer room, or For person increases data center/newly-increased garden/newly-increased computer room newly, the increment MAN planning bandwidth of the network structure can be according to calculating The MAN bandwidth service index and newly-increased number of servers of the newly-increased server obtained obtain.
In the exemplary embodiment, when there are when path in a plurality of domain for a certain data center/garden, it is also necessary to according to the number According to the path coefficient in path in center/garden corresponding field, MAN planning bandwidth is allocated on path in each domain.
In the exemplary embodiment, for the DCI special line of network structure plans bandwidth, in the network structure For the storage server in existing city, storage DCI plan bandwidth can based on DCI historical traffic and historical traffic growth rate come It calculates；For the newly-increased server of data with existing center/existing garden/existing computer room or newly-increased data center/newly-increased garden For area/newly-increased computer room, the increment DCI planning bandwidth of the network structure can be according to the DCI for calculating the newly-increased server obtained Bandwidth service index and newly-increased number of servers obtain.
In the exemplary embodiment, when there are when path in a plurality of domain in a certain city, it is also necessary to according to the corresponding of the city DCI planning bandwidth is allocated by the path coefficient of inter-domain path on each inter-domain path.
The calculating of TIX planning bandwidth is illustrated below by the following table 5:
The sample calculation of table 5:TIX
In above-mentioned table 5, it is assumed that the rate of discharge of computer room (computer room here is it also will be understood that at data center) 1 is TIX1, TIX1 are that TIX1 can be calculated according to historical traffic information in 2015 without the existing computer room of newly-increased server Planning flow in 2016 are as follows:
100* (1+50%)+50* (1+50%)+30* (1+90%)=282G
Then it is calculated further according to operator proportionality coefficient 2:1:1 future 1 year of TIX1- telecommunications this external path Planning flow are as follows:
282G*2/4=141G
Similar, the planning flow for obtaining TIX1- connection and this mobile two external paths of TIX1- can be calculated.
In the present embodiment, after the planning flow for obtaining this external path of TIX1- telecommunications is 141G, using 141G/0.45 The future 1 year planning bandwidth that can be obtained this external path is 400G.
In above-mentioned table 5, it is assumed that computer room 3 is newly-increased computer room, and the newly-increased number of servers of computer room 3 is 20,000, according to above The Bdwidth_TIX for the newly-increased server being calculated is 25M, then 20,000 * 25M can obtain the planning flow of TIX3 and be Future 1 year planning stream of this external path of TIX3- telecommunications is then calculated in 500G according to operator proportionality coefficient 2:1:1 Amount are as follows:
500G*2/4=250G
Similar, the planning flow for obtaining TIX3- connection and this mobile two external paths of TIX3- and planning can be calculated Bandwidth.
With continued reference to above-mentioned table 5, add up to the historical traffic of each external path of each computer room of the network structure that can obtain History total flow in 2015 is 5000G, adds up to the planning flow of each external path of each computer room of the network structure that can obtain 2016 history total flow be 9000G, can be calculated by the following formula obtain the network structure TIX outlet planning stream Measure annual growth are as follows:
(9000-5000)/5000*100%=80%
Due to the annual growth 80% of the outlet planning flow obtained here by Model of network traffic, greater than Hmin's 50%, it is therefore possible to use planning flow by the outlet that the Model of network traffic obtains to instruct following 1 year external road The network bandwidth of diameter is built.
The calculating of MAN special line planning bandwidth is illustrated below by the following table 6:
The sample calculation of table 6:MAN special line planning bandwidth
In above-mentioned table 6, it is assumed that the historical traffic of data center MAN1 is 1000G, and MAN1 is only direct with SMAN in city Connection, then SMAN (Super MAN, super core do not include server in SMAN with city data center) be directly connected to MAN1 this The planning flow in path in a domain are as follows:
1000* (1+80%)=1800G
With continued reference to table 6, it is assumed that data center MAN2 is with newly-increased server (increment number of servers is 20,000) Data with existing center, the Bdwidth_MAN for increasing server newly is 50M, and MAN2 is also only directly connected to SMAN in city, then SMAN is directly connected to the planning flow in path in this domain MAN2 are as follows:
+ 2 ten thousand * 50M=2080G of 600* (1+80%)
With continued reference to table 6, it is assumed that data center MAN3 is newly-increased data center, and increment number of servers is 20,000, then The planning flow of MAN3 are as follows:
20000 * 50M=1000G
Since in table 6, there is only paths in the domain being directly connected between SMAN by MAN3, and there is also straight between MAN4 Path in the domain connect in succession, therefore, it is necessary to according to the respective path coefficient in path in the two domains, to the planning flow of MAN3 into Row distribution, specific path coefficient calculation method are referred to above-described embodiment.
It should be noted that the newly-increased number of servers in the embodiment of the present disclosure comes from corporate business and servers' layout portion Door, is given data.
The acquisition of DCI special line planning bandwidth is illustrated below by table 7:
The sample calculation of table 7:DCI special line planning bandwidth
In above-mentioned table 7 because city it is basic it has been determined that it is now most of be all in existing city dilatation, here With storage+increment algorithm, and calculated according to there are the algorithms of a plurality of inter-domain path in city.
Assuming that being directly connected between Shenzhen and Shanghai by the first inter-domain path, by between the second domain between Shenzhen and Shanghai Path is directly connected to, and Shanghai and Beijing are directly connected to by third inter-domain path, wherein Shenzhen, Shanghai and Pekinese's storage clothes Business device is respectively 200,000,100,000 and 50,000, and Shenzhen, Shanghai and Pekinese's increment server are respectively 50,000,100,000 With 50,000, be 50M by the BDwidth_DCI that newly-increased server is calculated before, between the first domain between Shenzhen and Shanghai The historical traffic in path is 400G, then the planning flow of first inter-domain path can be calculated by the following formula acquisition:
The planning flow of the first inter-domain path between Shenzhen and Shanghai=
(Shenzhen increases server newly to+MAX to the historical traffic * (annual growth of the first inter-domain path of 1+) of first inter-domain path Quantity * BDwidth_DCI* third path coefficient, Shanghai increase the 4th path coefficient of number of servers * BDwidth_DCI* newly)=
400G* (1+100%)+MAX (50,000 * 50M* (20/ (20+10)), 100,000 * 50M* (25/ (25+10)) ≈ 1200G
Similar, it can be in the hope of the planning flow and planning bandwidth of other each inter-domain paths.
The device of the invention embodiment introduced below can be used for executing the above-mentioned network resource planning method of the present invention. For undisclosed details in apparatus of the present invention embodiment, the implementation of the above-mentioned network resource planning method of the present invention is please referred to Example.
Figure 27 diagrammatically illustrates the block diagram of network resource planning device according to an embodiment of the invention.
Referring to shown in Figure 27, network resource planning device 2700 according to an embodiment of the invention, Internet resources rule Drawing device 2700 can be applied to network structure, which includes at least one domain, and each domain includes at least one domain internal segment Point and network switching node, at least one domain interior nodes are separately connected the network switching node by path in domain, in each domain Node includes server, which includes the first domain interior nodes, which passes through at least one External path is separately connected an at least external node.
Network resource planning device 2700 may include: external path Bandwidth plan module 2710 and external Bandwidth plan mould Block 2720.
Wherein, external path Bandwidth plan module 2710 can be used for the historical traffic according at least one external path Information, the first bandwidth service indication of the newly-increased number of servers of the first domain interior nodes and newly-increased server and corresponding outer The path coefficient in portion path obtains the planning bandwidth of each external path of the first domain interior nodes respectively.
External bandwidth planning module 2720 can be used for the planning bandwidth of each external path according to the first domain interior nodes It obtains the external of the first domain interior nodes and plans bandwidth.
In the exemplary embodiment, external path Bandwidth plan module 2710 may include the first storage planning unit and One increment planning unit and external path Bandwidth plan unit.Wherein, which can be used for according to phase The historical traffic information of external path is answered to obtain the storage planning bandwidth of each external path of the first domain interior nodes respectively.This One increment planning unit can be used for the newly-increased number of servers and the first bandwidth service indication according to the first domain interior nodes Obtain the increment planning bandwidth of the first domain interior nodes.The external path Bandwidth plan unit can be used for according in first domain Storage planning bandwidth, the increment planning bandwidth of the first domain interior nodes and the respective external path of each external path of node Path coefficient obtain respectively the first domain interior nodes each external path planning bandwidth.
In the exemplary embodiment, which includes the first domain, which includes multiple domain interior nodes, this is more A domain interior nodes include the first domain interior nodes and the second domain interior nodes connected by path in the first domain.Network resource planning dress Setting 2700 can also include path bandwidth planning module in the first domain.Wherein, path bandwidth planning module can in first domain For the historical traffic information and path coefficient, the first domain interior nodes and the second domain internal segment according to path in first domain The newly-increased number of servers of point and the second bandwidth service index of newly-increased server obtain the planning band in path in first domain It is wide.
In the exemplary embodiment, in first domain path coefficient in path include in first domain path about this first Second path coefficient of the path about the second domain interior nodes in the first path coefficient of domain interior nodes and first domain.This first Path bandwidth planning module may include the second storage planning unit, path bandwidth in the second increment planning unit and domain in domain Planning unit.Wherein, which can be used for the historical traffic information acquisition according to path in first domain The storage in path plans bandwidth in first domain.The second increment planning unit can be used for according to the new of the first domain interior nodes Increase number of servers and the first path coefficient, the newly-increased number of servers of the second domain interior nodes and second path coefficient, And the second bandwidth service index obtains the increment planning bandwidth in path in first domain.Path bandwidth planning unit in the domain It can be used for obtaining the rule in path in first domain according to the storage planning bandwidth and increment planning bandwidth in path in first domain Draw bandwidth.
In the exemplary embodiment, in first domain path increment planning bandwidth include in first domain path about this Path is advised about the second increment of the second domain interior nodes in the first increment planning bandwidth of first domain interior nodes and first domain Draw bandwidth.The second increment planning unit may include first direction increment planning subelement, second direction increment planning son list Path increment plans subelement in member and domain.Wherein, first direction increment planning subelement can be used for according to this The newly-increased number of servers of one domain interior nodes, the first path coefficient and the second bandwidth service index obtain first increment rule Draw bandwidth.Second direction increment planning subelement can be used for the newly-increased number of servers according to the second domain interior nodes, be somebody's turn to do Second path coefficient and the second bandwidth service index obtain second increment planning bandwidth.Path increment planning is single in the domain Member can be used for choosing the greater in first increment planning bandwidth and second increment planning bandwidth as in first domain The increment in path plans bandwidth.
In the exemplary embodiment, network resource planning device 2700 can also include path coefficient acquisition module in domain. Wherein, path coefficient acquisition module can be used in other domains according to the non-first domain interior nodes in first domain in the domain The number of servers of node obtains the first path coefficient.
In the exemplary embodiment, network resource planning device 2700 can also include path coefficient adjustment module in domain. Wherein, path coefficient adjustment module can be used for when other domain interior nodes include newly-increased server in the domain, adjust this One path coefficient.
In the exemplary embodiment, which includes the second domain, which includes that domain interior nodes and network are handed over Node is changed, which connects the network switching node by path in domain.Network resource planning device 2700 can also wrap Include path bandwidth planning module in the second domain.Wherein, path bandwidth planning module can be used for according in the domain in second domain Second bandwidth service index of the historical traffic information in path, the newly-increased number of servers of the domain interior nodes and newly-increased server obtains Obtain the planning bandwidth in path in the domain.
In the exemplary embodiment, which includes the first domain and the second domain, which passes through between the first domain Path connects second domain.Network resource planning device 2700 can also include inter-domain path Bandwidth plan module.Wherein, the domain Between path bandwidth planning module can be used for historical traffic information and path coefficient according to first inter-domain path, first domain First inter-domain path is obtained with the newly-increased number of servers in second domain and the third bandwidth service index of newly-increased server Planning bandwidth.
In the exemplary embodiment, the path coefficient of first inter-domain path include first inter-domain path about this first The third path coefficient in domain and fourth path coefficient of first inter-domain path about second domain.The inter-domain path Bandwidth plan Module may include third storage planning unit, third increment planning unit and inter-domain path Bandwidth plan unit.Wherein, this Three storage planning units can be used for depositing according to historical traffic information acquisition first inter-domain path of first inter-domain path Gauge draws bandwidth.The third increment planning unit can be used for newly-increased number of servers and the third path according to first domain Coefficient, the newly-increased number of servers in second domain and the 4th path coefficient and the third bandwidth service index obtain this The increment of one inter-domain path plans bandwidth.The inter-domain path Bandwidth plan unit can be used for depositing according to first inter-domain path Gauge draws bandwidth and increment planning bandwidth obtains the planning bandwidth of first inter-domain path.
In the exemplary embodiment, network resource planning device 2700 can also include that inter-domain path coefficient obtains module. Wherein, the inter-domain path coefficient obtain module can be used for according to being directly connected at least one domain with first domain and/or The number of servers in other domains being indirectly connected with obtains the third path coefficient.
In the exemplary embodiment, network resource planning device 2700 can also include external path bandwidth adjustment module. Wherein, which can be used for adjusting each outside of the first domain interior nodes using industry growth base The planning bandwidth in path.
It should be noted that although being referred to several modules or list for acting the equipment executed in the above detailed description Member or subelement, but this division is not enforceable.In fact, embodiment according to the present invention, above-described Two or more modules or the feature and function of unit or subelement can be in a module or units or subelement Middle materialization.Conversely, an above-described module or the feature and function of unit or subelement can be with further divisions To be embodied by multiple modules or unit or subelement.
Through the above description of the embodiments, those skilled in the art is it can be readily appreciated that example described herein is implemented Mode can also be realized by software realization in such a way that software is in conjunction with necessary hardware.Therefore, according to the present invention The technical solution of embodiment can be embodied in the form of software products, which can store non-volatile at one Property storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.) in or network on, including some instructions are so that a calculating Equipment (can be personal computer, server, touch control terminal or network equipment etc.) executes embodiment according to the present invention Method.
Those skilled in the art after considering the specification and implementing the invention disclosed here, will readily occur to of the invention its Its embodiment.This application is intended to cover any variations, uses, or adaptations of the invention, these modifications, purposes or Person's adaptive change follows general principle of the invention and including the undocumented common knowledge in the art of the present invention Or conventional techniques.The description and examples are only to be considered as illustrative, and true scope and spirit of the invention are by following Claim is pointed out.
It should be understood that the present invention is not limited to the precise structure already described above and shown in the accompanying drawings, and And various modifications and changes may be made without departing from the scope thereof.The scope of the present invention is limited only by the attached claims.

Claims (13)

1. a kind of network resource planning method, which is characterized in that be applied to network structure, which includes at least one Domain, each domain include at least one domain interior nodes and network switching node, which passes through path difference in domain The network switching node is connected, each domain interior nodes include server, which includes the first domain interior nodes, should First domain interior nodes are separately connected an at least external node by least one external path, which comprises
The first domain interior nodes are obtained respectively according to the newly-increased server info of external path information and the first domain interior nodes Each external path planning bandwidth；
The external of the first domain interior nodes, which is obtained, according to the planning bandwidth of each external path of the first domain interior nodes plans bandwidth.
2. the method according to claim 1, wherein the external path information includes at least one external path Historical traffic information and respective external path path coefficient；The newly-increased server info includes the new of the first domain interior nodes Increase the first bandwidth service indication of number of servers and newly-increased server.
3. according to the method described in claim 2, it is characterized in that, according to external path information and the first domain interior nodes Newly-increased server info obtains the planning bandwidth of each external path of the first domain interior nodes respectively, comprising:
Obtain the storage rule of each external path of the first domain interior nodes respectively according to the historical traffic information in respective external path Draw bandwidth；
The first domain interior nodes are obtained according to the newly-increased number of servers of the first domain interior nodes and the first bandwidth service indication Increment plan bandwidth；
Bandwidth is planned according to the storage of each external path of the first domain interior nodes, the increment of the first domain interior nodes plans band Wide and respective external path path coefficient obtains the planning bandwidth of each external path of the first domain interior nodes respectively.
4. first domain includes the method according to claim 1, wherein at least one domain includes the first domain Multiple domain interior nodes, multiple domain interior nodes include the first domain interior nodes connected by path in the first domain and the second domain internal segment Point；The method also includes:
According to the historical traffic information in path in first domain and path coefficient, the first domain interior nodes and the second domain interior nodes Newly-increased number of servers and the second bandwidth service index of newly-increased server obtain the planning band in path in first domain It is wide.
5. according to the method described in claim 4, it is characterized in that, the path coefficient in path includes first domain in first domain Interior path about path in the first path coefficient of the first domain interior nodes and first domain about the second domain interior nodes the Two path coefficients；Wherein,
According to the historical traffic information in path in first domain and path coefficient, the first domain interior nodes and the second domain interior nodes Newly-increased number of servers and the second bandwidth service index of newly-increased server obtain the planning band in path in first domain It is wide, comprising:
According to the storage in path plans bandwidth in the historical traffic information acquisition in path first domain in first domain；
According to the newly-increased clothes of the newly-increased number of servers of the first domain interior nodes and the first path coefficient, the second domain interior nodes Business device quantity and second path coefficient and the second bandwidth service index obtain the increment planning band in path in first domain It is wide；
The planning band in path in first domain is obtained according to the storage planning bandwidth in path in first domain and increment planning bandwidth It is wide.
6. according to the method described in claim 5, it is characterized in that, in first domain increment planning bandwidth in path include this One path in domain is about path in the first increment planning bandwidth of the first domain interior nodes and first domain about in second domain Second increment of node plans bandwidth；Wherein,
According to the newly-increased clothes of the newly-increased number of servers of the first domain interior nodes and the first path coefficient, the second domain interior nodes Business device quantity and second path coefficient and the second bandwidth service index obtain the increment planning band in path in first domain It is wide, comprising:
It is obtained according to the newly-increased number of servers of the first domain interior nodes, the first path coefficient and the second bandwidth service index First increment plans bandwidth；
It is obtained according to the newly-increased number of servers of the second domain interior nodes, second path coefficient and the second bandwidth service index Second increment plans bandwidth；
The greater in first increment planning bandwidth and second increment planning bandwidth is chosen as path in first domain Increment plans bandwidth.
7. according to the method described in claim 6, it is characterized by further comprising:
The first path is obtained according to the number of servers of other domain interior nodes of the non-first domain interior nodes in first domain Coefficient；
When other domain interior nodes include newly-increased server, the first path coefficient is adjusted.
8. second domain includes the method according to claim 1, wherein at least one domain includes the second domain Domain interior nodes and network switching node, the domain interior nodes connect the network switching node by path in domain；The method is also wrapped It includes:
According to the second of the historical traffic information in path in the domain, the newly-increased number of servers of the domain interior nodes and newly-increased server Bandwidth service index obtains the planning bandwidth in path in the domain.
9. this method according to claim 1, wherein at least one domain includes the first domain and the second domain One domain connects second domain by the first inter-domain path；The method also includes:
According to the historical traffic information and path coefficient of first inter-domain path, the newly-increased server in first domain and second domain Quantity and the third bandwidth service index of newly-increased server obtain the planning bandwidth of first inter-domain path.
10. according to the method described in claim 9, it is characterized in that, the path coefficient of first inter-domain path include this first Third path coefficient and first inter-domain path fourth path coefficient about second domain of the inter-domain path about first domain； Wherein,
According to the historical traffic information and path coefficient of first inter-domain path, the newly-increased server in first domain and second domain Quantity and the third bandwidth service index of newly-increased server obtain the planning bandwidth of first inter-domain path, comprising:
According to the storage planning bandwidth of the historical traffic information acquisition of first inter-domain path first inter-domain path；
According to the newly-increased number of servers in first domain and the third path coefficient, second domain newly-increased number of servers and should 4th path coefficient and the third bandwidth service index obtain the increment planning bandwidth of first inter-domain path；
Plan that bandwidth and increment planning bandwidth obtain the planning band of first inter-domain path according to the storage of first inter-domain path It is wide；
It is obtained according to the number of servers in other domains for being directly connected to and/or being indirectly connected with first domain at least one domain The third path coefficient.
11. a kind of network resource planning device, which is characterized in that be applied to network structure, which includes at least one Domain, each domain include at least one domain interior nodes and network switching node, which passes through path difference in domain The network switching node is connected, each domain interior nodes include server, which includes the first domain interior nodes, should First domain interior nodes are separately connected at least an external node, described device by least one external path
External path Bandwidth plan module, for being believed according to the newly-increased server of external path information and the first domain interior nodes Breath obtains the planning bandwidth of each external path of the first domain interior nodes respectively；
External bandwidth planning module, the planning bandwidth for each external path according to the first domain interior nodes obtain first domain The external of interior nodes plans bandwidth.
12. a kind of computer-readable medium, is stored thereon with computer program, which is characterized in that described program is held by processor The method as described in any one of claims 1 to 10 is realized when row.
13. a kind of electronic equipment characterized by comprising
One or more processors；
Storage device, for storing one or more programs, when one or more of programs are by one or more of processing When device executes, so that one or more of processors realize the method as described in any one of claims 1 to 10.
CN201810251249.8A 2018-03-26 2018-03-26 Network resource planning method and device, computer readable medium and electronic equipment Active CN110198543B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810251249.8A CN110198543B (en) 2018-03-26 2018-03-26 Network resource planning method and device, computer readable medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810251249.8A CN110198543B (en) 2018-03-26 2018-03-26 Network resource planning method and device, computer readable medium and electronic equipment

Publications (2)

Publication Number Publication Date
CN110198543A true CN110198543A (en) 2019-09-03
CN110198543B CN110198543B (en) 2021-11-05

Family

ID=67751093

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810251249.8A Active CN110198543B (en) 2018-03-26 2018-03-26 Network resource planning method and device, computer readable medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN110198543B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021129575A1 (en) * 2019-12-26 2021-07-01 华为技术有限公司 Bandwidth scheduling method, traffic transmission method, and related product
TWI739616B (en) * 2020-09-30 2021-09-11 中華電信股份有限公司 Method and electronic system for configuring route path

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101466124A (en) * 2007-12-19 2009-06-24 中国移动通信集团公司 Control method and system for network bandwidth
CN103200114A (en) * 2013-04-18 2013-07-10 湖北邮电规划设计有限公司 Metropolitan area network planning method
CN103685347A (en) * 2012-09-03 2014-03-26 阿里巴巴集团控股有限公司 Method and device for allocating network resources
CN105471759A (en) * 2016-01-11 2016-04-06 北京百度网讯科技有限公司 Network traffic scheduling method and apparatus for data centers

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101466124A (en) * 2007-12-19 2009-06-24 中国移动通信集团公司 Control method and system for network bandwidth
CN103685347A (en) * 2012-09-03 2014-03-26 阿里巴巴集团控股有限公司 Method and device for allocating network resources
CN103200114A (en) * 2013-04-18 2013-07-10 湖北邮电规划设计有限公司 Metropolitan area network planning method
CN105471759A (en) * 2016-01-11 2016-04-06 北京百度网讯科技有限公司 Network traffic scheduling method and apparatus for data centers

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021129575A1 (en) * 2019-12-26 2021-07-01 华为技术有限公司 Bandwidth scheduling method, traffic transmission method, and related product
US11929942B2 (en) 2019-12-26 2024-03-12 Huawei Cloud Computing Technologies Co., Ltd. Method and device for network traffic scheduling
TWI739616B (en) * 2020-09-30 2021-09-11 中華電信股份有限公司 Method and electronic system for configuring route path

Also Published As

Publication number Publication date
CN110198543B (en) 2021-11-05

Similar Documents

Publication Publication Date Title
Agajie et al. Optimal expansion planning of distribution system using grid-based multi-objective harmony search algorithm
CN101901428B (en) A kind of electricity market simulating system adopting SOA technology
Wang et al. A computational strategy to solve preventive risk-based security-constrained OPF
US20120185106A1 (en) Integration of demand response and renewable resources for power generation management
CN103150600B (en) A kind of power grid security analysis system
Kristiansen et al. Merchant electricity transmission expansion: A European case study
CN109858758A (en) A kind of the combination weighting appraisal procedure and system of distribution network electric energy quality
CN104268367B (en) Transformer state evaluation weight modification method and system based on multiple linear regression
CN109034505A (en) Metering table demand on-line prediction method and terminal device
Pandžić et al. Coordination of regulated and merchant energy storage investments
CN108182323A (en) A kind of intelligent operation management method for low-voltage network
Gutierrez-Alcaraz et al. An efficient method for contingency-constrained transmission expansion planning
KR20190132187A (en) An incentive-based demand response method and system considering composite DR resources
CN110198543A (en) Network resource planning method, apparatus, computer-readable medium and electronic equipment
Avramidis et al. Practical approximations and heuristic approaches for managing shiftable loads in the multi-period optimal power flow framework
CN105977958B (en) Bilateral transaction loss allocation methods based on network catalogue system
CN110033195A (en) Adjust grid model splicing method to a kind of province based on CIM/CIS
Fusco et al. Smart AMI based demand-response management in a micro-grid environment
CN108711860A (en) A kind of power distribution network substation-lines join planing method based on parallel computation
Marchand et al. Optimized operating rules for short-term hydropower planning in a stochastic environment
Benetti et al. Transmission pricing: right insights for suitable cost allocation methods
CN115115292B (en) Power generation distribution information generation method, device, apparatus, medium, and program product
CN107592363A (en) Water rate collection methods and Internet of things system based on compound Internet of Things
CN111798046A (en) Provincial medium and long term transaction clearing method and device considering ATC and storage medium
CN110336266A (en) The direct current of alternating current-direct current mixed connection receiving end power grid divides group's planing method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant