CN102075429B - Virtual network mapping method based on principle of proximity - Google Patents
Virtual network mapping method based on principle of proximity Download PDFInfo
- Publication number
- CN102075429B CN102075429B CN201110023701.3A CN201110023701A CN102075429B CN 102075429 B CN102075429 B CN 102075429B CN 201110023701 A CN201110023701 A CN 201110023701A CN 102075429 B CN102075429 B CN 102075429B
- Authority
- CN
- China
- Prior art keywords
- node
- request
- net
- empty
- physical network
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a virtual network mapping method based on a principle of proximity. In the method, when a substrate network node is selected in node mapping, not only is available resource taken into account, but also whether the principle of proximity is satisfied is taken into account, namely whether link connection exists between the substrate network node and the substrate network node which is successful in mapping; and in addition, a mechanism that a node is lined up according to the remaining resource in the virtual network node mapping and a mechanism that a link is lined up according to the bandwidth before the virtual network link mapping are introduced into the method. The virtual network mapping method based on the principle of proximity provided by the invention is suitable for the networks which are already used or are going to use a network virtualization technology to perform network segregation, resource management scheduling or customized service providing, such as an experiment network, an operator network. The virtual network mapping method based on the principle of proximity has the characteristics of low complexity of link mapping, high utilization ratio of the substrate network resource, high success ratio of the virtual request mapping, and the like.
Description
Technical field
Network virtualization technology is one of important method promoting oriented Internet Architecture development, its essence is by abstract, distribute, isolation mech isolation test runs multiple virtual subnet independently on a public physical network, each virtual subnet can use separate protocol architecture, and reasonable disposition can be carried out according to the demand of user's dynamic change to whole nodes and link circuit resource, thus strengthen flexibility and the diversity of network, realize the measurable and controllable property of network, the distribution of peak optimizating network resource and scheduling, improve safety and service quality, reduce operation maintenance cost, in the hope of essence solve the Internet existing ossify, with patch and be updated to main current situation.
Network virtualization technology may be used for for the research of new network architecture provides the basis of shared Physical Experiment network, bottom physical facility provider and network service operators can also be separated by it simultaneously, the network of multiple operator is allowed to share same public bottom physical network architecture (link, switching node etc.), each network has neither by the Network resource share that other web influences can adjust again flexibly wherein, heterogeneous networks operator can adopt different procotols, the end-to-end service of innovation is provided, therefore network virtualization also gets a good chance of the main flow operation mode becoming a kind of future network.
Background technology
Virtual network mapping problems is then requisite link in network virtualization technology, its major function the virtual network requests of user (Virtual Request) is reasonably mapped to the bottom physical network facility (Substrate Network) that operator provides, mapping process not only will realize the separation between virtual network and be independent of each other, thus ensure the service quality (QoS) of each virtual network user, also to try one's best simultaneously and reasonably distribute bottom physical network resource, improve resource utilization.As shown in Figure 1.
In FIG, two different virtual networks are mapped on bottom physical network, and provide service to corresponding user.Due to the diversity of virtual network requests topology, and node and link two groups of restrictive conditions need to consider simultaneously, and making multiple different virtual network to be mapped to a public bottom physical network becomes NP-hard problem.For solving this problem, external a lot of researcher has proposed some and has solved the mapping method mapping coupling suboptimal solution, but existing algorithm ubiquity matching equation solve complexity, calculate cost large, lack the problems such as concrete routing resource.
The implementation procedure that virtual network maps can be divided into two steps: node mapping and link maps.Existing main method uses greedy algorithm to carry out node mapping, uses K shortest path first to carry out link maps.System is in units of time window, and all virtual network requests in a time window according to its income sequence, will map from largest request.If map successfully, then upgrade bottom physical network state; If failure, then put into waiting list by request; If the frequency of failure exceedes parameter preset DELAY, then directly refuse this request.
Wherein, as follows to the mapping step of each virtual network requests:
First node mapping is carried out: to each empty net node (V in virtual network requests
node), use greedy algorithm to find the bottom Physical Network node (S having maximum residual resource
node); If this S
nodemeet this V
nodecPU restriction, then this V
nodemap successfully; If to certain V
node, the S do not met the demands
node, then node mapping failure; If all V
nodemap successfully, then node mapping completes.
Node mapping completes laggard downlink map: to the empty network chain road (V of the every bar in virtual network requests
hnk), determine its two-end-point V
node1, V
node2map to the S in bottom physical network
node1, S
node2; K shortest path first is used to find S
node1, S
node2between 1-K article of shortest path; If wherein certain paths meets this V
hnkbandwidth requirement, then this V
hnkmap successfully; If all discontented sufficient bandwidth requirement of all K paths, then link maps failure; If all V
linkmap successfully, then link maps completes.
In the virtual network mapping algorithm of present stage, owing to not considering its impact on link maps during design node mapping algorithm, therefore one use greedy algorithm optimization after node mapping result likely cause link maps complexity maybe cannot complete.Such as, node possibility wide apart (multi-hop) in bottom Physical Network topology that greedy algorithm is selected, the link so in the middle of their and node will be well used, thus increase one's load; Meanwhile, because a virtual link will take many bottom Physical Network links, the resource utilization of bottom Physical Network can be deteriorated, and namely income/the expenditure (Revenue/Cost) of system can reduce.
Summary of the invention
The present invention analyzes the relation of node mapping algorithm and link maps algorithm, find in node mapping process, if only with the surplus resources of bottom Physical Network node for target, then the above-mentioned negative effect to link maps almost can not be avoided, if therefore can a kind of method be proposed, while consideration bottom Physical Network node surplus resources, also the distance between node is considered, and operation parameter regulates the impact of these two factors, then greatly can simplify the complexity of link maps, and improve the resource utilization of bottom Physical Network.
The present invention introduces a kind of nearby principle according to this starting point for node mapping, and use coefficient correlation Corr to regulate the weight of bottom Physical Network node surplus resources and nodal distance two factors, form new, a node mapping criterion more comprehensively: weighted residual resource (WeightedAvailable Resource, WAR).Using weighted residual resource as the criterion of node mapping, add node nearby principle as another factor of influence in node mapping process except bottom Physical Network node surplus resources, thus link maps has been taken into account in node mapping process, avoid and only consider bottom Physical Network node surplus resources and the adverse effect to link maps that causes, reduce the complexity of link maps, improve the utilance of bottom Physical Network link circuit resource, improve the income expenditure ratio of system.
The definition that the present invention relates to:
1) (Revenue) is taken in
Revenue refers to that empty net maps the profit successfully obtained, and defines according to the successful empty net bandwidth sum CPU of mapping:
Revenue＝α
R∑BW
R+β
R∑CPU
R
Wherein, BW
rthat the successful empty guipure of mapping is wide, CPU
rmap successful empty net node cpu resource, α
rand β
rbe the weight coefficient for regulating bandwidth sum CPU, also can be understood as the unit price that operator provides empty net service Time Bandwidth and cpu resource, subscript R refers to income.
2) (Cost) is paid:
Cost refers to that empty net maps the expense of successfully expenditure, according to mapping the bottom physical network bandwidth and CPU definition that use:
Cost＝α
C∑HOPS·BW
C+β
C∑CPU
C
Wherein, BW
cbe map the bottom physical network bandwidth used, HOPS is the physical link quantity that a virtual link takies on bottom physical network, CPU
cmap the bottom physical network nodes CPU used, α
cand β
cbe the weight coefficient for regulating bandwidth sum CPU, also can be understood as the cost that operator provides empty net service Time Bandwidth and cpu resource, subscript C refers to Cost.
3) surplus resources (Available Resource, AR):
AR is the surplus resources for certain bottom Physical Network node, defines according to residue cpu resource and the residue link circuit resource that is connected with this bottom Physical Network node:
AR＝CPU
A∑BW
A
Wherein, Corr is for certain bottom Physical Network node (S
node) coefficient correlation, along with Corr increase, the effect of nearby principle is enhanced, Corr > 1.Index n represent current void net request in mapped successfully and map resemble node and S
nodehave the virtual node number directly connected, the size of n characterizes S
nodewith the distance having mapped successful bottom physical network nodes before, subscript A refers to AR.
The present invention, one is introduce nearby principle by definition weighted residual resource, while node mapping, account for link maps.Two is introduce V in virtual network node mapping process
nodeaccording to the mechanism that its surplus resources sorts.Three is introduce V in virtual network link mapping process
hnkaccording to the mechanism that its bandwidth sorts.
(1) nearby principle
As mentioned above, in existing empty net node mapping flow process, when finding bottom Physical Network node, criterion is the surplus resources of node, this criterion only considers the surplus resources size of bottom Physical Network node, do not consider the distance problem of link maps, therefore the present invention proposes to use weighted residual resource as criterion, is defined as follows:
WAR＝Corr
n·CPU
A∑BW
A
Wherein, Corr is for certain bottom Physical Network node S
nodecoefficient correlation, along with Corr increase, the effect of nearby principle is enhanced, and should be set to Corr > 1.Index n represent current void net request in mapped successfully and map resemble node and S
nodehave the virtual node number directly connected, the size of n characterizes S
nodewith the distance having mapped successful bottom physical network nodes before, n larger expression distance is nearer, then follow-up link maps is easier.Employ weighted residual resource as criterion after, the distance problem of bottom Physical Network node surplus resources and link maps obtains consideration simultaneously, significantly reduce the complexity of link maps, improve the utilance of bottom Physical Network link circuit resource, improve the income expenditure ratio of system.
(2) V
nodeordering mechanism
In the process that the request of single void net maps, existing empty net node mapping method does not carry out V
nodesequence, therefore in empty net request, unessential empty net node is probably preferentially mapped to the most abundant bottom physical network nodes of resource, when then the empty net node of outbalance maps below, possibly cannot find the bottom physical network nodes meeting resource requirement, thus cause node mapping failure.Therefore invention introduces V
nodecarry out the mechanism sorted according to its surplus resources, this mechanism ensure that important V to a certain extent
nodepreferential mapping, thus the overall success rate that improve node mapping.
(3) V
hnkordering mechanism
In the process that the request of single void net maps, existing empty network chain road mapping method does not carry out V
hnksequence, therefore in empty net request, the less empty network chain road of bandwidth is probably preferentially mapped to the most abundant bottom physical network links of resource, when the empty network chain road that then bandwidth is larger below maps, possibly cannot find the bottom physical network links meeting bandwidth requirement, thus cause link maps failure.Therefore invention introduces V
hnkcarry out the mechanism sorted according to its bandwidth, this mechanism ensure that the V that bandwidth is larger to a certain extent
hnkpreferential mapping, thus the overall success rate that improve link maps.
Accompanying drawing explanation
Fig. 1 virtual network mapping problems
Void net under Fig. 2 time window pattern maps flow process
The idiographic flow that Fig. 3 void net maps
Execution mode
The core of concrete operations flow process of the present invention is time window, and carry out a virtual network in a time window and map, empty net is mapped in the flow process under time window pattern, as shown in Figure 2:
A. discharge the bottom Physical Network resource that the void net request left in previous time window takies, the request of above-mentioned void net comprised service request and by the request initiatively refused; Empty net request comprises the request of empty net node and empty net link request two parts;
B. add up the void net request arrived in this time window, the request comprising newly arrived request and requeue asked by empty net;
C. the void net request added up in step B is sorted from big to small according to its income (Revenue), then bottom physical network is mapped in order, if wherein any one empty net request maps successfully, namely empty net node and empty network chain road map successfully simultaneously, then upgrade the state of bottom physical network; If map unsuccessfully, then waiting list is delivered in this empty net request, wait for next time window; Pre-set the number of times that empty net asks to requeue, exceed preset times as mapped failed number of times, then this request no longer sends into waiting list, but directly refuses.
This void net mapping flow process ensure that empty net request can process in real time, and the mechanism of permitting the entrance of empty net request can be undertaken controlling (as postponed, refusing empty net request) by regulating parameter.
The core procedure that empty net maps is that group empty net request of in time window is mapped to bottom physical network (step C), and this mapping process can describe by flow process below, as shown in Figure 3
C1) first carry out node mapping, the request of void net is sorted from big to small according to its income;
C2) whether there is empty net request not carry out node mapping after judging the sequence of C1 step, if there is the void net request not carrying out node mapping, perform step C3, if do not carry out the void net request of node mapping, perform step C9;
C3) maximum void net request is taken in after selecting the sequence of C1 step, and by the empty net node (V in the request of this void net
node) sort from big to small according to its surplus resources (Available Resource, AR);
C4) judge whether have empty net node not map in the void net request selected in C3 step, if there is unmapped empty net node, perform step C5, if there is no unmapped empty net node, perform step C2;
C5) select the empty net node that the rear surplus resources of C3 step sequence is maximum, in bottom Physical Network, select such Physical Network node (S
node): its cpu resource is greater than the cpu resource of above-mentioned empty net node, is sorted from big to small by the Physical Network node selected according to its weighted residual resource (WeightedAvailable Resource, WAR);
C6) whether there is Physical Network node not mapped after judging the sequence of C5 step, if there is not mapped Physical Network node, perform step C7, if there is no not mapped Physical Network node, perform step C8;
C7) by Physical Network peer distribution maximum for C5 step sequence rear weight surplus resources to the maximum empty net node of the surplus resources selected in C5 step, perform step C4;
C8) void net request maximum for the income selected in C3 step is delivered to waiting list or refusal request, perform step C2;
C9) start to carry out link maps, successful for node mapping empty net request is sorted from big to small by income;
Whether have empty net request not carry out link maps after C10) judging the sequence of C9 step, if there is the void net request not carrying out link maps, perform step C11, if do not carry out the void net request of link maps, mapping algorithm terminates;
C11) maximum void net request is taken in after selecting the sequence of C9 step, and by the empty network chain road (V in the request of this void net
hnk) sort from big to small according to its bandwidth;
C12) judge whether have empty network chain road not map in the void net request selected in C11 step, if there is unmapped empty network chain road, perform step C13, if there is no unmapped empty network chain road, perform step C10;
C13) select the empty network chain road that the rear bandwidth of C11 step sequence is maximum, use K shortest path (K-Shortest) algorithm to find 1 to K article of shortest path successively, these paths are by one or more bottom Physical Network link (S
link) composition, K be greater than 1 integer, only retain the path wherein meeting this empty net link bandwidth in this K paths;
C14) judge that whether the Physical Network path retained in C13 step is not mapped, if there is not mapped Physical Network path, perform step C15; If there is no not mapped Physical Network path, perform step C16;
C15) shortest path in the Physical Network path retained in C13 step is distributed to the empty network chain road that the bandwidth selected in C13 step is maximum, perform step C12;
C16) void net request maximum for the income selected in C11 step is delivered to waiting list or refusal request, perform step C10.
Claims (5)
1., based on a mapping method of virtual network for nearby principle, the step of carrying out a virtual network mapping in a time window comprises:
A. discharge the bottom Physical Network resource that the void net request left in previous time window takies, the request of above-mentioned void net comprised service request and by the request initiatively refused; Empty net request comprises the request of empty net node and empty net link request two parts;
B. add up the void net request arrived in this time window, the request comprising newly arrived request and requeue asked by empty net;
C. the void net request added up in step B is sorted from big to small according to its income (Revenue), then bottom physical network is mapped in order, if wherein any one empty net request maps successfully, namely empty net node and empty network chain road map successfully simultaneously, then upgrade the state of bottom physical network; If map unsuccessfully, then waiting list is delivered in this empty net request, wait for next time window; Pre-set the number of times that empty net asks to requeue, exceed preset times as mapped failed number of times, then this request no longer sends into waiting list, but directly refuses.
2. the method for claim 1, above-mentioned steps C comprises:
C1) first carry out node mapping, the request of void net is sorted from big to small according to its income;
C2) whether there is empty net request not carry out node mapping after judging the sequence of C1 step, if there is the void net request not carrying out node mapping, perform step C3, if do not carry out the void net request of node mapping, perform step C9;
C3) maximum void net request is taken in after selecting the sequence of C1 step, and by the empty net node (V in the request of this void net
node) sort from big to small according to its surplus resources (Available Resource, AR);
C4) judge whether have empty net node not map in the void net request selected in C3 step, if there is unmapped empty net node, perform step C5, if there is no unmapped empty net node, perform step C2;
C5) select the empty net node that the rear surplus resources of C3 step sequence is maximum, in bottom Physical Network, select the Physical Network node (S that surplus resources is maximum
node): its cpu resource is greater than the cpu resource of above-mentioned empty net node, is sorted from big to small by the Physical Network node selected according to its weighted residual resource (Weighted Available Resource, WAR);
C6) whether there is Physical Network node not mapped after judging the sequence of C5 step, if there is not mapped Physical Network node, perform step C7, if there is no not mapped Physical Network node, perform step C8;
C7) by Physical Network peer distribution maximum for C5 step sequence rear weight surplus resources to the maximum empty net node of the surplus resources selected in C5 step, perform step C4;
C8) void net request maximum for the income selected in C3 step is delivered to waiting list or refusal request, pre-set the number of times that empty net asks to requeue, exceed preset times as mapped failed number of times, then this request no longer sends into waiting list, but directly refuses; Perform step C2;
C9) start to carry out link maps, successful for node mapping empty net request is sorted from big to small by income;
Whether have empty net request not carry out link maps after C10) judging the sequence of C9 step, if there is the void net request not carrying out link maps, perform step C11, if do not carry out the void net request of link maps, mapping algorithm terminates;
C11) maximum void net request is taken in after selecting the sequence of C9 step, and by the empty network chain road (V in the request of this void net
link) sort from big to small according to its bandwidth;
C12) judge whether have empty network chain road not map in the void net request selected in C11 step, if there is unmapped empty network chain road, perform step C13, if there is no unmapped empty network chain road, perform step C10;
C13) select the empty network chain road that the rear bandwidth of C11 step sequence is maximum, use K shortest path (K-Shortest) algorithm to find 1 to K article of shortest path successively, these paths are by one or more bottom Physical Network link (S
link) composition, K be greater than 1 integer, only retain the path wherein meeting this empty net link bandwidth in this K paths;
C14) judge that whether the Physical Network path retained in C13 step is not mapped, if there is not mapped Physical Network path, perform step C15; If there is no not mapped Physical Network path, perform step C16;
C15) shortest path in the Physical Network path retained in C13 step is distributed to the empty network chain road that the bandwidth selected in C13 step is maximum, perform step C12;
C16) void net request maximum for the income selected in C11 step is delivered to waiting list or refusal request, pre-set the number of times that empty net asks to requeue, exceed preset times as mapped failed number of times, then this request no longer sends into waiting list, but directly refuses; Perform step C10.
3. method as claimed in claim 2, wherein
Income refers to that empty net maps the profit successfully obtained, and defines according to the successful empty net bandwidth sum CPU of mapping:
Wherein, BW
rthat the successful empty guipure of mapping is wide, CPU
rmap successful empty net node cpu resource, α
rand β
rbe the weight coefficient for regulating bandwidth sum CPU, subscript R refers to take in (Revenue).
4. method as claimed in claim 2, wherein
Surplus resources is the surplus resources for certain bottom Physical Network node, defines according to residue cpu resource and the residue link bandwidth resource that is connected with this Physical Network node:
Wherein, BW
athe residue cpu resource of bottom Physical Network node, CPU
abe the remaining bandwidth resources of bottom Physical Network link be connected with this bottom Physical Network node, subscript A refers to surplus resources (Available Resource, AR).
5. method as claimed in claim 2, wherein,
Weighted residual resource (Weighted Available Resource, WAR) is defined as:
Wherein, Corr is for certain bottom Physical Network node S
nodecoefficient correlation, along with Corr increase, the effect of nearby principle is enhanced, Corr be greater than 1 real number; Index n represent current void net request in mapped successfully and map resemble node and S
nodehave the virtual node number directly connected, the size of n characterizes S
nodewith before by the distance of bottom physical network nodes successfully mapped.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110023701.3A CN102075429B (en) | 2011-01-21 | 2011-01-21 | Virtual network mapping method based on principle of proximity |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110023701.3A CN102075429B (en) | 2011-01-21 | 2011-01-21 | Virtual network mapping method based on principle of proximity |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102075429A CN102075429A (en) | 2011-05-25 |
| CN102075429B true CN102075429B (en) | 2014-12-17 |
Family
ID=44033781
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110023701.3A Active CN102075429B (en) | 2011-01-21 | 2011-01-21 | Virtual network mapping method based on principle of proximity |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102075429B (en) |
Families Citing this family (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102223281B (en) * | 2011-06-24 | 2013-09-04 | 清华大学 | Method for remapping resource demand dynamic change based on virtual network |
| CN102427420B (en) * | 2011-12-06 | 2014-05-07 | 北京航空航天大学 | Virtual network mapping method and device based on graph pattern matching |
| CN103179052B (en) * | 2011-12-20 | 2016-03-02 | 中国科学院声学研究所 | A kind of based on the central virtual resource allocation method and system of the degree of approach |
| CN102629216A (en) * | 2012-02-24 | 2012-08-08 | 浪潮(北京)电子信息产业有限公司 | Cloud operating system (OS) scheduling method and cloud system scheduling device |
| CN102624597B (en) * | 2012-03-09 | 2014-12-17 | 北京邮电大学 | Two-way sequencing virtual network mapping method |
| CN102664784B (en) * | 2012-04-19 | 2016-07-06 | 北京邮电大学 | A kind of mapping method of virtual network of node link pressure weight adaptive equalization |
| CN103457752A (en) * | 2012-05-30 | 2013-12-18 | 中国科学院声学研究所 | Virtual network mapping method |
| CN102710488B (en) * | 2012-06-07 | 2015-02-18 | 北京邮电大学 | Method for realizing virtual network mapping |
| CN102904794A (en) * | 2012-09-27 | 2013-01-30 | 北京邮电大学 | Method and device for mapping virtual network |
| CN104243258B (en) * | 2013-06-20 | 2017-10-31 | 中国科学院声学研究所 | A kind of mapping method of virtual network and system based on classification |
| CN103856385B (en) * | 2013-12-11 | 2017-02-08 | 北京邮电大学 | Virtual network mapping method based on link priority |
| CN105262669A (en) * | 2015-12-01 | 2016-01-20 | 电子科技大学 | Virtual network mapping method |
| CN105959141B (en) * | 2016-05-03 | 2019-12-03 | 北京邮电大学 | A kind of virtual network topology construction method and device |
| CN106028453B (en) * | 2016-07-01 | 2019-04-16 | 南京邮电大学 | Wireless dummy network resource cross-layer scheduling mapping method based on queueing theory |
| CN107733677B (en) * | 2016-08-12 | 2022-11-15 | 中兴通讯股份有限公司 | Alarm generation method and device for overlay network |
| CN107360031B (en) * | 2017-07-18 | 2020-04-14 | 哈尔滨工业大学 | Virtual network mapping method based on optimized overhead-to-revenue ratio |
| CN109660376B (en) * | 2017-10-12 | 2022-09-02 | 中兴通讯股份有限公司 | Virtual network mapping method, equipment and storage medium |
| CN108174446B (en) * | 2017-11-30 | 2021-08-20 | 西安电子科技大学 | Network node link resource joint distribution method with minimized resource occupancy |
| CN108156041B (en) * | 2018-01-30 | 2021-08-13 | 重庆邮电大学 | Differentiated virtual optical network mapping method based on security perception |
| CN109245948B (en) * | 2018-07-27 | 2019-12-17 | 北京邮电大学 | Security-aware virtual network mapping method and device |
| CN112636961B (en) * | 2020-12-15 | 2022-11-08 | 国网河南省电力公司信息通信公司 | Virtual network resource allocation method based on reliability and distribution strategy under network slice |
| CN113316039B (en) * | 2021-06-02 | 2023-03-14 | 重庆邮电大学 | Virtual network survival mapping method based on reliability and time-frequency resource perception |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6192051B1 (en) * | 1999-02-26 | 2001-02-20 | Redstone Communications, Inc. | Network router search engine using compressed tree forwarding table |
| KR100392206B1 (en) * | 2000-11-10 | 2003-07-22 | (주)인터미디어 | A method for an Internet Communication |
| CN101291430B (en) * | 2007-04-19 | 2012-02-29 | 株式会社Ntt都科摩 | Video transmission method and apparatus in wireless network |
| CN101741717A (en) * | 2008-11-07 | 2010-06-16 | 赵季红 | Conditional risk separation degree-based multiple domain network routing method |
| CN101630275B (en) * | 2009-07-31 | 2012-07-04 | 清华大学 | Realizing method of configuration information for generating cycle task and device thereof |
| CN101799838B (en) * | 2010-01-22 | 2011-12-28 | 电子科技大学 | Method for seeking mapping scheme between tasks and nodes of network on chip |
-
2011
- 2011-01-21 CN CN201110023701.3A patent/CN102075429B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN102075429A (en) | 2011-05-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102075429B (en) | Virtual network mapping method based on principle of proximity | |
| CN102546232B (en) | Multi-topology mapping method of virtual network | |
| CN104836736B (en) | Efficiency resource allocation and path method for reconfiguration in elastic optical network based on frequency spectrum perception | |
| CA2716526C (en) | A method for equitable bandwidth allocation for content distribution networks | |
| CN105827528B (en) | A kind of route selection method suitable for the flexible optical-fiber network of frequency spectrum | |
| CN101026482A (en) | Network protection method based shared risk linkgroup for WDM optical network | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN104486194A (en) | Control system and control method for virtual network with multiple reliability levels | |
| CN105357124B (en) | A kind of MapReduce bandwidth optimization methods | |
| CN108134967A (en) | A kind of electric power optical-fiber network routing frequency spectrum distributing method and system | |
| CN107135056B (en) | Anycast service resource allocation method for reducing frequency spectrum fragments and time delay | |
| CN105472484B (en) | A kind of electric power backbone Optical Transmission Network OTN radio frequency channel proportional routing Wavelength allocation method | |
| CN110401478A (en) | A kind of Information Network management-control method based on SDN technology | |
| CN114268575A (en) | Self-adaptive three-dimensional transmission method and system in heaven-earth integrated information network | |
| CN103595634B (en) | Dynamic service leading method in IP/WDM network | |
| CN109743751A (en) | The resource allocation methods and device of wireless access network | |
| CN105915310A (en) | WDM optical network RWA comprehensive optimization method based on ant colony algorithm | |
| CN102624597B (en) | Two-way sequencing virtual network mapping method | |
| CN104202262B (en) | Frequency spectrum distributing method and device in the flexible optical-fiber network of frequency spectrum | |
| CN110535673A (en) | Construction method, equipment and the storage medium of virtual subnet | |
| CN108616782A (en) | A kind of frequency spectrum distributing method based on the optimization of non-intersecting connection group in elastic optical network | |
| Guan et al. | Virtual network embedding supporting user mobility in 5G metro/access networks | |
| CN106911393A (en) | Appoint multicast service route minimal frequency light tree generation method based on what shared light path merged | |
| CN107241268A (en) | Local multipath method for routing and device based on satellite-based ADS B message satellite networks | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| DD01 | Delivery of document by public notice |
Addressee: Beijing University of Posts and Telecommunications Huang Tao Document name: Notification of Passing Preliminary Examination of the Application for Invention |
|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |