A Secure Mechanism for Address Block Allocation and Distribution
Fri, 02/22/2008 - 13:48 by Damien Leroy • Categories:
Abstract
All equipments attached to the Internet are configured with one or several IP addresses. Most hosts are able to automatically request (e.g., from a DHCP server) or discover (e.g., by using stateless autoconfiguration) the IP address that they should use. This simplifies the configuration and the management of hosts. Unfortunately, these techniques do not apply on routers whose IP addresses and subnet prefixes for their directly attached LANs still need to be manually configured. This utilization of manual configuration is error-prone and a frequent source of errors. It is also one of the reasons why IP address renumbering is so difficult with both IPv4 and IPv6. In this paper, we propose a new address block allocation and distribution protocol that has been designed to be both secure and efficient. We first summarize the main requirements of an address block allocation mechanism. We then describe the operation of our proposed mechanism. Finally, we demonstrate the efficiency of our protocol by simulations.
- Authors
- Damien Leroy and Olivier Bonaventure
- Source
- In Amitabha Das, Francis Bu Sung Lee, Hung Keng Pung, and Lawrence Wai Choong Wong, editor,
Proc. IFIP Networking , pages 748-755, Singapore, May 2008. Springer Verlag.
- Full text
-
(706.28 KB) - Slides
-
(2.2 MB) - 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.