TAILIEUCHUNG - Predicting Internet Network Distance with Coordinates-Based Approaches

As innovative ways are being developed to harvest the enormous potential of the Internet infrastructure, a new class of large-scale globally-distributed network services and applications such as distributed content hosting services, overlay network multicast [1][2], content addressable overlay networks [3][4], and peer-to-peer file sharing such as Napster and Gnutella have emerged. Because these systems have a lot of flexibility in choosing their communication paths, they can greatly benefit from intelligent path selection based on network performance. For example, in a peer-to-peer file sharing application, a client ideally wants to know the available bandwidth between itself and all the peers that have the wanted file. Unfortunately, although dynamic network performance characteristics such as available. | Predicting Internet Network Distance with Coordinates-Based Approaches T. S. Eugene Ng and Hui Zhang Carnegie Mellon University Pittsburgh PA 15213 eugeneng hzhang @ Abstract In this paper we propose to use coordinates-based mechanisms in a peer-to-peer architecture to predict Internet network distance . round-trip propagation and transmission delay . We study two mechanisms. The first is a previously proposed scheme called the triangulated heuristic which is based on relative coordinates that are simply the distances from a host to some special network nodes. We propose the second mechanism called Global Network Positioning GNP which is based on absolute coordinates computed from modeling the Internet as a geometric space. Since end hosts maintain their own coordinates these approaches allow end hosts to compute their inter-host distances as soon as they discover each other. Moreover coordinates are very efficient in summarizing inter-host distances making these approaches very scalable. By performing experiments using measured Internet distance data we show that both coordinates-based schemes are more accurate than the existing state of the art system IDMaps and the GNP approach achieves the highest accuracy and robustness among them. I. Introduction As innovative ways are being developed to harvest the enormous potential of the Internet infrastructure a new class of large-scale globally-distributed network services and applications such as distributed content hosting services overlay network multicast 1 2 content addressable overlay networks 3 4 and peer-to-peer file sharing such as Napster and Gnutella have emerged. Because these systems have a lot of flexibility in choosing their communication paths they can greatly benefit from intelligent path selection based on network performance. For example in a peer-to-peer file sharing application a client ideally wants to know the available bandwidth between itself and all the peers that have the wanted

TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.