Scheduling and buffer management for soft-real-time VBR traffic in packet-switched networks Export

@proceedings{citeulike:647673, abstract = {This paper describes four scheduling algorithms and two packet-dropping algorithms for transmitting soft-real-time variable-bit-rate traffic in a packet-switched network. Simulation results show that the first-come-first-serve algorithm, which is equivalent to the earliest-deadline-first algorithm when all packets have equal relative deadlines, outperforms the timed-token algorithm as well as two other real-time scheduling algorithms. We also simulated the last-in-first-discard (LIFD) algorithm as well as a more complex (1,k) packet-dropping algorithm which, for each stream, tries to drop no more than I packet in any sequence of k packets. We found that although the (1,k) dropping algorithm does significantly reduce the failure rate, the same reduction in this failure rate can be achieved by slightly lowering the network utilization and using the simpler LIFD algorithm}, author = {Philp, I. R. and Nahrstedt, K. and Liu, J. W. S.}, citeulike-article-id = {647673}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=558142}, journal = {Local Computer Networks, 1996., Proceedings 21st IEEE Conference on}, keywords = {buffer, management, real-time, scheduling}, pages = {143--152}, posted-at = {2006-10-19 06:24:30}, priority = {2}, title = {Scheduling and buffer management for soft-real-time VBR traffic in packet-switched networks}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=558142}, year = {1996} }

TY - CONF ID - citeulike:647673 L3 - citeulike-article-id:647673 N2 - This paper describes four scheduling algorithms and two packet-dropping algorithms for transmitting soft-real-time variable-bit-rate traffic in a packet-switched network. Simulation results show that the first-come-first-serve algorithm, which is equivalent to the earliest-deadline-first algorithm when all packets have equal relative deadlines, outperforms the timed-token algorithm as well as two other real-time scheduling algorithms. We also simulated the last-in-first-discard (LIFD) algorithm as well as a more complex (1,k) packet-dropping algorithm which, for each stream, tries to drop no more than I packet in any sequence of k packets. We found that although the (1,k) dropping algorithm does significantly reduce the failure rate, the same reduction in this failure rate can be achieved by slightly lowering the network utilization and using the simpler LIFD algorithm JF - Local Computer Networks, 1996., Proceedings 21st IEEE Conference on EP - 152 TI - Scheduling and buffer management for soft-real-time VBR traffic in packet-switched networks SP - 143 KW - buffer KW - management KW - real-time KW - scheduling AU - Philp, IR AU - Nahrstedt, K AU - Liu, JWS PY - 1996/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=558142 ER -