Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Quality-of-service in packet networks: basic mechanisms and directions
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on Internet telephony
On achievable service differentiation with token bucket marking for TCP
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Optimal smoothing schedules for real-time streams (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Proportional differentiated services: delay differentiation and packet scheduling
IEEE/ACM Transactions on Networking (TON)
Nearly optimal FIFO buffer management for DiffServ
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
A simple FIFO-based scheme for differentiated loss guarantees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Lower and upper bounds on FIFO buffer management in QoS switches
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Adaptive packet marking for achieving fairness in DiffServ networks
Computer Communications
A QoS architecture for quantitative service differentiation
IEEE Communications Magazine
Traffic management strategy for delay-tolerant networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Motivated by providing differentiated services on the Internet, we consider efficient online algorithms for buffer management in network switches. We study a FIFO buffering model, in which unit-length packets arrive in an online manner and each packet is associated with a value (weight) representing its priority. The order of the packets being sent should comply with the order of their arriving time. The buffer size is finite. At most one packet can be sent in each time step. Our objective is to maximize weighted throughput, defined by the total value of the packets sent. In this paper, we design competitive online FIFO buffering algorithms, where competitive ratios are used to measure online algorithms' performance against the worst-case scenarios. We first provide an online algorithm with a constant competitive ratio 2. Then, we study the experimental performance of our algorithm on real Internet packet traces and compare it with all other known FIFO online competitive algorithms. We conclude that for the same instance, the algorithms' experimental performances could be different from their competitive ratios; other factors such as packet flow characteristics and buffer sizes affect the outcome. Our algorithm outperforms other online algorithms when the buffer resource is limited.