ANALISA PENCARIAN JARAK ANTAR HOST MENGGUNAKAN PENDEKATAN KOORDINAT DALAM JARINGAN P2P UNTUK MENGEMBANGKAN METODE OPTIMALISASI JARINGAN

SANTOSO, DAVID KURNIAWAN (2014) ANALISA PENCARIAN JARAK ANTAR HOST MENGGUNAKAN PENDEKATAN KOORDINAT DALAM JARINGAN P2P UNTUK MENGEMBANGKAN METODE OPTIMALISASI JARINGAN.

Preview

PDF - Published Version Download (4Kb) | Preview

Abstract

Start with increasing human need of information and entertainment through digital content, mainly internet as medium or source, make the need of computer network increasing many and wider. To get fast access, usually user upgrade the bandwith capacities, but we try to find another solution, we try to optimize the route with put the attention on start host and end host distances. Use coordinat based mechanism on P2P architectur for predict host distance on the internet. We hope the result that could optimize exist bandwith by choosing nearest host. We study two mechanisms, first is Triangulated Heuristic, which base on relative coordinat from host to special node. The second one is GNP : Global Network Positioning, which base on absolute coordinat compute from internet as euclidean geometric space model. Since end host will maintain their own coordinat, this mechanism allow end host to compute distance between host after they connected. More than that, coordinat are very efficient in simulate inter host distance, make this mechanism very scalable. Using measured distance, we make an analysis, we show that triangulated heuristic and GNP are more accurate than the existing method that is IDMaps.

Actions (login required)