ÇѱÛÁ¦¸ñ(Korean Title) |
Doughnut: È¿À²ÀûÀÎ Áö¿ª¼º ¹× ij½³À» »ç¿ëÇÏ´Â Çâ»óµÈ P2P Pastry ¿À¹ö·¹ÀÌ ³×Æ®¿öÅ© |
¿µ¹®Á¦¸ñ(English Title) |
Doughnut: An improved P2P Pastry Overlay Network with Efficient |
ÀúÀÚ(Author) |
±è¸í¿ø
°ûÈıÙ
Á¤±Ô½Ä
Myungwon Kim
Hukeun Kwak
Kyusik Chung
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 16-C NO. 02 PP. 0245 ~ 0256 (2009. 04) |
Çѱ۳»¿ë (Korean Abstract) |
Pastry ¿À¹ö·¹ÀÌ ³×Æ®¿öÅ©´Â ºÐ»ê Çؽ¬ Å×À̺í(DHT : Distributed Hash Table)À» »ç¿ëÇÏ´Â ±¸Á¶Àû(Structured) P2PÀÌ´Ù. Pastry¿¡¼´Â ³ëµåµé »çÀÌÀÇ ¸Þ½ÃÁö ¼ö¸¦ ÁÙÀ̱â À§ÇØ °¢°¢ °ø°£Àû Áö¿ª¼º°ú ij½³À» ÀÌ¿ëÇÑ Rosary¿Í LARÀÌ Á¦¾ÈµÇ¾ú´Ù. Rosary´Â Inter-Pastry¿Í Intra-Pastry·Î ±¸¼ºµÈ´Ù. Rosary¿¡¼ ·çÆ® ³ëµå´Â °¢ Intra-Pastry¸¦ ´ëÇ¥ÇÏ´Â ³ëµå°¡ ÇÒ´çµÇ°í Inter-Pastry¿Í Intra-Pastry ¶ó¿ìÆÃÀ» Ã¥ÀÓÁø´Ù. ÀÌ·¯ÇÑ ±¸Á¶·Î ÀÎÇØ Rosary´Â ´ÙÀ½°ú °°Àº ´ÜÁ¡À» °¡Áø´Ù. ù°´Â ·çÆ® ³ëµåÀÇ ½ÇÆÐ ½Ã °íÀå ¹æÁö ´É·Â(Fault Tolerance)¿¡ ¾àÇÏ´Ù´Â Á¡ÀÌ°í, µÑ°´Â ·çÆ® ³ëµå¸¦ »ç¿ëÇϱ⠶§¹®¿¡ ¶ó¿ìÆà ȩ Ä«¿îÆ®°¡ ±âÁ¸ Structured P2P¿¡ ºñÇØ Áõ°¡ÇÑ´Ù´Â Á¡ÀÌ´Ù. ¸¶Áö¸·À¸·Î ¼Â°´Â Åë½Å ºÎÇÏ°¡ ƯÁ¤ Áö¿ª¿¡ ÁýÁßÇÑ´Ù´Â Á¡ÀÌ´Ù. LARÀÇ °æ¿ì ij½³ÀÌ Intra-Pastry³»ÀÇ ³ëµåµé »çÀÌ¿¡ °ñ°í·ç ºÐÆ÷µÇÁö ¾Ê°í Intra-Pastry³»ÀÇ Æ¯Á¤ ³ëµåµé¿¡ ÀÇÇؼ¸¸ »ç¿ëµÇ¾îÁö´Â ´ÜÁ¡À» °¡Áø´Ù. º» ³í¹®¿¡¼´Â Rosary¿Í LARÀÇ ¹®Á¦Á¡À» ÇØ°áÇÑ DoughnutÀ̶ó ºÒ¸®´Â °³¼±µÈ Pastry¸¦ Á¦¾ÈÇÑ´Ù. DoughnutÀº Áö¿ªÀû Ư¼º¿¡ µû¶ó ³ëµåµé À» ±¸ºÐÇÑ Inter-Pastry¿Í Intra-Pastry·Î ±¸¼ºµÇ°í, ¸ðµç ³ëµåµéÀº Inter-Pastry¿Í Intra-Pastry ¶ó¿ìÆÃÀ» Ã¥ÀÓÁø´Ù. ÀÌ°ÍÀº ¸ðµç ³ëµåµéÀÌ ±âÁ¸ ÀÇ ·çÆ® ³ëµåÀÇ ¿ªÇÒÀ» ¼öÇàÇÔÀ» ÀǹÌÇÑ´Ù. ÀÌ·¯ÇÑ ¹æ¹ýÀº °íÀå ¹æÁö ´É·ÂÀÌ °¨¼ÒÇÏ´Â ¹®Á¦, ¶ó¿ìÆà ȩ Ä«¿îÆ®°¡ Áõ°¡ÇÏ´Â ¹®Á¦ ¹× Åë½Å ºÎÇÏ°¡ ±ÕÀÏÇÏ°Ô ºÐÆ÷ÇÏÁö ¾Ê´Â ¹®Á¦¸¦ ÇØ°áÇÑ´Ù. ¶ÇÇÑ DoughnutÀº Áö¿ªÀûÀ¸·Î(Intra-Pastry) ij½¬ÀÇ ±ÕÀÏÇÑ ºÐÆ÷¸¦ º¸ÀåÇÏ°í, Áö¿ª¾ÈÀÇ Ä³½¬ ÄÜÅÙÃ÷´Â ´Ù¸¥ Áö¿ª¿¡¼µµ »ç¿ëµÉ ¼ö Àֱ⠶§¹®¿¡ È¿À²ÀûÀ¸·Î ij½¬¸¦ »ç¿ëÇÒ ¼ö ÀÖ´Ù. Á¦¾ÈµÈ ¾Ë°í¸®ÁòÀº ½Ã¹Ä·¹ÀÌÅ͸¦ ÅëÇØ ±¸ÇöµÇ¾ú°í, ½ÇÇè °á°ú´Â ±âÁ¸ ¹æ¹ý¿¡ ºñÇØ Á¦¾ÈµÈ ¹æ¹ýÀÌ È¿°úÀûÀÓÀ» º¸¿©ÁØ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
Pastry overlay network is one of structured P2Ps using DHT(Distributed Hash Table). To reduce the number of messages among nodes, Rosary and LAR have been proposed by exploiting spatial locality and caching, respectively, in the Pastry. Rosary consists of Inter-Pastry and Intra-Pastry. A root node is assigned as a representative in each Intra-Pastry and it has the responsibility of Inter-Pastry and Intra-Pastry routing. Therefore, Rosary has several disadvantages; 1) low fault tolerance in case of root node failure 2) routing hop count increases because of the use of root nodes compared to the existing structured P2Ps, and 3) the communication load is concentrated in some specific areas. LAR has inefficient problems in that caching is not distributed among nodes in Intra-Pastry and caching is used by only nodes in the Intra-Pastry.
In this paper, we propose an improved Pastry called Doughnut to overcome the above problems of Rosary and LAR. By dividing nodes with the local characteristics, the Doughnut consists of Inter-Pastry and Intra-Pastry, and all nodes have the responsibility of Inter-Pastry and Intra-Pastry routing. This results in that all nodes perform the role of the existing root node. This solves the problems of the reducing of fault-tolerance, the increasing of routing hop count, and the not-distributed communication load. Also Doughnut can use cache effectively because it guarantees the even cache distribution in local(Intra-Pastry) and the cache contents in local can be used in the other local. The proposed algorithm is implemented using simulator and the experimental results show the effectiveness of the proposed method compared to the existing method. |
Å°¿öµå(Keyword) |
¿À¹ö·¹ÀÌ ³×Æ®¿öÅ©
Áö¿ª¼º
ij½³
Pastry
Rosary
LAR
Doughnut
Overlay Network
Locality
Caching
Pastry
Rosary
LAR
Doughnut
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|