Bradley R. Smith, PhD
Computer Engineering Department
Jack Baskin School of Engineering
University of California, Santa Cruz
Santa Cruz, CA 95064
4/26/2015: The Santa Cruz Warriors... D-League Champions!
1/4/2014: Another interesting graphic showing how people respond to Pew surveyors general first question of how their day is going, organized by country. General trend is the richer the country the more negative the response... except the US. Not sure what this means... but is interesting). (From a Washington Post article, covers ~48,000 responses from the past year.)
12/18/11: Interesting graphic on the relative allocation of resources to R&D by different countries... is good to know that, even though the California is squandering its strength in creating the future, the nation is still in a leadership position (although this is only a snapshot... would be interesting to have a sense of national trends).
These articles from the Los Angeles Times (9/4/09) and the New York Times (11/19/09) that give a good perspective on the plight of higher education in California.
8/12/09: here's an article that illustrates very clearly how the wolves are circling the wounded UC system. The residents of California should be very clear how the current governor and legislature are presiding over the dismantling of the greatest public research university the world has known, and the source of innovation driving the California economy.
6/16/09: here's a very good summary of the state budget situation from the Mercury News. Here is the original article (with a link to an interactive version of the graphic).
This homepage provides information about my:
My research interests, in general, are in distributed systems and computer communications. Currently, my specific interests are in the areas of policy-based routing, formalizing trust in the context of a routing computation, object routing, and the application of these technologies to the improvement of the security and robustness of Internet-based systems.
The current Internet can be characterized as realizing a cloud model of topology control due to its dependence on a pre-computed, distributed route computation (i.e. no single router computes a complete path through an internet), and hop-by-hop forwarding where forwarding decisions are made independently at each router in a path through the network. In contrast, recent proposals for the control of Internet topology computation realize a string model of topology control due to their dependence on on-demand, centralized route computations performed at the ingress router, and virtual-circuit style, source-specified forwarding implemented by source routing or some form of path setup.
There are a number of benefits of the cloud model compared with the string model. The cloud model is more robust in the sense that, since control of state in a cloud is distributed with the state itself (e.g. packet forwarding state is controlled by a co-located routing process), the loss of any component of the network only results in the loss of functionality at that node. I.e. the distributed nature of clouds tends to localize the affects of failures in a network. The cloud model is more responsive and efficient in that, due to the autonomous control of network state, it only requires simplex communication of events in an internet to adapt to changes. For example, in the event of a link cost change in an internet, routers only need to be notified of the event (to change their local forwarding state, if necessary), and do not need to engage in any further communication to coordinate their response to the event.
The goal of my PhD work was to enhance the Internet's current
distributed, hop-by-hop routing architecture to support a default
multi-policy forwarding model as compared with the
traditional default single-policy forwarding model. The
concrete implication of this change in assumptions is that the
dramatic jump in expected policy-route request rates makes the costs
of on-demand, string-style policy-based routing unacceptable. This
change requires efficient mechanisms for computing and implementing
policy-constrained topologies. Therefore, the focus of my
dissertation was the design and analysis of new policy-based routing
algorithms, and the application of these algorithms to the security
and manageability of unicast and multicast services.
Christopher Wilks et al. "The Cancer Genomics Hub (CGHub): overcoming cancer through the power of torrential data", Database. 2014.
Bradley R. Smith and Lincoln Thurlow. "Practical Multipath Load Balancing with QoS", Proceedings International Conference on Computing, Networking and Communications. January, 2013.
Bradley R. Smith. "Using Dijkstra to Compute Hop-by-Hop QoS Paths" Proceedings 1st Workshop on Context-aware QoS Provisioning and Management for Emerging Networks, Applications and Services (ContextQoS), 20th International Conference on Computer Communication Networks (ICCCN '11). August, 2011.
Stephen Dabideen, Bradley R. Smith, and J.J. Garcia-Luna-Aceves. "An End-to-End Approach to Secure Routing in MANETs" Security and Communication Networks, Wiley. Vol. 3, Issue 2-3, pp. 130-149, March-June 2010.
Stephen Dabideen, Bradley R. Smith and J.J. Garcia-Luna-Aceves. "An End-to-End Solution for Secure and Survivable Routing in MANET(s)," 7th International Workshop on the Design of Reliable Commuication Networks (DRCN 2009), Washington D.C. October, 2009.
Stephen Dabideen, Bradley R. Smith and J.J. Garcia-Luna-Aceves. "The Case for End-to-End Solutions to Secure Routing in MANETs," International Workshop on Security, Privacy and Trust of Computer and Cyber-Physical Networks (SecureCPN); 18th International Conference on Computer Communication and Networks (ICCCN '09), San Francisco, CA. August, 2009.
Bradley R. Smith and J.J. Garcia-Luna-Aceves. "Best Effort Quality-of-Service," 17th International Confereonce on Computer Communications and Networks (ICCCN '08), St Thomas, U.S. Virgin Islands. August, 2008.
Bradley R. Smith and J.J. Garcia-Luna-Aceves. "Efficient Policy-Based Routing Without Virtual Circuits," First International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE '04), Dallas, Texas. October, 2004.
Bradley R. Smith and J.J. Garcia-Luna-Aceves. "Policy-Aware Connectionless Routing," First International Workshop on QoS Routing (WQoSR '04), Barcelona, Spain. October, 2004.
Bradley R. Smith, "Efficient Policy-Based Routing in the Internet"(PDF), PhD Dissertation, Computer Science, University of California, Santa Cruz, CA 95064. September, 2003.
G. Denker, J.J. Garcia-Luna-Aceves, J. Meseguer, P.C. Olveczky, J. Raju, B. Smith, and C.L. Talcott, "Specification and Analysis of a Reliable Broadcasting Protocol in Maude", Proc. 37th Allerton Conference on Communications, Control, and Computing, Sept. 22-24, 1999.
Bradley R. Smith and J.J. Garcia-Luna-Aceves, "Efficient Security Mechanisms for the Border Gateway Routing Protocol" (PDF), Computer Communications (Elsevier), Vol. 21, No. 3, 1998, pp. 203-210.
Bradley R. Smith,
"Securing Distance Vector Routing Protocols"
M.S. Thesis, Computer Science, University of California, Santa Cruz,
CA 95064, June 1997.
Bradley R. Smith, Shree Murthy, and J.J. Garcia-Luna-Aceves, "Securing Distance Vector Routing Protocols" (PDF), Proc. Internet Society Symposium on Network and Distributed System Security, San Diego, California, February 1997.
Bradley R. Smith and J.J. Garcia-Luna-Aceves,
"Securing the Border Gateway Routing Protocol"
Proc. Global Internet '96, London, UK, 20-21 November 1996.
US 7,725,596: J.J. Garcia-Luna-Aceves and B. Smith, "System and Method for Resolving Network Layer Anycast Addresses to Network Layer Unicast Addresses" (May 25, 2010)
US 7,577,754: J.J. Garcia-Luna-Aceves and B. Smith, "System and Method for Controlling Access to Content Carried in A Caching Architecture" (August 18, 2009)
US 7,565,450: J.J. Garcia-Luna-Aceves and B. Smith, "System and Method for Using a Mapping between Client Addresses and Addresses of Caches To Support Content Delivery" (July 21, 2009)
US 7,552,233: J. Raju, J.J. Garcia-Luna-Aceves and B. Smith, "System and method for information object routing in computer networks" (June 23, 2009)
J.J. Garcia-Luna-Aceves and B. Smith, "System and Method for Using Uniform
Resource Locators to Map Application Layer Content Names to Network Layer
Anycast Addresses" (March, 2008)
interesting article by Jason Hong in the CACM giving advice on how to succeed
in PhD work. In it he referenced what he call's Heilmeier's Catechism, which
is a set of questions credited to
that anyone proposing a research project or product development effort should
be able to answer. Here are the questions:
"Do not judge me by my successes, judge me by how many times I fell down and got back up again." - Nelson Mandela
"I have learned that success is to be measured not so much by the position that one has reached in life as by the obstacles which he has overcome while trying to succeed." - Booker T. Washington
"Calamity is the touchstone of a brave mind." - Lucius Annaeus Seneca
"It is not the critic who counts: not the man who points out how the strong man stumbles or where the doer of deeds could have done better. The credit belongs to the man who is actually in the arena, whose face is marred by dust and sweat and blood, who strives valiantly, who errs and comes up short again and again, because there is no effort without error or shortcoming, but who knows the great enthusiasms, the great devotions, who spends himself for a worthy cause; who, at the best, knows, in the end, the triumph of high achievement, and who, at the worst, if he fails, at least he fails while daring greatly, so that his place shall never be with those cold and timid souls who knew neither victory nor defeat."
- President Theodore Roosevelt, from a speech titled "Citizenship in a Republic" given at the Sorbonne, April 1910
The OODA Loop: Observe, Orient, Decide, Act - USAF Colonel John Boyd
Whether you believe you can or you can't, you're right.
I've seen things you people wouldn't believe...
Never attribute to malice that which is adequately explained by stupidity (Hanlon's Razor).