Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
ÇѱÛÁ¦¸ñ(Korean Title) |
±×·¡ÇÁ Ŭ·¯½ºÅ͸µ ¾Ë°í¸®ÁòÀ» ÀÌ¿ëÇÑ ÀÓ¹« ±â¹Ý ¼ºñ½º ÄÚµð³×ÀÌ¼Ç ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
Mission-oriented Service Coordination by using Graph Clustering Algorithm |
ÀúÀÚ(Author) |
½Å»óº¹
±¸Çü¹Î
°íÀοµ
Sang-Bok Shin
Hyung-Min Koo
In-Young Ko
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 40 NO. 09 PP. 0502 ~ 0510 (2013. 09) |
Çѱ۳»¿ë (Korean Abstract) |
±º ÀÓ¹« ȯ°æ¿¡¼ »ç¿ëµÇ´Â ŽÁö ¹× °ø°Ý ¹«±âü°è¿Í °°Àº ÀÚ¿øÀÇ ¼ö°¡ Áõ°¡ÇÔ¿¡ µû¶ó ÀÚ¿øÀ» ÀÓ¹« ¿ä±¸»çÇ׿¡ ¸Â°Ô È¿À²ÀûÀ¸·Î È°¿ëÇϱâ À§ÇÏ¿©, ÀÚ¿øÀÇ ±â´É ¹× ´É·ÂÀ» ¼ºñ½º·Î Ç¥ÇöÇÏ°í µ¿ÀûÀ¸·Î Á¶ÇÕµÉ ¼ö ÀÖµµ·Ï ÇÏ´Â ¼ºñ½º ±â¹Ý ÀÓ¹« °èȹ ±â¹ýµéÀÌ Á¦¾ÈµÇ¾ú´Ù. À̸¦ À§Çؼ ¼ºñ½ºµéÀ» °ü¸®ÇÏ°í ¿äû¿¡ µû¶ó µ¿ÀûÀ¸·Î ÇÒ´çÇØ ÁÙ ¼ö ÀÖµµ·Ï ÇÏ´Â ¼ºñ½º ÄÚµð³×ÀÌ¼Ç ±â¹ý¿¡ ´ëÇÑ ¿¬±¸°¡ Áß¿ä½Ã µÇ°í ÀÖ´Ù. ±âÁ¸¿¡ ÁÖ·Î ¿¬±¸µÈ Áß¾Ó ÁýÁßÇü ¼ºñ½º ÄÚµð³×ÀÌ¼Ç ±â¹ýÀº ÀÓ¹« ¼öÇàÀ» À§ÇÑ ¼ºñ½º ¹× °ú¾÷ÀÇ ¼ö°¡ Áõ°¡ÇÔ¿¡ µû¶ó ´ÜÀÏ ³ëµå¿¡ ºÎÇÏ°¡ ÁýÁßµÊÀ¸·Î½á º´¸ñ(Bottleneck) Çö»óÀÌ ¹ß»ýÇÒ ¼ö ÀÖ°í, °íÀåÀÌ ¹ß»ýÇÏ¸é ½Ã½ºÅÛ Àüü°¡ µ¿ÀÛÇÏÁö ¾Ê´Â Ä¡¸íÀû ¿À·ùÀÇ ÁöÁ¡ÀÌ µÉ ¼ö ÀÖ´Ù´Â ´ÜÁ¡ÀÌ ÀÖ´Ù. ÀÌ·¯ÇÑ ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇØ ³×Æ®¿öÅ©¸¦ ÅëÇØ ¿¬°áµÈ ´Ù¼öÀÇ ³ëµåµé¿¡ ÀÇÇØ ¼ºñ½ºÀÇ Ã³¸®°¡ °¡´ÉÇϵµ·Ï ÇÏ´Â ºÐ»ê ¼ºñ½º ÄÚµð³×ÀÌ¼Ç ±â¹ýÀÌ Á¦¾ÈµÇ¾ú´Ù. º» ³í¹®¿¡¼´Â ±ºÀÇ Àü¼ú ÀÓ¹« ȯ°æ¿¡¼ ¼ºñ½º ±â¹Ý ÀÓ¹« °èȹÀ» À§ÇÑ ºÐ»ê ¼ºñ½º ÄÚµð³×ÀÌ¼Ç ±â¹ýÀ» ¼Ò°³ÇÏ°í, ºÐ»ê ¼ºñ½º ÄÚµð³×À̼ǿ¡ µû¶ó ¹ß»ýÇÒ ¼ö ÀÖ´Â °ÔÀÌÆ®¿þÀÌ °£ Åë½Å ¿À¹öÇìµå¸¦ ÃÖ¼ÒÈÇϱâ À§ÇÏ¿© Ŭ·¯½ºÅ͸µ ¾Ë°í¸®ÁòÀ» È°¿ëÇÑ ÀÚ¿ø ÇÒ´ç ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. ½Ã¹Ä·¹À̼ÇÀ» ÅëÇÏ¿© º» ³í¹®¿¡¼ Á¦¾ÈÇÏ´Â ¾Ë°í¸®ÁòÀÌ ±×¸®µð(Greedy) ¹× ·£´ý ÇÒ´ç(Random Allocation) ¾Ë°í¸®Áò¿¡ ºñÇØ °ÔÀÌÆ®¿þÀÌ ¿ÜºÎ ¼ºñ½º ÂüÁ¶ Ƚ¼ö ¹× Åë½Å ¿À¹öÇìµå¸¦ 10¢¦20% ´õ ÁÙÀÏ ¼ö ÀÖ¾ú´Ù. |
¿µ¹®³»¿ë (English Abstract) |
Abstract As the amount of avaliable resources of detecting and attacking enemies is increased in the defense domain, the approaches of servicizing the weaponry resources and making them dynamically composed together to support mission plans have been developed. The core part of these approaches includes the service management, representation of the functionalities and capabilities of weaponry resources, and dynamic service reconfiguration based on changes in mission requirements and/or mission environments. Distributed service coordination is an essential issue in dynamic service reconfiguration because services should be managed at runtime and assigned to appropriate resources dynamically in a mission environment. The centralized service coordination approaches have the single point failure problem and may cause the centralized server to become a bottleneck as the number of requests increases. To overcome these limitations, we propose a mission-oriented and distributed service coordination approach that supports a collaborative execution of services based on connected resource-nodes in a tactical network. We developed a dynamic resource allocation algorithm for minimizing the communication overhead between gateways based on the graph clustering algorithm. We showed the effectiveness of the proposed approach by performing a simulation. The result shows that the communication overhead can be reduced by 10 to 20% in comparison to the greedy and random allocation algorithms. |
Å°¿öµå(Keyword) |
ºÐ»ê ¼ºñ½º ÄÚµð³×À̼Ç
Ŭ·¯½ºÅ͸µ
±×·¡ÇÁ ºÐÇÒ
distributed service coordination
clustering
graph partitioning
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|