M. Andrews and L. Zhang (1999): Packet routing with arbitrary end-to-end delay requirements. Proc. 31st ACM Symp. on Theory of Computing, pp. 557--565.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... Our approach of appropriately using the rounding theorem of [13] has subsequently been applied by Bar Noy, Guha, Naor Schieber to develop approximation algorithms for a family of multi casting 17 problems [3] It has also been applied for a family of routing problems by Andrews Zhang [2]. The second major result in the paper improves upon a class of results in multicriteria covering integer programs. We show that the local criterion of unweighted covering integer programs can be improved from an approximately logarithmic factor to a constant factor, with the global criterion not ....

M. Andrews and L. Zhang. Packet routing with arbitrary end-to-end delay requirements. In Proc. ACM Symposium on Theory of Computing, pages 557--565, 1999.

....consists of a given path from a source to a destination [17, 18, 2] The aim is to schedule the packets across different links of the network with guaranteed (small) delays that depend on the rates of the sessions and the congestion on the links along the paths of the sessions. In a recent paper [3], delay requirements are added to the sessions, so that packets of a given session request to be routed with a delay no larger than the requirement. 3] provides a distributed packet scheduling algorithm such that, if two necessary conditions on the set of packets being routed within this delay ....

....(small) delays that depend on the rates of the sessions and the congestion on the links along the paths of the sessions. In a recent paper [3] delay requirements are added to the sessions, so that packets of a given session request to be routed with a delay no larger than the requirement. [3] provides a distributed packet scheduling algorithm such that, if two necessary conditions on the set of packets being routed within this delay requirement are met, then the packets arrive with a delay that is roughly speaking at most a logarithmic factor (in the size of the network) larger ....

M. Andrews and L. Zhang (1999): Packet routing with arbitrary end-to-end delay requirements. 31st ACM Symp. on Theory of Computing.

....analysis was tightened and simulation results were carried out to show that in many cases, the performance of CEDF and GPS is close to the analytical bounds, implying that CEDF outperforms GPS. This work was extended to the case of arbitrary end to end delay bounds (i.e. independent of ae i ) in [3]. Other work on Earliest Deadline First scheduling includes [5] 8] 9] 16] 20] In [7] Elwalid, Mitra and Wentworth analyzed statistical multiplexing in the context of FIFO scheduling. This analysis was then adapted for the case of GPS by Elwalid and Mitra in [6] and Kumaran, Margrave, ....

M. Andrews and L. Zhang. Packet routing with arbitrary end-to-end delay requirements. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 557 -- 565, Atlanta, GA, May 1999.

....analysis was tightened and simulation results were carried out to show that in many cases, the performance of CEDF and GPS is close to the analytical bounds, implying that CEDF outperforms GPS. This work was extended to the case of arbitrary end to end delay bounds (i.e. independent of ) in [3]. Other work on Earliest Deadline First scheduling includes [5] 8] 9] 16] 20] In [7] Elwalid, Mitra and Wentworth analyzed statistical multiplexing in the context of FIFO scheduling. This analysis was then adapted for the case of GPS by Elwalid and Mitra in [6] and Kumaran, Margrave, ....

M. Andrews and L. Zhang. Packet routing with arbitrary end-to-end delay requirements. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 557 -- 565, Atlanta, GA, May 1999.

No context found.

M. Andrews and L. Zhang (1999): Packet routing with arbitrary end-to-end delay requirements. Proc. 31st ACM Symp. on Theory of Computing, pp. 557--565.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC