Performance and fluid simulations of a novel shared buffer management system

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Performance and fluid simulations of a novel shared buffer management system

Full text

Pdf (229 KB)

Source

ACM Transactions on Modeling and Computer Simulation (TOMACS) archive
Volume 11 , Issue 1 (January 2001) table of contents

Pages: 43 - 75

Year of Publication: 2001

ISSN:1049-3301

Authors

Krishnan Kumaran	Lucent Technologies, Murray Hill, NJ
Debasis Mitra	Lucent Technologies, Murray Hill, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract 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/379525.379527 What is a DOI?

ABSTRACT

We consider a switching system that has multiple ports that share a common buffer, in which there is a FIFO logical queue for each port. Each port may support a large number of flows or connections, which are approximately homogeneous in their statistical characteristics, with common QoS requirements in cell loss and maximum delay. Heterogeneity may exist across ports. Our first contribution is a buffer management scheme based on Buffer Admission Control, which is integrated with Connection Admission Control at the switch. At the same time, this scheme is fair, efficient, and robust in sharing the buffer resources across ports. Our scheme is based on the resource-sharing technique of Virtual Partitioning. Our second major contribution is to advance the practice of discrete-event fluid simulations. Such simulations are approximations to cell-level simulations and offer orders of magnitude speed-up. A third contribution of the paper is the formulation and solution of a problem of optimal allocation of bandwidth and buffers to each port having specific delay bounds, in a lossless multiplexing framework. Finally, we report on extensive simulation results. The scheme is found to be effective, efficient, and robust.

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	AKINPELU, J. M. 1984. The overload performance of engineered networks with nonhierarchical and hierarchical routing. AT&T Bell Lab. Tech. J. 63, 1261-1281.
	2	BORST, S. AND MITRA, D. 1997. Virtual partitioning for resource sharing by state-dependent priorities: Analysis, approximations and performance for heterogeneous traffic. In Proceedings on Teletraffic Contributions for the Information Age-ITC-15, V. Ramaswami and P. E. Wirth, Eds. Elsevier, Amsterdam, The Netherlands, 1457-1468.
	3	CHOUDHURY, A. K. AND HAHNE, E. L. 1993. Space priority management in a shared memory ATM switch. In Proceedings of the IEEE GLOBECOM Conference (Dec.). IEEE Press, Piscataway, NJ, 1375-1383.
	4	CHOUDHURY, A. K. AND HAHNE, E. L. 1996. Dynamic queue length thresholds in a shared memory ATM switch. In Proceedings of the IEEE INFOCOM Conference (Mar.). IEEE Press, Piscataway, NJ, 679-687.
	5	David D. Clark , Scott Shenker , Lixia Zhang, Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism, Conference proceedings on Communications architectures & protocols, p.14-26, August 17-20, 1992, Baltimore, Maryland, United States
	6	ELWALID, A. AND MITRA, D. 1994. Statistical multiplexing with loss priorities in rate-based congestion control of high-speed networks. IEEE Trans. Commun. 42, 11 (Nov.), 2989- 3002.
	7	Anwar Elwalid , Debasis Mitra, Traffic Shaping at a Network Node: Theory, Optimum Design, Admission Control, Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p.444, April 09-11, 1997
	8	ELWALID, A., MITRA, D., AND WENTWORTH, R. H. 1995. A new approach for allocating buffers and bandwidth to heterogenous, regulated traffic in an ATM node. IEEE J. Sel. Areas Commun. 13, 6 (Aug.), 1115-1127.
	9	ENG, K. Y. AND PASHAN, M. A. 1997. Advances in shared-memory designs for gigabit ATM switching. AT&T Bell Lab. Tech. J. 2, 2, 175-187.
	10	FOSCHINI, G. J. AND GOPINATH, B. 1983. Sharing memory optimally. IEEE Trans. Commun. 3 (Mar.), 352-360.
	11	GEORGIADIS, L., CIDON, I., GUERIN, R., AND KHAMISY, A. 1995. Optimal buffer sharing. IEEE J. Sel. Areas Commun. 13 (Sept.), 1229-1240.
	12	HERNANDEZ-VALENCIA, E. J. AND BONOMI, F. G. 1993. Simulation of a simple loss/delay priority scheme for shared memory ATM fabrics. In Proceedings of the IEEE GLOBECOM Conference (Dec.). IEEE Press, Piscataway, NJ, 1389-1394.
	13	IRLAND, M. I. 1978. Buffer management in a packet switch. IEEE Trans. Commun. 26 (Mar.), 328-337.
	14	KEY, P. B. 1990. Optimal control and trunk reservation in loss networks. Prob. Eng. Inf. Sci. 4, 203-242.
	15	LE BOUDEC, J.-Y. 1996. Network calculus made easy. 96/218, EPFL.
	16	LE BOUDEC, J.-Y. AND ZIEDINS, A. 1997. A CAC algorithm for VBR connections over a VBR trunk. In Proceedings on Teletraffic Contributions for the Information Age-ITC-15,V. Ramaswami and P. E. Wirth, Eds. Elsevier, Amsterdam, The Netherlands, 59-70.
	17	Francesco Lo Presti , Zhi-Li Zhang , Jim Kurose , Don Towsley, Source Time Scale and Optimal Buffer/Bandwidth Trade-off for Regulated Traffic in an ATM Node, Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p.675, April 09-11, 1997
	18	MITRA, D., GIBBENS, R. J., AND HUANG, B. D. 1991. Analysis and optimal design of aggregated-least-busy-alternative routing in symmetrical lossless networks with trunk reservations. In Proceedings of the Conference on Teletraffic and Datatraffic, Proc. ITC-13, A. Jensen and V. B. Iversen, Eds. Elsevier North-Holland, Inc., New York, NY, 477-482.
	19	MITRA, D. AND MORRISON, J. A. 1995. Multiple time scale regulation and worst case processes for ATM network control. In Proceedings of the 34th IEEE Conference on Decision and Control (New Orleans, LA, Dec. 13-15). IEEE Press, Piscataway, NJ, 353-358.
	20	Debasis Mitra , Ilze Ziedins, Virtual Partitioning by Dynamic Priorities: Fair and Efficient Resource-Sharing by Several Services, Proceedings of the 1996 International Zurich Seminar on Digital Communications: Broadband Communications - Networks, Services, Applications, Future Directions, p.173-185, February 21-23, 1996
	21	MITRA, D. AND ZIEDINS, I. 1997. Hierarchical virtual partitioning: Algorithms for virtual private networking. In Proceedings of the IEEE GLOBECOM Conference. 1784-1791.
	22	RAJAGOPAL, S., REISSLEIN, M., AND ROSS, K. W. 1997. Packet multiplexers with adversarial regulated traffic.
	23	REIMAN, M. I. 1991. Optimal trunk reservation for a critically loaded link. In Proceedings of the Conference on Teletraffic and Datatraffic, Proc. ITC-13, A. Jensen and V. B. Iversen, Eds. Elsevier North-Holland, Inc., New York, NY, 247-252.
	24	REIMAN, M. I., WANG, J., AND MITRA, D. 1995. Dynamic call admission control of an ATM multiplexer with on/off sources. In Proceedings of the 34th IEEE Conference on Decision and Control (New Orleans, LA, Dec. 13-15). IEEE Press, Piscataway, NJ, 1382-1388.
	25	SIU, K. Y., WU, Y., AND REN, W. 1997. Virtual queueing techniques for UBR1 service in ATM with fair access and minimum bandwidth guarantee. In Proceedings of the IEEE GLOBE- COM Conference. 1081-1085.
	26	Guo-Liang Wu , Jon W. Mark, A buffer allocation scheme for ATM networks: complete sharing based on virtual partition, IEEE/ACM Transactions on Networking (TON), v.3 n.6, p.660-670, Dec. 1995 [doi>10.1109/90.477712]