Full Abstract

This tutorial introduces service providers to some of the features available in BGP to aid multihoming to the Internet. After an explanation of multihoming and the principles being followed in this tutorial, several examples involving different scenarios will be given. Configuration techniques for modifying inbound and outbound traffic flows are covered, as are some examples on how to use BGP communities in inter-AS relationships. The tutorial finishes by covering some common multihoming security issues.

Speakers
Philip Smith, Cisco Systems
Philip Smith joined Cisco Systems in January 1998. He is a member of the Service Provider Architectures Group of Consulting Engineering, within Corporate Development. His role includes working with many ISPs in the Asia-Pacific region and the rest of the world, specifically in network strategies, design, technology, and operations, as well as helping with network configuration and scaling. Other areas of interest also include Internet routing, Internet protocols, IPv6, and encouraging the growth of the Internet around the world. Prior to joining Cisco, he spent five years at PIPEX (now part of UUNET's global ISP business), the UK's first commercial Internet Service Provider. He was one of the first engineers working in the UK Internet, and played a fundamental role in building the modern Internet in the UK and Europe. Philip is co-author of Cisco ISP Essentials, published by Cisco Press. He holds a Doctor of Philosophy and has a First Class Honours Degree in Physics. He lives in Brisbane, Australia.

Full Abstract

Knowledge of the amount of traffic between source and destination pairs of a network is crucial to fundamental operational tasks such as capacity planning, traffic engineering, and peering management. Router vendors, third parties, academic researchers, and ingenious network engineers have devised multiple ways of collecting and estimating traffic matrices. This session presents an overview of applications of traffic matrices and operational experiences with the various approaches, including NetFlow-based methods, mathematical estimation models, and MPLS (both RSVP and LDP) methods. Emphasis will be on practical experiences with each method. The tutorial has been slightly revised since its presentation at the Seattle meeting. In LA, there will be less focus on NetFlow (only new advances will be covered), a more detailed description of how to build a traffic matrix from MPLS LDP counters, more coverage of measuring/estimating peering traffic (external in addition to internal traffic matrix), and another 'real-life' example.

Speakers
Thomas Telkamp, Cariden

Full Abstract

Speakers
Jordi Palet, Consulintel

Full Abstract

Speakers
Philip Smith, Cisco Systems

Full Abstract

This tutorial discusses some of the scaling considerations in MPLS deployments, concentrating on the tradeoffs between the cost and benefit of creating extra state in the network. In particular, the tutorial will look at how the amount of state (for example LSPs and forwarding state) is affected by different MPLS signaling protocols, features deployed, and network design choices. Furthermore, the cost of this state in terms of both platform resources and operations/management overhead is evaluated (for example, when is it necessary to upgrade a platform or add a new device in the network, or how difficult is it to configure and troubleshoot a particular deployment?). The material presented is vendor-independent. The tutorial is targeted for network engineers and service providers who want to gain a deeper understanding of MPLS networks. Attendees should have a basic understanding of MPLS and BGP/MPLS VPNs.

Speakers
Ina Minei, Juniper
Ina Minei is a network protocols engineer at Juniper Networks, where she focuses on MPLS protocols and applications. She is an active participant in industry fora and conferences and has co-filed several patents in the area of IP and MPLS. She is co-author of the new book, MPLS-Enabled Applications, to be published by Wiley UK in October 2005. The book provides an overview of current MPLS topics, and contains several discussions on scaling issues that arise in MPLS networks.

Full Abstract

We invite you to join us on Sunday evening from 5:00-7:00, between the tutorials and the opening reception, when the NANOG Steering Committee will hold an open meeting for those interested in discussing general NANOG concerns. The meeting will be broadcast, and a method for external input (e.g. jabber) will be provided.

The agenda the SC has come up with so far is:

• Steeering Committee progress/status report
• Open microphone
• Steve Feldman, CNET - Program Committee report
• Open microphone
• Betty Burke, Merit - Finance report
• Open microphone
• Mailing List issues
  • Policy and process
  • Appeal process
  • SC process regarding ML committee, i.e. terms, selection, ... as this is not covered well in the NANOG charter.
• Other open issues
• Open microphone
  
  

Oh, and did we mention open microphone? :-)

If you have a flash presentation (five minutes max) you wish to make, please tell us and send a draft of the presentation.

Speakers
Moderator - Randy Bush, IIJ
Randy Bush is a Principal Scientist at IIJ (an actual ISP) and chairs the NANOG Steering Committee. He was a Founding Engineer at Verio (now retired) and has spent 40 years in computing: compiler geek, real-time systems, actually configures routers, servers, architects networks ... Randy also has 18 years of experience in internet tech transfer to developing countries. He has served as Principal Investigator at the Network Startup Resource Center (NSRC, http://nsrc.org/) and was on the NANOG Program Committee for many years. Randy was one of the members of the Founding Board of ARIN, and has also served as the IVTF Ops Director (retired).

Full Abstract

With the advent of the growing and widespread deployment of IPv6, many familiar operational issues have arisen. Among the current IPv6 "hot topics" are RIR policy (including the HD ratio discussion) and site multi-homing. This BOF focuses on the multi-homing issue, since multi-homing is a one of the significant drivers of the growth and dynamic properties of Default Free Zone (DFZ). In particular, there is concern that the amount of multi-homing will grow beyond the organizations who use it today in the IPv4 Internet and that we need new mechanisms to handle the potential growth (both in terms of the size of the DFZ, and its dynamic properties). The current direction that the IETF is taking is being defined by the shim6 working group. Briefly, shim6 seeks to find a mechanism which provides most the functional benefits of multi-homing while still allowing reasonable scalability of the DFZ. More precisely, shim6 seeks to find scalable solutions that allow sites to multi-home for the purposes of redundancy, traffic engineering, or other policy. However, there has been quite a bit of discussion in various venues as to whether shim6 actually accomplishes what most might traditionally think of as traffic engineering. In particular, traffic engineering can be thought of as the practice and mechanisms needed to place traffic where capacity exists (in contrast to capacity planning, which puts capacity where traffic exists). One can note that in order to accomplish site-wide inbound traffic engineering under shim6, some control mechanism would be required that is capable of causing all of the hosts within the site to change the destination address that their correspondents are using. Some feel that this is overly complex. In the outbound traffic engineering case, a similar capability would require a control mechanism that has knowledge of the site's external routing tables and can affect the destination addresses used by the site's hosts, which has also raised concerns about its potential complexity. The purpose of this BOF for the IAB is to solicit community feedback on the progress and direction of the IPv6 multi-homing work in the IETF, and to help the IAB determine if there is meaningful work that the IETF (and the IAB in particular) can do to address any problem(s) that may be perceived with the current direction. The BOF is IAB-sponsored, and is the first in a series held at the various NOGs (NANOG, RIPE, APRICOT, etc) in support of this effort. A possible outcome might be an IAB workshop on multi-homing in IPv6.

Speakers
Dave Meyer, Cisco Systems

Full Abstract

Information about the geographic locality of IP prefixes can be useful for understanding the issues related to IP address allocation, aggregation, and BGP routing table growth. In this study, we use traceroute data and geographic mappings of IP addresses to study the geographic properties of IP prefixes and their implications on Internet routing. We find that (1) IP prefixes may be too coarse-grained for expressing routing policies, (2) address allocation policies and the granularity of routing contribute significantly to routing table size, and (3) not considering the geographic diversity of contiguous prefixes may result in overestimating the opportunities for aggregation in the BGP routing table. The complete paper is available at http://nms.lcs.mit.edu/~feamster/papers/imc05.pdf">http://nms.lcs.mit.edu/~feamster/papers/imc05.pdf

Speakers
Hari Balakrishnan, MIT
Nick Feamster, MIT
Nick Feamster will join the College of Computing at Georgia Tech as an assistant professor in January 2006. He plans to receive his Ph.D. in computer science from MIT in 2005. He received 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 the NSDI 2005 conference (fault detection in router configuration), Usenix Security 2002 (circumventing web censorship using Infranet), and Usenix Security 2001 (web cookie analysis).

Mike Freedman, NYU.
Mythili Vutukuru, MIT

Full Abstract

This research paper examines initial experimental results for BGP mechanisms for dynamically changing BGP AS numbers without dropping the AS connection. The mechanisms proposed have two flavors: Non-Confederation (draft-hares-bose-dynamic_as-02.txt) and confederation-specific (draft-hares-confed-edge-AS-02.txt). The talk will review the real work problems this mechanism tries to solve, the BGP mechanisms, and the experimental results. The initial tests look at small, medium and large numbers of BGP peers into one peer using Dynamic AS. The peers attached to a Dynamic AS renumbering peer are both IBGP and EBGP and IPv4 and IPv6 pathways. The initial tests use both Internet route mixtures and generated routes (LAN routes).

Speakers
Patrick Bose, Lockheed Martin
Sue Hares, NextHop
Sue Hares is the founder and CTO of NextHop Technologies. Prior to launching NextHop, Sue spent 13 years at Merit Network, where she directed the GateD Consortium. An active participant in the design, specification, and implementation of routing protocols, Sue co-chairs the IETF IDR Working Group. She holds a B.S. in Computer Engineering from the University of Michigan.

Full Abstract

Network operators are routinely confronted with a wide range of anomalies—ranging from abuse-related events (DOS attacks, worms, scans) to maintainance issues (outages, misconfigurations, etc.) to unusual customer behavior (flash crowds, shift in customer demands, etc.). To mitigate their effect, operators need to mine network-wide data for anomalies as they occur, and once detected, classify them in order to select the appropriate response. In this talk, we will present techniques to detect and classify anomalies in network-wide flow traffic data. We will then apply our methods on data collected from two backbone networks, and show that they can: 1) detect a broad set of anomalies, at a low false alarm rate, and 2) automatically classify anomalies into meaningful categories.

Speakers
Mark Crovella, Boston University
Christophe Diot, Thomson Paris Research
Anukool Lakhina, Boston University
Anukool Lakhina is a Ph.D. candidate at Boston University, where he is advised by Prof. Mark Crovella. Anukool spent four months at Sprint Labs, where he worked on problems faced by network operators. His Ph.D. dissertation was inspired by these problems, and develops methods for analyzing network-wide traffic in order to detect unusual network events, such as attacks, scans, shifts in traffic, outages, etc. Anukool intends to graduate in dall 2005.

Full Abstract

Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologies such as SRAM or all-optical buffering. Unfortunately, a widely used rule-of-thumb says we need a bandwidth-delay product of buffering at each router so as not to lose link utilization. This can be prohibitively large. In a recent paper, Appenzeller et al. challenged this rule-of-thumb and showed that for a backbone network, the buffer size can be divided by \sqrt(N) without sacrificing throughput, where N is the number of flows sharing the bottleneck. In this work, we first provide some experimental validation (using data gathered from the Level3 Communications backbone) for the reduced buffer size result. Then, we explore how buffers in the backbone can be significantly reduced even more, to as little as a few dozen packets, if we are willing to sacrifice a small amount of link capacity. We argue that if the TCP sources are not overly bursty, then fewer than twenty packet buffers are sufficient for high throughput. Specifically, we argue that O(\log W) buffers are sufficient, where W is the window size of each flow. We support our claim with analysis and a variety of simulations. The change we need to make to TCP is minimal—each sender just needs to pace packet injections from its window. Moreover, there is some evidence that such small buffers are sufficient even if we don't modify the TCP sources, so long as the access network is much slower than the backbone, which is true today and likely to remain true in the future. We conclude that buffers can be made small enough for all-optical routers with small integrated optical buffers. For details, see the SIGCOMM 2004 paper at http://tiny-tera.stanford.edu/~nickm/papers/sigcomm2004.pdf">http://tiny-tera.stanford.edu/~nickm/papers/sigcomm2004.pdf and the ACM/Sigcomm CCR paper at http://yuba.stanford.edu/~yganjali/research/publications/Small-Buffers-CCR05.pdf">http://yuba.stanford.edu/~yganjali/research/publications/Small-Buffers-CCR05.pdf

Speakers
Guido Appenzeller, Stanford University
Yashar Ganjali, Stanford University
Yashar Ganjali is with the High Performance Networking Group at Stanford University, where he is working toward his Ph.D. degree. He received a B.Sc. in Computer Engineering from Sharif University of Technology, Tehran, Iran, in 1999, and an M.Sc. in Computer Science from the University of Waterloo, Waterloo, Canada, in 2001. He is currently involved with the buffer sizing project: its goal is to determine the impact of reducing the buffer size in core routers from millions of packets to just tens of packets, and thus exploring the possibility of building all-optical networks. His other research interests include analysis and design of high performance switches, scheduling algorithms, congestion control, routing protocols, and network optimization.

Ashish Goel, Stanford University
Nick McKeown, Stanford University
Tim Roughgarden, Stanford University

Full Abstract

Speakers
Steve Feldman, CNET
Susan Harris, Merit Network

Full Abstract

This is a personal view of the next three to five years for the Internet industry, looking at the world from the perspective of the Carrier ISP. The presentation explores some of the common perceptions about value propositions for the industry and makes some predictions concerning future sustainable business models.

Speakers
Geoff Huston, APNIC

Full Abstract

In this presentation, we examine facts and fiction of the filtering of peering sessions in the Internet core. Large networks have traditionally not filtered peering sessions, preferring instead to trust their peers to correctly filter all customer connections. Although several incidents have caused network operators to reexamine this approach, few have been willing to attempt to filter all peering sessions due to the perceived difficulty of building and deploying the necessary prefix filters. We present a novel technique for generating prefix filters in the absence of up-to-date IRR data, including an analysis of the accuracy that may be possible using the new technique. We also look at the operational impact and performance of using this technique on real-world infrastructures.

Speakers
Jim Deleskie, Teleglobe
Jim DeLeskie is a Senior Network Engineer at Teleglobe. His core areas of responsibility are core routing, peering, security, and network architecture. Prior to joining Teleglobe, Jim held several positions in both the vendor and service provide space over the past 10 years, including time at Rogers Cable, Avici Systems, and internetMCI.

Tom Scholl, SBCIS
Tom Scholl is a senior network engineer at SBC Internet Services, IP Core NP&E - Design & Standards. He currently works on defining SBCIS routing protocol policies, network architecture of both the IP and FTTx networks. and testing router code and hardware. Previously, Tom worked at Ameritech and various other Chicago ISPs.

Todd Underwood, Renesys Corporation
Todd Underwood is in charge of operations and peering for Renesys. Before that he was CTO of Oso Grande, a New Mexico ISP. He has a background in systems engineering and security and has worked on a variety of systems architecture and scalability problems. Todd has presented work related to Internet routing dynamics and relationships at NANOG and various peering forums (LINX, S&D, NOTA).

Full Abstract

Recently, peer-to-peer (P2P) networks have emerged as an attractive solution to enable large-scale content distribution without requiring major infrastructure investments. While such P2P solutions appear highly beneficial for content providers and end-users, there seems to be a growing concern among ISPs that now need to support the distribution cost. In this work, we explore the potential impact of future P2P file delivery mechanisms as seen from three different perspectives: i) the content provider, ii) the ISPs, and iii) individual content consumers. Using a diverse set of measurements, including BitTorrent tracker logs and full-payload packet traces collected at the edge of a 20,000 user access network, we quantify the impact of peer-assisted file delivery on end-user experience and resource consumption. We further compare it with the performance expected from traditional distribution mechanisms based on large server farms and Content Distribution Networks (CDNs). While existing P2P content distribution solutions may provide significant benefits for content providers and end-consumers in terms of cost and performance, our results demonstrate that they have an adverse impact on ISPs' costs by shifting the associated capacity requirements from the content providers and CDNs to the ISP itself. Further, we highlight how simple "locality-aware" P2P delivery solutions can significantly alleviate the induced cost at the ISPs, while providing an overall performance that approximates that of a perfect world-wide caching infrastructure.

Speakers
Thomas Karagiannis, UC Riverside
Thomas Karagiannis is a Ph.D. Candidate in the Department of Computer Science at the University of California, Riverside. He received his B.S. from the Applied Informatics department at the University of Macedonia in Greece. He is currently an intern with Intel Research at Cambridge, UK. His research interests include Internet measurements and monitoring, analysis of Internet traffic dynamics, traffic classification, and peer-to-peer networks.

Konstantina Papagiannaki, Intel Research.
Pablo Rodriguez, Microsoft Research

Full Abstract

An ISP's business revolves around traffic but traffic behavior is very difficult to extract from a network. SNMP MIB interface counters can give a link's loading but offer no clue as to why it's loaded. NetFlow collectors give a detailed source/destination breakdown of the traffic on a link but the data is so voluminous that it's difficult even to acquire, much less analyze, categorize and correlate across an entire topology. Although we have lots of traffic data, little useful information gets extracted from it. Route/flow data fusion—combining flow measurements (NetFlow, sflow, MPLS tunnel counters, sniffer traces, etc.) with IGP and BGP routing data—makes it possible to construct tools that show, in real time, where traffic is distributed across a topology. Unlike a simple traffic matrix, this analysis can show not only what are the ingress to egress loads but also how loaded are the intermediate links, who loaded them, and why. Route/flow fusion is scalable and doesn't require much effort to set up: since routing transforms a flow measurement made at a point to flow along an entire path, flows only need to be collected on customer and peering links. Since the meta information needed to classify and aggregate the flow data is already in the routing data (e.g., address-to-prefix mappings, prefix-to-AS, and prefix-to-community mappings) the tools can almost entirely self-configure. This talk will describe algorithms and give examples of how to fuse flow and routing data and how to analyze and visualize the results. Examples will use real flow and routing data from a large ISP and emphasize solving real operational, engineering and business problems.

Speakers
Van Jacobson, Packet Design
Van Jacobson did some networking stuff a long time ago. These days he spends most of his time chauffeuring a grumpy teenager & a loud seven year old. Occasionally he gives talks for people who are too busy doing real work to talk about it.

Bruce Mah, Packet Design
Haobo Yu, Packet Design

Full Abstract

For network operators engaged in peering, an accurate analysis of their traffic is essential for:

• Making determinations about potential new peering partners
• Convincing other networks to peer with you
• Traffic engineering to external networks
• Defending your network against depeering
• Making intelligent transit purchase decisions that support your peering strategies
  
  

NetFlow can be a powerful tool for obtaining information about the traffic on your network, but existing tools are only equipped to provide information about the current path, or the final destination for the traffic. Because the vast majority of Internet routes are reachable through more than one AS path, a full understanding of the non-active but available paths is critical to making intelligent decisions about peering and transit purchasing strategies. However, because BGP obscures all but the best-path information, new techniques must be developed in order to analyze these alternate paths. This presentation aims to discuss some of these techniques, based on the practical experiences of network operators, as well as share concepts and examples for analysis which historically could only be accomplished through trial and error methods.

Some example uses include:

• Accurately determining the amount of traffic that would be exchanged with a potential new peer, as well as what other paths are available to that traffic.
• Convincing networks to peer with you, by being able to show them the missed business in traffic that is delivered via alternate paths.
• Finding alternate paths to the largest customers of networks who will not peer with you ("Donut" peering analysis).
• Analyzing the routing policies of existing or potentially new transit providers as it impacts your network's traffic, without actually having to purchase transit or shift traffic.
  
  

Speakers
Nathan Patrick, Sonic.net
Richard Steenbergen, nLayer Communications
Richard Steenbergen is the Co-Founder of nLayer Communications, where he currently serves as Chief Technical Officer and devotes a significant amount of time to the strategic management of peering and transit relationships. Previously, he served as a Sr. Network Engineer for several large NSPs, and was the Sr. Software Engineer responsible for developing optimized routing technologies at netVmg, Inc.