CS 655 Readings
The following is a tentative list of additional readings from classical networking literature.
J. Saltzer, D. Reed, and D. Clark. End-to-end Arguments in System Design. ACM Transactions on Computer Systems, Vol. 2, Issue 4, Nov. 1984.
D. Clark. The Design Philosophy of the DARPA Internet Protocols. ACM SIGCOMM 1988.
D. Qiu and R. Srikant. Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks. ACM SIGCOMM, 2004.
A. Legout, N. Liogkas, E. Kohler, and L. Zhang. Clustering and Sharing Incentives in BitTorrent Systems. ACM SIGMETRICS, 2007.
V. Jacobson and M. Karels. Congestion Avoidance and Control. ACM SIGCOMM 1988.
D. Chiu and R. Jain. Analysis of the Increase/Decrease Algorithms for Congestion Avoidance in Computer Networks. Journal of Computer Networks and ISDN, vol. 17, no. 1, pp. 1-14, 1989.
C. Cheng et al. A Loop-free Extended Bellman-Ford Routing Protocol without Bouncing Effect. ACM SIGCOMM 1989.
T. Griffin and G. Wilfong. An Analysis of BGP Convergence Properties. ACM SIGCOMM 1999.
V. Paxson and S. Floyd. Why We Don’t Know How to Simulate the Internet. In Proceedings of the Winter Simulation Conference, December 1997.
ADDITIONAL NOTES ON SIMULATION AND CONFIDENCE INTERVALS
Discrete-Event Simulation (skip Section 7).
Confidence Intervals, Finite Mathematics 2e.