Yi Wang will present his research seminar/general exam
on Wednesday May 16
at 2PM in Room 402. The members of his committee
are Jennifer Rexford (advisor),
Larry Peterson, and Kai Li. 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.
----------------------------------
Morpheus: Making Routing
Programmable
Abstract:
The Border
Gateway Protocol (BGP) is used by Internet Service Providers
(ISPs) to
exchange reachability information with neighboring domains.
Internet
Service Providers (ISPs) express complex policies, affecting
everything
from business relationships with their neighbors to traffic
engineering,
scalability, and security, by configuring the BGP.
However, the
routing architecture within an ISP, coupled
with the
multi-step BGP route-selection algorithm running on the routers,
imposes
significant restrictions on the policies that can be realized in
practice.
These restrictions stand in the way of ISPs achieving policy
objectives
that are important in practice, such as enabling new services
to
customers.
We argue that
the limitations of BGP can be overcome by providing
greater
visibility into the candidate routes, a more flexible decision
process, and
support for for multipath routing and forwarding. We
present
Morpheus, a modular, open routing platform that enables
network
operators to realize many useful policies that are infeasible
today
through:
(1) flexible
composition of multiple (possibly third-party developed)
policy
modules, and
(2)
programming the route-selection algorithms.
Morpheus also
supports multipath routing, which is essential in enabling
many new
customizable routing services. Morpheus can be readily
deployed
without requiring changes in other domains.
We've
implemented an Morpheus prototype as an extension to XORP,
the
extensible open routing platform. Our evaluation of the prototype
demonstrates
that the system can scale to the large number of address
blocks and
BGP sessions present in large backbone networks. We are
currently
working on demonstrating the flexibility of the prototype in
supporting
new routing policies.
Reading
list:
Textbook:
L. Peterson
and B. Davie, Computer Networks: A Systems Approach, Morgan Haulmann, 3e,
2003
Papers:
[1] D.
Clark,
ACM SIGCOMM,
August 1988
[2] N.
Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and J. van der
Merwe,
ACM SIGCOMM
workshop on Future Directions in Network Architecture, August 2004
[3] A.
Greenberg, G. Hjalmtysson, D. Maltz, A. Meyers, J. Rexford, G. Xie, H. Yan, J.
Zhan, and H. Zhang,
ACM SIGCOMM
Computer Communications Review, October 2005
[4] M.
Handley, E. Kohler, A. Ghosh, O. Hodson, P. Radoslavov,
USENIX
Symposium on Networked Systems Design and Implementation, May 2005
[5] Matthew
Caesar, Donald Caldwell, Nick Feamster, Jennifer Rexford, Aman Shaikh, and
Jacobus van der Merwe,
USENIX
Symposium on Networked Systems Design and Implementation, May 2005
[6] B.
Raghavan and A. Snoeren,
ACM SIGCOMM,
September 2004
[7] T. V.
Lakshman, T. Nandagopal, R. Ramjee, K. Sabnani, and T. Woo,
ACM Workshop
on Hot Topics in Networks, November 2004
[8] G.
Goodell, W. Aiello, T. Griffin, J. Ioannidis, P. McDaniel, and A.
Rubin,
Symposium on
Network and Distributed System Security, February, 2003
[9] T.
Griffin, B. Shepherd, and G. Wilfong,
IEEE
Transactions on Networking, 10(2), April 2002
[10] M.
Caesar and J. Rexford,
IEEE Network
Magazine, Special Issue on Interdomain Routing, November/December
2005
[11] Hong
Yan, T. S. Eugene Ng, David Maltz, Hui Zhang, Hemant Gogineni and Zheng
Cai,
USENIX
Symposium on Networked Systems Design & Implementation, April
2007
[12] Wen Xu
and Jennifer Rexford,
ACM SIGCOMM,
September 2006