If path-choices are allowed to be chosen optimally or “
selfishly” by the end-system, then coordinated control reaches
the best systemwide optimum; as indeed does uncoordinated control, but only if the control objective is the same for
all paths (unlike current TCP), and also only if all users agree
to use the same number of parallel paths (connections). This
optimum can also be reached by limiting each session to a
small number of path choices (e.g., 2) but allowing paths to
be resampled and better paths to replace existing ones.
This suggests that good design choices for multipath
controllers are coordinated controllers or uncoordinated
controllers with the RTT bias removed.
This work was supported in part by the NSF under award
1. Agar wal, S., Chuah, C.-N., Katz, R.
OPCA: Robust interdomain policy
routing and traffic control. In
Proceedings of the IEEE Openarch
2. Andersen, D., Balakrishnan, H.,
Kaashoek, F., Rao, R. Improving Web
availability for clients with MONET.
In Proceedings of the NSDI 2005
3. Bertsekas, D., Gallager, R. Data
Networks. Longman Higher Education,
Prentice-Hall, Inc., Englewood Cliffs,
4. Cohen, B. Incentives build robustness
in Bit Torrent. In Proceeding of P2P
Economics workshop (June 2003).
5. de Launois, C., Quoitin, B.
Bonaventure, O. Leveraging network
performance with IPv6 multihoming
and multiple provider-dependent
aggregatable prefixes. Comput. Netw.
50, 8 (2006), 1145–1157.
6. Gummadi, K., Madhyastha, H., Gribble,
S., Levy, H., Wetherall, D. Improving
the reliability of Internet paths with
one-hop source routing. In Proceedings
of the 6th OSDI (Dec. 2004).
7. Han, H., Shakkottai, S., Hollot, C.,
Srikant, R., Towsley, D. Multi-path TCP:
a joint congestion control and routing
scheme to exploit path diversity in the
Internet. IEEE/ACM Trans. Netw. 14, 6
(Dec. 2006), 1260–1271.
8. Kelly, F., Maulloo, A., Tan, D. Communication networks: shadow prices,
proportional fairness and stability.
J. Oper. Res. Soc. 49, (1998), 237–252.
9. Kelly, F. P. Mathematical modelling of
the Internet. Mathematics Unlimited –
2001 and Beyond. B. Engquist and
W. Schmid, eds. Springer-Verlag,
New York, 2001, 685–702.
10. Kelly, F.P., Voice, T. Stability of end-to-end algorithms for joint routing and
rate control. ACM SIGCOMM Comput.
Comm. Rev. 35, 2 (2005), 5–12.
11. Key, P., Massoulié, L., Towsley, D. Path
selection and multipath congestion
control. In INFOCOM07 (May 2007).
12. Key, P., Massoulié, L. Fluid models
of integrated traffic and multipath
routing. Queueing Syst. 53, 1
(June 2006), 85–98.
13. Key, P., Massoulié, L., Towsley, D.
Multipath routing, congestion control
and load balancing. In ICASSP 2007
14. Kodialam, M., Lakshman, T., Sengupta,
S. Efficient and robust routing of highly
variable traffic. In HotNets (2004).
15. Kunniyur, S., Srikant, R. End-to-end
congestion control schemes: utility
functions, random losses and ECN
marks. In INFOCOM 2000 (2000).
16. Mitzenmacher, M., Richa, A.
Sitaraman, R. The power of two
random choices: a survey of the
techniques and results. Handbook
of Randomized Computing.
P. Pardalos, S. Rajasekaran, and
J. Rolim, eds. Kluwer Academic
Publishers, Dordrecht, 2001,
17. Mo, J., Walrand, J. Fair end-to-end window based congestion
control. In SPIE 98, International
Symposium on Voice, Video and Data
18. Raiciu, C., Wischik, D., Handley, M.
Practical congestion control for
multipath transport protocols. UCL
Technical Report (2010).
19. Ramakrishnan, K., Floyd, S., Black, D.
The addition of explicit congestion
notification (ECN) to IP. Technical
Report RFC3168, IE TF (Sept. 2001).
20. Srikant, R. The Mathematics of
Internet Congestion Control.
Birkhauser, Boston, 2003.
21. Zhang-Shen, R., McKeown, N.
Designing a predictable Internet
backbone network with Valiant load-balancing. In IWQoS (June 2005).
Peter Key ( firstname.lastname@example.org),
Microsoft Research, Cambridge, UK.
Laurent Massoulié ( laurent.massoulie@
technicolor.com), Thomson Technology
Paris Laboratory, 1, Issy-les-Moulineaux-Moulineau, France.
© 2011 ACM 0001-0782/11/0100 $10.00
Don Towsley ( email@example.com),
Department of Computer Science, University
of Massachusetts, Amherst, MA.
You’ve come a long way.
Share what you’ve learned.
ACM has partnered with MentorNet, the award-winning nonprofit e-mentoring network in engineering,
science and mathematics. MentorNet’s award-winning One-on-One Mentoring Programs pair ACM
student members with mentors from industry, government, higher education, and other sectors.
• Communicate by email about career goals, course work, and many other topics.
• Spend just 20 minutes a week - and make a huge difference in a student’s life.
• Take part in a lively online community of professionals and students all over the world.
Make a difference to a student in your field.
Sign up today at: www.mentornet.net
Find out more at: www.acm.org/mentornet
MentorNet’s sponsors include 3M Foundation, ACM, Alcoa Foundation, Agilent Technologies, Amylin Pharmaceuticals, Bechtel Group Foundation, Cisco
Systems, Hewlett-Packard Company, IBM Corporation, Intel Foundation, Lockheed Martin Space Systems, National Science Foundation, Naval Research
Laboratory, NVIDIA, Sandia National Laboratories, Schlumberger, S.D. Bechtel, Jr. Foundation, Texas Instruments, and The Henry Luce Foundation.