SIGCOMM '92 Conference proceedings on Communications architectures & protocols
A buffer allocation scheme for ATM networks: complete sharing based on virtual partition
IEEE/ACM Transactions on Networking (TON)
Virtual Partitioning by Dynamic Priorities: Fair and Efficient Resource-Sharing by Several Services
IZS '96 Proceedings of the 1996 International Zurich Seminar on Digital Communications: Broadband Communications - Networks, Services, Applications, Future Directions
Traffic Shaping at a Network Node: Theory, Optimum Design, Admission Control
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Source Time Scale and Optimal Buffer/Bandwidth Trade-off for Regulated Traffic in an ATM Node
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Dynamic queue length thresholds in a shared memory ATM switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Discrete event fluid modeling of background TCP traffic
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.01 |
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.