Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36857
Type: | Conference paper |
Title: | Measuring BGP pass-through times |
Author: | Feldmann, Anja Kong, Hongwei Maennel, Olaf Manuel Tudor, Alexander |
Citation: | Passive and active network measurement : 5th international workshop, PAM 2004, Antibes Juan-les-Pins, France, April 19-20, 2004 ; proceedings / Chadi Barakat, Ian Pratt (eds.), pp. 267-277 |
Publisher: | Springer |
Issue Date: | 2004 |
Series/Report no.: | Lecture notes in computer science ; 3015. |
ISBN: | 3540214925 |
Conference Name: | PAM 2004 (5th : 2004 : Antibes Juan-les-Pins, France) |
School/Discipline: | School of Mathematical Sciences |
Statement of Responsibility: | Anja Feldmann, Hongwei Kong, Olaf Maennel and Alexander Tudor |
Abstract: | Fast routing convergence is a key requirement for services that rely on stringent QoS. Yet experience has shown that the standard inter-domain routing protocol, BGP4, takes, at times, more than one hour to converge. Previous work has focused on exploring if this stems from protocol interactions, timers, etc. In comparison only marginal attention has been payed to quantify the impact of individual router delays on the overall delay. Salient factors, such as CPU load, number of BGP peers, etc., may help explain unusually high delays and as a consequence BGP convergence times. This paper presents a methodology for studying the relationship between BGP pass-through times and a number of operationally important variables, along with some initial results. Our results suggest that while pass-through delays under normal conditions are rather small, under certain conditions, they can be a major contributing factor to slow convergence. |
Description: | The original publication is available at www.springerlink.com |
Published version: | http://www.springerlink.com/content/dbxx4kvl77j9vccy/ |
Appears in Collections: | Mathematical Sciences publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.