Per-Flow Queueing by Dynamic Queue Sharing
暂无分享,去创建一个
Bin Liu | Xuefei Chen | Chengchen Hu | Yi Tang | B. Liu | Chengchen Hu | Xuefei Chen | Yi Tang
[1] Larry Peterson,et al. Inter-AS traffic patterns and their implications , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).
[2] Thomas H. Cormen,et al. Introduction to algorithms [2nd ed.] , 2001 .
[3] Chase Cotton,et al. Packet-level traffic measurements from the Sprint IP backbone , 2003, IEEE Netw..
[4] T. V. Lakshman,et al. Beyond best effort: router architectures for the differentiated services of tomorrow's Internet , 1998, IEEE Commun. Mag..
[5] George Varghese,et al. Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.
[6] Abdesselem Kortebi,et al. Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing , 2005, SIGMETRICS '05.
[7] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[8] Tim Roughgarden,et al. Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[9] Scott Shenker,et al. Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .
[10] Guido Appenzeller,et al. Sizing router buffers , 2004, SIGCOMM '04.
[11] T. V. Lakshman,et al. Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing , 1999, IEEE J. Sel. Areas Commun..