Spanners and message distribution in networks

Discrete Applied Mathematics

Volumn 137, Issue 2, 2004, Pages 159-171

  Farley, Arthur M ^a   Proskurowski, Andrzej ^a   Zappala, Daniel ^a   Windisch, Kurt ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

Broadcast; Flooding; Graph; k spanner; Networks; Simulation

Indexed keywords

BROADCASTING; COSTS; GRAPH THEORY; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; PROBLEM SOLVING; ROUTERS;

MESSAGE DISTRIBUTED; MULTICAST ROUTING; SPANNERS;

MULTICASTING;

EID: 0346280042     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00259-2     Document Type: Conference Paper

References (18)

1. A.J. Ballardie, P.F. Francis, J. Crowcroft, Core based trees, in: Proceedings of ACM SIGCOMM, London, August 1993.
2. Brandes U., Handke D. NP-Completeness results for minimum plannar spanners. Discr. Math. Theoret. Comput. Sci. 3:1998;110.
3. Cai L. NP-completeness of minimum spanner problem. Discrete Appl. Math. 48:1994;187-194.
4. Cai L., Corneil D.G. Tree spanners. SIAM J. Discrete Math. 8:1995;359-387.
5. K. Calvert, E. Zegura, Georgia Tech Internetwork Topology Models, Software at http://www.cc.gatech.edu.
6. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, A. Helmy, D. Meyer, L. Wei, Protocol Independent Multicast Version 2 Dense Mode Specification, Internet Draft: work in progress, June 1999.
7. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, L. Wei, An architecture for wide-area multicast routing, in: Proceedings of ACM SIGCOMM, San Francisco, August 1994.
8. A. Farley, A. Proskurowski, K. Windish, Spanners and message distribution in networks, Technical Report UO-TR-99-02, University of Oregon, 1999.
9. A. Farley, A. Proskurowski, D. Zappala, Domcast: a multicore multicast protocol, Technical Report UO-TR-01-02, University of Oregon, 2001.
10. Kou L., Markowsky G., Berman L. A fast algorithm for Steiner trees. Acta Inform. 15:1981;141-145.
11. Y. Mansour, D. Peleg, An approximation algorithm for minimum-cost network design, Technical Report CS94-22, Weizmann Institute of Science, Faculty of Mathematical Sciences, January 1, 1994.
12. D. Peleg, J.D. Ullman, An optimal synchronizer for the hypercube, in: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 10-12 August 1987, pp. 77-85.
13. D. Waitzman, C. Partridge, S. Deering, Distance vector multicast routing protocol, RFC 1075, November 1988.
14. D.W. Wall, Mechanisms for broadcast and selective broadcast, Ph.D. Thesis, Department of Electrical Engineering, Stanford University, 1980.
15. Waxman B.M. Routing of multipoint connections. IEEE J. Selected Areas Comm. 6(9):1988;1617-1622.
16. L. Wei, D. Estrin, The trade-offs of multicast trees and algorithms, in: Proceedings of 1994 International Conference on Computer Communications Networks, San Francisco, September 1994.
17. Winter P. Steiner problem in networks. a survey IEEE Networks. 17(2):1987;129-167.
18. E.W. Zegura, K. Calvert, S. Bhattacharjee, How to model an internetwork, in: IEEE INFOCOM, San Francisco, 1996.