Modeling the Routing of an Autonomous System with C-BGP

user warning: Can't create/write to file '/tmp/#sql_4d68_0.MYI' (Errcode: 30) query: SELECT t.* FROM inl_term_node r INNER JOIN inl_term_data t ON r.tid = t.tid INNER JOIN inl_vocabulary v ON t.vid = v.vid LEFT JOIN inl_term_data tac_td ON t.tid = tac_td.tid WHERE (t.tid IN (0, 1) OR tac_td.vid NOT IN (1)) AND ( r.nid = 212 ) ORDER BY v.weight, t.weight, t.name in /var/www/obonet/includes/database.mysql.inc on line 174.
Wed, 04/04/2007 - 23:29 by Damien Leroy

Abstract

Today, the complexity of ISPs’ networks make it difficult to investigate the implications
of internal or external changes on the distribution of traffic across their network.
In this article we explain the complexity of building models of large ISPs’
networks. We describe the various aspects important to understanding the routing
inside an AS. We present an open source routing solver, C-BGP, that eases the
investigation of changes in the routing or topology of large networks. We illustrate
how to build a model of an ISP on a real transit network and apply the model on
two “what-if” scenarios. The first scenario studies the impact of changes in the
Internet connectivity of a transit network. The second investigates the impact of failures
in its internal topology.

Authors
B. Quoitin and S. Uhlig
Source
IEEE Network, 19(6), November 2005.
Full text
pdf    (173.22 KB)
Cite it
BibTex
Copyright
See here

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.