One document matched: draft-laouiti-manet-olsr-address-autoconf-00.ps
%!PS-Adobe-3.0
%%Title: draft-laouiti-manet-olsr-address-autoconf-00.txt
%%For: Anis LAOUITI
%%Creator: a2ps version 4.13
%%CreationDate: Mon Feb 14 12:09:43 2005
%%BoundingBox: 24 24 571 818
%%DocumentData: Clean7Bit
%%Orientation: Landscape
%%Pages: 7
%%PageOrder: Ascend
%%DocumentMedia: A4 595 842 0 () ()
%%DocumentNeededResources: font Courier
%%+ font Courier-Bold
%%+ font Courier-BoldOblique
%%+ font Courier-Oblique
%%+ font Helvetica
%%+ font Helvetica-Bold
%%+ font Symbol
%%+ font Times-Bold
%%+ font Times-Roman
%%DocumentProcessColors: Black
%%DocumentSuppliedResources: procset a2ps-a2ps-hdr
%%+ procset a2ps-black+white-Prolog
%%+ encoding ISO-8859-1Encoding
%%EndComments
/a2psdict 200 dict def
a2psdict begin
%%BeginProlog
%%Copyright: (c) 1988, 89, 90, 91, 92, 93 Miguel Santana
%%Copyright: (c) 1995, 96, 97, 98 Akim Demaille, Miguel Santana
% Check PostScript language level.
/languagelevel where {
pop /gs_languagelevel languagelevel def
} {
/gs_languagelevel 1 def
} ifelse
% EPSF import as in the Red Book
/BeginInclude {
/b4_Inc_state save def % Save state for cleanup
/dict_count countdictstack def % Count objects on dict stack
/op_count count 1 sub def % Count objects on operand stack
userdict begin
0 setgray 0 setlinecap
1 setlinewidth 0 setlinejoin
10 setmiterlimit [ ] 0 setdash newpath
gs_languagelevel 1 ne {
false setstrokeadjust false setoverprint
} if
} bind def
/EndInclude {
count op_count sub { pos } repeat % Clean up stacks
countdictstack dict_count sub { end } repeat
b4_Inc_state restore
} bind def
/BeginEPSF {
BeginInclude
/showpage { } def
} bind def
/EndEPSF {
EndInclude
} bind def
% Page prefeed
/page_prefeed { % bool -> -
statusdict /prefeed known {
statusdict exch /prefeed exch put
} {
pop
} ifelse
} bind def
/deffont {
findfont exch scalefont def
} bind def
/reencode_font {
findfont reencode 2 copy definefont pop def
} bind def
% Function c-show (str => -)
% centers text only according to x axis.
/c-show {
dup stringwidth pop
2 div neg 0 rmoveto
show
} bind def
% Function l-show (str => -)
% prints texts so that it ends at currentpoint
/l-show {
dup stringwidth pop neg
0
rmoveto show
} bind def
% center-fit show (str w => -)
% show centered, and scale currentfont so that the width is less than w
/cfshow {
exch dup stringwidth pop
% If the title is too big, try to make it smaller
3 2 roll 2 copy
gt
{ % if, i.e. too big
exch div
currentfont exch scalefont setfont
} { % ifelse
pop pop
}
ifelse
c-show % center title
} bind def
% Return the y size of the current font
% - => fontsize
/currentfontsize {
currentfont /FontMatrix get 3 get 1000 mul
} bind def
% reencode the font
% <encoding-vector> <fontdict> -> <newfontdict>
/reencode { %def
dup length 5 add dict begin
{ %forall
1 index /FID ne
{ def }{ pop pop } ifelse
} forall
/Encoding exch def
% Use the font's bounding box to determine the ascent, descent,
% and overall height; don't forget that these values have to be
% transformed using the font's matrix.
% We use `load' because sometimes BBox is executable, sometimes not.
% Since we need 4 numbers an not an array avoid BBox from being executed
/FontBBox load aload pop
FontMatrix transform /Ascent exch def pop
FontMatrix transform /Descent exch def pop
/FontHeight Ascent Descent sub def
% Define these in case they're not in the FontInfo (also, here
% they're easier to get to.
/UnderlinePosition 1 def
/UnderlineThickness 1 def
% Get the underline position and thickness if they're defined.
currentdict /FontInfo known {
FontInfo
dup /UnderlinePosition known {
dup /UnderlinePosition get
0 exch FontMatrix transform exch pop
/UnderlinePosition exch def
} if
dup /UnderlineThickness known {
/UnderlineThickness get
0 exch FontMatrix transform exch pop
/UnderlineThickness exch def
} if
} if
currentdict
end
} bind def
% Function print line number (<string> # -)
/# {
gsave
sx cw mul neg 2 div 0 rmoveto
f# setfont
c-show
grestore
} bind def
% -------- Some routines to enlight plain b/w printings ---------
% Underline
% width --
/dounderline {
currentpoint
gsave
moveto
0 currentfont /Descent get currentfontsize mul rmoveto
0 rlineto
stroke
grestore
} bind def
% Underline a string
% string --
/dounderlinestring {
stringwidth pop
dounderline
} bind def
/UL {
/ul exch store
} bind def
% Draw a box of WIDTH wrt current font
% width --
/dobox {
currentpoint
gsave
newpath
moveto
0 currentfont /Descent get currentfontsize mul rmoveto
dup 0 rlineto
0 currentfont /FontHeight get currentfontsize mul rlineto
neg 0 rlineto
closepath
stroke
grestore
} bind def
/BX {
/bx exch store
} bind def
% Box a string
% string --
/doboxstring {
stringwidth pop
dobox
} bind def
%
% ------------- Color routines ---------------
%
/FG /setrgbcolor load def
% Draw the background
% width --
/dobackground {
currentpoint
gsave
newpath
moveto
0 currentfont /Descent get currentfontsize mul rmoveto
dup 0 rlineto
0 currentfont /FontHeight get currentfontsize mul rlineto
neg 0 rlineto
closepath
bgcolor aload pop setrgbcolor
fill
grestore
} bind def
% Draw bg for a string
% string --
/dobackgroundstring {
stringwidth pop
dobackground
} bind def
/BG {
dup /bg exch store
{ mark 4 1 roll ] /bgcolor exch store } if
} bind def
/Show {
bg { dup dobackgroundstring } if
ul { dup dounderlinestring } if
bx { dup doboxstring } if
show
} bind def
% Function T(ab), jumps to the n-th tabulation in the current line
/T {
cw mul x0 add
bg { dup currentpoint pop sub dobackground } if
ul { dup currentpoint pop sub dounderline } if
bx { dup currentpoint pop sub dobox } if
y0 moveto
} bind def
% Function n: move to the next line
/n {
/y0 y0 bfs sub store
x0 y0 moveto
} bind def
% Function N: show and move to the next line
/N {
Show
/y0 y0 bfs sub store
x0 y0 moveto
} bind def
/S {
Show
} bind def
%%BeginResource: procset a2ps-a2ps-hdr 2.0 2
%%Copyright: (c) 1988, 89, 90, 91, 92, 93 Miguel Santana
%%Copyright: (c) 1995, 96, 97, 98 Akim Demaille, Miguel Santana
% Function title: prints page header.
% <ct> <rt> <lt> are passed as argument
/title {
% 1. Draw the background
x v get y v get moveto
gsave
0 th 2 div neg rmoveto
th setlinewidth
0.95 setgray
pw 0 rlineto stroke
grestore
% 2. Border it
gsave
0.7 setlinewidth
pw 0 rlineto
0 th neg rlineto
pw neg 0 rlineto
closepath stroke
grestore
% stk: ct rt lt
x v get y v get th sub 1 add moveto
%%IncludeResource: font Helvetica
fHelvetica fnfs 0.8 mul scalefont setfont
% 3. The left title
gsave
dup stringwidth pop fnfs 0.8 mul add exch % leave space took on stack
fnfs 0.8 mul hm rmoveto
show % left title
grestore
exch
% stk: ct ltw rt
% 4. the right title
gsave
dup stringwidth pop fnfs 0.8 mul add exch % leave space took on stack
dup
pw exch stringwidth pop fnfs 0.8 mul add sub
hm
rmoveto
show % right title
grestore
% stk: ct ltw rtw
% 5. the center title
gsave
pw 3 1 roll
% stk: ct pw ltw rtw
3 copy
% Move to the center of the left room
sub add 2 div hm rmoveto
% What is the available space in here?
add sub fnfs 0.8 mul sub fnfs 0.8 mul sub
% stk: ct space_left
%%IncludeResource: font Helvetica-Bold
fHelvetica-Bold fnfs scalefont setfont
cfshow
grestore
} bind def
% Function border: prints virtual page border
/border { %def
gsave % print four sides
0 setgray
x v get y v get moveto
0.7 setlinewidth % of the square
pw 0 rlineto
0 ph neg rlineto
pw neg 0 rlineto
closepath stroke
grestore
} bind def
% Function water: prints a water mark in background
/water { %def
gsave
scx scy moveto rotate
%%IncludeResource: font Times-Bold
fTimes-Bold 100 scalefont setfont
.97 setgray
dup stringwidth pop 2 div neg -50 rmoveto
show
grestore
} bind def
% Function rhead: prints the right header
/rhead { %def
lx ly moveto
fHelvetica fnfs 0.8 mul scalefont setfont
l-show
} bind def
% Function footer (cf rf lf -> -)
/footer {
fHelvetica fnfs 0.8 mul scalefont setfont
dx dy moveto
show
snx sny moveto
l-show
fnx fny moveto
c-show
} bind def
%%EndResource
%%BeginResource: procset a2ps-black+white-Prolog 2.0 1
% Function T(ab), jumps to the n-th tabulation in the current line
/T {
cw mul x0 add y0 moveto
} bind def
% Function n: move to the next line
/n { %def
/y0 y0 bfs sub store
x0 y0 moveto
} bind def
% Function N: show and move to the next line
/N {
Show
/y0 y0 bfs sub store
x0 y0 moveto
} bind def
/S {
Show
} bind def
/p {
false UL
false BX
fCourier bfs scalefont setfont
Show
} bind def
/sy {
false UL
false BX
fSymbol bfs scalefont setfont
Show
} bind def
/k {
false UL
false BX
fCourier-Oblique bfs scalefont setfont
Show
} bind def
/K {
false UL
false BX
fCourier-Bold bfs scalefont setfont
Show
} bind def
/c {
false UL
false BX
fCourier-Oblique bfs scalefont setfont
Show
} bind def
/C {
false UL
false BX
fCourier-BoldOblique bfs scalefont setfont
Show
} bind def
/l {
false UL
false BX
fHelvetica bfs scalefont setfont
Show
} bind def
/L {
false UL
false BX
fHelvetica-Bold bfs scalefont setfont
Show
} bind def
/str{
false UL
false BX
fTimes-Roman bfs scalefont setfont
Show
} bind def
/e{
false UL
true BX
fHelvetica-Bold bfs scalefont setfont
Show
} bind def
%%EndResource
%%EndProlog
%%BeginSetup
%%IncludeResource: font Courier
%%IncludeResource: font Courier-Oblique
%%IncludeResource: font Courier-Bold
%%IncludeResource: font Times-Roman
%%IncludeResource: font Symbol
%%IncludeResource: font Courier-BoldOblique
%%BeginResource: encoding ISO-8859-1Encoding
/ISO-8859-1Encoding [
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/space /exclam /quotedbl /numbersign /dollar /percent /ampersand /quoteright
/parenleft /parenright /asterisk /plus /comma /minus /period /slash
/zero /one /two /three /four /five /six /seven
/eight /nine /colon /semicolon /less /equal /greater /question
/at /A /B /C /D /E /F /G
/H /I /J /K /L /M /N /O
/P /Q /R /S /T /U /V /W
/X /Y /Z /bracketleft /backslash /bracketright /asciicircum /underscore
/quoteleft /a /b /c /d /e /f /g
/h /i /j /k /l /m /n /o
/p /q /r /s /t /u /v /w
/x /y /z /braceleft /bar /braceright /asciitilde /.notdef
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef /.notdef
/space /exclamdown /cent /sterling /currency /yen /brokenbar /section
/dieresis /copyright /ordfeminine /guillemotleft /logicalnot /hyphen /registered /macron
/degree /plusminus /twosuperior /threesuperior /acute /mu /paragraph /bullet
/cedilla /onesuperior /ordmasculine /guillemotright /onequarter /onehalf /threequarters /questiondown
/Agrave /Aacute /Acircumflex /Atilde /Adieresis /Aring /AE /Ccedilla
/Egrave /Eacute /Ecircumflex /Edieresis /Igrave /Iacute /Icircumflex /Idieresis
/Eth /Ntilde /Ograve /Oacute /Ocircumflex /Otilde /Odieresis /multiply
/Oslash /Ugrave /Uacute /Ucircumflex /Udieresis /Yacute /Thorn /germandbls
/agrave /aacute /acircumflex /atilde /adieresis /aring /ae /ccedilla
/egrave /eacute /ecircumflex /edieresis /igrave /iacute /icircumflex /idieresis
/eth /ntilde /ograve /oacute /ocircumflex /otilde /odieresis /divide
/oslash /ugrave /uacute /ucircumflex /udieresis /yacute /thorn /ydieresis
] def
%%EndResource
% Initialize page description variables.
/sh 595 def
/sw 842 def
/llx 24 def
/urx 818 def
/ury 571 def
/lly 24 def
/#copies 1 def
/th 15.000000 def
/fnfs 11 def
/bfs 8.005733 def
/cw 4.803440 def
% Dictionary for ISO-8859-1 support
/iso1dict 8 dict begin
/fCourier ISO-8859-1Encoding /Courier reencode_font
/fCourier-Bold ISO-8859-1Encoding /Courier-Bold reencode_font
/fCourier-BoldOblique ISO-8859-1Encoding /Courier-BoldOblique reencode_font
/fCourier-Oblique ISO-8859-1Encoding /Courier-Oblique reencode_font
/fHelvetica ISO-8859-1Encoding /Helvetica reencode_font
/fHelvetica-Bold ISO-8859-1Encoding /Helvetica-Bold reencode_font
/fTimes-Bold ISO-8859-1Encoding /Times-Bold reencode_font
/fTimes-Roman ISO-8859-1Encoding /Times-Roman reencode_font
currentdict end def
/bgcolor [ 0 0 0 ] def
/bg false def
/ul false def
/bx false def
% The font for line numbering
/f# /Helvetica findfont bfs .6 mul scalefont def
/fSymbol /Symbol findfont def
/hm fnfs 0.25 mul def
/pw
cw 81.400000 mul
def
/ph
501.959430 th add
def
/pmw urx llx sub pw 2 mul sub 1 div def
/pmh 0 def
/v 0 def
/x [
0
dup pmw add pw add
] def
/y [
pmh ph add 0 mul ph add
dup
] def
/scx sw 2 div def
/scy sh 2 div def
/snx urx def
/sny lly 2 add def
/dx llx def
/dy sny def
/fnx scx def
/fny dy def
/lx snx def
/ly ury fnfs 0.8 mul sub def
/sx 0 def
/tab 8 def
/x0 0 def
/y0 0 def
%%EndSetup
%%Page: (1-2) 1
%%BeginPageSetup
/pagesave save def
sh 0 translate 90 rotate
%%EndPageSetup
iso1dict begin
gsave
llx lly 12 add translate
/v 0 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
() p n
() N
() N
() N
() N
() N
(INTERNET-DRAFT Cedric Adjih) N
(IETF MANET Working Group Saadi Boudjit) N
(Expiration: 14 August 2005 Philippe Jacquet) N
( Anis Laouiti) N
( Paul Muhlethaler) N
() N
( INRIA Rocquencourt, France) N
( 14 February 2005) N
() N
( Address autoconfiguration in Optimized Link State Routing Protocol) N
() N
() N
( draft-laouiti-manet-olsr-address-autoconf-00.txt) N
() N
(Status of this Memo) N
() N
( This document is an Internet-Draft and is subject to all provisions) N
( of section 3 of RFC 3667. By submitting this Internet-Draft, the) N
( authors certify that any applicable patent or other IPR claims of) N
( which they are aware have been or will be disclosed, and any of which) N
( they become aware will be disclosed, in accordance with RFC 3668.) N
() N
( Internet-Drafts are working documents of the Internet Engineering) N
( Task Force \(IETF\), its areas, and its working groups. Note that) N
( other groups may also distribute working documents as Internet-) N
( Drafts.) N
() N
( Internet-Drafts are draft documents valid for a maximum of six months) N
( and may be updated, replaced, or obsoleted by other documents at any) N
( time. It is inappropriate to use Internet-Drafts as reference) N
( material or to cite them other than as "work in progress.") N
() N
( The list of current Internet-Drafts can be accessed at) N
( http://www.ietf.org/ietf/1id-abstracts.txt.) N
( The list of Internet-Draft Shadow Directories can be accessed at) N
( http://www.ietf.org/shadow.html.) N
() N
(Copyright Notice) N
() N
( Copyright\(C\)The Internet Society \(2005\).) N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 1]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 1/13) (Feb 14, 05 11:57) title
border
/v 1 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
(Abstract) N
() N
( One of the MANET protocols which have been recently promoted to) N
( experimental RFC is the OLSR routing protocol[3]. This document aims) N
( at complementing the OLSR routing protocol specifications to handle) N
( autoconfiguration. The corner stone of this autoconfiguration) N
( protocol is an advanced duplicate address detection algorithm. We) N
( propose a comprehensive autoconfiguration scheme whose basic idea is) N
( to avoid conflicts in the 2-hop neighborhood of each node. We have) N
( designed two algorithms to perform this task. These algorithms are) N
( shown to work in any case of multiple conflicts, especially during) N
( network mergers.) N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 2]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 2/13) (Feb 14, 05 11:57) title
border
grestore
(Printed by Anis LAOUITI) rhead
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (1/7) (Monday February 14, 2005) footer
end % of iso1dict
pagesave restore
showpage
%%Page: (3-4) 2
%%BeginPageSetup
/pagesave save def
sh 0 translate 90 rotate
%%EndPageSetup
iso1dict begin
gsave
llx lly 12 add translate
/v 0 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
(Table of Contents) N
() N
(1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . 4) N
(2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . . . 4) N
(3. Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5) N
(4. Duplicate address detection and MAD message description . . . . . 6) N
(5. Duplicate Address Detection mechanism . . . . . . . . . . . . . . 7) N
(5.1. First algorithm . . . . . . . . . . . . . . . . . . . . . . . . 7) N
(5.1.1. First rule . . . . . . . . . . . . . . . . . . . . . . . . . 7) N
(5.1.2. Second rule . . . . . . . . . . . . . . . . . . . . . . . . . 7) N
(5.1.3. Full algorithm . . . . . . . . . . . . . . . . . . . . . . . 7) N
(5.2. Second algorithm . . . . . . . . . . . . . . . . . . . . . . . 9) N
(6. Address assignment . . . . . . . . . . . . . . . . . . . . . . . 11) N
(7. Pool of addresses . . . . . . . . . . . . . . . . . . . . . . . . 11) N
(8. Resolution of a conflict . . . . . . . . . . . . . . . . . . . . 11) N
(9. Security Considerations . . . . . . . . . . . . . . . . . . . . . 11) N
(10. Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 12) N
(11. References . . . . . . . . . . . . . . . . . . . . . . . . . . . 13) N
(12. Full Copyright Statement . . . . . . . . . . . . . . . . . . . . 13) N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 3]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 3/13) (Feb 14, 05 11:57) title
border
/v 1 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
() N
() N
(1. Introduction) N
() N
( Mobile Ad hoc NETworks \(MANETs\) are infrastructure-free, highly) N
( dynamic wireless networks, where central administration or configura-) N
( tion by the user is very difficult. In hardwired networks nodes usu-) N
( ally rely on a centralized server and use a dynamic host configura-) N
( tion protocol, like DHCP[1], to acquire an IP address. Such a solu-) N
( tion cannot be deployed in MANETs due to the unavailability of any) N
( centralized DHCP server. For small scale MANETs, it may be possible) N
( to allocate free IP addresses manually.) N
() N
( However, the procedure becomes impractical for a large-scale or open) N
( system where mobile nodes are free to join and leave. Most of the) N
( autoconfiguration algorithms proposed for ad hoc networks are inde-) N
( pendent of the routing protocols and therefore, generate a signifi-) N
( cant overhead. Using the genuine optimization of the underlying) N
( routing protocol can significantly reduce the autoconfiguration over-) N
( head.) N
() N
( Research on automatic configuration of IP addresses for MANET is rel-) N
( atively less frequent. The IPv6 and ZEROCONF working groups of the) N
( IETF deal with autoconfiguration issues but with a focus on wired) N
( networks. Automatic address allocation is more difficult in a MANET) N
( environment than in wired networks due to instability of links,) N
( mobility of the nodes, the open nature of the mobile ad hoc networks,) N
( and lack of central administration in the general case. Thus per-) N
( forming a DAD \(Duplicate Address Detection\) generates more complexity) N
( and more overhead in ad hoc networks than in wired networks where) N
( protocols such as DHCP[1] and SAA [2] can be used.) N
() N
( In this document we will describe an autoconfiguration solution for) N
( the OLSR protocol. This solution is based on an efficient Duplicate) N
( Address Detection \(DAD\) algorithm which takes advantage of the gen-) N
( uine optimization of the OLSR protocol. We actually propose two) N
( solutions to handle multiple address conflicts. They have the same) N
( main basic idea which is to ensure the absence of conflicts in the) N
( 2-hop neighborhood of each node.) N
() N
(2. Terminology) N
() N
( The keywords "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",) N
( "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this) N
( document are to be interpreted as described in RFC2119 [5].) N
() N
( For the OLSR description and terminology, the reader should refer to) N
( the OLSR RFC [3].) N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 4]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 4/13) (Feb 14, 05 11:57) title
border
grestore
(Printed by Anis LAOUITI) rhead
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (2/7) (Monday February 14, 2005) footer
end % of iso1dict
pagesave restore
showpage
%%Page: (5-6) 3
%%BeginPageSetup
/pagesave save def
sh 0 translate 90 rotate
%%EndPageSetup
iso1dict begin
gsave
llx lly 12 add translate
/v 0 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
(3. Overview) N
() N
( Our proposed autoconfiguration algorithm is based on two steps. In) N
( the first step, an IP address is selected by the arriving node and) N
( this latter can join the ad hoc network. Numerous schemes can be) N
( used to select this IP address for instance the node can perform a) N
( random selection; another technique is that a neighbor node selects) N
( this IP address for the arriving node.) N
() N
( After this first step has been performed, the second step can take) N
( place. The aim of this step is to detect potential address duplica-) N
( tions on run. To perform this task a DAD algorithm is started on) N
( this newly configured node. This DAD algorithm allows the newly con-) N
( figured node to state whether the selected address is duplicated or) N
( not in a proactive manner. If such a case occurs, a node can change) N
( its address with respect to some specified criteria.) N
() N
() N
( In such a case a new address can be chosen. The DAD algorithm uses a) N
( special control packet called MAD for ``Multiple Address Declara-) N
( tion''. This control packet includes the node address and a node) N
( identifier. This packet is broadcast in the network, thus all the) N
( network nodes must receive this packet. The duplicate detection uses) N
( the node identifier. If a node receives an MAD message with a dif-) N
( ferent identifier than its own, an address duplication is detected.) N
( To spare the channel bandwidth the MAD packet should be broadcasted) N
( using the MPR flooding.) N
() N
() N
( On the other hand, duplicated addresses may be the origin of MPR) N
( election and flooding corruption, which may induce errors in packet) N
( delivery, particularly the MAD packets. Consequently, we need first) N
( to ensure the MPR election from those conflictual situations. We) N
( propose two algorithms to achieve this task:) N
() N
( 1 In first algorithm, we suggest to ignore the MPR mechanism for) N
( the first hop, and relay each originated MAD message by all) N
( the neighbors to the 2-hop neighbors. In this manner possible) N
( address conflict could be detected and resolved. The direct) N
( consequence is that the MPR set will be fixed.) N
() N
( 2 In the second one, we propose to modify the OLSR Hello mes-) N
( sages and the MPR election algorithm. The calculation will be) N
( based on the address and the node identifier to guarantee the) N
( uniqueness of the direct neighbors and the 2-hop neighbors.) N
( This leads to a correct MPR set, hence,we are sure that the) N
( MAD messages reach all the nodes.) N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 5]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 5/13) (Feb 14, 05 11:57) title
border
/v 1 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
( In the sequel we first present the MAD message used to detect the) N
( address conflict. Then, we introduce the two proposed DAD algorithms) N
( tailored for OLSR protocol. And, finally we give some address) N
( assignment and conflict resolution issues.) N
() N
() N
(4. Duplicate address detection and MAD message description) N
() N
( In order to detect address conflicts, each node diffuses periodically) N
( a special message that we call a MAD for ``Multiple Address Declara-) N
( tion'' to the entire network[5]. This control packet includes the) N
( node addresses and the node identifier. The node identifier is a) N
( sequence of bits of fixed length L which is randomly generated.) N
( Hence we are using the standard idea that the probability of two) N
( nodes having the same node identifier is low, and the probability of) N
( at least one address collision with N nodes, which is the well known) N
( ``birthday problem'', can be set arbitrarily low by choosing a large) N
( enough value of L \(eight bytes are enough to code the random identi-) N
( fier if we consider a network with a maximum of 10000 nodes [4]\).) N
( The MAD message format is depicted in the following figure.) N
() N
() N
( 0 1 2 3) N
( 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1) N
() N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | |) N
( | Originator node identifier |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | OLSR Interface Address |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | OLSR Interface Address |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | ... |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
() N
() N
( A node detects an address conflict when it receives an MAD message) N
( having the same address as its own, but with a different identifier.) N
( These situations may happen during network mergers. Actually other) N
( nodes will detect the conflict. These nodes could announce the con-) N
( flict using a special control message. However this approach may) N
( induce broadcast storm since many nodes may announce the conflict and) N
( special care must be taken to avoid this effect. For that reason we) N
( do not recommend this way. An efficient manner to notify the address) N
( duplication to the nodes in conflict, consists in allowing the MAD) N
( packets to reach all the nodes in the network. To save the channel) N
( bandwidth the MAD packets should be broadcasted using the MPR) N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 6]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 6/13) (Feb 14, 05 11:57) title
border
grestore
(Printed by Anis LAOUITI) rhead
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (3/7) (Monday February 14, 2005) footer
end % of iso1dict
pagesave restore
showpage
%%Page: (7-8) 4
%%BeginPageSetup
/pagesave save def
sh 0 translate 90 rotate
%%EndPageSetup
iso1dict begin
gsave
llx lly 12 add translate
/v 0 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
( flooding. Actually, applying OLSR relaying optimization rules as) N
( they are defined, may not be sufficient to ensure diffusion in some) N
( conflictual cases.) N
() N
() N
(5. Duplicate Address Detection mechanism) N
() N
( Duplicate addresses are detected by the periodic exchange of MAD mes-) N
( sages. We propose two different algorithms to ensure the delivery of) N
( these messages to the participants in the network in order to dis-) N
( cover these conflicts. The first one suggests to modify the MPR) N
( flooding rules for MAD messages diffusion. Where in the second one,) N
( we propose to modify the OLSR MPR election, which is done on the) N
( basis of the node identifier and address interface. This guarantee) N
( correct MPR sets, that cover the 2-hop neighbors even in the presence) N
( of duplicate addresses.) N
() N
(5.1. First algorithm) N
() N
( In this first approach we will add rules to the OLSR MPR flooding.) N
() N
() N
(5.1.1. First rule) N
() N
( The property that we will add is actually extremely simple. We) N
( weaken the relaying condition for nodes who are in the 2-hop neigh-) N
( borhood of a node who is sending an MAD message. When these neighbor) N
( nodes receive an MAD message, they must relay the MAD message irre-) N
( spectively of the relaying conditions of the OLSR MPR flooding algo-) N
( rithm. We call this first rule, rule 1.) N
() N
() N
(5.1.2. Second rule) N
() N
( When a node receives an MAD message from a neighbor node with a given) N
( IP address and a given Node-ID, and another MAD message with the same) N
( address but with a different Node-ID, it must relay this latter MAD) N
( message irrespectively of the MPR flooding rules. We call this sec-) N
( ond rule, rule 2.) N
() N
() N
(5.1.3. Full algorithm) N
( Let us recall the assumptions here.) N
() N
( Each node A periodically sends a message M including:) N
() N
( 1 The originator address of A, Orig_A, in the OLSR message) N
( header.) N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 7]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 7/13) (Feb 14, 05 11:57) title
border
/v 1 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
( 2 The message sequence number, mssn, in the OLSR message header.) N
() N
( 3 The node identifier ID_A \(a string of bits\) in the message) N
( itself.) N
() N
( The message is propagated by MPR flooding to the other nodes ; but) N
( for DAD-MPR Flooding, the duplicate table of OLSR is modified, so) N
( that it also includes the node identifier list in the duplicate) N
( tuple. That is, a duplicate tuple, includes the following informa-) N
( tion:) N
() N
( 1 The originator address \(as in OLSR standard duplicate table\).) N
() N
( 2 The message sequence number \(as in OLSR standard duplicate ta-) N
( ble\).) N
() N
( 3 The list of node identifiers.) N
() N
( The detailed algorithm for DAD-MPR Flooding is the following:) N
() N
( 1 When a node receives a message M from node B with originator) N
( Orig_A, with message sequence number mssn, and with node iden-) N
( tifier ID_A, it performs the following tasks:) N
() N
( 1.1 If a duplicate tuple exists with the same originator) N
( Orig_A, the same message sequence number, and ID_A is in) N
( the list of node identifiers, Then, the message is) N
( ignored \(it has already been processed\). The algorithm) N
( stops here.) N
() N
( 1.2 Else one of the following situations occurs :) N
() N
( 1.2.1) N
( A duplicate tuple exists with the same originator) N
( Orig_A and the same message sequence number, but) N
( ID_A is not in the list of node identifiers: then, a) N
( conflict is detected \(address Orig_A is duplicated\).) N
( ID_A is added to the list of node identifiers.) N
() N
( 1.2.2) N
( A duplicate tuple exists with the same originator) N
( Orig_A, but with a different message sequence number) N
( and ID_A is not in the list of node identifiers:) N
( then, a conflict is detected \(address Orig_A is) N
( duplicated\). A duplicate tuple is created with the) N
( originator address, message sequence number and list) N
( of node identifiers containing only ID_A.) N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 8]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 8/13) (Feb 14, 05 11:57) title
border
grestore
(Printed by Anis LAOUITI) rhead
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (4/7) (Monday February 14, 2005) footer
end % of iso1dict
pagesave restore
showpage
%%Page: (9-10) 5
%%BeginPageSetup
/pagesave save def
sh 0 translate 90 rotate
%%EndPageSetup
iso1dict begin
gsave
llx lly 12 add translate
/v 0 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
( 1.2.3) N
( No duplicate tuple exists. A new one is created) N
( with the originator address, message sequence number) N
( and list of node identifiers containing only ID_A.) N
() N
( 1.3 The MAD messages should be relayed if one or more of the) N
( following rules are met:) N
() N
( 1.3.1) N
( The node B is the source of the MAD message i.e. it) N
( has the originator address Orig_A.) N
() N
( 1.3.2) N
( B had chosen this current receiving node as an MPR.) N
() N
( 1.3.3) N
( One of the conflicting nodes is a neighbor of the) N
( node detecting the duplication. In such a case, the) N
( TTL value of the MAD message showing the conflict is) N
( set to one before its retransmission. This also) N
( applies even if the current node has not been) N
( selected as an MPR by the previous message sender.) N
() N
() N
(5.2. Second algorithm) N
() N
( An issue with the previous approach is that the conflicts at 2-hop) N
( neighbors must be resolved before one can be sure that the MAD mes-) N
( sages are successfully transmitted within the entire network. An) N
( ideal property would be that the MAD messages reach all the nodes in) N
( the network irrespectively of potential address duplications. This) N
( property can be achieved if the MPR flooding continues to work in) N
( presence of address duplication. A solution is then to base the) N
( selection of MPR not on addresses but on node identifiers. With the) N
( assumption that node identifiers are globally unique in the network,) N
( one can be sure that there will not be identifier duplications at two) N
( hops of a given node and thus the selection of MPRs will be correct.) N
( This solution can be simply implemented, the selection of the MPRs) N
( must follow the principle defined in the OLSR protocol except that) N
( the base for the selection must be the node identifiers i.e. the) N
( 2-hop coverage must be obtained not on the addresses but on the node) N
( identifiers.) N
() N
( To be able to do so, hello packets must be modified such that the) N
( following information will be given in the hello message :) N
() N
( 1 the node identifier of the originator node of the hello mes-) N
( sage,) N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 9]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 9/13) (Feb 14, 05 11:57) title
border
/v 1 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
( 2 the node identifier of the nodes \(actually the node interface) N
( addresses \) advertised in the hello messages. The modified) N
( Hello message format is specified in the following figure.) N
() N
( 0 1 2 3) N
( 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1) N
() N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | Reserved | Htime | Willingness |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | |) N
( | Originator node identifier |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | Link Code | Reserved | Link Message Size |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | Neighbor Interface Address |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | |) N
( | Neighbor identifier |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-) N
( | Neighbor Interface Address |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | |) N
( | Neighbor identifier |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( : . . . :) N
( : :) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | Link Code | Reserved | Link Message Size |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | Neighbor Interface Address |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | |) N
( | Neighbor identifier |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-) N
( | Neighbor Interface Address |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( | |) N
( | Neighbor identifier |) N
( +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+) N
( : :) N
( : :) N
( \(etc.\)) N
() N
() N
(The drawback of this mechanism is that it introduces a significant extra) N
(overhead.) N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 10]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 10/13) (Feb 14, 05 11:57) title
border
grestore
(Printed by Anis LAOUITI) rhead
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (5/7) (Monday February 14, 2005) footer
end % of iso1dict
pagesave restore
showpage
%%Page: (11-12) 6
%%BeginPageSetup
/pagesave save def
sh 0 translate 90 rotate
%%EndPageSetup
iso1dict begin
gsave
llx lly 12 add translate
/v 0 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
(6. Address assignment) N
() N
( We have two main ways to allocate an address to a newly arriving) N
( node. The first way is to assign this node a random address in the) N
( pool of addresses that can be allocated and then to rely on the DAD) N
( algorithm to discover potential conflicts. The second way is to ask) N
( for the help of a neighbor node. This neighbor will be able to pro-) N
( pose to the newly arriving node a configuration address. Since a) N
( neighbor node must in principle receive the MAD messages of all nodes) N
( in the network, it can maintain a pool of non-affected addresses. A) N
( newly arriving node can choose between these two approaches.) N
() N
() N
() N
(7. Pool of addresses) N
() N
( The pool of addresses could be for local use only. For example, it) N
( could be reserved by the IANA authority for local MANET forwarding \() N
( i.e, those addresses must not be forwarded outside the MANET network,) N
( nor reached from outside\). A second possibility consists in relying) N
( on some machines which will announce the prefix to use for address) N
( autoconfiguration for this MANET network. These machines could be) N
( connected to the internet, and act as gateways. In this case, the) N
( addresses may be global addresses, and could be seen from outside.) N
() N
() N
(8. Resolution of a conflict) N
() N
( When two nodes A1 and A2 are configured with the same IP address and) N
( assuming that there is no packet loss, each of these two nodes will) N
( receive the MAD message of the other node. Thus the nodes where the) N
( conflict lies are bound to discover the conflict. A simple rule to) N
( solve this conflict will be: the node in conflict with the smallest) N
( identifier changes its address. Since this node knows via the recep-) N
( tion of the MAD control messages the already assigned addresses, the) N
( new address must be selected at random among the addresses that are) N
( believed to be free.) N
() N
() N
() N
(9. Security Considerations) N
() N
( This memo does not specify any security considerations.) N
() N
() N
() N
() N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 11]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 11/13) (Feb 14, 05 11:57) title
border
/v 1 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
(10. Authors' Addresses) N
() N
( The authors are listed in alphabetical order.) N
() N
( Cedric Adjih) N
( Project HIPERCOM) N
( INRIA Rocquencourt) N
( BP 105) N
( 78153 Le Chesnay Cedex, France) N
( Phone: +33 1 3963 5215) N
( Email: Cedric.Adjih@inria.fr) N
() N
() N
( Saadi Boudjit) N
( Project HIPERCOM) N
( INRIA Rocquencourt) N
( BP 105) N
( 78153 Le Chesnay Cedex, France) N
( Phone: +33 1 3963 5039) N
( Email: Saadi.Boudjit@inria.fr) N
() N
() N
( Philippe Jacquet) N
( Project HIPERCOM) N
( INRIA Rocquencourt) N
( BP 105) N
( 78153 Le Chesnay Cedex, France) N
( Phone: +33 1 3963 5263) N
( Email: Philippe.Jacquet@inria.fr) N
() N
() N
( Anis Laouiti) N
( Project HIPERCOM) N
( INRIA Rocquencourt) N
( BP 105) N
( 78153 Le Chesnay Cedex, France) N
( Phone: +33 1 3963 5088) N
( Email: Anis.Laouiti@inria.fr) N
() N
() N
( Paul Muhlethaler) N
( Project HIPERCOM) N
( INRIA Rocquencourt) N
( BP 105) N
( 78153 Le Chesnay Cedex, France) N
( Phone: +33 1 3963 5278) N
( Email: Paul.Muhlethaler@inria.fr) N
() N
() N
() N
() N
(Adjih Boudjit Jacquet Laouiti Muhlethaler [Page 12]) N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 12/13) (Feb 14, 05 11:57) title
border
grestore
(Printed by Anis LAOUITI) rhead
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (6/7) (Monday February 14, 2005) footer
end % of iso1dict
pagesave restore
showpage
%%Page: (13) 7
%%BeginPageSetup
/pagesave save def
sh 0 translate 90 rotate
%%EndPageSetup
iso1dict begin
gsave
llx lly 12 add translate
/v 0 store
/x0 x v get 3.362408 add sx cw mul add store
/y0 y v get bfs th add sub store
x0 y0 moveto
(INTERNET-DRAFT Address Autoconfiguration for OLSR 14 February 2005) p n
() N
() N
(11. References) N
() N
() N
() N
([1] R. Droms, Ed.,J. Bound, B. Volz, T. Lemon, C. Perkins, M. Car-) N
( ney, ``Dynamic Host Configuration Protocol for IPv6 \(DHCPv6\)'',) N
( IETF RFC 3315, July 2003.) N
() N
([2] S. Thomson, T. Narten, ``IPv6 Stateless Address Autoconfigura-) N
( tion'', IETF RFC 2462, December 1998.) N
() N
() N
([3] T. Clausen, Ed., P. Jacquet, Ed., Optimized Link State Routing) N
( Protocol. Request for Comments \(Experimental\) 3626, Internet Engi-) N
( neering Task Force, October 2003.) N
() N
() N
([4] S.Boudjit, A. Laouiti, P. Muhlethaler, C. Adjih, "Duplicate) N
( address detection and autoconfiguration in OLSR", INRIA Research) N
( Report-5475, Jan 2005.) N
() N
() N
([5] A. Laouiti, S. Boudjit, P. Minet and C. Adjih, "OLSR for IPv6) N
( networks", Proceedings of Med-Hoc-Net, June 2004,Bodrum, Turkey.) N
() N
() N
() N
() N
(12. Full Copyright Statement) N
() N
( Copyright\(C\)The Internet Society \(2005\). This document is subject to) N
( the rights, licenses and restrictions contained in BCP 78, and except) N
( as set forth therein, the author retains all his rights.) N
() N
( This document and the information contained herein are provided on an) N
( "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE REPRESENTS OR) N
( IS SPONSORED BY \(IF ANY\), THE INTERNET SOCIETY AND THE INTERNET ENGI-) N
( NEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED,) N
( INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE INFOR-) N
( MATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED WARRANTIES) N
( OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.) N
() N
() N
() N
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (Page 13/13) (Feb 14, 05 11:57) title
border
grestore
(Printed by Anis LAOUITI) rhead
(draft-laouiti-manet-olsr-address-autoconf-00.txt) (7/7) (Monday February 14, 2005) footer
end % of iso1dict
pagesave restore
showpage
%%Trailer
end
%%EOF
| PAFTECH AB 2003-2026 | 2026-04-23 17:32:59 |