Exploiting Dynamic Querying like Flooding Techniques in Unstructured Essay

Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks Review - Essay Example ses the potential solution (algorithm) for making dynamic querying like flooding technique useful for the general unstructured peer-to-peer networks. Comments: Researcher for evaluating KaZaA, BitTorrent and other unstructured network topology can use the material for checking and implementing the enhanced algorithm method and evaluation produced in this paper. (2) ã‚ ¤Ã£Æ' ³Ã£Æ'ˆãÆ' ­Ã£Æ'€ã‚ ¯Ã£â€š ·Ã£Æ' §Ã£Æ' ³Ã£  ¯Ã£â‚¬ Ã§  â€Ã§ © ¶Ã£  ®Ã¨Æ'Å'æ™ ¯Ã£â€šâ€žÃ¥â€¹â€¢Ã¦ ©Å¸Ã£â€šâ€™Ã£â‚¬ Ã£ â€œÃ£  ®Ã¥Ë†â€ Ã©â€¡Å½Ã£  ®Ã£â€š ¹Ã£Æ'šã‚ ·Ã£Æ' £Ã£Æ' ªÃ£â€š ¹Ã£Æ'ˆã  §Ã£  ªÃ£ â€žÃ¤ º ºÃ£  «Ã£â€šâ€šÃ£â€š Ã£ â€¹Ã£â€šâ€¹Ã¨ ¨â‚¬Ã¨â€˜â€°Ã£  §Ã¦ËœÅ½Ã§ ¢ ºÃ£  «Ã¨ ¿ °Ã£  ¹Ã£  ¦Ã£ â€žÃ£â€šâ€¹Ã£ â€¹(Does the introduction clearly state the background and motivation in terms understandable to the non-specialist?) Comments: The introduction is very simple, clear, and understandable to the non-specialist. It provides the background and motivation for discussing an enhanced algorithm for peer-to-peer network for searching. (5) 㠁“㠁 ®Ã¨ «â€"æâ€"‡ã  ®Ã¥Ë†â€ Ã©â€¡Å½Ã£  ®Ã£â€š ¹Ã£Æ'šã‚ ·Ã£Æ' £Ã£Æ' ªÃ£â€š ¹Ã£Æ'ˆã  §Ã£  ªÃ£ â€žÃ¦Å â‚¬Ã¨ ¡â€œÃ¨â‚¬â€¦Ã£  «Ã£  ¨Ã£  £Ã£  ¦Ã£ â€œÃ£  ®Ã¨ «â€"æâ€"‡ã  ¯Ã£  ©Ã£  ®Ã£  Ã£â€šâ€°Ã£ â€žÃ¨ ª ­Ã£  ¿Ã£â€šâ€žÃ£ â„¢Ã£ â€žÃ£ â€¹(How readable is the paper for an engineer who is not a specialist inthis particular field?) Comments: The paper for an engineer who is not a specialist in this particular field is readable. However, if researchers have included ceratin keywords, the definitions of certain concepts, terms, and symbols than it would be an excellent paper. This paper discusses the dynamic querying like technique that is adopted by the Gnutella like peer-to-peer network. In this technique, the source peer first sends query packets towards a few neighbors with a small TTL value to have an initial estimate of the popularity of the searched item. This process is iterative and in each iteration; the source peer estimates the number of peers to be contacted for desired number of result, calculation of TTL for query for sending to the next neighbor and finally propagating query to the next neighbor. Once the desired number of result found the iterative process stops. However, in this technique, the latency can be