Allocating bandwidth for bursty connections

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Allocating bandwidth for bursty connections

Full text

Pdf (1.36 MB)

Source

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

El Paso, Texas, United States

Pages: 664 - 673

Year of Publication: 1997

ISBN:0-89791-888-6

Authors

Jon Kleinberg	Cornell University, IBM Almaden
Yuval Rabani	Technion
Éva Tardos	Cornell University

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 36, Citation Count: 7

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

	1	James Aspnes , Yossi Azar , Amos Fiat , Serge Plotkin , Orli Waarts, On-line load balancing with applications to machine scheduling and virtual circuit routing, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.623-631, May 16-18, 1993, San Diego, California, United States [doi>10.1145/167088.167248]
	2	B. Awerbuch, Y. Azar, S. PIotkin, "Throughput-competitive online routing," Proc. 34th IEEE FOCS, 1993, pp. 32--40.
	3	Yair Bartal , Amos Fiat , Howard Karloff , Rakesh Vohra, New algorithms for an ancient scheduling problem, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.51-58, May 04-06, 1992, Victoria, British Columbia, Canada [doi>10.1145/129712.129718]
	4	Anwar I. Elwalid , Debasis Mitra, Effective bandwidth of general Markovian traffic sources and admission control of high speed networks, IEEE/ACM Transactions on Networking (TON), v.1 n.3, p.329-343, June 1993 [doi>10.1109/90.234855]
	5	R. Gawlick , C. Kalmanek , K. G. Ramakrishnan, On-line routing for permanent virtual circuits, Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume, p.278, April 02-06, 1995
	6	R. J. Gibbens , P. J. Hunt, Effective bandwidths for the multi-type UAS channel, Queueing Systems: Theory and Applications, v.9 n.1-2, p.17-28, Oct. 1991 [doi>10.1007/BF01158790]
	7	R.L. Graham. Bounds for certain multiprocessing anomalies. Bell System Tech. d., 45:1563-1581,1966.
	8	R.L. Graham. Bounds on multiprocessing anomalies. SIAM d. Appl. Math., 17(2):416-429, 1969.
	9	Dorit S. Hochbaum , David B. Shmoys, Using dual approximation algorithms for scheduling problems theoretical and practical results, Journal of the ACM (JACM), v.34 n.1, p.144-162, Jan. 1987 [doi>10.1145/7531.7535]
	10	J.Y. Hui, "Resource allocation for broadband networks," IEEE J. Selected Areas in Comm., 6(1988).
	11	F. P. Kelly, Effective bandwidths at multi-class queues, Queueing Systems: Theory and Applications, v.9 n.1-2, p.5-16, Oct. 1991 [doi>10.1007/BF01158789]
	12	F,P. Kelly, "Notes on effective bandwidths;' in {13}.
	13	F.P. Kelly, S. Zachary, I.B. Zeidins, eds., Stochastic Networks: Theory and Applications, Oxford University Press, 1996.
	14	T. Lehtonen. Scheduling jobs with exponential processing times on parallel machines. J. App. Prob., 25(1988), 752-762.
	15	M. Pinedo, Scheduling: Theory, Algorithms and Systems. Prentice Hall, 1995.
	16	S. Plotkin. Competitive Routing in ATM networks. IEEE J. Selected Areas in Communications, 1128-1136, 1995.
	17	Prabhakar Raghavan , Clark D. Tompson, Randomized rounding: a technique for provably good algorithms and algorithmic proofs, Combinatorica, v.7 n.4, p.365-374, Dec, 1987 [doi>10.1007/BF02579324]
	18	G. de Veciana and J. Walrand. Effective bandwidths: Call admission, traffic policing and filtering for ATM networks. Queueing Systems, 20:37-39, 1995.
	19	Gideon Weiss, Approximation results in parallel machines stochastic scheduling, Annals of Operations Research, v.26 n.1-4, p.195-242, Dec. 1990 [doi>10.1007/BF02248591]
	20	G. Weiss, "A Tutorial in Stochastic Scheduling;' in Scheduling Theory and Its Applications, P. Chretienne, E.G. Coffman, J.K. Lenstra, Z. Liu, eds., Wiley, 1995.

CITED BY 7

	Ashish Goel , Adam Meyerson , Serge Plotkin, Approximate majorization and fair online load balancing, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.384-390, January 07-09, 2001, Washington, D.C., United States
	Aranyak Mehta , Scott Shenker , Vijay V. Vazirani, Profit-maximizing multicast pricing by approximating fixed points [Extended Abstract], Proceedings of the 4th ACM conference on Electronic commerce, June 09-12, 2003, San Diego, CA, USA
	Gopal Pandurangan , Eli Upfal, Static and dynamic evaluation of QoS properties, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.566-573, May 01-04, 1999, Atlanta, Georgia, United States
	Aranyak Mehta , Scott Shenker , Vijay V. Vazirani, Posted price profit maximization for multicast by approximating fixed points, Journal of Algorithms, v.58 n.2, p.150-164, February 2006
	Rene Beier , Artur Czumaj , Piotr Krysta , Berthold Vöcking, Computing equilibria for congestion games with (im)perfect information, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
	Sushu Zhang , Karam S. Chatha, System-level thermal aware design of applications with uncertain execution time, Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, November 10-13, 2008, San Jose, California
	Suleyman Uludag , Ljubomir Perković , Anna Kashkanova , Kemal Akkaya, Quality-of-service provisioning via stochastic path selection under Weibullian link delays, The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops, August 14-17, 2007, Vancouver, Canada