Journal of the ACM (JACM)
Buffer size requirements under longest queue first
Performance Evaluation
Cell multiplexing in ATM networks
IEEE/ACM Transactions on Networking (TON)
Competitive on-line switching policies
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The zero-one principle for switching networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An improved algorithm for CIOQ switches
ACM Transactions on Algorithms (TALG)
Designing packet buffers for router linecards
IEEE/ACM Transactions on Networking (TON)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
Consider a switching component in a packet-switching network, where messages from several incoming channels arrive and are routed to appropriate outgoing ports according to a service policy. One requirement in the design of such a system is to determine the buffer storage necessary at the input of each channel and the policy for serving these buffers that will prevent buffer overflow and the corresponding loss of messages. In this paper, a class of buffer service policies, called Least Time to Reach Bound (LTRB), is introduced that guarantees no overflow, and for which the buffer size required at each input channel is independent of the number of channels and their relative speeds. Further, the storage requirement is only twice the maximal length of a message in all cases, and as a consequence the class is shown to be optimal in the sense that any nonoverflowing policy requires at least as much storage as LTRB.