<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=us-ascii">
<META content="MSHTML 6.00.2900.3059" name=GENERATOR></HEAD>
<BODY>
<DIV dir=ltr align=left><FONT face=Arial color=#0000ff
size=2></FONT> </DIV>
<DIV dir=ltr align=left><SPAN class=089572413-10052007><FONT face=Arial
color=#0000ff size=2>Chang Kim will present his research seminar/general exam on
Tuesday May 15 </FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=089572413-10052007><FONT face=Arial
color=#0000ff size=2>at 10AM in Room 402. The members of his committee are
Jennifer Rexford (advisor), </FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=089572413-10052007><FONT face=Arial
color=#0000ff size=2>Margaret Martonosi, and David August. Everyone is
invited to attend his talk and </FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=089572413-10052007><FONT face=Arial
color=#0000ff size=2>those faculty wishing to remain for the oral exam following
are welcome to do so.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=089572413-10052007><FONT face=Arial
color=#0000ff size=2>His abstract and reading list follow
below.</FONT></SPAN></DIV>
<DIV dir=ltr align=left><SPAN class=089572413-10052007><FONT face=Arial
color=#0000ff
size=2>----------------------------------</FONT></SPAN></DIV><BR><FONT
style="FONT-FAMILY: Arial" size=4>SEIZE: Scalable and Efficient
Zero-configuration Enterprise Architecture</FONT><BR
style="FONT-FAMILY: Arial"><SPAN
style="FONT-WEIGHT: bold; FONT-FAMILY: Arial"><BR></SPAN><FONT
style="FONT-FAMILY: Arial" size=2><FONT size=3><SPAN
style="FONT-WEIGHT: bold"><FONT size=2>Abstract</FONT><BR><FONT
size=2><BR></FONT></SPAN><FONT size=2>Most conventional enterprise or campus
networks consist of Ethernet-based IP subnets interconnected by routers.
</FONT></FONT></FONT><FONT style="FONT-FAMILY: Arial" size=2>Although each
subnet runs with minimal (or zero) configuration by virtue of Ethernet's
flat-addressing and self-learning capability, interconnecting subnets at the
IP-level introduces a significant amount of configuration and management
overhead on both end-hosts and routers. The configuration problem becomes more
serious as an enterprise network grows by merging multiple remote sites or by
supporting a large number of mobile end-hosts. Deploying enterprise-wide
Ethernet, however, cannot solve this problem because Ethernet bridging does not
scale.<BR><BR></FONT><FONT style="FONT-FAMILY: Arial" size=2>As an alternative,
we propose a scalable and efficient zero-configuration architecture (SEIZE) for
enterprise networks. SEIZE provides "plug-and-play" capability via flat
addressing and yet allows for scalability and efficiency through a combination
of shortest-path routing and hash-based location resolution. Networking nodes
perform location resolution on an on-demand basis and can cache the results to
optimize routing paths and to avoid redundant resolution as well.</FONT><FONT
style="FONT-FAMILY: Arial" size=2><BR></FONT><FONT style="FONT-FAMILY: Arial"
size=2><FONT size=2><BR>We implemented a SEIZE prototype system using a
collection of Click modular router elements and the XORP routing protocol
daemon. For evaluation, we run the system on Emulab with real enterprise traffic
traces. Our experiments show that SEIZE exhibits near-optimal path efficiency,
while limiting the number of host information entries replicated over a network
and reducing the control overhead as much as two orders of magnitude compared
with the conventional Ethernet bridging.</FONT><BR></FONT><BR><SPAN
style="FONT-WEIGHT: bold">Papers</SPAN><BR>
<OL style="FONT-FAMILY: Arial">
<LI><FONT size=2>L. Kleinrock, and F. Kamoun,<BR>"Hierarchical Routing for
Large Networks; Performance Evaluation and Optimization,"<BR>Computer Networks
vol. 1, 1977. </FONT>
<LI><FONT size=2>R. Perlman,<BR>"<A
title="An Algorithm for Distributed Computation of a 	 Spanning Tree in an Extended LAN"
href="http://www1.cs.columbia.edu/%7Eji/F02/ir02/p44-perlman.pdf"
target=blank_> An Algorithm for Distributed Computation of a Spanning Tree in
an Extended LAN</A>,"<BR>Proc. ninth Data Communications Symposium, 1985.
</FONT>
<LI><FONT size=2>D. Peleg, and E. Upfal,<BR>"<A
title="A Trade-Off between Space and Efficiency for Routing Tables"
href="http://portal.acm.org/ft_gateway.cfm?id=62217&type=pdf&coll=GUIDE&dl=GUIDE&CFID=16578858&CFTOKEN=37897046"
target=blank_> A Trade-Off between Space and Efficiency for Routing
Tables</A>,"<BR>Journal of the ACM, 1989. </FONT>
<LI><FONT size=2>T. Rodeheffer, C. Thekkath, and D. Anderson,<BR>"<A
title="SmartBridge: a scalable bridge architecture"
href="http://www.sigcomm.org/sigcomm2000/conf/paper/sigcomm2000-6-2.pdf"
target=blank_>SmartBridge: A scalable bridge architecture</A>,"<BR>Proc. ACM
SIGCOMM, 2000. </FONT>
<LI><FONT size=2>Andy Myers, T. S. Eugene Ng, and H. Zhang,<BR><A
href="http://www.cs.cmu.edu/%7Eacm/papers/myers-hotnetsIII.pdf"
target=_blank>"Rethinking the Service Model: Scaling Ethernet to a Million
Nodes</A>,"<BR>Proc. of HotNets-III, 2004. </FONT>
<LI><FONT size=2>R. Perlman,<BR>"<A
href="http://www.ieee-infocom.org/2004/Papers/26_1.PDF" target=_blank>
Rbridges: Transparent routing</A>,"<BR>Proc. of IEEE Infocom, 2004. </FONT>
<LI><FONT size=2>S. Sharma, K. Gopalan, S. Nanda, and T. Chiueh,<BR>"<A
title="Viking: A multi-spanning-tree Ethernet architecture for metropolitan area and cluster networks"
href="http://www.ieee-infocom.org/2004/Papers/47_3.PDF" target=blank_>Viking:
A multi-spanning-tree Ethernet architecture for metropolitan area and cluster
networks</A>,"<BR>Proc. of IEEE Infocom, 2004. </FONT>
<LI><FONT size=2>D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and
R. Panigrahy,<BR>"<A
title="Consistent hashing and random trees: distributed caching protocol for relieving hot spots on the World Wide Web"
href="http://www.akamai.com/dl/technical_publications/ConsistenHashingandRandomTreesDistributedCachingprotocolsforrelievingHotSpotsontheworldwideweb.pdf"
target=blank_> Consistent hashing and random trees: distributed caching
protocol for relieving hot spots on the World Wide Web</A>,"<BR>Proc. ACM
STOC, 1997. </FONT>
<LI><FONT size=2>J. Eriksson, M. Faloutsos, and S. Krishnamurthy,<BR>"<A
title="PeerNet: Pushing Peer-to-Peer Down the Stack"
href="http://iptps03.cs.berkeley.edu/final-papers/peernet.pdf"
target=blank_>PeerNet: Pushing Peer-to-Peer Down the Stack</A>,"<BR>Proc. of
International Workshop on Peer-to-Peer Systems, 2003. </FONT>
<LI><FONT size=2>D. Clark, R. Braden, A. Falk, and V. Pingali,<BR>"<A
title="FARA: reorganizing the addressing architecture"
href="http://www.isi.edu/newarch/DOCUMENTS/FARA.FDNA03.pdf"
target=blank_>FARA: Reorganizing the addressing architecture</A>,"<BR>Proc. of
ACM SIGCOMM Workshop on Future Directions in Network Architecture, 2003.
</FONT>
<LI><FONT size=2>M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan, I.
Stoica, and S. Shenker,<BR>"<A title="ROFL: Routing on Flat Labels"
href="http://project-iris.net/irisbib/papers/flatlabels:sigcomm2006/paper.pdf"
target=blank_>ROFL: Routing on Flat Labels</A>,"<BR>Proc. of ACM SIGCOMM,
2006. </FONT>
<LI><FONT size=2>M. Caesar, M. Castro, E. Nightingale, Gerg O, and A.
Rowstron,<BR>"<A
title="Virtual Ring Routing: Network Routing Inspired by DHTs,"
href="http://www.sigcomm.org/sigcomm2006/discussion/getpaper.php?paper_id=33"
target=blank_>Virtual Ring Routing: Network Routing Inspired by
DHTs</A>,"<BR>Proc. of ACM SIGCOMM, 2006. </FONT> </LI></OL>
<P style="FONT-FAMILY: Arial"><FONT size=2><SPAN
style="FONT-WEIGHT: bold">Textbooks<BR></SPAN></FONT></P>
<OL style="FONT-FAMILY: Arial">
<LI>L. Peterson, and B. Davie, <SPAN style="FONT-STYLE: italic">Computer
Networks: A Systems Approach</SPAN>, Morgan Kaufmann, 3e, 2003<BR>
<LI>R. Perlman, <SPAN style="FONT-STYLE: italic">Interconnections: Bridges,
Routers, Switches, and Internetworking Protocols</SPAN>, Addison-Wesley, 2e,
1999 </LI></OL><BR></BODY></HTML>