Abstract
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.
| Original language | English |
|---|---|
| Pages | 226-231 |
| Number of pages | 6 |
| Publication status | Published - 2004 |
| Externally published | Yes |
| Event | Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN - Hong Kong, China Duration: 10 May 2004 → 12 May 2004 |
Conference
| Conference | Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
|---|---|
| Country/Territory | China |
| City | Hong Kong |
| Period | 10/05/04 → 12/05/04 |
Keywords
- Dynamic programming
- Optimization problem
- Transcoding proxy placement
- Tree networks
- World Wide Web