²é¿´: 838  |  »Ø¸´: 5

yjj691121

Í­³æ (³õÈëÎÄ̳)

[ÇóÖú] °ïæ²éÒ»ÏÂÎÄÕµÄEi¼ìË÷ÐÅÏ¢

퉀Solution for Virtual Network Embedding Problem based on Simulated Annealing Genetic Algorithm

×÷Õß
Jianjun YU

ÕâÆªÎÄÕµļìË÷ºÅµÈÏêϸÐÅÏ¢¡£
Âé·³ÁË¡£
»Ø¸´´ËÂ¥

» ²ÂÄãϲ»¶

» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:

ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

zzfelix

ľ³æ (СÓÐÃûÆø)

¡¾´ð°¸¡¿Ó¦Öú»ØÌû

¡ï ¡ï ¡ï ¡ï ¡ï
yjj691121: ½ð±Ò+5, ¡ï¡ï¡ï¡ï¡ï×î¼Ñ´ð°¸, лл 2012-10-25 09:20:41
Accession number:  20122415104335

  Title:  Solution for virtual network embedding problem based on simulated annealing genetic algorithm
  Authors:  Yu, Jianjun1   
  Author affiliation:  1 Faculty of Information Engineering, Quzhou College of Technology, Quzhou, China  
  Corresponding author:  Yu, J. (yjj691121@126.com)  
  Source title:  2012 2nd International Conference on Consumer Electronics, Communications and Networks, CECNet 2012 - Proceedings
  Abbreviated source title:  Int. Conf. Consum. Electron., Commun. Networks, CECNet - Proc.
  Monograph title:  2012 2nd International Conference on Consumer Electronics, Communications and Networks, CECNet 2012 - Proceedings
  Issue date:  2012
  Publication year:  2012
  Pages:  579-582
  Article number:  6201795
  Language:  Chinese
  ISBN-13:  9781457714153  
  Document type:  Conference article (CA)
  Conference name:  2012 2nd International Conference on Consumer Electronics, Communications and Networks, CECNet 2012
  Conference date:  April 21, 2012 - April 23, 2012
  Conference location:  Three Gorges, China
  Conference code:  90025  
  Sponsor:  IEEE
  Publisher:  IEEE Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States
  Abstract:  Assigning the resources of a virtual network to the components of a physical network, called Virtual Network Mapping, plays a central role in network virtualization. Since this problem is known to be NP-hard, previous research focused on designing heuristic-based algorithms which had clear separation between the node mapping and the link mapping phases. In this paper we propose a Simulated Annealing genetic algorithm to optimize node mapping, and the heuristic algorithm or multi-commodity flow algorithms to solve the link mapping. Our experimental evaluations show that the proposed algorithm increases the acceptance ratio and the revenue while decreasing the cost incurred by the substrate network in the long run. © 2012 IEEE.
  Number of references:  15
  Main heading:  Simulated annealing  
  Controlled terms:  Consumer electronics  -  Distributed computer systems  -  Genetic algorithms  -  Heuristic algorithms  -  Mapping  
  Uncontrolled terms:  Acceptance ratio  -  Annealing genetic algorithm  -  Embedding problems  -  Experimental evaluation  -  Multi-commodity flow  -  Network virtualization  -  Node mapping  -  NP-hard  -  Physical network  -  Substrate networks  -  Virtual networks  
  Classification code:  921 Mathematics -  913 Production Planning and Control; Manufacturing -  902.1 Engineering Graphics -  723.1 Computer Programming -  723 Computer Software, Data Handling and Applications -  722.4 Digital Computers and Systems -  715 Electronic Equipment, General Purpose and Industrial
  DOI:  10.1109/CECNet.2012.6201795
  Database:  Compendex
   Compilation and indexing terms, © 2012 Elsevier Inc.
2Â¥2012-10-22 11:20:17
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

yjj691121

Í­³æ (³õÈëÎÄ̳)

·Ç³£¸Ðл
3Â¥2012-10-22 15:41:43
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

zzfelix

ľ³æ (СÓÐÃûÆø)

ÒýÓûØÌû:
3Â¥: Originally posted by yjj691121 at 2012-10-22 15:41:43
·Ç³£¸Ðл

ÇëÖ§¸¶½ð±Ò°¡ Àϴ󣡣¡
4Â¥2012-10-22 16:01:17
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

yjj691121

Í­³æ (³õÈëÎÄ̳)

ÈçºÎÖ§¸¶Ñ½
5Â¥2012-10-25 09:08:03
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû

¾Å¸½t14

½û³æ (³õÈëÎÄ̳)

±¾ÌûÄÚÈݱ»ÆÁ±Î

6Â¥2017-05-26 12:02:30
ÒÑÔÄ   »Ø¸´´ËÂ¥   ¹Ø×¢TA ¸øTA·¢ÏûÏ¢ ËÍTAºì»¨ TAµÄ»ØÌû
Ïà¹Ø°æ¿éÌø×ª ÎÒÒª¶©ÔÄÂ¥Ö÷ yjj691121 µÄÖ÷Ìâ¸üÐÂ
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] 384Çóµ÷¼Á +3 ×Óϵ²© 2026-03-22 6/300 2026-03-23 21:45 by ×Óϵ²©
[¿¼ÑÐ] 070300»¯Ñ§Çóµ÷¼Á +8 Ô·¶¹¶¹ 2026-03-20 8/400 2026-03-23 20:57 by baobaoye
[¿¼ÑÐ] 0703»¯Ñ§Çóµ÷¼Á +4 ÄÌÓͲÝÝ®. 2026-03-22 5/250 2026-03-23 19:37 by pswait
[¿¼ÑÐ] Çóµ÷¼ÁÒ»Ö¾Ô¸Î人Àí¹¤´óѧ²ÄÁϹ¤³Ì£¨085601£© +3 WW.' 2026-03-23 5/250 2026-03-23 17:18 by ·ãÒíljj
[¿¼ÑÐ] Ò»Ö¾Ô¸ÄϾ©Àí¹¤´óѧ085701×ÊÔ´Óë»·¾³302·ÖÇóµ÷¼Á +5 ¿ûè÷ÎÀ¶Ó 2026-03-18 7/350 2026-03-23 16:26 by lingjue
[¿¼ÑÐ] 08¹¤Ñ§µ÷¼Á +7 Óû§573181 2026-03-20 11/550 2026-03-23 15:47 by ÎÒ°®Ñ§Ï°Ñ§Ï°Ê¹Î
[¿¼ÑÐ] Çóµ÷¼Á²ÄÁÏѧ˶080500£¬×Ü·Ö289·Ö 5+3 @taotao 2026-03-19 21/1050 2026-03-23 10:17 by ¹Úc¸ç
[¿¼ÑÐ] 311Çóµ÷¼Á +6 ¶¬Ê®Èý 2026-03-18 6/300 2026-03-22 20:18 by edmund7
[¿¼ÑÐ] Ò»Ö¾Ô¸»ªÖÐũҵ071010£¬×Ü·Ö320Çóµ÷¼Á +5 À§À§À§À§À¤À¤ 2026-03-20 6/300 2026-03-22 17:41 by hxsm
[¿¼ÑÐ] ÉúÎïѧµ÷¼Á +5 Surekei 2026-03-21 5/250 2026-03-22 14:39 by tcx007
[¿¼ÑÐ] 286·ÖÈ˹¤ÖÇÄÜרҵÇëÇóµ÷¼ÁÔ¸Òâ¿ç¿¼£¡ +4 lemonzzn 2026-03-17 8/400 2026-03-21 22:49 by lemonzzn
[¿¼ÑÐ] 0805 316Çóµ÷¼Á +3 ´óÑ©Éî²Ø 2026-03-18 3/150 2026-03-21 18:55 by ѧԱ8dgXkO
[¿¼ÑÐ] 0703»¯Ñ§µ÷¼Á +4 ÄÝÄÝninicgb 2026-03-21 4/200 2026-03-21 18:39 by ѧԱ8dgXkO
[¿¼ÑÐ] 296Çóµ÷¼Á +6 www_q 2026-03-18 10/500 2026-03-20 23:56 by JourneyLucky
[¿¼ÑÐ] 321Çóµ÷¼Á +9 ºÎÈó²É123 2026-03-18 11/550 2026-03-20 23:19 by JourneyLucky
[¿¼ÑÐ] 304Çóµ÷¼Á +7 ˾¿Õ. 2026-03-18 7/350 2026-03-20 23:08 by JourneyLucky
[¿¼ÑÐ] Ò»Ö¾Ô¸Î÷ÄϽ»Í¨ ר˶ ²ÄÁÏ355 ±¾¿ÆË«·Ç Çóµ÷¼Á +5 Î÷ÄϽ»Í¨×¨²Ä355 2026-03-19 5/250 2026-03-20 21:10 by JourneyLucky
[¿¼ÑÐ] Ò»Ö¾Ô¸ ÄϾ©º½¿Õº½Ìì´óѧ´óѧ £¬080500²ÄÁÏ¿ÆÑ§Ó빤³Ìѧ˶ +5 @taotao 2026-03-20 5/250 2026-03-20 20:16 by JourneyLucky
[¿¼ÑÐ] 0703»¯Ñ§µ÷¼Á +4 18889395102 2026-03-18 4/200 2026-03-19 16:13 by 30660438
[¿¼ÑÐ] ¿¼ÑÐÇóµ÷¼Á +3 éÙËÌ. 2026-03-17 4/200 2026-03-17 21:43 by ÓÐÖ»ÀêÅ«
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û