<html><head><style type='text/css'>p { margin: 0; }</style></head><body><div style='font-family: arial,helvetica,sans-serif; font-size: 10pt; color: #000000'>Nanxi Kang will present her research seminar/general exam on Friday May 3 <br>at Noon in Room 301 (note room!). The members of her committee are: <br>Jennifer Rexford (advisor), David Walker, and Vivek Pai. Everyone is invited<br>to attend her talk and those faculty wishing to remain for the oral exam <br>following are welcome to do so. Her abstract and reading list follow below.<br><br><hr id="zwchr"><div style="color:#000;font-weight:normal;font-style:normal;text-decoration:none;font-family:Helvetica,Arial,sans-serif;font-size:12pt;"><div dir="ltr"><div style="">Abstract </div><div style=""><br></div><div><div>Software Defined Networking (SDN) supports diverse</div><div>network policies by offering direct, network-wide control</div>
<div>over how the switches handle traffic. However, today’s controller</div><div>platforms force applications to grapple with the space</div><div>limits on each switch and the interaction between the packet-handling</div>
<div>rules at different hops in a path. Instead, we believe</div><div>SDN applications should specify high-level policies,</div><div>and rely on the controller to generate the rules for each switch.</div><div>A high-level policy defines the handling of traffic on a single</div>
<div>abstract switch (indicating how packets should be modified,</div><div>and dropped or forwarded to egress ports), as well as the</div><div>routing of traffic across the “switching fabric.” Transforming</div><div>the high-level policy into an equivalent set of switch-level</div>
<div>rules is computationally difficult, since the policy may</div><div>route traffic on arbitrary paths and match traffic on multiple</div><div>dimensions of packet-header fields. We present a family</div><div>of efficient rule-placement algorithms, starting with the simple</div>
<div>case of policies matching one packet-header field along</div><div>a chain, and building up to the general case which involves</div><div>arbitrary routing, multi-dimensional patterns and the need</div><div>to enable dynamic, incremental update of policies. Our experiments</div>
<div>with synthetic benchmarks, and real firewall and</div><div>routing policies, demonstrate that our algorithms can support</div><div>realistic policies using the small rule tables available in</div><div>commodity switches.</div>
<div><br></div><div>----------------------------------</div><div><br></div><div>Reading List</div><div><br></div><div>[1] L. L. Peterson and B. S. Davie, Computer networks: a systems approach. Morgan Kaufmann, 2007.</div>
<div><br></div><div>[2] J. H. Saltzer, D. P. Reed, and D. D. Clark, “End-to-end arguments in system design,” ACM Transactions on Computer Systems (TOCS), vol. 2, no. 4, 1984.</div><div><br></div><div>[3] M. Casado, M. J. Freedman, J. Pettit, J. Luo, N. Gude, N. McKeown, and S. Shenker, “Rethinking enterprise network control,” IEEE/ACM Trans. Networking, vol. 17, August 2009.</div>
<div><br></div><div>[4] N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, “OpenFlow: Enabling innovation in campus networks,” SIGCOMM Computer Communications Review, vol. 38, no. 2, 2008.</div>
<div><br></div><div>[5]C. Monsanto, J. Reich, N. Foster, J. Rexford, and D. Walker, "Composing software dened networks," in NSDI, Apr 2013.</div><div><br></div><div>[6] M. Yu, J. Rexford, M. J. Freedman, and J. Wang, "Scalable flow-based networking with DIFANE," In ACM SIGCOMM, pp. 351-362, Sep 2010.</div>
<div><br></div><div>[7] M. Moshref, M. Yu, A. Sharma, and R. Govindan, "VCRIB: Virtualized rule management in the cloud," in NSDI, Apr 2013.</div><div><br></div><div>[8] Y. Kanizo, D. Hay, and I. Keslassy, "Palette: Distributing tables in software-dened networks," in IEEE INFOCOM Mini-conference, Apr 2013.</div>
<div><br></div><div>[9] C. R. Meiners, A. X. Liu, and E. Torng, "TCAM Razor: A systematic approach towards minimizing packet classiers in TCAMs," IEEE/ACM Trans. Netw., vol. 18, pp. 490-500, Apr 2010.</div><div>
<br></div><div>[10] P. Gupta and N. McKeown, "Packet classication on multiple fields," in ACM SIGCOMM, pp. 147-160, 1999.</div><div><br></div><div>[11] S. Singh, F. Baboescu, G. Varghese, and J. Wang, "Packet classication using multidimensional cutting," in ACM SIGCOMM, pp. 213-224, 2003.</div>
<div><br></div><div>[12] Y. Ma and S. Banerjee, "A smart pre-classier to reduce power consumption of tcams for multi-dimensional packet classication," in ACM SIGCOMM, pp. 335-346, Aug 2012.</div></div></div><div class="gmail_extra">
<div class="gmail_quote"><div><div style="font-size:10pt;font-family:arial,helvetica,sans-serif"><br></div></div></div><br></div>
</div><br></div></body></html>