Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30866
Title: Design a hierarchical cache system for effective loss recovery in reliable multicast
Authors: Wang, Z
Fan, X
Cao, J 
Keywords: Cooperative cache
Loss recovery
Reliable multicast
Replacement algorithm
Issue Date: 2007
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2007, v. 4847 LNCS, p. 423-432 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: Packet loss recovery is a key issue in reliable multicast. An effective way for packet loss recovery is to place repair servers with active routers along the transmission paths. These repair servers naturally form a hierarchical cache system due to the hierarchical nature of the multicast tree. How to design an effective hierarchical cache system to minimize the packet loss is important. In this paper, we first derive a cooperative caching efficiency model for a hierarchical cache system. Based on the model, a heuristic Cooperative Cache Replacement (CCR) algorithm is proposed to achieve efficient cache performance for reliable multicast systems. The implementation issues are also discussed in detail. The ns-2 based simulations are conducted to evaluate the performance of the proposed algorithm by compared to the optimal caching time (OCT) based algorithm. The results show that CCR effectively reduces the packet loss recovery latency.
Description: 7th International Symposium on Advanced Parallel Processing Technologies, APPT 2007, Guangzhou, 22-23 November 2007
URI: http://hdl.handle.net/10397/30866
ISBN: 9783540768364
ISSN: 0302-9743 (print)
1611-3349 (online)
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

29
Last Week
2
Last month
Checked on Jul 10, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.