Publications

Export 7148 results:
[ Author(Desc)] Title Type Year
Filters: Filter is   [Clear All Filters]
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, 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, 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, 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, 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.
Feamster N, Balakrishnan H.  2003.  Towards a logic for wide-area Internet routing. SIGCOMM Comput. Commun. Rev.. 33(4):289-300.
Feamster N, Balazinska M, Wang W, Balakrishnan H, Karger D.  2003.  Defeating Web censorship with untrusted messenger discovery. Workshop on Privacy Enhancing Technologies.
Feamster N.  2008.  Fighting spam, phishing, and online scams at the network level. Proceedings of the 4th Asian Conference on Internet Engineering. :39-40.
Feamster N, Balazinska M, Harfst G, Balakrishnan H, Karger D.  2002.  Infranet: Circumventing web censorship and surveillance. Proceedings of the 11th USENIX Security Symposium. :247-262.
Feamster N, Nayak A, Kim H, Clark R, Mundada Y, Ramachandran A, bin Tariq M.  2010.  Decoupling policy from configuration in campus and enterprise networks. Local and Metropolitan Area Networks (LANMAN), 2010 17th IEEE Workshop on. :1-6.
Feamster N, Wee S.  1999.  An MPEG-2 to H. 263 transcoder. SPIE Voice, Video, and Data Communications Conference.
Feamster N, Jung J, Balakrishnan H.  2005.  An empirical study of "bogon" route advertisements. SIGCOMM Comput. Commun. Rev.. 35(1):63-70.
Feamster N.  2010.  Outsourcing home network security. Proceedings of the 2010 ACM SIGCOMM workshop on Home networks. :37-42.
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.  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.
Fekete J-D, Plaisant C.  2002.  Interactive information visualization of a million items. Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on. :117-124.
Fekete SP, Khuller S, Klemmstein M, Raghavachari B, Young N.  1997.  A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. Journal of Algorithms. 24(2):310-324.

Pages