[talks] C Kim general exam

[Melissa M Lawson]

Chang Kim will present his research seminar/general exam on Tuesday May 15 
at 10AM in Room 402.  The members of his committee are Jennifer Rexford (advisor), 
Margaret Martonosi, and David August.  Everyone is invited to attend his talk and 
those faculty wishing to remain for the oral exam following are welcome to do so.
His abstract and reading list follow below.
----------------------------------

SEIZE: Scalable and Efficient Zero-configuration Enterprise Architecture

Abstract

Most conventional enterprise or campus networks consist of Ethernet-based IP subnets
interconnected by routers. 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.

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.

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.

Papers


1.	L. Kleinrock, and F. Kamoun,
"Hierarchical Routing for Large Networks; Performance Evaluation and Optimization,"
Computer Networks vol. 1, 1977. 

2.	R. Perlman,
" An Algorithm for Distributed Computation of a Spanning Tree in
<http://www1.cs.columbia.edu/%7Eji/F02/ir02/p44-perlman.pdf> an Extended LAN,"
Proc. ninth Data Communications Symposium, 1985. 

3.	D. Peleg, and E. Upfal,
" A Trade-Off between Space and Efficiency for Routing
<http://portal.acm.org/ft_gateway.cfm?id=62217&type=pdf&coll=GUIDE&dl=GUIDE&CFID=16578858&
CFTOKEN=37897046> Tables,"
Journal of the ACM, 1989. 

4.	T. Rodeheffer, C. Thekkath, and D. Anderson,
"SmartBridge: A scalable bridge architecture
<http://www.sigcomm.org/sigcomm2000/conf/paper/sigcomm2000-6-2.pdf> ,"
Proc. ACM SIGCOMM, 2000. 

5.	Andy Myers, T. S. Eugene Ng, and H. Zhang,
"Rethinking the Service Model: Scaling Ethernet to a Million
<http://www.cs.cmu.edu/%7Eacm/papers/myers-hotnetsIII.pdf> Nodes,"
Proc. of HotNets-III, 2004. 

6.	R. Perlman,
"  <http://www.ieee-infocom.org/2004/Papers/26_1.PDF> Rbridges: Transparent routing,"
Proc. of IEEE Infocom, 2004. 

7.	S. Sharma, K. Gopalan, S. Nanda, and T. Chiueh,
"Viking:  <http://www.ieee-infocom.org/2004/Papers/47_3.PDF> A multi-spanning-tree
Ethernet architecture for metropolitan area and cluster networks,"
Proc. of IEEE Infocom, 2004. 

8.	D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy,
" Consistent hashing and random trees: distributed caching
<http://www.akamai.com/dl/technical_publications/ConsistenHashingandRandomTreesDistributed
CachingprotocolsforrelievingHotSpotsontheworldwideweb.pdf> protocol for relieving hot
spots on the World Wide Web,"
Proc. ACM STOC, 1997. 

9.	J. Eriksson, M. Faloutsos, and S. Krishnamurthy,
"PeerNet: Pushing Peer-to-Peer Down the Stack
<http://iptps03.cs.berkeley.edu/final-papers/peernet.pdf> ,"
Proc. of International Workshop on Peer-to-Peer Systems, 2003. 

10.	D. Clark, R. Braden, A. Falk, and V. Pingali,
"FARA: Reorganizing the addressing architecture
<http://www.isi.edu/newarch/DOCUMENTS/FARA.FDNA03.pdf> ,"
Proc. of ACM SIGCOMM Workshop on Future Directions in Network Architecture, 2003. 

11.	M. Caesar, T. Condie, J. Kannan, K. Lakshminarayanan, I. Stoica, and S. Shenker,
"ROFL: Routing on Flat Labels
<http://project-iris.net/irisbib/papers/flatlabels:sigcomm2006/paper.pdf> ,"
Proc. of ACM SIGCOMM, 2006. 

12.	M. Caesar, M. Castro, E. Nightingale, Gerg O, and A. Rowstron,
"Virtual Ring Routing: Network Routing Inspired by
<http://www.sigcomm.org/sigcomm2006/discussion/getpaper.php?paper_id=33> DHTs,"
Proc. of ACM SIGCOMM, 2006.   

Textbooks


1.	L. Peterson, and B. Davie, Computer Networks: A Systems Approach, Morgan Kaufmann,
3e, 2003


2.	R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking
Protocols, Addison-Wesley, 2e, 1999 


-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.cs.princeton.edu/pipermail/talks/attachments/20070510/bfe3460f/attachment.htm