Full Abstract

Welcome & Introduction to NANOG , Steve Feldman, PC Chair MERIT Report, Betty Burke, Nanog Project Chair at MERIT NANOG History, William B. Norton, Equinix

Speakers
Betty Burke, NANOG Project Chair at MERIT.
William B. Norton, Equinix

Full Abstract

Security incidents are a daily event for Internet Service Providers. Attacks on an ISP's customers, attacks from an ISP's customer, worms, BOTNETs, and attacks on the ISP's infrastructure are now one of many"security" NOC tickets throughout the day. This increase in the volume and intensity of attacks has forced ISP's to spend constrained resources to mitigate the effects of these attacks on their operations and services. This investment has helped minimize the effects of the attacks, but it has not helped stop them at the source. Stopping attacks at their source requires rapid and effective inter-ISP cooperation. Hence, these ISP Security BOFs are also used as a face-to-face sync up meeting for the NSP-SEC forum.

Defined topics to be discussed during this ISP Security BOF include:

• Agenda Bashing
• Estonian Attack Overview - Merike Kaeo
• SP CALEA Issues; Challenges & Future - Chris Morrow (moderator)
• ISPs and CPE/Consumer-side Protection & Mitigation
• February 6/7, 2007 DNS Attack Recap - John Kristoff
• Quarterly Attack Statistics Update - Danny McPherson
• Open Discussion
  
  

Speakers
Moderator - Kevin Lanning, AT&T
Kevin Lanning is a Technical Specialist for AT&T Labs IP Network Security Group, and responsible for Denial of Service protection in AT&T's core networks, monitoring all connections into and out of the AT&T group of ASN's. Prior to mergers and assignment to AT&T Labs, he had responsibility for IP Network Security Planning and Architecture at SBC.

Danny McPherson, Arbor Networks
Danny McPherson is Chief Research Officer with Arbor Networks. He's active within the Internet Operations, Security and Standardization community.

Full Abstract

The tutorial introduces service providers to some more advanced BGP features and techniques to aid with operating their networks within the Internet. After a recap of iBGP, eBGP and common attributes, the tutorial will look at the various scaling techniques available, when to use BGP instead of an IGP, and examine policy options available through the use of local preference, MED and communities. The tutorial then looks at deployment techniques, including aggregation, announcing and receiving prefixes, pressure points on the routing system, and some of the newer features available.

Speakers
Philip Smith, Cisco Systems
Philip Smith has been with Cisco Systems since 1998 and is based in Brisbane, Australia. He is a Consulting Engineer, part of the Service Provider Architectures Group in Corporate Development. His role includes working with many ISPs in the Asia Pacific region, specifically in network strategies, technology, design and operations, configuration and scaling. As part of an ISP and Internet education initiative, Philip runs several Routing and Internet Technology Workshops in the Asia Pacific region. He also assists as co-instructor at similar events in many other parts of the world. Philip also is closely involved in regional activities, being chair of the APRICOT Management Committee, chair of APOPS, member of the organizing and programme committees for SANOG and PacNOG, as well as chair of APNIC's Routing and Internet Exchange Point Special Interest Groups. Prior to joining Cisco, he spent five years at PIPEX (now integrated into MCI's global network business), the UK's first commercial Internet Service Provider. He was one of the first engineers working in the commercial Internet in the UK, and played a key role in building the modern Internet in Europe.

Full Abstract

Welcome - 10 minutes - Bill Norton - Agenda Bashing and Observations Anonymous Survey and Discussion - 5 minutes - Bill Norton - On behalf of an anonymous community member who is employer mute would like to know 1) Who is using graceful restart on their BGP peering sessions? 2) Why graceful restart is a good idea? 3) Why graceful restart is a bad idea? PeeringDB.com Presentation - 10 minutes - Terry Rodery (BitGravity) - an update on the function and enhancement of this community contact information database. UnderHanded Peering Techniques - 10 minutes - Jim Deleskie (VSNL) - some updates to the Art of Peering white paper detailing some of the more unusual tactics seen in the field. Peering in Seattle Presentation- 10 minutes - Patrick Gilmore (Akamai) - Since we are all near Seattle, a major peering location in the U.S., Patrick will review the peering landscape in Seattle. Specifically - Why peer in Seattle? Where do folks peer in Seattle? What is different about peering in Seattle? What ASes are uniquely available here? Any gotchas. lessons learned? Peering BOF HotSeat Topic - Transit Survey(s) - 10 Minutes - Joe Provo - Here we to perform another survey that will hopefully mitigate the privacy concerns while still providing interesting useful data. Additional topics as they come up at NANOG. Send email to bill.norton at gmail.com if you want to volunteer to facilitate a short peering discussion. Peering Spotlight - remainder of the time - ALL - for Peering Coordinators that are just starting peering with their AS in the US we have a few minutes for them to introduce themselves to the group. This will provide a chance for them to be approached by active peers in the room as we break. ------------------------------------------------- Still TBD... Here are the ideas without someone to volunteer to step up and lead the discussion. Add your name if you would volunteer.... ------------------------------------------------- Is peering with the eyeball networks becoming more difficult with all the mergers. SBC used to be selective, now with BellSouth and AT&T, present more eyeballs and presumably is more restrictive. Likewise with Adelphia, Time Warner/Roadrunner merging and Verizon/MCI/UUNet, are we seeing a tightening of peering with eyeball networks? (Need a discussion leader here) Peering Capacity Upgrade - The Peering Community often upgrades peering capacity when utilization reaches 60%/75%/80%...but what do folks find is the right number? When should folks upgrade from 1G to 10G public peering or 1G to n*1G private peering? (from boggits-8468) Pros and Cons of hot potato routing for video traffic (i.e. relying on the quality your own vs. your peers network) (from Remco-16243) VOIP Peering Requests - while voip is still in its infancy it continues to be a growth area and companies make money from it. This sub topic will explore the practical side of peering voice traffic. (from ren-8172) Multicast Peering - as bandwidth for video becomes a constraint, is it time for multicast to be considered as an efficient inter-as distribution? (from Niels) Jumbo frames - should we explore big mtu VLANs for peering this traffic? (from Niels) -- YES! Small MTU's are a waste! (Martin) Do shared Route Servers make sense anymore? (from Niels) A random walk through IRC Peering Topics and Discussions - what are the peering coordinators discussing these days? Peering Debate - a staple of the Peering BOF, this section identifies an interesting topic for which there are two diametrically opposing views. Two debaters are recruited to present the strongest case on each side and the audience votes on which side presented the most compelling case. Then we discuss points that didn't come up or were not made strongly enough. How about peering point support for carriers that have 10G, and potentially 40G, undersea cable backbones arriving in the US at the Pacific or Atlantic coasts. (Martin)

Speakers
William B. Norton, Equinix
Bill Norton is Co-Founder and Chief Technical Liaison for Equinix. He focuses on research on large-scale interconnection and ISP peering, and in particular, scaling Internet operations using optical networking. Bill has published and presented his research in a variety of international forums. From 1987 to 1998, he served in several staff and managerial roles at Merit Network, directing national and international network research and operations activities and serving as NANOG coordinator. Bill received a B.A. in Computer Science and an M.B.A. from the Business School at the University of Michigan, and has been an active member of the Internet Engineering Task Force for the past 15 years.

Full Abstract

Steering Committee Report, Randy Bush, Acting SC Chair Program Committee Report, Steve Feldman, PC Chair Mailing List Committee Report, Aleksandr Pilosov, Acting MLC Chair MERIT Administrative Report, Betty Burke, Nanog Project Chair at MERIT

Speakers
Betty Burke, NANOG Project Chair at MERIT
Randy Bush, Acting SC Chair
Steve Feldman, PC Chair
Aleksandr Pilosov, Acting MLC Chair

Full Abstract

Speakers
David Isenberg, isen.com

Full Abstract

Speakers
Dino Farinacci

Full Abstract

Speakers
Yoshinobu Matsuzaki

Full Abstract

Speakers
David Meyer

Full Abstract

sFlow is a relatively new but more and more popular standard to capture traffic data in switched or routed networks. It uses a sampling technology to collect statistics from the device and is for that reason applicable to gigabit speeds or higher. AMS-IX implemented a traffic flow visualization service for it's members based on sFlow data. Due to the high and constantly increasing throughput on the AMS-IX platform the implementation was focused on performance as well as on scalability. This talk describes the implementation of the tools, visualization to the members and the benefits for traffic engineering within the exchange gained from sFlow data.

Speakers
Elisa Jasinska, AMS-IX
Elisa Jasinska is an engineer at the Amsterdam Internet Exchange. She has been working on the hand-coded sFlow software for AMS-IX since last year. The AMS-IX is a Layer 2 platform providing the facilities for over 250 parties to peer with each other. The non-profit organization is based at 4 independent collocations in Amsterdam.

Full Abstract

The Internet network is composed of tens of thousands Autonomous Systems (AS) networks. Each AS establishes links with other AS to learn routes toward any destination in the whole Internet. Border Gateway Protocol (BGP) is responsible for the propagation of reachability informations (routes to address ranges) originated by all AS in the Internet. Routing policies of ASs and the AS-level network topology are unknown, but they shape the possible BGP paths learned and used by routers and though end-to-end flows of IP packets in the network. The position of an AS in the Internet hierarchy determines its reachability profile to the hundreds of thousands destinations in the Network. We study here a new algorithm to compute an AS ranking that evaluates the average transit operated by an AS in BGP routing. This ranking can be used for decision support in (re-)negotiation of business agreements between AS.

Speakers
Mickael Meulle, France Telecom R&D
Mickael Meulle received a B.A. in Physics, a M.S. and Ph. D in Computer Science from the Blaise Pascal University, Clermont-Ferrand (France), in 2000, 2003 and 2007, respectively. Mickael also received an Engineer Diploma from Institut Supérieur d'Informatique et de Mathématique Appliquées, Clermont Ferrand (France) in 2003. The M.S. and Ph. D. thesis were pursued at Orange Labs, Issy-Les-Moulineaux (France) and are dealing with discovery of Internet topology, inference of Internet routing policies and Internet provider business relationships. Mickael became a member of CORE/CPN research staff at Orange Labs after completion of the Ph.D.

Full Abstract

Today, the complexity of ISPs' networks make it difficult to investigate the implications of internal or external changes on the distribution of the traffic across their network. In this talk, we present an open-source routing solver, called C-BGP, that eases the investigation of changes in the routing or the topology of large networks. We illustrate how to build a model of a real transit network. Then, we use the model to evaluate two different "what-if" scenarios. The first scenario studies the impact of changes in the Internet connectivity of the transit network (peering placement). The second investigates the impact of failures in its internal topology on the traffic distribution.

Speakers
Bruno Quoitin, Université catholique de Louvain, Belgium
Bruno Quoitin is a research fellow at UCL (Belgium). His current research is in the area of inter-domain routing and network modeling. He received his B.S. degree in Mathematics and his Master degree in Computer Science from FUNDP in 1999. He worked at DTI in the field of industrial network management for 2 years, until returning in the academic world where he obtained his Ph.D, in 2006 from UCL.

Full Abstract

We present path splicing, a new routing primitive that allows network paths to be constructed from multiple independent routing processes that run over a single network topology. Path splicing computes multiple independent routing trees by randomly perturbing link weights and, using network virtualization, runs multiple routing protocols in parallel slices, which collectively insert entries into a shared forwarding table. Using a small number of additional bits in packet headers, end systems can then redirect traffic between forwarding tables at any hop in the network. By allowing paths to be ``spliced'' by assembling segments from each of these trees, path splicing achieves exponential improvements in path diversity with only a linear increase in state and message complexity. Our evaluation of path splicing on several realistic ISP topologies demonstrates a dramatic increase in reliability that approaches the best possible using only a small number of slices and for only a small increase in latency. We also describe the implementation and deployment of path splicing on the VINI testbed.

Speakers
Nick Feamster, Georgia Tech University
Nick Feamster is an assistant professor in the College of Computing at Georgia Tech. He received his Ph.D. in Computer science from MIT in 2005, and his S.B. and M.Eng. degrees in Electrical Engineering and Computer Science from MIT in 2000 and 2001, respectively. His research focuses on many aspects of computer networking and networked systems, including the design, measurement, and analysis of network routing protocols, network security, anonymous communication systems, and adaptive streaming media protocols. His honors include award papers at SIGCOMM 2006 (network-level behavior of spammers), the NSDI 2005 conference (fault detection in router configuration), Usenix Security 2002 (circumventing web censorship using Infranet), and Usenix Security 2001 (web cookie analysis).

Murtaza Motiwala, Georgia Tech University.
Santosh Vempala, Georgia Tech University

Full Abstract

Speakers
NANOG Staff

Full Abstract

Arbor Networks

Full Abstract

In IPTV networks it is important to be able to make efficient and reliable multicast deliver. Different functionalities exist for being able to deliver multicast traffic through networks, MPLS P2MP is one such option where MPLS FRR can be used to protect multicast traffic from network failures, another solution is a functionality we call PIM Dual Join multicast streams. This presentation will go into discussions on these 2 functionalities and try and highlight benefits of each solution and also provide some test numbers for multicast traffic recovery in different failure scenarios.

Speakers
Peter Arberg, Redback Networks
Peter Arberg is Director, Architecture & Standards within Redback Networks. Prior to joining Redback, Peter Arberg worked as a Network Consultant for Cisco Systems and has also worked in both government and enterprise business implementing IP and MPLS networks.

Full Abstract

BGP prefix hijacks are a known operational problem in the Internet. In this talk we propose BGP Origins; a system that uses both public data (derived from sources such as RouteViews) to suggest stable prefix-to-origin mappings, and information submitted by users that has been cryptographically signed by a PGP key. This talk will outline the design and usage of this system. Part of the difficulty in developing a prevention technique for prefix hijacking stems from the fact that it is very difficult to determine the rightful origin for an announced prefix (and almost impossible to do so in an automated way). In BGP Origins, users are able to use observed origin information and augment it with their own attestations (of prefix-to-origin mappings). BGP Origins does not require a defacto PKI, and leverages concepts from PGP's Web of Trust. End users decide whose attestations they believe. BGP Origins is accessible via DNS' standard protocol. Users are able to query for origin mappings based on prefixes and can submit their own attestations using DNS updates. BGP Origins is intended to facilitate the operational practice of verifying proper origin mappings and to allow an automated approach for this.

Speakers
Eric Osterweil, UCLA
Eric Osterweil is a Ph.D. student in Computer Science Department at the University of California, Los Angeles. His previous experience includes 8 years of industry software engineering, at companies including Micormuse (now owned by IBM) and Avaya. His current research interests center around Internet Security. He is the lead developer on the SecSpider project ( http://secspider.cs.ucla.edu - the first DNSSEC deployment monitoring system).

Full Abstract

It is common to characterize any BGP-related routing convergence as hopelessly slow due to the linear relationship between the number of impacted prefixes (in the 500k range in early 2007 counting internet and vpn routes) and the number of convergence operation (bestpath, RIB and FIB update, transmission or reception of withdraw/update). The objective of this paper is to demonstrate that this belief is wrong for any failures occurring within the network of a service provider or on peering links with redundantly-connected peers. This covers the vast majority (if not all) of business models involving BGP convergence requirements. Thanks to BGP Prefix Independent Convergence (BGP PIC), an alternative path to the existing BGP next-hop is enabled at IGP convergence time (modify) in the core scenario, while in the edge scenario, the deletion of the IGP path to a BGP next-hop triggers an immediate and prefix-independent rerouting of the dependent BGP destinations via an alternate BGP next-hop. Aside the obvious convergence gains, BGP PIC and its underlying hierarchical FIB organization bring significant scaling and robustness gains to router architecture. The first section defines the problem and introduces concepts such as RIB, FIB, recursion, dependency, flattened and hierarchical FIB organization. The second section explains why modern high-end router design invests in more complex and expensive packet lookup engine to support hierarchical FIB databases. This allows for significant gains in scaling, robustness and routing convergence (BGP PIC Core). The next section generalizes the hierarchical FIB structure and introduces the concepts of shared BGP path-lists and loadbalancing FIB entries. BGP PIC edge is then defined both for the multipath and unipath BGP policies. The next section describes the BGP control Plane reaction to the core and edge failures, how it is automatically serialized with IGP convergence and how the later BGP control-plane induced FIB modifications reconciliate with the BGP-PIC-modified FIB in a lossless manner. We then review the vast applicability for BGP PIC behavior and report detailed lab measurement based on a commercially-available product. We finish with a conclusion.

Speakers
Clarence Filsfils, Cisco Systems
Clarence Filsfils is a Cisco Distinguished Engineer. He has been playing a key role in engineering, marketing and deploying the Quality of Service and Fast Routing Convergence technology at Cisco Systems.

Full Abstract

We describe a methodology which targets the identification of wrongly configured route filters by Internet Service Providers (ISPs). A current problem for network operators is that newly announced IP address space (from previously unused IP blocks) is often not reachable as it is still blocked by certain ISPs. It is common for network operators to filter out address space which is known to be unallocated (bogon addresses). However, as allocated address space changes over time these bogons might become legitimately announced prefixes. Unfortunately, some ISPs still do not configure their bogon filters via lists published by the RIRs, instead choosing to manually configure filters. Therefore it would be desirable to test whether filters block IP blocks, before this address space is allocated to ISPs and/or end users. In this article we present a methodology that detects where wrongly configured filters exists, so that ISPs can be contacted and asked to update their filters.

Speakers
Randy Bush, IIJ
Randy Bush works as Principal Scientist at Internet Initiative Japan. Previously he spent a bit over a year at AT&T doing research and working on network architecture. He got some operational experience from being on the founding team at Verio, a backbone provider, from which he graduated as VP of Networking after five years. Before that, he was the principal engineer of RAINet, an ISP in Oregon and Washington, which was Verio's first acquisition. As PI for the Network Startup Resource Center, an NSF-supported pro bono effort, he has been involved for some years with the deployment and integration of appropriate networking technology in the developing world.

Full Abstract

Microsoft

Full Abstract

Speakers
Majdi Abbas, Lattice, L.L.C.

Full Abstract

Speakers
Len Bosack, XKL

Full Abstract

Speakers
Ricardo Oliveira

Full Abstract

Speakers
Tim Pozar

Full Abstract

Speakers
Peter Losher

Full Abstract

Stability is one of the key challenges of BGP, the de facto inter-domain routing protocol in today's Internet. BGP's slow convergence and recovery in the face of routing failures and policy changes can lead to poor data plane performance including significant periods of packet loss. In this talk, we propose stable route selection (SRS), a simple approach to improve BGP stability, by directly incorporating route stability as a factor in the route selection process. Through extensive simulations in a realistic environment, we show that the mean rate at which routes change can be reduced by a factor of 4.9, while preserving local preferences based on ISP business relationships, and limiting the increase in path length to less than 15%. Moreover, this approach can be deployed easily, as it requires no protocol changes or coordination among ISPs. A single ISP can unilaterally implement SRS and obtain a significant improvement in stability, with benefits increasing as more ISPs participate.

Speakers
Brighten Godfrey, UC Berkeley
Brighten Godfrey received his B.S. in Computer Science from Carnegie Mellon University in 2002, and an M.S. from UC Berkeley in 2006. He is now a Ph.D. candidate advised by Ion Stoica at UC Berkeley. His thesis research concerns designing distributed systems for heterogeneity, with a focus on improving stability in interdomain routing and other systems. Other research interests include distributed algorithms, analysis of networks, peer-to-peer systems and overlay networks.

Full Abstract

We have developed iPlane, an Internet-wide information plane that provides real-time predictions of approximate paths and path properties between arbitrary end-hosts. iPlane continually performs measurements from several hundred geographically distributed vantage points to build a map of the Internet's structure and to annotate links in this map with performance metrics such as latency, loss rate, and bandwidth capacity. We have evaluated the utility of iPlane by applying it to several popular distributed services in use today: content distribution, swarming peer-to-peer file-sharing, and voice-over-IP. In each case, using iPlane's predictions leads to improved application performance.

Speakers
Harsha V. Madhyastha, University of Washington
Harsha V. Madhyastha is a PhD. candidate in Computer Science and Engineering at the University of Washington. His advisors are Prof. Tom Anderson and Prof. Arvind Krishnamurthy at UW, and Prof. Arun Venkataramani at UMass Amherst. His research interests span the areas of networking and distributed systems, with specific enthusiasm in getting his hands dirty with measurements of the Internet and using insights from those to build large-scale systems.

Full Abstract

We present Hubble, a system designed to identify and diagnose reachability problems on the Internet in real-time. Using Hubble, we are able to evaluate the extent to which global reachability is violated: how many prefixes are reachable from some vantages and not others, and how long do these problems persist? Whereas previous work focused on either reachability within a single AS or simple passive monitoring of BGP updates, we have designed Hubble to unify RouteViews and distributed vantage points into a system that can perform active probe monitoring and diagnosis of reachability problems to about 90% of the Internet's edge prefixes. Our results show that 10% of prefixes experience reachability problems on a given day. Beyond identifying problems, Hubble gathers data and can trigger measurements to help troubleshoot and categorize commonly occuring reachability problems in real-time. Is a prefix currently unreachable from portions of the Internet? Is the problem due to issues with multi-homed failover? Is some AS dropping all traffic to the prefix? Hubble can provide answers to these questions.

Speakers
Thomas Anderson, University of Washington.
John P. Johnson, University of Washington.
Ethan Katz-Bassett, University of Washington
Ethan Katz-Bassett is pursuing a PhD at the University of Washington. He is advised by Tom Anderson and Arvind Krishnamurthy. His current research is in the area of Internet measurement and measurement-based systems.

Arvind Krishnamurthy, University of Washington.
Harsha V. Madhyastha, University of Washington.