摘要
This paper addresses the problem of transcoding proxy placement for coordinated en-route web caching for tree networks. We propose a model for this problem by considering all the nodes among the network in a coordinated way and formulate this problem as an optimization problem. We implement our dynamic programming-based algorithm and evaluate our model on different performance metrics through extensive simulation experiments. The implementation results show that our model outperforms the placement model for linear topology.
原文 | English |
---|---|
頁面 | 226-231 |
頁數 | 6 |
出版狀態 | Published - 2004 |
對外發佈 | 是 |
事件 | Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN - Hong Kong, China 持續時間: 10 5月 2004 → 12 5月 2004 |
Conference
Conference | Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
---|---|
國家/地區 | China |
城市 | Hong Kong |
期間 | 10/05/04 → 12/05/04 |