UCL
>>
Computer Science dept
>>
Networks research group
>>
Damon Wischik
>> Talks
Talks etc.
What mathematicians should know about the Internet: a case study.
Heriot-Watt, 20 June 2011.
Workshop for F.P.Kelly, Eurandom, 29 April 2011.
Congestion control for multipath TCP: design, and application to data centers.
Cisco, 27 May 2011.
The teleology of Internet congestion control.
CoMPLEX, UCL, 10 December 2010.
Poolability.
Cambridge, 2 July 2010.
Tutorial: queueing theory for switched networks
ICMS workshop on stochastic processes in communication networks, for young researchers, 7–11 June 2010, Edinburgh
Resource pooling with multipath TCP.
EU, 11 March 2010; Turin, May 2010
Restless bandits and congestion control.
Newton Institute, Cambridge, 14 January 2010.
MAC3
.
Newton Institute, Cambridge, 14 January 2010.
Multipath TCP.
NetCOOP, 25 November 2009.
Queueing theory and Internet congestion control.
NUS, 9 November 2009.
MSR Asia, 13 November 2009.
The teleology of the Internet.
Leys School, Cambridge, 24 September 2009.
Scaling behaviour in switched networks.
15th INFORMS Applied Probability Society Conference
, 14 July 2009, Cornell.
The teleology of switched networks.
Stochastic Networks Workshop
, 9 June 2009, Cambridge.
Resource pooling, as a design principle for the Internet.
Stochastic Networks Workshop
, 9 June 2009, Cambridge.
Resource pooling with multipath TCP.
Trilogy project, 4 June 2009.
Complexity theory for distributed algorithms on crummy networks.
UCL networks seminar, 29 May 2009.
Allocation of bandwidth by TCP.
Wolfram Demonstrations Project, 18 Feb 2009.
The virtual economy of P2P.
Sky meeting, UCL, 28 November 2008.
Models of multipath resource allocation.
Trilogy project meeting, UCL, 9 April 2008.
BT, 18 June 2008.
Short messages: complexity theory for distributed algorithms.
Royal Society workshop on networks: modelling and control, 24 September 2007.
Queueing in switched networks.
LMS, 17 September 2007.
Optimal scheduling algorithms for input-queued switches.
IEEE Infocom 2006, 26 April.
Network teleology.
UCL Computer Science networks seminar, 25 May 2005.
Queueing theory for TCP.
Stochastic Networks Conference 2006.
Hamilton Institute workshop on congestion control 2005.
Stanford Operations Research Colloquium 2005.
et al.
New designs for Internet congestion control.
Oxford Physics Colloquium, Friday 18 February 2005.
Imperial College department of computing, Tuesday 24 May 2005.
Lighthill Institute, Wednesday 6 July 2005.
LSE, Thursday 30 November 2006.
The calculus of Hurstiness.
Mathematics of Networks, 2 July 2004, BT Adastral Park.
Input-queued switches in heavy traffic.
Stochastic Networks seminar, Stanford, 2002.
Issues in modelling optical networks.
Stochastic Networks seminar, Stanford, 2001.
The capacity of a burst-switched network.
Rank Prize Fund mini-symposium on Terabit Optical Networks, 2001.
The history of `probability'.
Stanford EE/CS network group meeting, 2000.
Moderate deviations in queueing theory.
Conference on Stochastic Processes and their Applications, Cambridge, 2001 and others.
Large deviations and Internet congestion.
Bell Labs, 2000.
Sample path large deviations for networks of queues with many traffic flows.
Eurandom, 1999
and
Stanford probability seminar, 1999.
Fair charges for Internet congestion.
Stanford Graduate School of Business, 1999.
Pricing the Internet.
AT&T Labs--Research, 1998.
Admission control for booking ahead shared resources.
Stochastic Networks seminar, Cambridge, 1996.