Link-State Routing Optimization for Compound Autonomous Systems in the Internet
Tue, 09/04/2012 - 11:53 by Juan Antonio Cordero
Abstract
This manuscript addresses the coexistence of planned and spontaneous interconnected networks in the Internet core. In this realm, the focus is on routing within a specific type of Autonomous System (AS) called compound AS, which contains both wireless ad hoc networks and wired fixed networks. The approach studied in this manuscript is to enhance existing Interior Gateway Protocols (IGPs), typically based on the link-state algorithm, in order to enable them to operate both in ad hoc networks and in wired networks.
The manuscript thus analyzes the use of link-state routing in ad hoc networks. Based on this analysis, different techniques are proposed and theoretically evaluated, aiming at optimizing the performance of link state routing in a compound AS.
The manuscript then investigates the impact of these techniques when applied to OSPF, one of the main IGPs used in the Internet. The performance of OSPF extensions on MANETs using the studied techniques are compared via simulations. Finally, OSPF operation over compound internetworks is evaluated via experiments on a testbed.
- Authors
- Juan Antonio Cordero
- Type
- PhD thesis
- Source
- École Polytechnique (France), September 2011.
- 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.