A. Dhamdhere, C. Dovrolis, and H. Jiang, Buffer sizing for congested internet links, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005.
DOI : 10.1109/INFCOM.2005.1498335

M. Alizadeh, pFabric: Minimal Near-optimal Datacenter Transport, Proc. of SIGCOMM'13. Hong Kong, pp.435-446, 2013.

J. Augé, S. Oueslati, and J. Roberts, « Measurement-Based Admission Control for Flow-Aware Implicit Service Differentiation, 2011.

J. Augé and J. Roberts, A Statistical Bandwidth Sharing Perspective on Buffer Sizing, Lecture Notes in Computer Science, vol.10, pp.410-421, 2007.
DOI : 10.1007/978-3-540-72990-7_38

J. Augé and J. Roberts, Buffer sizing for elastic traffic, 2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06., p.8, 2006.
DOI : 10.1109/NGI.2006.1678220

J. Augé and J. Roberts, « Performance of TCP over a link using Fair Queueing, EuroNGI, Proceedings of Workshop on QoS and Traffic Control, 2005.

K. Avrachenkov, The effect of router buffer size on the TCP performance, Proc. of the LONIIS Workshop on Telecommunication Networks and Teletraffic Theory, 2001.

K. Avrachenkov, Differentiation between short and long TCP flows: Predictability of the response time, IEEE INFOCOM, pp.762-773, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071615

N. Bansal and M. Harchol-balter, « Analysis of SRPT scheduling: Investigating unfairness, Proc. of SIGMETRICS'01, p.290, 2001.

D. Barman, G. Smaragdakis, and I. Matta, The effect of router buffer size on highspeed TCP performance, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., pp.1617-1621, 2004.
DOI : 10.1109/GLOCOM.2004.1378255

N. G. Bean, Estimation and Control in ATM Network. Rapp. tech, 1994.

S. B. Fredj, Statistical bandwidth sharing: a study of congestion at flow level, Proc. of SIGCOMM'01, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01266470

N. Benameur, F. Guillemin, and L. Muscariello, « Latency Reduction in Home Access Gateways with Shortest Queue First, Proc. ISOC Workshop on Reducing Internet Latency, 2013.

N. Benameur, Integrated Admission Control for Streaming and Elastic Traffic, Quality of Future Internet Services, pp.69-81, 2001.
DOI : 10.1007/3-540-45412-8_6

N. Benameur, Quality of service and flow level admission control in the Internet, Computer Networks, vol.40, issue.1, pp.57-71, 2002.
DOI : 10.1016/S1389-1286(02)00266-9

N. Benameur, Quality of service and flow level admission control in the Internet, Computer Networks, vol.40, issue.1, pp.57-71, 2002.
DOI : 10.1016/S1389-1286(02)00266-9

N. Benameur, Selective service protection in overload; differentiated services or perflow admission control?, Proc. of Networks'04, p.217, 2004.

H. Van-den-berg and M. Mandjes, « Measurement-based admission control: algorithms, evaluation , and research perspectives, p.257, 1999.

D. P. Bertsekas and R. Gallager, Data networks, 1987.

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

T. Bonald, S. Oueslati-boulahia, and J. Roberts, « IP traffic and QoS control: the need for a flow-aware architecture, 2002.

T. Bonald and J. Roberts, Scheduling network traffic, ACM SIGMETRICS Performance Evaluation Review, vol.34, issue.4, p.35, 2007.
DOI : 10.1145/1243401.1243408

URL : https://hal.archives-ouvertes.fr/hal-01244767

T. Bonald, « Throughput performance in networks with linear capacity constraints, Proc. of CISS'06, 20006.

T. Bonald, M. Jonckheere, and A. Proutiere, « Insensitive load balancing, Proc. of SIGMETRICS'04, pp.367-377, 2004.

T. Bonald and L. Massoulié, « Impact of fairness on Internet performance, Proc. of SIGMETRICS'01, p.91, 2001.

T. Bonald, L. Muscariello, and N. Ostallo, Self-Prioritization of Audio and Video Traffic, 2011 IEEE International Conference on Communications (ICC), pp.1-6, 2011.
DOI : 10.1109/icc.2011.5963295

URL : https://hal.archives-ouvertes.fr/hal-01244042

T. Bonald and A. Proutiere, « Insensitive bandwidth sharing in data networks, Queueing systems 44, pp.69-100, 2003.

T. Bonald and A. Proutiere, On performance bounds for balanced fairness, Performance Evaluation, vol.55, issue.1-2, pp.25-50, 2004.
DOI : 10.1016/S0166-5316(03)00100-7

URL : https://hal.archives-ouvertes.fr/hal-01276419

T. Bonald and A. Proutière, Insensitivity in processor-sharing networks, Proc. of Performance, 2002.
DOI : 10.1016/S0166-5316(02)00110-4

URL : https://hal.archives-ouvertes.fr/hal-01267145

T. Bonald, A. Proutière, and J. Roberts, Statistical performance guarantees for streaming flows using expedited forwarding, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.1104-1112, 2001.
DOI : 10.1109/INFCOM.2001.916304

URL : https://hal.archives-ouvertes.fr/hal-01244778

T. Bonald, W. James, and . Roberts, Congestion at flow level and the impact of user behaviour, Computer Networks 42, pp.521-536, 2003.
DOI : 10.1016/S1389-1286(03)00200-7

B. Braden, Recommendations on Queue Management and Congestion Avoidance in the Internet, p.2309, 1998.
DOI : 10.17487/rfc2309

R. Braden, Resource ReSerVation Protocol (RSVP) ? Version 1 Functional Specification. RFC 2205. Internet Engineering Task Force, sept, 1997.

L. S. Brakmo and . Vegas, End to end congestion avoidance on a global Internet, IEEE Journal on selected Areas in Communications, vol.138, p.1465, 1995.

L. Breslau, S. Jamin, and S. Shenker, Comments on the performance of measurement-based admission control algorithms, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 2000.
DOI : 10.1109/INFCOM.2000.832506

B. Briscoe, Flow rate fairness, ACM SIGCOMM Computer Communication Review, vol.37, issue.2, pp.63-74, 2007.
DOI : 10.1145/1232919.1232926

B. Briscoe, Flow rate fairness, ACM SIGCOMM Computer Communication Review, vol.37, issue.2, pp.63-74, 2007.
DOI : 10.1145/1232919.1232926

B. Briscoe, Pre-congestion notification marking ». In : IETF Internet draft draft-briscoe- tsvwg-cl-phb-03, 2006.

C. Casetti, J. Kurose, and D. Towsley, An adaptive algorithm for measurement-based admission control in integrated services packet networks, Proc. of the Int. Workshop on Protocols for High-Speed Networks, 1996.
DOI : 10.1016/S0140-3664(00)00182-1

A. Charny, Pre-congestion notification using single marking for admission and preemption ». In : draft-charny-pcn-single-marking-00, 2006.

D. Clark, « The design philosophy of the DARPA Internet protocols, ACM SIGCOMM CCR. T. 18. 4, pp.106-114, 1988.

F. Delcoigne, A. Proutiere, and G. Régnié, Modeling integration of streaming and data traffic, Performance Evaluation, vol.55, issue.3-4, pp.185-209, 2004.
DOI : 10.1016/S0166-5316(03)00115-9

N. Dukkipati, Processor Sharing Flows in the Internet, Proc. of IWQoS'05, pp.271-285, 2005.
DOI : 10.1007/11499169_22

M. Enachescu, Part III, ACM SIGCOMM Computer Communication Review, vol.35, issue.3, pp.35-38, 2005.
DOI : 10.1145/1070873.1070886

M. Enachescu, Routers with Very Small Buffers, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
DOI : 10.1109/INFOCOM.2006.240

W. Feng, The BLUE active queue management algorithms, IEEE/ACM Transactions on Networking, vol.10, issue.4, p.528, 2002.

S. Floyd, « HighSpeed TCP for Large Congestion Windows, 2003.
DOI : 10.17487/rfc3649

S. Floyd and K. Fall, Router mechanisms to support end-to-end congestion control, 1997.

S. Floyd and V. Jacobson, Link-sharing and resource management models for packet networks, IEEE/ACM Transactions on Networking, vol.3, issue.4, pp.365-386, 1995.
DOI : 10.1109/90.413212

S. Floyd, « Comments on measurement-based admissions control for controlled-load services, 1996.

S. Floyd, TCP and explicit congestion notification, ACM SIGCOMM Computer Communication Review, vol.24, issue.5, pp.8-23, 1994.
DOI : 10.1145/205511.205512

S. Floyd and V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking, vol.1, issue.4, pp.397-413, 1993.
DOI : 10.1109/90.251892

S. Floyd, R. Gummadi, and S. Shenker, Adaptive RED: An algorithm for increasing the robustness of RED's active queue management, 2001.

L. «. Gao, On inferring autonomous system relationships in the Internet, IEEE/ACM Transactions on Networking (Transactions on Networking), vol.96, pp.733-745, 2001.

J. Gettys, K. Nichols, and . Bufferbloat, Dark buffers in the internet, p.40, 2011.

J. Richard, . Gibbens, P. Frank, and . Kelly, « Measurement-based connection admission control, 15th International Teletraffic Congress. T. 2, pp.879-888, 1997.

R. J. Gibbens, F. P. Kelly, and P. B. Key, A decision-theoretic approach to call admission control in ATM networks, IEEE Journal on Selected Areas in Communications, vol.13, issue.6, pp.1101-1114, 1995.
DOI : 10.1109/49.400665

Y. Gong, Fighting the bufferbloat: on the coexistence of AQM and low priority congestion control, Computer Networks, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00858172

L. A. , G. , and S. Mascolo, « TCP Westwood and easy red to improve fairness in high-speed networks, Protocols for High Speed Networks, pp.130-146, 2002.

M. Grossglauser, N. David, and . Tse, « A framework for robust measurement-based admission control, IEEE/ACM Transactions on Networking, vol.73, pp.293-309, 1999.

M. Grossglauser, N. David, and . Tse, A time-scale decomposition approach to measurement-based admission control, IEEE/ACM Transactions on Networking, vol.11, issue.4, pp.550-563, 2003.
DOI : 10.1109/TNET.2003.815289

D. Grossman, New Terminology and Clarifications for Diffserv. RFC 3260 Internet Engineering Task Force, avr, 2002.

N. Gude, NOX, ACM SIGCOMM Computer Communication Review, vol.38, issue.3, pp.105-110, 2008.
DOI : 10.1145/1384609.1384625

M. Balter, Size-based scheduling to improve web performance, ACM Transactions on Computer Systems, vol.21, issue.2, pp.207-233, 2003.
DOI : 10.1145/762483.762486

V. Christopher and . Hollot, Analysis and design of controllers for AQM routers supporting TCP flows, IEEE Transactions on Automatic Control, vol.476, pp.945-959, 2002.

C. V. Hollot, On designing improved controllers for AQM routers supporting TCP flows, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.1726-1734, 2001.
DOI : 10.1109/INFCOM.2001.916670

B. Hubert, The Wonder Shaper

V. Jacobson and . Braden, « Congestion control and avoidance, Proc. ACM SigComm. T. 88, pp.314-329, 1988.

S. Jamin, J. Scott, . Shenker, B. Peter, and . Danzig, Comparison of measurement-based admission control algorithms for controlled-load service, Proceedings of INFOCOM '97, pp.973-980, 1997.
DOI : 10.1109/INFCOM.1997.631035

H. Jiang and C. Dovrolis, Why is the internet traffic bursty in short time scales?, ACM SIGMETRICS Performance Evaluation Review, vol.33, issue.1, pp.241-252, 2005.
DOI : 10.1145/1071690.1064240

C. Jin, D. X. Wei, and S. H. Low, « Fast TCP: Motivation, architecture, algorithms, performance, Proc. of INFOCOM-06 14, p.1259, 2006.

J. Joung, J. Song, and S. S. Lee, Flow-Based QoS Management Architectures for the Next Generation Network, ETRI journal 30, p.238, 2008.
DOI : 10.4218/etrij.08.1107.0006

A. E. Kamal, A discrete-time model of TCP Reno with background traffic interference, Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, p.445, 2002.
DOI : 10.1109/MASCOT.2002.1167106

D. Katabi, M. Handley, and C. Rohrs, « Congestion control for high bandwidth-delay product networks, ACM SIGCOMM CCR. T. 32. 4, pp.89-102, 2002.

J. Kaur, M. Harrick, and . Vin, Core-stateless guaranteed rate scheduling algorithms, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), pp.1484-1492, 2001.
DOI : 10.1109/INFCOM.2001.916644

F. P. Kelly, Models for a self-managed Internet, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.358, issue.1773, pp.2335-2348, 2000.
DOI : 10.1098/rsta.2000.0651

F. P. Kelly, A. K. Maulloo, and D. K. Tan, « Rate control for communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research society, vol.493, pp.237-252, 1998.

T. Kelly and T. Scalable, Improving performance in highspeed wide area networks, In : ACM SIGCOMM CCR, vol.332, pp.83-91, 2003.

S. Keshav, « Packet-pair flow control, IEEE/ACM Transactions on Networking, 1995.

P. Key, A network flow model for mixtures of file transfers and streaming traffic, Proc. of ITC'18, 2003.
DOI : 10.1016/S1388-3437(03)80251-2

P. Key, Fair Internet traffic integration: network flow models and analysis, Annals of Telecommunications, vol.5911, pp.1338-1352, 2004.

L. «. Kleinrock, Queueing systems, volume II: Computer applications, 1976.

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

A. Kortebi, S. Oueslati, and J. Roberts, « Implicit service differentiation using Deficit Round Robin, Proc. of ITC, vol.19, 2005.

A. Kortebi, Evaluating the Number of Active Flows in a Schedular Realizing Fair Statistical Bandwidth Sharing, Proc. of SIGMETRICS'05, 2005.

A. Kortebi, Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing », In : ACM SIGMETRICS Performance Evaluation Review, vol.331, p.228, 2005.

A. Kortebi, On the scalability of fair queueing, Proc. of HotNets-III, 2004.

T. Lan, An Axiomatic Theory of Fairness in Network Resource Allocation, 2010 Proceedings IEEE INFOCOM, pp.1-9, 2010.
DOI : 10.1109/INFCOM.2010.5461911

D. Lapsley and S. Low, « Random exponential marking for internet congestion control, Proc. of IEEE Globecom, pp.66-74, 1999.

W. E. Leland, On the self-similar nature of Ethernet traffic (extended version), IEEE/ACM Transactions on Networking, vol.2, issue.1, p.15, 1994.
DOI : 10.1109/90.282603

J. Li and C. Mao, Providing flow-based proportional differentiated services in class-based DiffServ routers, IEE Proc.-Communications, pp.82-88, 2004.
DOI : 10.1049/ip-com:20040393

Y. Li, D. Leith, and R. N. Shorten, Experimental Evaluation of TCP Protocols for High-Speed Networks, IEEE/ACM Transactions on Networking, vol.15, issue.5, 2005.
DOI : 10.1109/TNET.2007.896240

D. Lin and R. Morris, « Dynamics of Early Random Detection, ACM SIGCOMM. T. 97, 1997.

J. Liu, Flow-level stability of data networks with non-convex and time-varying rate regions, Proc. of SIGMETRICS'07, p.250, 2007.

L. Massoulié and J. Roberts, « Arguments in favour of admission control for TCP flows, Proc. ITC 16: Teletraffic engineering in a competitive, 1999.

S. Mccanne, S. Floyd, and K. Fall, ns2 (network simulator 2)

N. Mckeown, OpenFlow, ACM SIGCOMM Computer Communication Review, vol.38, issue.2, pp.69-74, 2008.
DOI : 10.1145/1355734.1355746

A. Medina, M. Allman, and S. Floyd, Measuring the evolution of transport protocols in the internet, ACM SIGCOMM Computer Communication Review, vol.35, issue.2, p.52, 2005.
DOI : 10.1145/1064413.1064418

J. Mo and J. Walrand, Fair end-to-end window-based congestion control, IEEE/ACM Transactions on Networking, vol.8, issue.5, pp.556-567, 2000.
DOI : 10.1109/90.879343

D. Mustill and J. Adams, « Conditionally Dedicated Bandwidth Transfer Capability ». In : proposed text for 100 Y.1221, ITU-T Q, p.12, 2005.

S. Nunez-queija, H. Berg, and M. Mandjes, « Strategies for integration of elastic and stream traffic: a performance evaluation, Proc. of ITC'16

S. Oueslati and J. Roberts, A new direction for quality of service: flow-aware networking, Next Generation Internet Networks, 2005, 2005.
DOI : 10.1109/NGI.2005.1431670

S. Oueslati, J. Roberts, and F. T. R&d, Comparing Flow-Aware and Flow-Oblivious Adaptive Routing, 2006 40th Annual Conference on Information Sciences and Systems, pp.655-660, 2006.
DOI : 10.1109/CISS.2006.286549

J. Padhye, Modeling TCP throughput: A simple model and its empirical validation, ACM SIGCOMM CCR. T. 28. 4, pp.303-314, 1998.

R. Pan, B. Prabhakar, and K. Psounis, « CHOKe-A stateless queue management scheme for approximating fair bandwidth allocation, Proc. of INFOCOM'00, pp.942-951, 2000.

R. Pan, Approximate fairness through differential dropping », In : ACM SIGCOMM CCR, vol.332, pp.23-39, 2003.

R. Pan, PIE: A lightweight control scheme to address the bufferbloat problem, 2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR), pp.148-155
DOI : 10.1109/HPSR.2013.6602305

K. Park, G. Kim, and M. Crovella, « On the relationship between file sizes, transport protocols, and self-similar network tra c, p.Computer, 1996.

V. Paxson and S. Floyd, « Wide area traffic: the failure of Poisson modeling, IEEE/ACM Transactions on Networking (TON), vol.33, p.244, 1995.

J. Qiu, W. Edward, and . Knightly, « Measurement-based admission control with aggregate traffic envelopes, IEEE/ACM Transactions on Networking (TON), vol.9, issue.2, pp.199-210, 2001.

G. Raina, D. Towsley, and D. Wischik, Part II, ACM SIGCOMM Computer Communication Review, vol.35, issue.3, pp.35-38, 2005.
DOI : 10.1145/1070873.1070885

G. Raina and D. Wischik, Buffer sizes for large multiplexers: TCP queueing theory and instability analysis, Next Generation Internet Networks, 2005, 2005.
DOI : 10.1109/NGI.2005.1431663

K. Ramakrishnan, S. Floyd, and D. Black, The Addition of Explicit Congestion Notification (ECN) to IP. RFC 3168 (Proposed Standard) Internet Engineering Task Force, sept, 2001.

J. Roberts, Realizing quality of service guarantees in multiservice networks, Proc. of IFIP Seminar PMCCN. T. 97, 1998.
DOI : 10.1007/978-0-387-35360-9_15

J. Roberts and J. Augé, « Fair Queueing and Congestion Control, Workshop on Congestion Control (sept. 2005)

J. Roberts and L. Massoulié, « Bandwidth sharing and admission control for elastic traffic, 1998.

J. W. Roberts and L. Massoulié, « Bandwidth sharing and admission control for elastic traffic ». In : ITC Specialist Seminar, pp.185-201, 1998.

J. W. Roberts, A survey on statistical bandwidth sharing, Computer Networks, vol.45, issue.3, pp.319-332, 2004.
DOI : 10.1016/j.comnet.2004.03.010

J. Roberts, Quality of service guarantees and charging in multiservice networks, p.Communications, 1998.

J. Roberts and L. Massoulie, « Bandwidth sharing: objectives and algorithms, INFO- COM'99, 1999.

J. Roberts and L. Massoulié, « Arguments in favour of admission control for TCP flows, Proc. of ITC 16th, 1999.

J. Roberts, U. Mocci, and J. Virtamo, « Methods for the performance evaluation and design of broadband multiservice networks, Published by the Commission of the European Communities, Information Technologies and Sciences, p.242, 1996.

J. Roberts and S. Oueslati-boulahia, Quality of Service by flow-aware networking, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.358, issue.1773, pp.2197-2207, 2000.
DOI : 10.1098/rsta.2000.0641

S. Scott, « Fundamental design issues for the future internet, pp.1176-1188, 1995.

R. Sherwood, A network virtualization layer, Tech. Rep, 2009.

A. Sivaraman, No silver bullet, Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks, HotNets-XII, p.19
DOI : 10.1145/2535771.2535796

A. Smith, Use of the Cell Loss Priority Tagging Mechanism in ATM Switches, Proc ICIE, vol.91, 1991.

K. Srisankar and R. Srikant, Analysis and design of an adaptive virtual queue(AVQ) algorithm for active queue management, Applications, Technologies, Architectures, and Protocols for Computer Communication, 2001.

I. Stoica, S. Shenker, and H. Zhang, Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks, IEEE/ACM Transactions on Networking, vol.11, issue.1, pp.33-46, 2003.
DOI : 10.1109/TNET.2002.808414

B. Suter, Buffer Management Schemes for Supporting TCP in Gigabit Routers with Per- Flow Queuing, IEEE Journal in Selected Areas in Communications, 1999.

B. Suter, Design considerations for supporting TCP with per-flow queuing, Proc. of INFOCOMM '98, 1998.

G. Hari-prakash-theagarajan, S. Ravichandran, and V. Sivaraman, An Experimental Study of Router Buffer Sizing for Mixed TCP and Real-Time Traffic, 2006 14th IEEE International Conference on Networks, pp.1-6, 2006.
DOI : 10.1109/ICON.2006.302587

C. Villamizar and C. Song, High performance TCP in ANSNET, ACM SIGCOMM Computer Communication Review, vol.24, issue.5, pp.45-60, 1994.
DOI : 10.1145/205511.205520

A. Vishwanath and V. Sivaraman, « Routers with very small buffers: Anomalous loss performance for mixed real-time and TCP traffic, Proc. of IWQoS'08, pp.80-89, 2008.

A. Vishwanath, V. Sivaraman, N. George, and . Rouskas, « Anomalous loss performance for mixed real-time and TCP traffic in routers with very small buffers, IEEE/ACM Transactions on Networking, vol.194, pp.933-946, 2011.

. Wikipedia, ?. Carrier-grade-linux, and . Wikipedia, The Free Encyclopedia. [Online; accessed 1, 2013.

. Wikipedia, Class-based queueing ? Wikipedia, The Free Encyclopedia. [Online; accessed 29, 2013.

. Wikipedia, Deficit round robin ? Wikipedia, The Free Encyclopedia. [Online; accessed 29, 2014.

. Wikipedia, . Fair, and . Wikipedia, The Free Encyclopedia. [Online; accessed 29, 2013.

. Wikipedia, Weighted round robin ? Wikipedia, The Free Encyclopedia. [Online; accessed 29, 2013.

. Wikipédia, Asynchronous Transfer Mode ? Wikipédia, l'encyclopédie libre. [En ligne; Page disponible le 29-janvier-2014]. 2013. url : %5Curl % 7Bhttp

. Wikipédia, Explicit Congestion Notification ? Wikipédia, l'encyclopédie libre. [En ligne

. Wikipédia, Round-robin (informatique) ? Wikipédia, l'encyclopédie libre. [En ligne; Page disponible le 29-janvier

. Wikipédia, Seau à jetons ? Wikipédia, l'encyclopédie libre. [En ligne

D. Wischik, Buffer requirements for high-speed routers, 31st European Conference on Optical Communications (ECOC 2005), pp.23-26, 2005.
DOI : 10.1049/cp:20050828

D. Wischik and N. Mckeown, Part I, ACM SIGCOMM Computer Communication Review, vol.35, issue.3, pp.35-38, 2005.
DOI : 10.1145/1070873.1070884

R. Wójcik and A. Jajszczyk, Flow Oriented Approaches to QoS Assurance, ACM Computing Surveys, vol.44, issue.1, p.5, 2012.
DOI : 10.1145/2071389.2071394

J. Wroclawski, The Use of RSVP with IETF Integrated Services. RFC 2210. Internet Engineering Task Force, sept, 1997.