Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Packet-mode scheduling in input-queued cell-based switches
IEEE/ACM Transactions on Networking (TON)
The Message Flow Model for Routing in Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
Bounds on delays and queue lengths in input-queued cell switches
Journal of the ACM (JACM)
Receiver-oriented adaptive buffer allocation in credit-based flow control for ATM networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Achieving stability in networks of input-queued switches
IEEE/ACM Transactions on Networking (TON)
Maximum Pressure Policies in Stochastic Processing Networks
Operations Research
Randomization and heavy traffic theory: new approaches to the design and analysis of switch algorithms
ATM rate based congestion control using a smith predictor: an EPRCA implementation
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
Scheduling and performance limits of networks with constantly changing topology
IEEE Transactions on Information Theory
On the stability of isolated and interconnected input-queueing switches under multiclass traffic
IEEE Transactions on Information Theory
Storage area network extension solutions and their performance assessment
IEEE Communications Magazine
Output-queued switch emulation by fabrics with limited memory
IEEE Journal on Selected Areas in Communications
On the stability of local scheduling policies in networks of packet switches with input queues
IEEE Journal on Selected Areas in Communications
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
An evolution to crossbar switches with virtual output queuing and buffered cross points
IEEE Network: The Magazine of Global Internetworking
Throughput and QoS optimization in nonuniform multichannel wireless mesh networks
Proceedings of the 4th ACM symposium on QoS and security for wireless and mobile networks
Generalized dynamic frame sizing algorithm for finite-internal-buffered networks
IEEE Communications Letters
Optimal control of wireless networks with finite buffers
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
Delay-based network utility maximization
IEEE/ACM Transactions on Networking (TON)
Delay-guaranteed cross-layer scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Most of the current communication networks, including the Internet, are packet switched networks. One of the main reasons behind the success of packet switched networks is the possibility of performance gain due to multiplexing of network bandwidth. The multiplexing gain crucially depends on the size of the buffers available at the nodes of the network to store packets at the congested links. However, most of the previous work assumes the availability of infinite buffer-size. In this paper, we study the effect of finite buffer-size on the performance of networks of interacting queues. In particular, we study the throughput of flow-controlled loss-less networks with finite buffers. The main result of this paper is the characterization of a dynamic scheduling policy that achieves the maximal throughput with a minimal finite buffer at the internal nodes of the network under memory-less (e.g., Bernoulli IID) exogenous arrival process. However, this ideal performance policy is rather complex and, hence, difficult to implement. This leads us to the design of a simpler and possibly implementable policy. We obtain a natural trade-off between throughput and buffer-size for such implementable policy. Finally, we apply our results to packet switches with buffered crossbar architecture.