The power of multimedia: combining point-to point and multi-access networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The power of multimedia: combining point-to point and multi-access networks

Full text

Pdf (1.51 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the seventh annual ACM Symposium on Principles of distributed computing table of contents

Toronto, Ontario, Canada

Pages: 90 - 104

Year of Publication: 1988

ISBN:0-89791-277-2

Authors

Yehuda Afek	AT&T Bell Labs., 600 Mountain Ave., Murray Hill, NJ
Gad M. Landau	Courant Institute of Mathematical Sciences, 251 Mercer St., New York Univ., New York, NY
Baruch Schieber	IBM Research Division, T.J. Watson Research Center, P.O.Box 218, Yorktown Heights, NY
Moti Yung	IBM Research Division, Almaden Research Center, 650 Harry Rd., San-Jose CA

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 10, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/62546.62564 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AAG87	Y. Afek, B. Awerbuch, and E. G afni. Applying static network protocols to dynamic networks. In Proc. of the 28th IEEE Annual Syrup. on Foundation of Computer Science, pages 358-370, October 1987.
	ABCP87	A. Asthana, C. J. Briggs, M. R. Cravatts, and K. Padmanabhan. A high speed multiple pipeline function unit as a building block for parallel architectures. Irt Proc. of the International Conf. on Computer Design, 1987.
	ALSY88	Y. Afek, G. M. Landau, B. Schieber, and M. Yung. The power of multimedia: combining pointto-point and muir:access networks. February 1988. Submitted for Journal Publication.
	Awe85	Baruch Awerbuch, Complexity of network synchronization, Journal of the ACM (JACM), v.32 n.4, p.804-823, Oct. 1985 [doi>10.1145/4221.4227]
	Awe87	B. Awerbuch, Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.230-240, January 1987, New York, New York, United States [doi>10.1145/28395.28421]
	BG87	Dimitri Bertsekas , Robert Gallager, Data networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	Bok84	K.E. Bokhari. Finding maximum on an array processor with a global bus. IEEE Trans. Computers, 33:836-840, 1984.
	Cap79	J. Capetanakis. Tree algorithms for packet broadcast channels. IEEE Trans. on Information Theory, IT- 25(5)'505-515, September 1979.
	CL85	K. Mani Chandy , Leslie Lamport, Distributed snapshots: determining global states of distributed systems, ACM Transactions on Computer Systems (TOCS), v.3 n.1, p.63-75, Feb. 1985 [doi>10.1145/214451.214456]
	CV86	R Cole , U Vishkin, Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.206-219, May 28-30, 1986, Berkeley, California, United States [doi>10.1145/12130.12151]
	FG87	P. A. Franaszek , C. J. Georgiou, Multipath hierarchies in interconnection networks, Proceedings of the 1st International Conference on Supercomputing, p.112-123, March 1988, Athens, Greece
	Gal82	R.G. Gallager. Distributed Minimum Hop Algorithms. Technical Report LIDS-P-1175, M.I.T. Lab for Information and Decision Systems, January 1982.
	GHS83	R. G. Gallager , P. A. Humblet , P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.1, p.66-77, Jan. 1983 [doi>10.1145/357195.357200]
	GL83	A.G. Greenberg and R. Ladner. Estimating the multiplicity of conflicts in multiple access channels. In Proc. of the 24~h IEEE Annual Syrup. on Foundation of Computer Science, pages 384-392, October 1983.
	GM87	Y. Gold and S. Moran. Distributed algorithms for constructing the minimum weight spanning tree in broadcast networks. Distributed Computing, 2(3)'139-148, 1987.
	GPS87	A. Goldberg , S. Plotkin , G. Shannon, Parallel symmetry-breaking in sparse graphs, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.315-324, January 1987, New York, New York, United States [doi>10.1145/28395.28429]
	Gre82	Albert G. Greenberg, On the time complexity of broadcast communication schemes (Preliminary Version), Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.354-364, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802211]
	Int85	intel. Ipsc" intel's personal supercomputer preliminary data sheet. 1985.
	KHS88	Y. J. Kang , J. H. Herzog , J. Spragins, FISHNET: A Distributed Architecture for High-Performance Local Computer Networks, IEEE Transactions on Computers, v.37 n.1, p.119-123, January 1988 [doi>10.1109/12.75144]
	KMZ84	E. Korach , S. Moran , S. Zaks, Tight lower and upper bounds for some distributed algorithms for a complete network of processors, Proceedings of the third annual ACM symposium on Principles of distributed computing, p.199-207, August 27-29, 1984, Vancouver, British Columbia, Canada [doi>10.1145/800222.806747]
	Kru56	J.B. Jr. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. In AMS, pages 48-50, 1956.
	MB76	Robert M. Metcalfe , David R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, v.19 n.7, p.395-404, July 1976 [doi>10.1145/360248.360253]
	Mol81	M. Molle. Unification and Extensions of the Multiple Access Commune'cations Problem. PhD thesis, UCLA, July 1981.
	Mol83	Mart L. Molle , Dimitri Konstantas, A Simulation Study of Retransmission Strategies for the Asynchronous Virtual Time CSMA Protocol, Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation, p.295-308, May 25-27, 1983
	Seg83	A. Segall. Distributed network protocols. IEEE Trans. on Information Theory, IT-29(1}, January 1983.
	SR85	L. Shrira and M. Rodeh. Methodological Construction of Reliable Distributed Algorithms. Technical Report, Technion, March 1985.
	Sto86	Q.F. Stout. Meshes with multiple buses. In Proc. of the 27th IEEE Annual Syrup. on Foundation of Comp,ter Science, pages 264- 273, October 1986.
	Tan81	A. S. Tanenbaum, Computer networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
	VW83	U. Vishkin and A. Wigderson. Trade-offs between depth and width in parallel computation. In Proc. of the e4th IEEE Annual Syrup. on Fdundation of Computer Science, pages 146- 153, October 1983.
	Wil84	Dan E. Willard, Log-logarithmic protocols for resolving ethernet and semaphore conflicts, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.512-521, December 1984 [doi>10.1145/800057.808721]

CITED BY 2

	Yehuda Afek , Baruch Awerbuch , Serge Plotkin , Michael Saks, Local management of a global resource in a communication network, Journal of the ACM (JACM), v.43 n.1, p.1-19, Jan. 1996
	Baruch Awerbuch , Alan Baratz , David Peleg, Cost-sensitive analysis of communication protocols, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.177-187, August 22-24, 1990, Quebec City, Quebec, Canada