J. Beran, R. Sherman, M. S. Taqqu, and W. Willinger, Long-range dependence in variable-bit-rate video traffic, IEEE Transactions on Communications, vol.43, issue.2/3/4, 1995.
DOI : 10.1109/26.380206

S. Blake, Architecture for Differentiated Service, RFC 2475 (Informational), updated by RFC 3260, 1998.

T. Bonald and L. Muscariello, Shortest queue first: implicit service differentiation through per-flow scheduling, 2009.

G. Carofiglio and L. Muscariello, On the impact of TCP and per-flow scheduling on Internet performance, Proc. of IEEE INFOCOM, 2010.

A. Demers, S. Keshav, and S. Shenker, Analysis and simulation of a fair queueing algorithm, Proc. of ACM SIGCOMM, 1989.

C. Demichelis and P. Chimento, IP Packet Delay Variation Metric for IP Performance Metrics (IPPM), RFC 3393, IETF, 2002.

A. Dimakis and J. Walrand, Sufficient conditions for stability of longestqueue-first scheduling: second-order properties using fluid limits, Annals of Applied Probablity, 2006.

R. Jain, D. M. Chiu, and W. Hawe, A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems, 1984.

A. Kortebi, L. Muscariello, S. Oueslati, and J. Roberts, On the Scalability of Fair Queueing, Proc. of ACM SIGCOMM HotNets III, 2004.

A. Kortebi, L. Muscariello, S. Oueslati, and J. Roberts, Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing, Proc. of ACM SIGMETRICS 2005

A. Kortebi, L. Muscariello, S. Oueslati, and J. Roberts, Minimizing the overhead in implementing flow-aware networking, Proceedings of the 2005 symposium on Architecture for networking and communications systems , ANCS '05, 2005.
DOI : 10.1145/1095890.1095912

A. Kortebi, S. Oueslati, and J. Roberts, Cross-protect: implicit service differentiation and admission control, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR., 2004.
DOI : 10.1109/HPSR.2004.1303427
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.467.5762

N. Mckeown, V. Anantharam, and J. Walrand, Achieving 100% throughput in an input-queued switch, Proc. of IEEE INFOCOM, 1996.

J. Nagle, On Packet Switches with Infinite Storage, IEEE Transactions on Communications, vol.35, 1987.

R. Pan, L. Breslau, B. Prabhakar, and S. Shenker, Approximate fairness through differential dropping, ACM SIGCOMM CCR, 2003.
DOI : 10.1145/956981.956985
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6043

R. Pan, B. Prabhakar, and K. Psounis, CHOKe: A stateless queue management scheme for approximating fair bandwdith allocation, Proceedings of IEEE INFOCOM, 2000.

G. Raina, D. Towsley, and D. , Wischik Part II: Control theory for buffer sizing, ACM SIGCOMM CCR, 2005.

G. Sharma, R. Mazumdar, and N. Shroff, Joint Congestion Control and Distributed Scheduling for Throughput Guarantees inWireless Networks, IEEE INFOCOM, 2007.
DOI : 10.1109/infcom.2007.240
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.4639

M. Shreedhar and G. , Varghese Efficient fair queueing using deficit round robin, Proc. of ACM SIGCOMM, 1995.
DOI : 10.1145/217391.217453
URL : http://openscholarship.wustl.edu/cgi/viewcontent.cgi?article=1339&context=cse_research

B. Suter, T. V. Lakshman, D. Stiliadis, and A. K. Choudhury, Design considerations for supporting TCP with per-flow queueing, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98CH36169), 1998.
DOI : 10.1109/INFCOM.1998.659666

L. Tassiulas and A. Ephremides, Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks, IEEE Transactions on Automatic Control, vol.37, issue.12, 1992.