Greedy packet scheduling on shortest paths (preliminary version)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Greedy packet scheduling on shortest paths (preliminary version)

Full text

Pdf (847 KB)

Source

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

Montreal, Quebec, Canada

Pages: 165 - 175

Year of Publication: 1991

ISBN:0-89791-439-2

Authors

Yishay Mansour	Aiken computation Laboratory, Harvard University, Cambridge, MA
Boaz Patt-Shamir	Laboratory for Computer Science, MIT, Cambridge, MA

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): 9, Citation Count: 6

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

	BG87	Dimitri Bertsekas , Robert Gallager, Data networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	CKMP90	Israel Cidon , Shay Kutten , Yishay Mansour , David Peleg, Greedy packet scheduling, Proceedings of the 4th international workshop on Distributed algorithms, p.169-184, June 1991, Bari, Italy
	LMR88	Tom Leighton, Bruce Maggs, and Satish Rao. Universal packet routing algorithm. In 29th Annual Symposium on Foundations of Computer Science, pages 256-269, White Plains, NY, October 1988.
	Mar82	James Martin , Kathleen Kavanagh Chapman , CORPORATE Inc. The Arben Group, SNA: IBM's networking solution, Prentice-Hall, Inc., Upper Saddle River, NJ, 1987
	MRR80	John McQuillan, Ira Richer, and Eric Rosen. The new routing algorithm for the ARPANET. IEEE Trans. Comm., 28(5):711-719, May 1980.
	RVVN91	Pedro I. Rivera-Vega, Ravi Varadarajan, and Shamkant B. Navathe. The file redistribution scheduling problem. manuscript, 1991.
	Tan81	A. S. Tanenbaum, Computer networks, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
	VB81	L. G. Valiant , G. J. Brebner, Universal schemes for parallel communication, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.263-277, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802479]

CITED BY 6

	Allan Borodin , Jon Kleinberg , Prabhakar Raghavan , Madhu Sudan , David P. Williamson, Adversarial queueing theory, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.376-385, May 22-24, 1996, Philadelphia, Pennsylvania, United States
	Robert Cypher , Luis Gravano, Requirements for deadlock-free, adaptive packet routing, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, p.25-33, August 10-12, 1992, Vancouver, British Columbia, Canada
	Andrea E. F. Clementi , Miriam Di Ianni, On the hardness of approximating optimum schedule problems in store and forward networks, IEEE/ACM Transactions on Networking (TON), v.4 n.2, p.272-280, April 1996
	Allan Borodin , Jon Kleinberg , Prabhakar Raghavan , Madhu Sudan , David P. Williamson, Adversarial queuing theory, Journal of the ACM (JACM), v.48 n.1, p.13-38, Jan. 2001
	Ambrose K. Laing , Robert Cypher, Deadlock-free routing in arbitrary networks via the flattest common supersequence method, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.55-66, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Allan Borodin , Yuval Rabani , Baruch Schieber, Deterministic Many-to-Many Hot Potato Routing, IEEE Transactions on Parallel and Distributed Systems, v.8 n.6, p.587-596, June 1997