Technical reports

HPP: a hierarchical propagation protocol for large scale replication in wide area networks

Noha Adly, Akhil Kumar

March 1994, 24 pages

DOI: 10.48456/tr-331

Abstract

This paper describes a fast, reliable, scalable and efficient propagation protocol for weak-consistency replica management. This protocol can be used to implement a bulletin board service such as the Usenet news on the Internet. It is based on organizing the nodes in a network into a logical hierarchy, and maintaining a limited amount of state information at each node. It ensures that messages are not lost due to failures or partitions once they are repaired and minimizes redundancy. Further the protocol allows messages to be diffused while nodes are down provided the parent and child nodes of a failed node are alive. Moreover the protocol allows nodes to be moved in the logical hierarchy, and the network to be restructured dynamically in order to improve performance while still ensuring that no messages are lost while the switch takes place and without disturbing normal operation.

Full text

PDF (1.7 MB)

BibTeX record

@TechReport{UCAM-CL-TR-331,
  author =	 {Adly, Noha and Kumar, Akhil},
  title = 	 {{HPP: a hierarchical propagation protocol for large scale
         	   replication in wide area networks}},
  year = 	 1994,
  month = 	 mar,
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-331.pdf},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-331},
  number = 	 {UCAM-CL-TR-331}
}