Skip to content

Bibliography

Every paper l2trace draws from, with stable identifiers. Where an open-access PDF exists at a stable URL, the link is included; for closed-access papers, only the DOI is provided. The PDFs themselves are not hosted on this site — see /reference/prior-art/ for the per-tier summaries.

  • Breitbart et al. 2004 — Yuri Breitbart, Minos Garofalakis, Ben Jai, Cliff Martin, Rajeev Rastogi, Avi Silberschatz. Topology Discovery in Heterogeneous IP Networks: The NetInventory System. IEEE/ACM ToN 12(3):401–414, June 2004. DOI: 10.1109/TNET.2004.828963. Closed-access.

  • Lowekamp, O’Hallaron, Gross 2001 — Bruce Lowekamp, David R. O’Hallaron, Thomas R. Gross. Topology Discovery for Large Ethernet Networks. ACM SIGCOMM 2001, pp. 237–248. DOI: 10.1145/383059.383078. Closed-access.

  • Bejerano 2009 — Yigal Bejerano. Taking the Skeletons Out of the Closets: A Simple and Efficient Topology Discovery Scheme for Large Ethernet LANs. IEEE/ACM ToN 17(5):1385–1398, October 2009. DOI: 10.1109/TNET.2009.2022264. Closed-access. Extended journal version of INFOCOM 2006.

Tier 3 — L2 standards lineage + post-STP fabrics

Section titled “Tier 3 — L2 standards lineage + post-STP fabrics”
  • Perlman 1985 (STP) — Radia Perlman. An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN. SIGCOMM ‘85, pp. 44–53. DOI: 10.1145/319056.319004. Open access from ACM DL.

  • Myers, Ng, Zhang 2004 — Andy Myers, T. S. Eugene Ng, Hui Zhang. Rethinking the Service Model: Scaling Ethernet to a Million Nodes. HotNets-III, 2004. No canonical DOI; PDF not retrievable via standard channels.

  • Allan et al. 2010 (SPB) — David Allan, Peter Ashwood-Smith, Nigel Bragg, János Farkas, Don Fedyk, Michel Ouellette, Mick Seaman, Paul Unbehagen. Shortest Path Bridging: Efficient Control of Larger Ethernet Networks. IEEE Communications Magazine, October 2010, pp. 128–135. DOI: 10.1109/mcom.2010.5594687. Closed-access.

  • Rojas et al. 2015 (All-Path Bridging) — Elisa Rojas, Guillermo Ibáñez, José Manuel Giménez-Guzmán, Juan A. Carral, Alberto García-Martínez, Isaías Martínez-Yelmo, José M. Arco. All-Path Bridging: Path Exploration Protocols for Data Center and Campus Networks. Computer Networks 86:79–93, 2015. DOI: 10.1016/j.comnet.2015.01.002. Open access (Elsevier).

  • Mysore et al. 2009 (PortLand) — Radhika Niranjan Mysore, Andreas Pamboris, Nathan Farrington, Nelson Huang, Pardis Miri, Sivasankar Radhakrishnan, Vikram Subramanya, Amin Vahdat. PortLand: A Scalable Fault-Tolerant Layer 2 Data Center Network Fabric. SIGCOMM ‘09, pp. 39–50. DOI: 10.1145/1592568.1592575. Closed-access.

  • Greenberg et al. 2009 (VL2) — Albert Greenberg, James R. Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, David A. Maltz, Parveen Patel, Sudipta Sengupta. VL2: A Scalable and Flexible Data Center Network. SIGCOMM ‘09, pp. 51–62. DOI: 10.1145/1592568.1592576. Closed-access.

  • RFC 6325 (TRILL) — Radia Perlman, Donald Eastlake 3rd, Dinesh Dutt, Silvano Gai, Anoop Ghanwani. Routing Bridges (RBridges): Base Protocol Specification. RFC 6325 (Standards Track), IETF, July 2011. Open access: https://www.rfc-editor.org/rfc/rfc6325

  • IEEE 802.1Q-2018IEEE Standard for Local and Metropolitan Area Networks — Bridges and Bridged Networks. IEEE-SA. Paywalled.

  • Snodgrass 2000 — Richard T. Snodgrass. Developing Time-Oriented Database Applications in SQL. Morgan Kaufmann, 2000. 528 pp. ISBN 1-55860-436-7. Open-access PDF: https://www2.cs.arizona.edu/~rts/tdbbook.pdf

  • Jensen, Dyreson et al. 1998Consensus Glossary of Temporal Database Concepts. In Temporal Databases — Research and Practice (LNCS 1399), pp. 367–405. Springer 1998. Subsumed by Snodgrass 2000 for citation purposes.

  • Kulkarni & Michels 2012 — Krishna Kulkarni, Jan-Eike Michels. Temporal Features in SQL:2011. SIGMOD Record 41(3):34–43, 2012. DOI: 10.1145/2380776.2380786. Secondary source for SQL:2011 description (ISO/IEC 9075:2011 itself is paywalled).

A consolidated BibTeX file with every entry above is kept at papers/bibliography.bib in the repository. Cite from there when writing a related paper.