Bubbles

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Bubbles: adaptive routing scheme for high-speed dynamic networks

Full text

Pdf (1.11 MB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-seventh annual ACM symposium on Theory of computing table of contents

Las Vegas, Nevada, United States

Pages: 528 - 537

Year of Publication: 1995

ISBN:0-89791-718-9

Authors

Shlomi Dolev	Department of Mathematics and Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel
Evangelos Kranakis	School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada
Danny Krizanc	School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada
David Peleg	Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 16, Citation Count: 3

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/225058.225270 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.

	AGR89	Y. Afek, E. Gafni, and M. Ricklin. "Upper and lower bounds for routing schemes in dynamic networks,') Proc. 30th Symp. on Foundations of Computer Sczence, pp. 370-375, 1989.
	Aw85	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]
	AB+89	B. Awerbuch , A. Bar-Noy , N. Linial , D. Peleg, Compact distributed data structures for adaptive routing, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.479-489, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73053]
	AB+90	Baruch Awerbuch , Amotz Bar Noy , Nathan Linial , David Peleg, Improved routing strategies with succinct tables, Journal of Algorithms, v.11 n.3, p.307-341, Sep. 1990 [doi>10.1016/0196-6774(90)90017-9]
	AP92	Baruch Awerbuch , David Peleg, Routing with polynomial communication-space trade-off, SIAM Journal on Discrete Mathematics, v.5 n.2, p.151-162, May 1992 [doi>10.1137/0405013]
	AP+92	Baruch Awerbuch , Boaz Patt-Shamir , David Peleg , Michael Saks, Adapting to asynchronous dynamic networks (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.557-570, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129767]
	CG88	I. Cidon and I. Gopal. "PARIS: An approach to private integrated networks," Journal of Ana-log and Digital Cabled Systems 1(2), pp. 77-86, 1988.
	CGZ94	Israel Cidon , Ornan Ori Gerstel , Shmuel Zaks, A Scalable Approach to Routing in ATM Networks, Proceedings of the 8th International Workshop on Distributed Algorithms, p.209-222, September 29-October 01, 1994
	DH95	S. Dolev and T. Herman, "SuperStabilizing Protocols for Dynamic Distributed Systems" University of Iowa, Department of Computer Science Technical Report 95-02, 1995.
	GZ94	Ornan Gerstel , Shmuel Zaks, The virtual path layout problem in fast networks (extended abstract), Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, p.235-243, August 14-17, 1994, Los Angeles, California, United States [doi>10.1145/197917.198100]
	KK77	L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks, " ComputeT Net-WOTkS1, (1977), 155-174.
	KK80	L. Kleinrock and F. Kamoun, "Optimal clus-tering structures for hierarchical topological de-sign of large computer networks, " Netwo?%s10, (1980), 221-248.
	PU89	David Peleg , Eli Upfal, A trade-off between space and efficiency for routing tables, Journal of the ACM (JACM), v.36 n.3, p.510-530, July 1989 [doi>10.1145/65950.65953]
	SK85	M. Santoro and R. Khatib. "Labeling and implicit routing in networks ," The Computer Journal, 28:5-8, 1985.
	Va81	L. G. Valiant. "Universality consideration in VLSI circuits," IEEE Transactions on Comput-eTs, 30, 135-140, 1981.
	vLT87	J. Van Leeuwen , R. B. Tan, Interval routing, The Computer Journal, v.30 n.4, p.298-307, Aug. 1987 [doi>10.1093/comjnl/30.4.298]

CITED BY 3

	Micah Adler , Christian Scheideler, Efficient communication strategies for ad-hoc wireless networks (extended abstract), Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.259-268, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Cyril Gavoille, Routing in distributed networks: overview and open problems, ACM SIGACT News, v.32 n.1, March 2001
	C. Greg Plaxton , Rajmohan Rajaraman , Andréa W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.311-320, June 23-25, 1997, Newport, Rhode Island, United States