Overflow management with multipart packets
暂无分享,去创建一个
[1] Jan Kratochvíl,et al. Independent Sets with Domination Constraints , 1998, Discret. Appl. Math..
[2] Boaz Patt-Shamir,et al. Competitive Router Scheduling with Structured Data , 2011, WAOA.
[3] Jörg Liebeherr,et al. Buffer Management for Aggregated Streaming Data with Packet Dependencies , 2013, IEEE Trans. Parallel Distributed Syst..
[4] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[5] Alexander Schrijver,et al. On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..
[6] Boaz Patt-Shamir,et al. Online set packing and competitive scheduling of multi-part tasks , 2010, PODC '10.
[7] Boaz Patt-Shamir,et al. Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..
[8] Michael H. Goldwasser. A survey of buffer management policies for packet switches , 2010, SIGA.
[9] Boaz Patt-Shamir,et al. Optimal smoothing schedules for real-time streams , 2004, PODC '00.
[10] Piotr Berman,et al. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..
[11] Oded Schwartz,et al. On the Complexity of Approximating k-Dimensional Matching , 2003, RANDOM-APPROX.
[12] Boaz Patt-Shamir,et al. Competitive buffer management with packet dependencies , 2013, Theor. Comput. Sci..
[13] Jonas Holmerin,et al. Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.
[14] Jill M. Boyce,et al. Packet loss effects on MPEG video sent over the public Internet , 1998, MULTIMEDIA '98.