Amortized efficiency of list update and paging rules
Communications of the ACM
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing of temporary tasks
Journal of Algorithms
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Proportional differentiated services: delay differentiation and packet scheduling
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On-Line Load Banancing in a Hierarchical Server Topology
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
Packet losses in the current networks take place because of buffer shortage in a router. This paper studies how many buffers should be prepared in a router to eliminate packet losses in the context that an on-line scheduling algorithm in the router must decide the order of transmitting packets among m queues each of which corresponds to a single traffics tream. To exclude packet losses with a small amount of buffers, the maximum queue length must be kept low over the whole scheduling period. This new on-line problem is named the balanced scheduling problem (BSP). By competitive analysis, we evaluate the power of on-line algorithms regarding to the prevention of packet losses. The BSP accompanies tasks with negative costs. Solving an on-line problem which admits tasks with negative costs is our main theoretical contribution. We prove a simple greedy algorithm is Θ(logm)-competitive and nearly optimal, while the ROUND ROBIN scheduling cannot break the trivial upper bound of m-competitiveness. Finally, this paper examines another balancing problem whose objective is to balance the delay among the m traffic streams.