> For the complete documentation index, see [llms.txt](https://sliu583.gitbook.io/blog/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://sliu583.gitbook.io/blog/networking/index/cs-268-adv-network.md).

# CS 268 (Adv Network)

## How to read a paper 

### Reading paper 

* Sylvia's advice: do not overthink it, just read it from start to end in depth 
* <mark style="background-color:red;">Phase 1: Understanding</mark> --> Questions to answer&#x20;
  * What problems are they solving?&#x20;
    * In 1-2 sentences&#x20;
  * Replay their motivating arguments&#x20;
    * Do they make sense
  * Replay how their solution works for a simple example&#x20;
    * Can you? If not, go back to step 1&#x20;
* <mark style="background-color:red;">Phase 2: Critiquing</mark>&#x20;
  * Is the problem important? ambitious? hard? having a long-shelf-life?&#x20;
  * Is the solution effective? Under what conditions does it break?
  * What other approaches are possible?&#x20;

### Reviewing paper&#x20;

* Review is not a summary&#x20;
* A typical format of the review&#x20;
  * <mark style="background-color:red;">What is the problem being addressed?</mark> &#x20;
  * <mark style="background-color:red;">Do you believe that the problem is / was important?</mark>&#x20;
    * <mark style="background-color:red;">Explain your thinking</mark>
    * <mark style="background-color:red;">Consider context</mark>&#x20;
  * <mark style="background-color:red;">What is the solution's main insight (nugget)?</mark>&#x20;
  * <mark style="background-color:red;">Do you think the solution is a good one? (strengths and weakness) --> explain</mark>&#x20;
  * <mark style="background-color:red;">Did you enjoy the paper?</mark>&#x20;

## Reading list&#x20;

### Intro and course overview

[Robert E. Kahn and Vinton Cerf 2004 ACM A.M. Turing Award Lecture ](https://www.youtube.com/watch?v=JLAfLWE76fE)

### Internet Architecture&#x20;

* [Clark](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//darpa-internet.pdf)
* [E2E](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//saltzer-e2e.pdf)
* [Active Nets](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//active.pdf)

### Beyond best-effort / Unicast&#x20;

* [Multicast](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers/cbt.pdf)
* [QoS](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//rfc1633.pdf)
* Background reading
  * [Deering](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//Deering88.pdf)
* Advanced Reading
  * [JustWorks](http://www.cs.ucl.ac.uk/staff/m.handley/papers/only-just-works.pdf)

### Congestion Control&#x20;

* [VanCC](http://web.mit.edu/6.829/www/2020/papers/vanjacobson-congavoid.pdf)
* [XCP](https://web.mit.edu/6.829/www/currentsemester/papers/xcp.pdf) Sections 1-3

### Datacenter Networking&#x20;

* [Fat-Tree](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//al-fares-sigcomm08.pdf)
* [Jellyfish](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//jellyfish-nsdi12.pdf)

### SDN: context&#x20;

* [4D](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers/4D-ccr05.pdf), [OF](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers/openflow.pdf), [video1](https://www.youtube.com/watch?v=c9-K5O_qYgA), [video2](https://www.youtube.com/watch?v=YHeyuD89n1Y)
* [Road](https://www.sigcomm.org/sites/default/files/ccr/papers/2014/April/0000000-0000012.pdf)

### SDN: practice&#x20;

* [B4](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//b4.pdf)
* [ONIX](https://people.eecs.berkeley.edu/~sylvia/cs268-2013/papers//onix.pdf)

### BGP

* [Labovitz, SIGCOMM’10](https://dl.acm.org/doi/10.1145/1851182.1851194)
* [RCP](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//rcp-fdna.pdf)

### BGP Security&#x20;

### Programmable Networks&#x20;

* [RMT](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//rmt.pdf) Sections 1-3
* [Netcache](https://www.cs.cornell.edu/~jnfoster/papers/netcache.pdf)

### Datacenter Congestion Control&#x20;

### WAN Congestion Control&#x20;

### P2P Networking&#x20;

* [Chord](https://pdos.csail.mit.edu/papers/chord:sigcomm01/chord_sigcomm.pdf)
* [deWeb](https://dl.acm.org/doi/10.1145/3544216.3544232)

### Net sw&#x20;

* [Click](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//click.pdf)
* [mTCP](https://www.usenix.org/system/files/conference/nsdi14/nsdi14-paper-jeong.pdf)

### NFV&#x20;

* [Aplomb](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers/aplomb.pdf)
* [PIX](https://www.usenix.org/system/files/nsdi22-paper-iyer.pdf)

### Disaggregation&#x20;

* [Net-Req](https://www.usenix.org/system/files/conference/osdi16/osdi16-gao.pdf)
* [MIND](https://dl.acm.org/doi/pdf/10.1145/3477132.3483561)

### Low latency&#x20;

* [cISP](https://www.usenix.org/system/files/nsdi22-paper-bhattacherjee.pdf)
* [Acquila](https://www.usenix.org/system/files/nsdi22-paper-gibson.pdf)

### Verification&#x20;

* [HSA](https://people.eecs.berkeley.edu/~sylvia/cs268-2019/papers//hsa.pdf)
* [Minesweeper](https://ratul.org/papers/sigcomm2017-minesweeper.pdf)

<br>