Network
Routing - Papers List
I expect every person to do at least one presentations.
Choices are on a first come
first served basis.
Send me an email to reserve a paper for presentation.
Presentation MUST follow these guidelines.
Presentations must be 17 minutes in length.
Everybody must read the papers however, and participate in the
discussions.
NEW
RULE: The presentation slides have
to be created exclusively by you, after reading the paper.
You
should not copy slides from
existing presentations.
Papers to be presented by index:
May 3:
May 5:
A.1. MRAI: Ali
A.3: BGP-lens: patterns and anomalies in internet routing
updates. Jarod
A.2. The Temporal and Topological Characteristics
of BGP Path Changes Mohammed
May 10: Lecture by Michalis
May 12: Lecture by Michalis
May 17:
B.6. MIRO: Multi-path Interdomain ROuting". Hasan
B5: Shedding Light on the Glue Logic of Internet Routing
Architecture Michael
B.4. XL: An Efficient Network Routing Algorithm Dave Keith
May 19:
A.4. On the scalability of BGP: the roles of topology growth and
update rate-limiting Yan Wang
D.1. Chord, Intrajeet
D.2 Ring Routing: Network Routing Inspired by DHTs Guojing
May 24:
C.5. "CPMC: An Efficient Proximity Malware Coping Scheme in
Smartphone-based Mobile Networks". Sazzad
C.3. iSPY: Detecting IP Prefix Hijacking on My Own! Huy
C.1. "Rationality and Traffic Attraction: Incentives for Honest Path
Announcements in BGP". Aggelos
May 26:
C.6 "De-anonymizing the Internet Using Unreliable IDs" Anton
C2. Accountable Internet Protocol (AIP) shailendra singh
June 2:
C.7 Carousel: Scalable Logging for Intrusion Prevention
Systems Vinh
The Lam ; Michael Mitzenmacher; George Varghese
NSDI 2010
Yuan Hao
C.4. "Neighborhood Watch for Internet Routing: Can we improve the
Robustness of Internet Routing Today?" Yi Wang
B.2 PortLand: A Scalable Fault-Tolerant Layer 2 Data Center
Network Fabric
by Mysore et al ACM SIGCOMM 2009 Alex
June 4: Lecture by Michalis - feedback on projects
June 4th : instruction ends
June 5-11 : Final Quiz: No quiz.
The papers below are suggestions. Feel free to propose
a paper to present. You should aim for a paper from a conference
not a workshop (which are often 5-6 pages).
I will need to approve the paper to make sure it is suitable for the
class.
A. BGP, scalability, and instability
A.1. ``An Experimental Analysis of BGP Convergence Time.''
Timothy G. Griffin and Brian J. Premore.
9th International Conference
on Network Protocols, ICNP' 2001
A.2. The Temporal and Topological Characteristics of
BGP Path Changes
D. Chang, R. Govindan, J.
Heidemann ICNP 2003
A.3. "BGP-lens: Patterns and Anomalies in Internet Routing
Updates"
B. A. Prakash, N. Valler, D. Andersen, M.
Faloutsos and Christos Faloutsos
ACM SIGKDD'09, industrial track, Paris 2009.
A.4. "On the scalability of BGP: the roles of topology
growth and update rate-limiting"
A.Elmokashfi and A.Kvalbein D.
Dovrolis ACM CoNext 2008
B. Revisiting Network Routing
B.1 BCube: A High Performance, Server-centric Network Architecture for
Modular Data Centers
Chuanxiong Guo et al ACM
SIGCOMM 2009
B.2 PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network
Fabric
Mysore et al ACM SIGCOMM 2009
B.3 SPAIN: COTS Data-Center Ethernet for Multipathing over Arbitrary
Topologies
Jayaram Mudigonda and Praveen Yalagandula, HP Labs; Mohammad Al-Fares
UCSD ; Jeffrey C. Mogul, HP Labs
NSDI 2010
B.4. XL: An Efficient Network Routing Algorithm
Kirill Levchenko (UC San
Diego); Geoffrey M.
Voelker (UC San Diego); Ramamohan Paturi (UC San Diego); Stefan Savage
(UC San Diego)
ACM SIGCOMM 2008
http://ccr.sigcomm.org/online/files/p15-levchenko.pdf
B.5. Shedding Light on the Glue Logic of Internet Routing Architecture
Franck Le (CMU); Geoffrey G.
Xie (Naval
Postgraduate School); Dan Pei (AT&T Labs - Research); Jia Wang
(AT&T Labs - Research); Hui Zhang (CMU)
ACM SIGCOMM 2008
B.6. MIRO: Multi-path Interdomain ROuting
W. Xu, J. Rexford
ACM SIGCOMM 2006
http://conferences.sigcomm.org/sigcomm/2006/discussion/getpaper.php?paper_id=18
B.7. Source Selectable Path Diversity via Routing Deflections
X. Yang, D. Wetherall
ACM SIGCOMM 2006
http://conferences.sigcomm.org/sigcomm/2006/discussion/getpaper.php?paper_id=17
C. Security and Business Issues
C.1. Rationality and Traffic Attraction: Incentives for Honest
Path
Announcements in BGP
Sharon Goldberg (Princeton
University); Shai
Halevi (IBM T. J. Watson Research); Aaron D. Jaggard (Rutgers
University); Vijay Ramachandran (Colgate University); Rebecca N. Wright
(Rutgers University)
ACM SIGCOMM 2008
http://ccr.sigcomm.org/online/files/p267-goldberg.pdf
C.2. Accountable Internet Protocol (AIP)
David G. Andersen (CMU); Hari
Balakrishnan
(MIT); Nick Feamster ; Teemu Koponen;
Daekyeong Moon; Scott Shenker
ACM SIGCOMM 2008
http://ccr.sigcomm.org/online/files/p339-balakrishnanA.pdf
C.3. iSPY: Detecting IP Prefix Hijacking on My Own
Zheng Zhang (Purdue
University); Ying Zhang
(University of Michigan); Y. Charlie Hu (Purdue University); Z. Morley
Mao (University of Michigan); Randy Bush (IIJ)
ACM SIGCOMM 2008
C.4. "Neighborhood Watch for Internet Routing: Can we improve the
Robustness of Internet Routing Today?"
G. Siganos, M. Faloutsos, IEEE INFOCOM 2007,
Anchorage, Alaska.
C.5. "CPMC: An Efficient Proximity Malware Coping Scheme in
Smartphone-based Mobile Networks"
Feng Li, IUPUI; Yinying Yang, Florida Atlantic University; Jie Wu, in
INFOCOM 2010 (download paper)
C.6 De-anonymizing the Internet Using Unreliable IDs
Yinglian Xie (Microsoft Research Silicon
Valley), Fang Yu (Microsoft Research Silicon Valley), Martín
Abadi
ACM SIGCOMM 2009
C.7 Carousel: Scalable Logging for Intrusion Prevention Systems
Vinh The Lam ; Michael Mitzenmacher; George
Varghese NSDI 2010
D. Overlay Routing and Distributed
Hash Tables
D.1. Chord: A Scalable Peer-To-Peer Lookup Service for Internet
Applications
Ion Stoica, Robert Morris, David Karger, Frans Kaashoek, Hari
Balakrishnan
D.2 Ring Routing: Network Routing Inspired by DHTs
http://conferences.sigcomm.org/sigcomm/2006/discussion/getpaper.php?paper_id=33
ACM SIGCOMM 2006
D.3 SOS: secure overlay services
Angelos D. Keromytis, Vishal Misra,
Dan
Rubenstein, ACM SIGCOMM 2002.
E. Sensor networks
E.1. Directed Diffusion for Wireless Sensor
Networking.
Chalermek
Intanagonwiwat, Ramesh
Govindan, Deborah Estrin, John
Heidemann, and Fabio Silva.
ACM/IEEE
Transactions on
Networking, 11 (1 ), pp. 2-16,
February, 2002
=========================== OLD PAPERS =======================
Ignore their associated numbers
* Effect of BGP Policy on Routing
1. The Impact of Routing Policy
on Internet Paths
Hongsuda Tangmunarunkit, Ramesh Govindan
Scott Shenker, Deborah
Estrin
INFOCOM 2001
2. The Impact of Internet Policy and Topology on
Delayed Routing Convergence, by Craig Labovitz, Roger Wattenhofer,
Srinivasan
Venkatachary and Abha Ahuja.
Proceedings of INFOCOM, Anchorage, AK, April,
2001
5. "A
Survey of Routing Protocols in Wireless Sensor Networks, "
K. Akkaya
and M. Younis, in the
Elsevier Ad Hoc Network Journal (to
appear) ()
6. Directed Diffusion for Wireless Sensor
Networking.
Chalermek
Intanagonwiwat, Ramesh
Govindan, Deborah Estrin, John
Heidemann, and Fabio Silva.
ACM/IEEE
Transactions on
Networking ,11 (1 ), pp. 2-16,
February, 2002
()
* 7. Synchronization of Multiple Levels of Data
Fusion in
Wireless Sensor Networks,
Yuan W.,
Krishnamurthy S.V, and
Tripathi, S.K., IEEE GLOBECOM 2003. Small paper needs to be
combined with
another paper realted to this work. ()
Routing and Security
* 8. "A Framework for Classifying Denial
of Service
Attacks,"
by Alefiya Hussain,
John Heidemann,
Christos Papadopoulos. In
Proceedings of Sigcomm 2003,
Karlsruhe, Germany,
August
2003.
()
* 9. Internet Quarantine:
Requirements for
Containing Self-Propagating Code.
David Moore, Colleen Shannon,
Geoffrey M.
Voelker, Stefan
Savage, INFOCOM 2003.
()
XX 10. Self-Organizing Hierarchical Routing for
Scalable
Ad
Hoc Networking
Rice
Computer Science Technical
Reoprt TR04-433
()
* 11. Should Internet Service Providers Fear
Peer-Assisted
Content Distribution? Thomas Karagiannis, Pablo Rodriguez, Dina
Papagiannaki Internet Measurement Conference (IMC), Berkeley, CA, USA,
October, 2005. ()
BGP/IBGP Stability and Anomalies:
XX 12. "Combining Visual and
Automated Data
Mining for Near-Real-Time Anomaly Detection and Analysis in
BGP",
()
Soon Tee Teoh,
Ke Zhang, Shih-Ming Tseng, Kwan-Liu Ma, and S. Felix Wu,
Proc. of the
ACM Conf. on Computer and Communications Security Workshop
on Visualization and Data Mining for Computer Security, 2004.
13. Reliability-aware IBGP
Route Reflection
Topology Design,
L. Xiao, J. Wang, K. Nahrstedt
(UIUC) ICNP
2003
())
Multicast routing - Bounds and proofs
14. "Bounds for the On-line Multicast
Problem in
Directed Graphs" ()
Michalis Faloutsos, Rajesh
Pankaj and Kenneth C. Sevcik
4th International
Colloquium on Structural Information and Communication Complexity
(SIROCCO '97)
15.a Scalable Application Layer
Multicast
Suman
Banerjee, Bobby
Bhattacharjee, Christopher Kommareddy
Proceedings of ACM Sigcomm 2002,
Pittsburgh, Pennsylvania, August 2002 ()
15.b "Application versus
Network Layer
Multicasting in Ad Hoc Networks: The ALMA Routing Protocol"
M. Ge, S. V.
Krishnamurthy, M. Faloutsos,
Ad Hoc Networks Journal (by
Elsevier), to appear.
Routing and Security
16. Topology-based
detection of anomalous BGP messages.
C. Kruegel, D. Mutz,
W. Robertson, F.
Valeur, RAID 2003. ()
17. Same as paper 12 sorry!
"Combining
Visual and Automated Data Mining for Near-Real-Time Anomaly Detection
and Analysis in BGP"
Soon Tee Teoh, Ke Zhang,
Shih-Ming Tseng, Kwan-Liu Ma, and S. Felix Wu,
Proc. of the ACM Conf. on
Computer and
Communications Security
Workshop on Visualization and Data Mining for Computer Security, 2004.
()
18. SOS: secure overlay services
Angelos D. Keromytis, Vishal Misra,
Dan
Rubenstein, ACM SIGCOMM 2002.
(
)
*
19 Locating Internet
Routing Instabilities. Anja Feldmann, Olaf Maennel, Z. Morley Mao,
Arthur Berger, Bruce Maggs, ACM/SIGCOMM 2004
*20 Easily-managed
and
topological-independent location service for self-organizing networks
Aline Viana (University of Paris VI,
France)
Marcelo Amorim (University of Paris VI,
France)
Yannis Viniotis (North Carolina State
University,
USA)
Serge Fdida (University Pierre and Marie
Curie,
France)
Jose F. de Rezende (Federal University
of Rio de
Janeiro, Brazil)
Mobihoc 2005.
*
21 Alex Fabrikant, Elias Koutsoupias, C. H.Papadimitriou
Heuristically Optimized Trade-offs
Proceedings of the 29th
International Colloquium on Automata, Languages and Programming 2002