The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Panduan dalam rangkaian untuk cache luar laluan, Breadcrumbs, telah dicadangkan untuk rangkaian cache. Ia membimbing permintaan kandungan ke kandungan cache di luar laluan dengan menggunakan penunjuk arah muat turun kandungan terkini, serbuk roti. Dalam Breadcrumbs, penunjuk serbuk roti ditimpa apabila muat turun kandungan baharu kandungan yang sepadan melalui penghala. Terdapat kemungkinan bahawa maklumat panduan yang sedikit lama untuk kandungan popular mungkin membawa kepada kandungan cache yang lebih baik daripada yang terkini. Dalam kertas kerja ini, kami mencadangkan panduan dalam rangkaian baharu, Serbuk Roti Berbilang, yang menyimpan serbuk roti lama walaupun dengan penuding serbuk roti terbaharu yang dijana dengan muat turun kandungan baharu. Kami menumpukan pada keupayaan carian kandungannya dan mencadangkan pemilihan Sensitif Throughput yang memilih sumber kandungan yang memberikan anggaran daya pengeluaran terbaik. Penilaian prestasi kami memberikan hasil yang menarik bahawa pemilihan Serbuk Roti Berbilang dengan Throughput Sensitive yang dicadangkan kami meningkatkan bukan sahaja daya pemprosesan untuk kandungan popular tetapi juga untuk kandungan yang tidak popular.
Yusaku HAYAMIZU
Kansai University
Miki YAMAMOTO
Kansai University
Elisha ROSENSWEIG
University of Massachusetts at Amherst
James F. KUROSE
University of Massachusetts at Amherst
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Yusaku HAYAMIZU, Miki YAMAMOTO, Elisha ROSENSWEIG, James F. KUROSE, "Multiple-Breadcrumbs: A New In-Network Guidance for Off-Path Cache in Cache Networks" in IEICE TRANSACTIONS on Communications,
vol. E101-B, no. 12, pp. 2388-2396, December 2018, doi: 10.1587/transcom.2018EBP3043.
Abstract: In-network guidance to off-path cache, Breadcrumbs, has been proposed for cache network. It guides content requests to off-path cached contents by using the latest content download direction pointer, breadcrumbs. In Breadcrumbs, breadcrumb pointer is overwritten when a new content download of the corresponding content passes through a router. There is a possibility that slightly old guidance information for popular contents might lead to better cached content than the latest one. In this paper, we propose a new in-network guidance, Multiple-Breadcrumbs, which holds old breadcrumbs even with the latest breadcrumb pointer generated with a new content download. We focus on its content search capability and propose Throughput Sensitive selection that selects the content source giving the best estimated throughput. Our performance evaluation gives interesting results that our proposed Multiple Breadcrumbs with Throughput Sensitive selection improves not only throughput for popular contents but also for unpopular contents.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2018EBP3043/_p
Salinan
@ARTICLE{e101-b_12_2388,
author={Yusaku HAYAMIZU, Miki YAMAMOTO, Elisha ROSENSWEIG, James F. KUROSE, },
journal={IEICE TRANSACTIONS on Communications},
title={Multiple-Breadcrumbs: A New In-Network Guidance for Off-Path Cache in Cache Networks},
year={2018},
volume={E101-B},
number={12},
pages={2388-2396},
abstract={In-network guidance to off-path cache, Breadcrumbs, has been proposed for cache network. It guides content requests to off-path cached contents by using the latest content download direction pointer, breadcrumbs. In Breadcrumbs, breadcrumb pointer is overwritten when a new content download of the corresponding content passes through a router. There is a possibility that slightly old guidance information for popular contents might lead to better cached content than the latest one. In this paper, we propose a new in-network guidance, Multiple-Breadcrumbs, which holds old breadcrumbs even with the latest breadcrumb pointer generated with a new content download. We focus on its content search capability and propose Throughput Sensitive selection that selects the content source giving the best estimated throughput. Our performance evaluation gives interesting results that our proposed Multiple Breadcrumbs with Throughput Sensitive selection improves not only throughput for popular contents but also for unpopular contents.},
keywords={},
doi={10.1587/transcom.2018EBP3043},
ISSN={1745-1345},
month={December},}
Salinan
TY - JOUR
TI - Multiple-Breadcrumbs: A New In-Network Guidance for Off-Path Cache in Cache Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2388
EP - 2396
AU - Yusaku HAYAMIZU
AU - Miki YAMAMOTO
AU - Elisha ROSENSWEIG
AU - James F. KUROSE
PY - 2018
DO - 10.1587/transcom.2018EBP3043
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E101-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2018
AB - In-network guidance to off-path cache, Breadcrumbs, has been proposed for cache network. It guides content requests to off-path cached contents by using the latest content download direction pointer, breadcrumbs. In Breadcrumbs, breadcrumb pointer is overwritten when a new content download of the corresponding content passes through a router. There is a possibility that slightly old guidance information for popular contents might lead to better cached content than the latest one. In this paper, we propose a new in-network guidance, Multiple-Breadcrumbs, which holds old breadcrumbs even with the latest breadcrumb pointer generated with a new content download. We focus on its content search capability and propose Throughput Sensitive selection that selects the content source giving the best estimated throughput. Our performance evaluation gives interesting results that our proposed Multiple Breadcrumbs with Throughput Sensitive selection improves not only throughput for popular contents but also for unpopular contents.
ER -