• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë

Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë

Current Result Document : 4 / 6 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) Àü¼ú ³×Æ®¿öÅ© ȯ°æ¿¡¼­ ±×·¡ÇÁ Ŭ·¯½ºÅ͸µ ¹æ¹ýÀ» ÀÌ¿ëÇÑ µ¿ÀûÀÚ¿ø ÇÒ´ç¹æ¹ý
¿µ¹®Á¦¸ñ(English Title) A Dynamic Resource Allocation Method in Tactical Network Environments Based on Graph Clustering
ÀúÀÚ(Author) ±è¹ÎÇù   °íÀοµ   ÀÌÃá¿ì   MinHyeop Kim   In-Young Ko   Choon-Woo Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 41 NO. 08 PP. 0569 ~ 0579 (2014. 08)
Çѱ۳»¿ë
(Korean Abstract)
Àü¼ú ³×Æ®¿öÅ© ȯ°æ¿¡¼­ ÀÓ¹« ¼öÇàÀ» À§ÇØ Á¶ÇÕµÈ ¼­ºñ½º¸¦ ¼öÇàÇϱâ À§Çؼ­´Â ½ÇÁ¦·Î ¼­ºñ½º¸¦ Á¦°øÇÏ´Â ÀÚ¿ø°ú Ãß»ó ¼­ºñ½º¸¦ ¹ÙÀεùÇÏ´Â ÀÛ¾÷ÀÌ ÇÊ¿äÇÏ´Ù. ±×·¯³ª ±ºÀÌ ¿î¿ëÇÏ´Â Àü¼ú ³×Æ®¿öÅ©´Â ´ë¿ªÆøÀÌ ³·°í ÆÐŶ¼Õ½Ç·üÀÌ ³ô¾Æ¼­ºñ½º¸¦ ¾ÈÁ¤ÀûÀ¸·Î ¼öÇàÇϱâ À§Çؼ­´Â Åë½Å·®À» ÃÖ¼ÒÈ­ÇØ¾ß ÇÑ´Ù. ¶ÇÇÑ ÀüÀåȯ°æÀº ±× Ư¼º»ó µ¿ÀûÀ¸·Î º¯È­ÇÑ´Ù. À̸¦ À§ÇØ º» ³í¹®¿¡¼­´Â ºÐ»ê¼­ºñ½º ÄÚµð³×ÀÌ¼Ç °úÁ¤¿¡ »ý±â´Â ¼­ºñ½º°ÔÀÌÆ®¿þÀÌ °£Åë½Å·®À» ÃÖ¼ÒÈ­ÇÏ°í ÀüÀåȯ°æÀÇ º¯È­ Áß ÀϺΠ°ÔÀÌÆ®¿þÀÌÀÇ ¹«·ÂÈ­ »óȲÀ» °í·ÁÇÏ´Â µÎ °³ÀÇ ÀÚ¿ø ÀçÇÒ´ç ±â¹ýÀ» Á¦¾ÈÇÏ°í °ÔÀÌÆ®¿þÀÌ °£ ÃÑÅë½Å ¿À¹öÇìµå¿Í ÇÒ´ç À¯»çµµ¸¦ ±âÁØÀ¸·Î Æò°¡ÇÏ¿´´Ù.
¿µ¹®³»¿ë
(English Abstract)
In a tactical-edge environment, where multiple weapon resources are coordinated together via services, it is essential to make an efficient binding between an abstract service and a resource that are needed to execute composite services for accomplishing a given mission. However, the tactical network that is used in military operation has low bandwidth and a high rate of packet loss. Therefore, communication overhead between services must be minimized to execute composite services in a stable manner in the tactical network. In addition, a tactical-edge environment changes dynamically, and it affects the connectivity and bandwidth of the tactical network. To deal with these characteristics of the tactical network we propose two service-resource reallocation methods which minimize the communication overhead between service gateways and effectively manage neutralization of gateways during distributed service coordination. We compared the effectiveness of these two - methods in terms of total communication overhead between service gateways and resource-allocation similarity between the initial resource allocation and the reallocation result.
Å°¿öµå(Keyword) ¼­ºñ½ºÁöÇâ¾ÆÅ°ÅØó   ¼­ºñ½ºÀÚ¿øÇÒ´ç   ±×·¡ÇÁŬ·¯½ºÅ͸µ   ±×·¡ÇÁºÐÇÒ   service oriented architecture   service resource allocation   graph clustering   graph partitioning  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå