Cariden often presents at conferences (see the news/events page for a recent overview). On this page we provide a selection of talks and papers by Cariden and its customers:
Event: Internet Measurement Conference, October 2004, Sicily
Author(s): Anders Gunnar (SICS), Mikael Johansson (KTH), Thomas Telkamp (Global Crossing)
This presentation considers the problem of estimating the point-to-point traffic matrix in an operational IP backbone. Contrary to previous studies that used a partial traffic matrix or demands estimated from aggregated Netflow traces, we use a unique data set of complete traffic matrices from a global IP network measured over five-minute intervals. This allows us to do an accurate data analysis on the time scale of typical link-load measurements and enables us to make a balanced evaluation of different traffic matrix estimation techniques. We describe the data collection infrastructure, present spatial and temporal demand distributions, investigate the stability of fanout factors, and analyze the mean-variance relationships between demands. We perform a critical evaluation of existing and novel methods for traffic matrix estimation, including recursive fanout estimation, worst-case bounds, regularized estimation techniques, and methods that rely on mean-variance relationships. We discuss the weaknesses and strengths of the various methods, and highlight differences in the results for the European and American sub-networks.
Event: Preparing for the Future of the Internet, Network Information Center, Mexico, November 29, 2007
Author(s): Arman Maghbouleh, Cariden
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.
Event: Asia Pacific IP Experts Conference (Cisco), November 4th, 2003, Shanghai, P.R. China
Author(s): Thomas Telkamp (Global Crossing)
Two main approaches exist today for providing quality of service (QoS) in IP backbones. One approach relies on scheduling/queuing; the other relies on the presence of capacity/bandwidth. The two schools of thought arise from different understandings of traffic characteristics. In this talk we present the results of an empirical study of Internet traffic characteristics. We use packet traces from a Tier-1 IP backbone network and introduce a non-parametric approach to study latency characteristics at high utilization levels. This approach requires minimal assumptions and has broad applicability. The 2nd part of the presentation is focused on the Network Planning framework, applying the derived guidelines to large IP networks. Topics covered include failure simulations, the role of Diff-Serv in the backbone, and traffic matrix
Event: NANOG 26, October 2002, Phoenix
Author(s): Arman Maghbouleh, Cariden
Recent research publications have noted the possibility that plain-old IGP metric manipulations may be as effective as the overlay-style traffic engineering made possible by ATM or MPLS. Adherents of either approach have pointed to specific topologies for which metric manipulation does extremely well or extremely poorly. Here, we present the results of a study comparing metric-based shortest-path routing with the theoretically optimal routing. We looked at six real networks under normal and single-circuit failures and found that, despite its limitations, metric-based routing was able to minimize maximum link utilizations about as well as the theoretical maximum. We present cases that illustrate the limitations of metric-based routing and speculate that these cases do not affect performance on existing networks because operators design networks with shortest-path routing limitations in mind.
Event: Terena Networking Conference, June 2004, Rhodes
Author(s): Thomas Telkamp (Global Crossing), Alan Gous (Cariden), Arash Afrakhteh (Cariden)
This presentation argues for the viability of metric-based traffic engineering (TE) in a pure IP network, as a simple alternative to MPLS tunnel-based TE. An overview of the steps required to perform metric-based TE are presented, with some special attention to demand estimation. A particular TE goal, reducing worst-case failure utilisation, is described formally. Metric-based TE is compared to alternatives in a study conducted on currently existing IP networks, using this criterion as a judge of performance.
© 2001-2012 Cariden Technologies, Inc. All rights reserved.