Publications

Export 7148 results:
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
F
Feamster N, Balakrishnan H, Rexford J, Shaikh A, van der Merwe J.  2004.  The case for separating routing from routers. Proceedings of the ACM SIGCOMM workshop on Future directions in network architecture. :5-12.
Feamster N, Voellmy A, Agarwal A, Hudak P, Burnett S, Launchbury J.  2010.  Don't Configure the Network, Program It! Domain-Specific Programming Languages for Network Systems. YALEU/DCS/RR-1432
Feamster N, Dingledine R.  2004.  Location diversity in anonymity networks. Proceedings of the 2004 ACM workshop on Privacy in the electronic society. :66-76.
Feamster N, Motiwala M, Vempala S.  2007.  Path splicing with network slicing. Proc. ACM SIGCOMM Hot-Nets.
Feamster N, Balakrishnan H.  2003.  Towards a logic for wide-area Internet routing. SIGCOMM Comput. Commun. Rev.. 33(4):289-300.
Feamster N, Johari R, Balakrishnan H.  2005.  Implications of autonomy for the expressiveness of policy routing. Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications. :25-36.
Feamster N, Mao Z M, Rexford J.  2004.  BorderGuard: detecting cold potatoes from peers. Proceedings of the 4th ACM SIGCOMM conference on Internet measurement. :213-218.
Feamster N, Balakrishnan H.  2002.  Packet loss recovery for streaming video. 12th International Packet Video Workshop.
Feamster N, Rexford J.  2004.  Modeling BGP route selection within an AS. IEEE/ACM Transactions on Networking.
Feamster N, Hassan U, Sundaresan S, Valancius V, Johari R, Vazirani V.  2009.  Towards an Internet Connectivity Market. GT-CS-09-01
Feamster N, Balakrishnan H.  2005.  Detecting BGP configuration faults with static analysis. Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2. :43-56.
Feamster N, Rexford J.  2002.  Network-wide BGP route prediction for traffic engineering. Proceedings of ITCOM.
Feamster N, Borkenhagen J, Rexford J.  2003.  Techniques for interdomain traffic engineering. Computer Communications Review. 33(5)
Feamster N, Balakrishnan H, Rexford J.  2004.  Some foundational problems in interdomain routing. Proceedings of Third Workshop on Hot Topics in Networks (HotNets-III).
Feamster N, Gray AG, Krasser S, Syed NA.  2008.  SNARE: Spatio-temporal Network-level Automatic Reputation Engine. GT-CSE-08-02
Feamster N, Winick J, Rexford J.  2004.  A model of BGP routing for network engineering. SIGMETRICS Perform. Eval. Rev.. 32(1):331-342.
Feamster N, Gao L, Rexford J.  2007.  How to lease the internet in your spare time. SIGCOMM Comput. Commun. Rev.. 37(1):61-64.
Feamster N.  2010.  Outsourcing home network security. Proceedings of the 2010 ACM SIGCOMM workshop on Home networks. :37-42.
Feamster N, Andersen DG, Balakrishnan H, Kaashoek FM.  2003.  Measuring the effects of internet path faults on reactive routing. SIGMETRICS Perform. Eval. Rev.. 31(1):126-137.
Fedder GK, Blanton S, Carley LR, Gupta SK, Koester D.  2001.  Integrated Microelectromechanical System (MEMS) Inertial Measurement Unit (IMIMU).
Fei Wu P, Qu Y, Fleischmann K, Golbeck J, Jaeger P, Preece J, Shneiderman B.  2008.  Designing community-based emergency communication system: A preliminary study. Proceedings of the American Society for Information Science and Technology. 45(1):1-3.
Feige U, Halldórsson MM, Kortsarz G, Srinivasan A.  2003.  Approximating the domatic number. SIAM Journal on Computing. 32(1):172-195.
Fekete J-D, Plaisant C.  2004.  Les leçons tirées des deux compétitions de visualisation d'information. Proceedings of the 16th conference on Association Francophone d'Interaction Homme-Machine. :7-12.
Fekete JD, Wang D, Dang N, Aris A, Plaisant C.  2003.  Overlaying graph links on treemaps. IEEE Symposium on Information Visualization Conference Compendium (demonstration).
Fekete J-D, Plaisant C.  1999.  Excentric labeling: dynamic neighborhood labeling for data visualization. Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit. :512-519.

Pages