Efficient Fair Queueing for ATM Networks Using Uniform

Abstract

In this paper, we study efficient scheduling algorithms that are suitable for ATM networks. In ATM networks, all packets have a fixed small length of 53 bytes and they are transmitted at very high rate. Thus time complexity of a scheduling algorithm is quite important. Most scheduling algorithms proposed so far have a complexity of O(logN) per packet, where… (More)

11 Figures and Tables

Topics

  • Presentations referencing similar topics