CN104125160A - Method and device for node switch to migrate between multiple management domains - Google Patents
Method and device for node switch to migrate between multiple management domains Download PDFInfo
- Publication number
- CN104125160A CN104125160A CN201410385263.9A CN201410385263A CN104125160A CN 104125160 A CN104125160 A CN 104125160A CN 201410385263 A CN201410385263 A CN 201410385263A CN 104125160 A CN104125160 A CN 104125160A
- Authority
- CN
- China
- Prior art keywords
- management server
- neighbours
- switch
- candidate
- management
- 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
Links
Abstract
The invention discloses a method and a device for a node switch to migrate between multiple management domains. The method comprises the following steps of selecting one node switch in the management domain of a first management server as a candidate switch and sending the event information of the candidate switch to the neighboring management servers of the first management server, receiving information which is fed back by each neighboring management server and includes the load information of the neighboring management server after the candidate switch is connected to the neighboring management server and the replay information of the resource utilization increase amount of the neighboring management server, taking the neighboring management servers of which the load information is lower than a preset value as candidate migration objects, comparing the resource utilization increase amount of every candidate migration objects, taking the candidate migration object having the maximum resource utilization increase amount as the target migration object, and moving the candidate switch to the target migration object. The method is used for well solving the problem of the migration of the node switch between two different management servers.
Description
Technical field
The application relates to technical field of the computer network, more particularly, relates to a kind of moving method and device of multi-management area intermediate node switch.
Background technology
Along with the development of information-intensive society, various new network applications emerge in an endless stream, and communication network is faced with lot of challenges, the impact that for example explosive growth of mobile terminal quantity, content, server virtualization and various cloud computing business constantly produce.The static framework of legacy network and the dynamic development trend of way to manage and various application are more and more incompatible.Network technology is in the urgent need to developing and evolution with together with the object of its service.Based on this, industry has proposed some novel network architecture, and they separate datum plane and control plane mostly, and chain of command adopts unified standard interface protocol to be connected with data surface.But this centralized control structure exists certain problem, resource consumption event can cause management server overload frequently.
In order to address the above problem, existing framework can be divided into two classes: horizontal framework and vertical framework.But this two classes framework does not all solve node switch and moves to from a management server problem of another management server.Static configuration between current management server and switch is difficult to adapt to the dynamic change of flow.
Summary of the invention
In view of this, the application provides a kind of moving method and device of multi-management area intermediate node switch, does not have the problem of the migration scheme of different management domain intermediate node switches for solving prior art.
To achieve these goals, the existing scheme proposing is as follows:
A moving method for multi-management area intermediate node switch, comprising:
Select a node switch in the management domain of the first management server as candidate switch, and the event information of described candidate switch is sent to neighbours' management server of described the first management server, judge whether to receive this candidate switch for neighbours' management server;
Receive described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment;
Judge whether the load information in the response message of each neighbours' management server exceedes preset value, using described load information lower than neighbours' management server of preset value as candidate's migrating objects;
Relatively described in each, the resource of candidate's migrating objects is used recruitment, uses candidate's migrating objects of recruitment maximum as target migrating objects resource;
Described candidate switch is migrated to described target migrating objects.
Preferably, the described event information by described candidate switch sends to the described neighbours' management server in neighbours' management server of described the first management server to be specially current neighbours' management server in idle condition.
Preferably, whether neighbours' management server comprises in the deterministic process of idle condition:
All neighbours' management servers to described the first management server send id signal;
Receive each neighbours' management server according to the state information of described id signal feedback, described state information comprises idle and busy.
Preferably, a node switch in the management domain of described selection the first management server, as candidate switch, is specially:
Filter out with described the first management server distance several node switch farthest as the first group of switches;
In described the first group of switches, filter out a minimum node switch of load, and this node switch is defined as to candidate switch.
A moving method for multi-management area intermediate node switch, comprising:
Receive the event information of candidate switch that the first management server sends, described candidate switch is a node switch in the management domain of described the first management server;
Utilize described event information calculate access described candidate switch after self load information and the use recruitment of resource, and send to described the first management server using the use recruitment of described load information and described resource as response message, judge for the latter whether load information exceedes preset value and resource is used the contrast of recruitment, thereby complete determining of target migrating objects;
In the time the described candidate switch that described the first management server sends being detected, carry out the migration of candidate switch.
Preferably, before the event information of the candidate switch sending at described reception the first management server, also comprise:
Respond the id signal that described the first management server sends, give described the first management server by the status information feedback of self, described state information comprises idle and busy.
A moving apparatus for multi-management area intermediate node switch, comprising:
Selected cell, for selecting a node switch in the management domain of the first management server as candidate switch;
The first transmitting element, for the event information of described candidate switch being sent to neighbours' management server of described the first management server, judges whether to receive this candidate switch for neighbours' management server;
The first receiving element, for receiving described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment;
Whether the first judging unit, exceed preset value for the load information of the response message that judges each neighbours' management server, using described load information lower than neighbours' management server of preset value as candidate's migrating objects;
Comparing unit, for relatively described in each the resource of candidate's migrating objects use recruitment, use candidate's migrating objects of recruitment maximum as target migrating objects resource;
Migration units, for migrating to described candidate switch described target migrating objects.
Preferably, described the first transmitting element comprises:
First sends subelement, for the event information of described candidate switch being sent to neighbours' management server of described the first management server in neighbours' management server of idle condition.
Preferably, also comprise the second judging unit, for judging that whether neighbours' management server is in idle condition, described the second judging unit comprises:
The second transmitting element, sends id signal for all neighbours' management servers to described the first management server;
The second receiving element, for receiving each neighbours' management server according to the state information of described id signal feedback, described state information comprises idle and busy.
Preferably, described selected cell comprises:
The first screening unit, for filtering out with described the first management server distance several node switch farthest as the first group of switches;
The second screening unit, for filter out a minimum node switch of load in described the first group of switches, and is defined as candidate switch by this node switch.
Can find out from above-mentioned technical scheme, the moving method of the multi-management area intermediate node switch that the embodiment of the present application provides, by selecting a node switch in the management domain of the first management server as candidate switch, and the event information of described candidate switch is sent to neighbours' management server of described the first management server, judge whether to receive this candidate switch for neighbours' management server, then receive described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment, then judge whether the load information in the response message of each neighbours' management server exceedes preset value, using described load information lower than neighbours' management server of preset value as candidate's migrating objects, relatively described in each, the resource of candidate's migrating objects is used recruitment, use candidate's migrating objects of recruitment maximum as target migrating objects resource, finally described candidate switch is migrated to described target migrating objects.The application has well solved the problem that node switch moves between two different management servers.
Brief description of the drawings
In order to be illustrated more clearly in the embodiment of the present application or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, apparently, accompanying drawing in the following describes is only the application's embodiment, for those of ordinary skill in the art, do not paying under the prerequisite of creative work, other accompanying drawing can also be provided according to the accompanying drawing providing.
Fig. 1 is the moving method flow chart of the disclosed a kind of multi-management area intermediate node switch of the embodiment of the present application;
Fig. 2 is the whether definite method flow diagram in idle condition of the disclosed neighbours' management server of the embodiment of the present application;
Fig. 3 is definite method flow diagram of the disclosed candidate switch of the embodiment of the present application;
Fig. 4 is the moving method flow chart of the disclosed another kind of multi-management area intermediate node switch of the embodiment of the present application;
Fig. 5 is the moving method flow chart of disclosed another the multi-management area intermediate node switch of the embodiment of the present application;
Fig. 6 is the moving apparatus structural representation of the disclosed a kind of multi-management area intermediate node switch of the embodiment of the present application;
Fig. 7 is the structural representation of disclosed the first transmitting element of the embodiment of the present application;
Fig. 8 is the moving apparatus structural representation of the disclosed another kind of multi-management area intermediate node switch of the embodiment of the present application;
Fig. 9 is the structural representation of the disclosed selected cell of the embodiment of the present application.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present application, the technical scheme in the embodiment of the present application is clearly and completely described, obviously, described embodiment is only some embodiments of the present application, instead of whole embodiment.Based on the embodiment in the application, those of ordinary skill in the art are not making the every other embodiment obtaining under creative work prerequisite, all belong to the scope of the application's protection.
Referring to Fig. 1, Fig. 1 is the moving method flow chart of the disclosed a kind of multi-management area intermediate node switch of the embodiment of the present application.
As shown in Figure 1, the method comprises:
Step 100: select a node switch in the management domain of the first management server as candidate switch, and the event information of described candidate switch is sent to neighbours' management server of described the first management server;
Wherein, the first management server is the management server that will move egress switch.Each management server includes several node switch.First select a node switch in the first management server management domain to move switch as candidate, the event information of this switch is sent to neighbours' management server of the first management server.Here, the event information of switch is the flow event that switch produces in management server, and the type of its event producing in different management servers is constant, but the quantity of the event of each type is different.The neighbours' management server that the event information of candidate switch is sent to the first management server, judges whether to receive this candidate switch for neighbours' management server.
Step 110: receive described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment;
Wherein, neighbours' management server receives and calculates hypothesis after event information and receive after this candidate switch, the load variations situation of self and received and change the recruitment that candidate switch can bring to the resource service condition of self.
Step 120: judge whether the load information in the response message of each neighbours' management server exceedes preset value, using described load information lower than neighbours' management server of preset value as candidate's migrating objects;
Particularly, in the time that the load information that judges some neighbours' management servers exceedes preset value, represent that this neighbours' management server is not suitable as the migrating objects of switch, we choose those load informations lower than neighbours' management server of preset value as candidate's migrating objects.
In addition, this deterministic process also can self be completed by neighbours' management server, in the time judging that self load exceeds standard, can send a refusal and accept to the first management server the signal of candidate switch.
Step 130: relatively described in each, the resource of candidate's migrating objects is used recruitment, uses candidate's migrating objects of recruitment maximum as target migrating objects resource;
After previous step is carried out load judgment, for candidate's migrating objects, we carry out the judgement of resource use recruitment again, filter out resource and use candidate's migrating objects of recruitment maximum as target migrating objects.Resource is used recruitment larger, represents that this neighbours' management server is receiving after candidate switch, larger to the resource utilization of self.
Step 140: described candidate switch is migrated to described target migrating objects.
The moving method of the multi-management area intermediate node switch that the embodiment of the present application provides, by selecting a node switch in the management domain of the first management server as candidate switch, and the event information of described candidate switch is sent to neighbours' management server of described the first management server, judge whether to receive this candidate switch for neighbours' management server, then receive described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment, then judge whether the load information in the response message of each neighbours' management server exceedes preset value, using described load information lower than neighbours' management server of preset value as candidate's migrating objects, relatively described in each, the resource of candidate's migrating objects is used recruitment, use candidate's migrating objects of recruitment maximum as target migrating objects resource, finally described candidate switch is migrated to described target migrating objects.The application has well solved the problem that node switch moves between two different management servers.
Optionally, in order to save cost on network communication, we can only send to the event information of candidate switch the management server in idle condition in neighbours' management server, and the neighbours' management server for those in busy condition does not send the event information of candidate switch.
And neighbours' management server the deterministic process in idle condition can be with reference to accompanying drawing 2, Fig. 2 is the whether definite method flow diagram in idle condition of the disclosed neighbours' management server of the embodiment of the present application.
As shown in Figure 2, comprising:
Step 200: all neighbours' management servers to described the first management server send id signal;
Step 210: receive each neighbours' management server according to the state information of described id signal feedback, described state information comprises idle and busy.
Wherein, its essence of id signal can be regarded a notice as, notifies each neighbours' management server, and the first management server will be to external migration node switch.Each management server that receives this id signal all can carry out feedback according to self current state information.
From another perspective, id signal can also be regarded a signal of setting up game territory as, invites each neighbours' management server referring to this game territory, carries out " game " of node switch.And only the neighbours' management server in idle condition just can add this game territory.Follow-up, be also the event information that sends candidate switch to the management server in this game territory.
Optionally, above-mentioned steps 100 a: node switch in the management domain of selection the first management server, as candidate switch, can be realized with reference to the mode of Fig. 3:
Step 300: filter out with described the first management server distance several node switch farthest as the first group of switches;
Step 310: filter out a minimum node switch of load in described the first group of switches, and this node switch is defined as to candidate switch.
Particularly, node switch distance the first management server is far away, and the impact that its migration causes this first management server is less.Therefore, our preferential chosen distance the first management servers node switch far away.In addition, we preferentially select the lower node switch of load to move.
Certainly, our comprehensive distance and these two parameters of load, can select node switch s according to following probability distribution
i:
In above-mentioned, γ
ixrepresent node switch s
iafter migration, the resource use amount of the first management server x accounts for the ratio of whole resource use amount, μ
ixrepresent node switch s
iand the distance value between the first management server x, X represents the node switch set { s in the first management server x management domain
1, s
2..., s
k.
Optionally, after the migration of above-mentioned both candidate nodes switch completes, can also further judge whether the load of current the first management server exceeds standard, if it still exceeds standard, also needs to carry out the migration work of node switch, now can repeating step 100-step 140.Until the first management server load no longer exceeds standard.
After the load that the first management server detected does not exceed standard, the game territory of above-mentioned foundation can be dismissed, notify each neighbours' management server in game territory, exit game territory.
Said method is all to stand in the elaboration that the first management server end carries out, and we can also stand in the angle of neighbours' management server of the first management server and discuss whole transition process.
Referring to Fig. 4, Fig. 4 is the moving method flow chart of the disclosed another kind of multi-management area intermediate node switch of the embodiment of the present application.
As shown in Figure 4, the method comprises:
Step 400: receive the event information of candidate switch that the first management server sends, described candidate switch is a node switch in the management domain of described the first management server;
Step 410: utilize described event information to calculate after the described candidate switch of access the load information of self and the use recruitment of resource, and send to described the first management server using the use recruitment of described load information and described resource as response message;
Particularly, send to described the first management server as long as in order to judge for the latter whether load information exceedes the contrast of preset value and resource recruitment using the use recruitment of described load information and described resource as response message, thereby complete determining of target migrating objects.
And the first management server utilize response message to carry out the deterministic process of target migrating objects can be referring to the introduction of above-described embodiment.
Step 420: carry out the migration of candidate switch in the time the described candidate switch that described the first management server sends being detected.
Particularly, in multiple neighbours' management servers, only have a management server and the candidate switch that the first management server sends can be detected, other several neighbours' management servers all can not detect, for the neighbours' management server that can't detect candidate switch, do not carry out any processing.
Optionally, on the basis of above-described embodiment, moving method can also increase following step, shown in Figure 5, before the event information of the candidate switch sending at described reception the first management server, also comprises:
Step 500: respond the id signal that described the first management server sends, give described the first management server by the status information feedback of self, described state information comprises idle and busy.
The moving apparatus of the multi-management area intermediate node switch below the embodiment of the present application being provided is described, and the moving apparatus of multi-management area intermediate node switch described below can mutual corresponding reference with the moving method of above-described multi-management area intermediate node switch.
Referring to Fig. 6, Fig. 6 is the moving apparatus structural representation of the disclosed a kind of multi-management area intermediate node switch of the embodiment of the present application.
As shown in Figure 6, this device comprises:
Selected cell 61, for selecting a node switch in the management domain of the first management server as candidate switch;
The first transmitting element 62, for the event information of described candidate switch being sent to neighbours' management server of described the first management server, judges whether to receive this candidate switch for neighbours' management server;
The first receiving element 63, for receiving described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment;
Whether the first judging unit 64, exceed preset value for the load information of the response message that judges each neighbours' management server, using described load information lower than neighbours' management server of preset value as candidate's migrating objects;
Comparing unit 65, for relatively described in each the resource of candidate's migrating objects use recruitment, use candidate's migrating objects of recruitment maximum as target migrating objects resource;
Migration units 66, for migrating to described candidate switch described target migrating objects.
Optionally, Fig. 7 example the optional structure of one of disclosed the first transmitting element 62 of the embodiment of the present application, as shown in Figure 7, the first transmitting element 62 can comprise:
First sends subelement 621, for the event information of described candidate switch being sent to neighbours' management server of described the first management server in neighbours' management server of idle condition.
Optionally, Fig. 8 example the optional structure of another kind of moving apparatus of the disclosed multi-management area intermediate node of the embodiment of the present application switch, known in conjunction with Fig. 6 and Fig. 8, this device also comprises:
The second judging unit 67, for judging that whether neighbours' management server is in idle condition, described the second judging unit 67 comprises:
The second transmitting element 671, sends id signal for all neighbours' management servers to described the first management server;
The second receiving element 672, for receiving each neighbours' management server according to the state information of described id signal feedback, described state information comprises idle and busy.
It should be noted that, be a kind of optional connected mode in Fig. 8, and we can also be connected in the second judging unit 67 between selected cell 61 and the first transmitting element 62.
Optionally, Fig. 9 example the optional structure of one of the disclosed selected cell 61 of the embodiment of the present application, as shown in Figure 9, selected cell 61 can comprise:
The first screening unit 611, for filtering out with described the first management server distance several node switch farthest as the first group of switches;
The second screening unit 612, for filter out a minimum node switch of load in described the first group of switches, and is defined as candidate switch by this node switch.
The moving apparatus of the multi-management area intermediate node switch that the embodiment of the present application provides, by selecting a node switch in the management domain of the first management server as candidate switch, and the event information of described candidate switch is sent to neighbours' management server of described the first management server, judge whether to receive this candidate switch for neighbours' management server, then receive described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment, then judge whether the load information in the response message of each neighbours' management server exceedes preset value, using described load information lower than neighbours' management server of preset value as candidate's migrating objects, relatively described in each, the resource of candidate's migrating objects is used recruitment, use candidate's migrating objects of recruitment maximum as target migrating objects resource, finally described candidate switch is migrated to described target migrating objects.The application has well solved the problem that node switch moves between two different management servers.
Finally, also it should be noted that, in this article, relational terms such as the first and second grades is only used for an entity or operation to separate with another entity or operating space, and not necessarily requires or imply and between these entities or operation, have the relation of any this reality or sequentially.And, term " comprises ", " comprising " or its any other variant are intended to contain comprising of nonexcludability, thereby the process, method, article or the equipment that make to comprise a series of key elements not only comprise those key elements, but also comprise other key elements of clearly not listing, or be also included as the intrinsic key element of this process, method, article or equipment.The in the situation that of more restrictions not, the key element being limited by statement " comprising ... ", and be not precluded within process, method, article or the equipment that comprises described key element and also have other identical element.
In this specification, each embodiment adopts the mode of going forward one by one to describe, and what each embodiment stressed is and the difference of other embodiment, between each embodiment identical similar part mutually referring to.
To the above-mentioned explanation of the disclosed embodiments, make professional and technical personnel in the field can realize or use the application.To be apparent for those skilled in the art to the multiple amendment of these embodiment, General Principle as defined herein can, in the case of not departing from the application's spirit or scope, realize in other embodiments.Therefore, the application will can not be restricted to these embodiment shown in this article, but will meet the widest scope consistent with principle disclosed herein and features of novelty.
Claims (10)
1. a moving method for multi-management area intermediate node switch, is characterized in that, comprising:
Select a node switch in the management domain of the first management server as candidate switch, and the event information of described candidate switch is sent to neighbours' management server of described the first management server, judge whether to receive this candidate switch for neighbours' management server;
Receive described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment;
Judge whether the load information in the response message of each neighbours' management server exceedes preset value, using described load information lower than neighbours' management server of preset value as candidate's migrating objects;
Relatively described in each, the resource of candidate's migrating objects is used recruitment, uses candidate's migrating objects of recruitment maximum as target migrating objects resource;
Described candidate switch is migrated to described target migrating objects.
2. moving method according to claim 1, it is characterized in that, the described event information by described candidate switch sends to the described neighbours' management server in neighbours' management server of described the first management server to be specially current neighbours' management server in idle condition.
3. moving method according to claim 2, is characterized in that, whether neighbours' management server comprises in the deterministic process of idle condition:
All neighbours' management servers to described the first management server send id signal;
Receive each neighbours' management server according to the state information of described id signal feedback, described state information comprises idle and busy.
4. moving method according to claim 2, is characterized in that, a node switch in the management domain of described selection the first management server, as candidate switch, is specially:
Filter out with described the first management server distance several node switch farthest as the first group of switches;
In described the first group of switches, filter out a minimum node switch of load, and this node switch is defined as to candidate switch.
5. a moving method for multi-management area intermediate node switch, is characterized in that, comprising:
Receive the event information of candidate switch that the first management server sends, described candidate switch is a node switch in the management domain of described the first management server;
Utilize described event information calculate access described candidate switch after self load information and the use recruitment of resource, and send to described the first management server using the use recruitment of described load information and described resource as response message, judge for the latter whether load information exceedes preset value and resource is used the contrast of recruitment, thereby complete determining of target migrating objects;
In the time the described candidate switch that described the first management server sends being detected, carry out the migration of candidate switch.
6. moving method according to claim 5, is characterized in that, before the event information of the candidate switch sending at described reception the first management server, also comprises:
Respond the id signal that described the first management server sends, give described the first management server by the status information feedback of self, described state information comprises idle and busy.
7. a moving apparatus for multi-management area intermediate node switch, is characterized in that, comprising:
Selected cell, for selecting a node switch in the management domain of the first management server as candidate switch;
The first transmitting element, for the event information of described candidate switch being sent to neighbours' management server of described the first management server, judges whether to receive this candidate switch for neighbours' management server;
The first receiving element, for receiving described in each neighbours' management server according to the response message of described event information feedback, described response message comprises after described candidate switch access neighbours management server that the load information of this neighbours' management server and the resource of this neighbours' management server are used recruitment;
Whether the first judging unit, exceed preset value for the load information of the response message that judges each neighbours' management server, using described load information lower than neighbours' management server of preset value as candidate's migrating objects;
Comparing unit, for relatively described in each the resource of candidate's migrating objects use recruitment, use candidate's migrating objects of recruitment maximum as target migrating objects resource;
Migration units, for migrating to described candidate switch described target migrating objects.
8. moving apparatus according to claim 7, is characterized in that, described the first transmitting element comprises:
First sends subelement, for the event information of described candidate switch being sent to neighbours' management server of described the first management server in neighbours' management server of idle condition.
9. moving apparatus according to claim 8, is characterized in that, also comprises the second judging unit, and for judging that whether neighbours' management server is in idle condition, described the second judging unit comprises:
The second transmitting element, sends id signal for all neighbours' management servers to described the first management server;
The second receiving element, for receiving each neighbours' management server according to the state information of described id signal feedback, described state information comprises idle and busy.
10. moving apparatus according to claim 8, is characterized in that, described selected cell comprises:
The first screening unit, for filtering out with described the first management server distance several node switch farthest as the first group of switches;
The second screening unit, for filter out a minimum node switch of load in described the first group of switches, and is defined as candidate switch by this node switch.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410385263.9A CN104125160B (en) | 2014-08-07 | 2014-08-07 | A kind of moving method and device of multi-management area intermediate node interchanger |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410385263.9A CN104125160B (en) | 2014-08-07 | 2014-08-07 | A kind of moving method and device of multi-management area intermediate node interchanger |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104125160A true CN104125160A (en) | 2014-10-29 |
| CN104125160B CN104125160B (en) | 2018-03-23 |
Family
ID=51770428
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410385263.9A Active CN104125160B (en) | 2014-08-07 | 2014-08-07 | A kind of moving method and device of multi-management area intermediate node interchanger |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104125160B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105656797A (en) * | 2015-12-26 | 2016-06-08 | 中国人民解放军信息工程大学 | Switch migration method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040049570A1 (en) * | 2002-09-17 | 2004-03-11 | Frank Ed H. | Method and system for network management in a hybrid wired/wireless network |
| CN102594697A (en) * | 2012-02-21 | 2012-07-18 | 华为技术有限公司 | Load balancing method and device |
| CN102843300A (en) * | 2012-09-12 | 2012-12-26 | 盛科网络（苏州）有限公司 | Method and system for achieving controller load balance in Openflow switchboard system |
| CN103023799A (en) * | 2011-09-27 | 2013-04-03 | 日电（中国）有限公司 | Central control unit and virtual machine migration method used for virtual machine migration |
-
2014
- 2014-08-07 CN CN201410385263.9A patent/CN104125160B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040049570A1 (en) * | 2002-09-17 | 2004-03-11 | Frank Ed H. | Method and system for network management in a hybrid wired/wireless network |
| CN103023799A (en) * | 2011-09-27 | 2013-04-03 | 日电（中国）有限公司 | Central control unit and virtual machine migration method used for virtual machine migration |
| CN102594697A (en) * | 2012-02-21 | 2012-07-18 | 华为技术有限公司 | Load balancing method and device |
| CN102843300A (en) * | 2012-09-12 | 2012-12-26 | 盛科网络（苏州）有限公司 | Method and system for achieving controller load balance in Openflow switchboard system |
Non-Patent Citations (3)
| Title |
|---|
| ADVAIT DIXIT等: "Towards an Elastic Distributed SDN Controller", 《ACM SIGCOMM COMPUTER COMMUNICATION REVIEW》 * |
| GUANG YAO等: "On the Capacitated Controller Placement Problem in Software Defined Networks", 《IEEE COMMUNICATIONS LETTERS》 * |
| MD. FAIZUL BARI等: "Dynamic Controller Provisioning in Software Defined Networks", 《2013 9TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM)》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105656797A (en) * | 2015-12-26 | 2016-06-08 | 中国人民解放军信息工程大学 | Switch migration method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104125160B (en) | 2018-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105830394B (en) | Configuration method, system and its Virtual NE and network management system of virtual network strategy | |
| CN108647967B (en) | Method and device for selecting block chain consensus mechanism and consensus node | |
| CN111008075B (en) | Load balancing system, method, device, equipment and medium | |
| CN112153700A (en) | Network slice resource management method and equipment | |
| EP3169018B1 (en) | Method and device for establishing performance measurement task and processing performance measurement result | |
| CN108255707B (en) | Development role creating method, device, equipment and storage medium of test case | |
| CN103634147A (en) | Network topology management method and equipment | |
| CN108901075A (en) | A kind of resource allocation methods based on GS algorithm | |
| EP3644646A1 (en) | Load-balancing method and apparatus | |
| CN108616553B (en) | Method and device for resource scheduling of cloud computing resource pool | |
| CN107943697A (en) | Problem distribution method, device, system, server and computer-readable storage medium | |
| CN105610538A (en) | Systems and methods for effective physical cell identifier reuse | |
| CN104537045A (en) | Service distribution method and device based on distributive system | |
| CN104333879A (en) | Load sharing method and device | |
| CN104917794A (en) | Data sharing method, device and system | |
| CN105207989B (en) | A kind of work system and its control method of various dimensions user | |
| CN104022951A (en) | Building method and system for network service path | |
| CN104468764A (en) | Method, device and system for strategy scheduling | |
| CN104125160A (en) | Method and device for node switch to migrate between multiple management domains | |
| CN104065684A (en) | Information processing method, electronic device and terminal device | |
| CN116938953A (en) | Block chain-based data processing method and device, electronic equipment and storage medium | |
| CN104955152A (en) | CoMP-based resource allocation method, device and system | |
| CN102929684A (en) | Implementation method for topology drawing of virtual machines | |
| US20220329529A1 (en) | 5g filters for virtual network functions | |
| CN105025040A (en) | Friend classification method and friend classification server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |