Managing Redundancy in Distributed Computer Networks: A State Transition Graph Approach for the Stashing Problem
暂无分享,去创建一个
[1] Daniel Barbará,et al. Using stashing to increase node autonomy in distributed file systems , 1990, Proceedings Ninth Symposium on Reliable Distributed Systems.
[2] Richard M. Karp,et al. A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..
[3] S. Louis Hakimi,et al. Steiner's problem in graphs and its implications , 1971, Networks.
[4] Luis Leopoldo Cova. Resource management in federated computing environments , 1990 .
[5] Rafael Alonso,et al. Managing replicated copies in very large distributed systems , 1990, [1990] Proceedings. Workshop on the Management of Replicated Data.
[6] François Soumis,et al. The dynamic predicate stashing copy problem , 1993, Networks.
[7] P. Borsook. Data communications , 1994, IEEE Spectrum.
[8] Bruce Walker,et al. The LOCUS distributed operating system , 1983, SOSP '83.
[9] Russell J. Clark,et al. Providing scalable Web service using multicast delivery , 1995, Second International Workshop on Services in Distributed and Networked Environments.
[10] Pawel Winter,et al. Steiner problem in networks: A survey , 1987, Networks.
[11] D. T. Marlow,et al. An evaluation of three multicast routing algorithms , 1994, Proceedings of 26th Southeastern Symposium on System Theory.
[12] Douglas S. Reeves,et al. Evaluation of multicast routing algorithms for real-time communication on high-speed networks , 1995 .
[13] Deborah Estrin,et al. An architecture for wide-area multicast routing , 1994, SIGCOMM 1994.