CS522: Reading Assignment and the Semester Project

1.1 reading assignment's paper list

The following papers are related to Quality of Services in the Internet, Congestion Control and Fair Queueing; Note that the papers are for course reading only. You are asked to read papers no.1, no.2, no.3, and choose any other two from the rest. Write a 1-2 page reading summary for each paper. You may search WWW for more information. However, you must use your own language to write the report. Note that the reading assignment must be completed by yourself INDIVIDUALLY.

1. C. Dovrolis and P. Ramanathan, "A Case for Relative Differentiated Services and the Proportional Differentiation Model"; IEEE Network, 13(5):26-34, September 1999; PDF. (special issue on Integrated and Differentiated Services in the Internet).

2. C. Yang and A. Reddy, "A taxonomy for congestion control algorithms in packet switching networks", IEEE Network, July/August 1995;PDF.

3. C. Dovrolis, D. Stiliadis, and P. Ramanathan, "Proportional Differentiated Services: Delay Differentiation and Packet Scheduling"; In IEEE/ACM Transactions in Networking, 10(1):12-26, February 2002; PDF.

4. C. Dovrolis and P. Ramanathan; "Proportional Differentiated Services, Part II: Loss Rate Differentiation and Packet Dropping"; In Proceedings of the 2000 International Workshop on Quality of Service (IWQoS), June 2000; PDF.

5. Matthew K. H. Leung, John C. S. Lui, David K. Y. Yau, "Adaptive Proportional Delay Differentiated Services: Characterization and Performance Evaluation," In IEEE/ACM Transactions in Networking, 9(6): 908-917, 2001; PDF.

6. X. Zhou, D. Ippoliti, and T. Boult, "Hop-count based probabilistic packet dropping: congestion mitigation with loss differentiation", In IEEE Int'l Conference on Communications (ICC), 2006; PDF.

7. D. Ippoliti and X. Zhou, "Packet scheduling with buffer management for fair bandwidth sharing and delay differentiation", In Proc. of the IEEE Int'l Conference on Computer Communications and Networks (ICCCN), 2007; PDF.

8.Floyd, S., and Jacobson, V., "Random Early Detection gateways for Congestion Avoidance", V.1, N.4, August 1993, p. 397-413; PDF.

9. Floyd, S., Ramakrishna Gummadi, and Scott Shenker, "Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management", August 2001; PDF.

10. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm", in Proc. of ACM SIGCOMM'1989, vol.19, no.4, pp.1-12, 1989; PDF.

11. K. Parekh, and Robert G., "A generalized processor sharing approach to flow control in integrated services networks: the single-node case", In IEEE/ACM Transactions in Networking, 1(3):344 - 357, 1993; PDF.

12. M. Shreedhar, G. Varghese, "Efficient Fair Queuing using Deficit Round Robin", in Proc. of ACM SIGCOMM’1995,(later in IEEE Trans. On Networking 1996), Vol.4, No.3, 1995; PDF.

13. L. Cherkasova and P. Phaal, "Session-based admission control: a mechanism for peak load management of commercial Web site", IEEE Transactions on Computers, Vol.51, No.6, June 2002; PDF.

14. S. Muppala and X. Zhou, "Coordinated Session-based Admission Control with Statistical Learning for Multi-tier Internet Applications", Proc. 18th IEEE International Conference on Computer Communications and Networks (ICCCN), 2009; PDF.

15. J. Cuo, J. Yao and L. Bhuyan, "An Efficient Packet Scheduling Algorithm in Network Processors", IEEE INFOCOM 2005; PDF.

16. G. Mainland, D. C. Parkes, and M. Welsh, "Decentralized, Adaptive Resource Allocation for Sensor Networks", USENIX NSDI 2005, PDF.

17. C. Tan, D. Chiu, J. C.S. Lui, and D. K.Y. Yau, "A Distributed Throttling Approach for Handling High Bandwidth Aggregates", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 18, NO. 7, JULY 2007; PDF.

18. C. Tang, M. Steinder, M. Spreitzer, and G. Pacifici, "A Scalable Application Placement Controller for Enterprise Data Centers", ACM WWW 2007; PDF.

19. J. Jung, B. Krishnamurthy, and M. Rabinovich, "Flash Crowds and Denial of Service Attacks: Characterization and Implications for CDNs and Web Sites", Proc. ACM WWW 2002; PDF.

20. X. Chen and J. Heidemann, "Flash Crowd Mitigation via Adaptive Admission Control Based on Application-Level Observations", ACM Transactions on Internet Technology, 5(3), 532-562, 2005; PDF.

1.2 reading assignment specifications

The questions you should answer after reading each paper include the following:

1. What is the overall purpose of the research? What are motivations for the work?

2. What are the primary research issues in the paper? What are your opinions on and reactions to the issues?

3. What are the primary contributions?

4. If you are asked to repeat some technical work by simulation or implementation, what are the major problems/difficulties/issues?

5. Any other thoughts or ideas you may bring up.

All reading reports should be turned in the hardcopy in an envelope.

2. Semester Project and Presentation

A team consists of two person. If you want to do it by your own, you need the approval from the instructor in advance.

Part 1: a queueing model.

See description and an associated Trace ZIP file.

Part 2: simulation or implementation with evaluation of the technical approach.

You need to simulate and evaluate the PDD algorithms: WTP and PAD, which are described in paper no.3 (C. Dovrolis, D. Stiliadis, and P. Ramanathan). The purpose is to get the key idea and validate the experimental data in the corresponding paper.

What to turn in:

For this part you should write a technical report specifying the simulation/implementation scheme, major data structures, performance evaluations (in figures), comparisons with the results in the paper 3, and the running problem(s) of the code, if any. You also need to specify the workload partition between you and your teammate (if applicable). Email me the report with the source code and all files of the simulator in a SINGLE ZIP FILE. Submit the report in the hardcopy in the class at the due time. If there is any question, please contact me.

Note that your project is not limited to the paper/scope above. You can come up with your own proposal, for example, from the papers you read. But you need to contact me for approval in advance (the proposed work may NOT be already used for other class). You may come up with your own idea that is close to the topic and is deemed worthy of being a project.

Part 3: Presentation

After read the papers, you and your teammate pick up ONE favorite from papers no.4 to no.18 (if not already picked by others). See below for the available papers. Request first will get the first pick. Due to the large enrollment in this semester, only one presentation PER group. Email me your selection the early the better. Topics will be assigned in FCFS order (so pick your favorite soon). You and your teammate (if applicable) will give the presentation of the paper. The papers surely have different levels of technical depth and scale. I will consider the workload and technical challenge depth in the grading. Each presentation may take about 18 minutes (with PowerPoint slides), which will take place in the last 3~4 classes in the semester.

Current Presentation Selections

Email me your selection the early the better. You will also have the priority to specify your favorite presentation time slots in the last classes (dates pending). You need to email me the Power Point slides of your talk two days before your presentation time, see below. Each presentation takes about 20~25 minutes.