| Project/Area Number |
15560327
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
ASAKA Takuya Kyoto University, Graduate School of Informatics, Associate Professor, 情報学研究科, 助教授 (30346043)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
TAKAHASHI Tatsuro Kyoto University, Graduate School of Informatics, Professor, 情報学研究科, 教授 (30324677)
|
|---|
| Project Period (FY) |
2003 – 2004
|
| Project Status |
Completed (Fiscal Year 2004)
|
| Budget Amount *help |
¥3,600,000 (Direct Cost: ¥3,600,000)
Fiscal Year 2004: ¥1,800,000 (Direct Cost: ¥1,800,000)
Fiscal Year 2003: ¥1,800,000 (Direct Cost: ¥1,800,000)
|
|---|
| Keywords | Peer-to-Peer / Traffic measurement / Heterogeneous network / Overlay network / Peer search / Peer-to-Peer |
|---|
| Research Abstract |
We have investigated a new content delivery system based on peer-to-Peer networking for heterogeneous network environment. This proposed system consists on traffic control with real-time network quality measurement and pure-type peer-to-peer network architecture.
We have proposed ABdis, a new active measurement method for estimating the available bandwidth on the communication network path. Many conventional active measurement methods/tools, however, can mea-sure/estimate only the average of the available bandwidth and cannot measure its distribution. If the distribution of average available bandwidth over short interval is measured, the information is useful for network management, proxy selection and end-to-end admission control. We propose an end-to-end active measurement method called ABdis which can estimate the distribution of the available bandwidth in a network path. ABdis uses multiple different rate probes and a parameter-matching technique for estimating distribution. Furthermore, we show experimental results by simulation.
We have also proposed a search message forwarding method in an unstructured Peer-to-Peer network. The proposed method appreciates the RTT (Round Trip Time) from peers to peers as the distance between peers. The proposed method builds a virtual field in which the distance between each peer is maintained. It tries to maintain a direction of a search message forwarding on the field. We evaluated the proposed method by computer simulation and show that the proposed method can achieve magnificent reduction about network traffic.
|
