Design a hierarchical cache system for effective loss recovery in reliable multicast

Zhijun Wang, Xiaopeng Fan, Jiannong Cao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review


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.
Original languageEnglish
Title of host publicationAdvanced Parallel Processing Technologies - 7th International Symposium, APPT 2007
Number of pages10
Publication statusPublished - 1 Dec 2007
Event7th International Symposium on Advanced Parallel Processing Technologies, APPT 2007 - Guangzhou, China
Duration: 22 Nov 200723 Nov 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4847 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th International Symposium on Advanced Parallel Processing Technologies, APPT 2007


  • Cooperative cache
  • Loss recovery
  • Reliable multicast
  • Replacement algorithm

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this