WPCz~
2BQZ)Helv 10pt (AC)#|M|X2PP"^,44Xp(88T,4,TXXXXXXXXXX00Xhltth`|x,ThXxhlh\tddhd P,t0'sP2" CWECover Page: Workshop Editor:IA6' - #2P+P#Workshop Editor: #2P+P#Fig CdO8
9#P2P3P#
*
#X2PP#NoteNote (10pt), "[]" Delimited[" and "]"|5F
H"#`oq P}m)P#Note:#`oq P}m)P#X[](#
#X2PP#NedEditor's Note (10pt)th full tabs0gN
?Editor's Note:(#
2" T|Ned3Editor's Note (10pt), Level 3, "[]" DelimitedtimesR9
?` ` Editor's Note:)[](#
Ned4Editor's Note (10pt), Level 4, "[]" Delimitedtimes[
?` ` Editor's Note:h.[](#
Ned2Editor's Note (10pt), Level 2, "[]" DelimitediceI8
7=
?` ` Editor's Note:hh$[](#h
Ned1Editor's Note (10pt), Level 1, "[]" Delimitedce@4
?Editor's Note:` [](#
2s
T
>
N
Y
TblTable using Table Feature C(1'
[#P2P3P#
*#P2P3P#LrnList of References: Number
)
l
~JX[]LrcList of Referencec: ContainerNP#X2PP#X` hp x (#%'0*,.8135@8:"(#m List Item(Lb)
Y
X(#
a2LiIp>"(#m List Item(Lb))c
XI. (#
LndList of Names: Description'}:D'#X2PP#
#X2PP#LncContainer for a List of NamesX` hp x (#%'0*,.8135@8:"(#m #X2PP#Ѳ a) 1) a) 1) a) 1) a) 1)LiIp>"(#m LiIp>"(#m #X2PP#a3LiIp>"(#m List Item(Lb)X
` ` #(#`
a4LiIp>"(#m List Item(Lb)2Y
` ` #A. (#`
LbOList Outline: Bullets'c:?'#X2PP##X2PP#2-q-k ta1LbIList Item: Bulletse
X (#
a2LbIList Item: BulletsY
X(#
EquEquation using Equation Feature2ԫ
#X2PP# 1dddddddd(1)1dddddddd(1)
#X2PP# 1dddddddd(1)1dddddddd(1) a4LbIList Item: Bullets}X
` ` #(#`
2ez_}\a3LbIList Item: BulletswLX
` ` # (#`
a5LbIList Item: Bullets$u
` ` #, (#
a6LbIList Item: Bullets
` ` #,(#
a7LbIList Item: Bullets-[#
` ` #,` 4- (#
2} a8LbIList Item: Bullets'E'#
` ` #,` 4(#
a5LiIp>"(#m List Item(Lb)
` ` #,(#
a7LiIp>"(#m List Item(Lb)'F3#
` ` #,` 4(#
ASNASN Definition -'
#d6X@8;f@#N
N#d6X@8;f@#2 !"#$LnnList of Names: Name!?Ca'
X
#&d2PNe&P##&d2PNe&P#FwTDPar
Foreword"RG,A'0*0*0*WԆ#2P+P#Foreword
#X2PP#
#X2PP#CPCCover Page: SIG Chair#c8u'Y , #2P+P#SIG Chair:` ` "
#2P+P#CPT1Cover Page: Title: Stable/Working$:z'#2P->P# #2P->P#2)% &a#'&((H1Heading, Clause, Numbered Level 1%H
W#7o> P+P#X` hp x (#%'0*,.8135@8: P+P#H2Heading, Clause, Numbered Level 2&HPj]
W#xo> P+P#X` hp x (#%'0*,.8135@8: P+P#H3Heading, Clause, Numbered Level 3'HF
P#po> P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#ppCPT2Cover Page: Title: Part 2(V
6'#2P->P#Implementation
Agreements for Open Systems
Interconnection Protocols:
#2P->P#2-)
**9++I,,^a-AbsAbstract)"'PԆ^&#Xl2P0gXP#Abstractă
X#X2PP#
#X2PP#LoFList of Figures*ֆ?'0*0*0*W2#2P+P#List of Figures#X2PP#у
,
%
#X2PP#H0Heading, Part, Unnumbered Level 0+'
P+P#Part
#7o> P+P#EbEmphasis: Bold,%'28-4-.%0/004NoONote Outline-$U
H#TD4PP#XNOTES(#
I. A. 1. a.(1)(a) i) a) 1 NoI#P2P3
P#Ѳ 1 1 NoINoI#
P2P3
P#ParParagraph: Untitled, Unnumbereded).(H'
#X2PP#
#X2PP#HanNext Annex (normative)/'
0*0*0*yxdddy
Y H #7o> P+P#X` hp x (#%'0*,.8135@8: P+P#HaiNext Annex (informative)0
0*0*0*yxdddy
Y H #7o> P+P#X` hp x (#%'0*,.8135@8: P+P#2=192^93948<a1NoINote Item1)
XI. (#
EiEmphasis: Italics2N%j'H4Heading, Clause, Numbered Level 43HbEv
L#&d2PNe&P#X` hp x (#%'0*,.8135@8:6@7A8EH5Heading, Clause, Numbered Level 55Im̨
H#\o> PP#X` hp x (#%'0*,.8135@8: PP# HAOpen Annexes6U I. A. 1. a.(1)(a) i) a) A .1 .1 .1 .1 .1 .1 .1 OPn ChapterOpen New ParterNew Chapter7+
3'3'Standard3' IIj"Z
l"3'StandardHPLASEII.PRSx
(X` hp x (#%'0*,.8135@8: P0gXP#ă^ I. A. 1. a.(1)(a) i) a) 1 .1 .1 .1 .1 .1 .1 .1 =#X2PP#a6LiIp>"(#m List Item(Lb)8;0%
` ` %1. (#
2EI9E:F;G<
8Ha8LiIp>"(#m List Item(Lb)9DC#
` ` %` -a. (#
NtTutorial Note:|'
H#TD4PP#XTutorial Note #P2P3
P#(#
#
P2P3
P#FnFootnote;''#P2P3
P##
P2P3
P#TtTable Title<_/`'H#X2PP#D&Table &
*#X2PP#2LM=wI>aJ?>K@ELTldTable using Line Draw=C[&(!'
L#d
@l;f@#
*#d
@l;f@#FldFigure using Line Draw>CmZ'
G#d
@l;f@##d
@l;f@#TTcTable Title (continued part)?VZ2T'J>:#X2PP#Table (continued)
*#X2PP#TTfTable Title (final part)@Vb2'J/$#X2PP#Table (concluded)
*
#X2PP#2VA~MBSNCQDSTTiTable Title (initial part)AIh
'H#X2PP#&Table &
#X2PP#P2Paragraph: Untitled, Numbered Level 2Bi8>U
W#xo> P+P#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: PP#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#PiIndented ParagraphK3`g'
#X2PP#X(#
#X2PP#a2NoINote ItemLr>4A.2fM%aNaOdPeBNFBNF DiagramM't|'#d6X@8;
f@##
d6X@8;
f@#ToCTable of ContentsNY10*0*0*0*0*0*ԒW"#2P+P#Table of Contents#\o> PP#у
, X` hp x (#%'0*,.8135@8: PP#LiNoList Item: NoteOxXb'
H#TD4PP#XNOTE #P2P3
P##
P2P3
P#LiNeList Item: Editor's NotePb'
H#X2PP#XEditor's Note #P2P3
P##
P2P3
P#2mQegRhgSgTlNoParNote Paragraph ExtensionQ
'5
XPParagraph, Untitled, Unnumbered (Use explicit Hrt)R8
#\D4Pa'P#
dd
IndexDocument IndexS{^&x0*0*0*0*0*0*ԒW(#2P+P#Index#P2P3P#у
, X` hp x (#%'0*,.8135@8:2PP u|,dl2pLIdL,xTk2PPH(8N<,+2PP )6N<,e2p*'\8,,\2pd+q%P2(,P2P3Px.K8!,,82P,P!s4ddd,fd6X@8;@e H,$,@H2P7PhfL,$,͐L2p2
k}Fax~Helv 10pt (AC)Helv 12pt (AC)Helv 12pt Bold (AC)Helv 11pt (AE)Helv 11pt Bold (AE)Helv 30pt (AE)Helv 30pt Bold (AC)Helv 18pt (AE)Helv 14pt (AC)Helv 14pt Bold (AC)Helv 10pt Bold (AC)Helv 9pt (AE)Helv 6pt (AC)Courier 12cpiHelv 8pt (AC)Helv 8pt Bold (AC)
7OP
3'3'Standard3' IIj"Z
l"3'Standardk)HPLASEII.PRS\o> (X` hp x (#%'0*,.8135@8: P0gXP#ă^ I. A. 1. a.(1)(a) i) a) 1 .1 .1 .1 .1 .1 .1 .1 =#X2PP#L#&d2PNe&P##&h2pf26&#PART 3 NETWORK LAYER`6(#]December 1993 (Working)ă
$zCPT1#2P->P#Working$CPT1 #X2PP#(VCPT2#2P->P#Implementation
Agreements for Open Systems
Interconnection Protocols:
?Part 3 Network Layer(
6CPT2
jT#X2PP#UPCPI T` #2PTkP#Output from the December 1993UCPI Open Systems
Environment Implementors' Workshop (OIW)
YN#X2PP##8CPC N, #2P+P#SIG Chair:` ` &Fred Burg, AT&T#uCPC
Y(#X2PP#T}7CPE (- #2P+P#SIG Editor:&Brenda Gray, NISTTiCPE#X2PP#"RGFw(=0*0*0*WԆ#2P+P#Foreword
~J#X2PP#This part of the Working Implementation Agreements was prepared by the Lower Layers Special Interest
Group (LLSIG) of the Open Systems Environment Implementors' Workshop (OIW). See Part 1 Workshop
Policies and Procedures in the "Draft Working Implementation Agreements Document" for the workshop
charter.",AFw
#X2PP#.Par
#X2PP#Text in this part has been approved by the Plenary of the Workshop. This part replaces the previously
existing part on this subject.
.HPar
#X2PP#.Par
#X2PP#Future changes and additions to this version of these Implementor Agreements will be published as a new
part. Deleted and replaced text will be shown as struck. New and replacement text will be shown as shaded..HPar
#X2PP#NToC 0*&&((W:#2P+P#Table of Contents#\o> PP#у
, X` hp x (#%'0*,.8135@8: P+P#Part 3 Network LayerR"+ P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8:'H3(#p
#X2PP#pX` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8:"(#m #X2PP#+Gca2LiI
Xa) NPDUs shall be scheduled based on the priority functions of ISO 8473. The scheduling
algorithm for achieving this priority function is left as a local matter. It is required that the following
constraints be met as described below:H+Ga2LiI(#
+Ga4LiI
` ` 1) An NPDU of lower priority shall not overtake an NPDU of higher priority in an
intermediate system (i.e., exit an IS ahead of a higher priority NPDU arriving before it);I+GYa4LiI(#`
+Ga4LiI
~J` ` 2) A minimum flow shall be provided for lower priority PDUs.t~Ji
ԍ XThe scheduling algorithm by which this is accomplished is for further study.(#
;J+GYa4LiI(#`
+Gca2LiI
Xb) According to ISO 8473, the priority level is a binary number with a range of 0000 0000 (lowest
priority) to 0000 1110 (highest priority level). Within this range, the four abstract values
corresponding to the four levels defined in section 3.11 shall be encoded as follows:L+Ga2LiI(#
+Ga4LiI
` ` 1) "high reserved" priority will be encoded with value 14 ( 0000 1110);M+GYa4LiI(#`
+Ga4LiI
` ` 2) "high" priority will be encoded with value 10 ( 0000 1010);jN+GYa4LiI(#`
+Ga4LiI
` ` 3) "normal" priority will be encoded with value 5 ( 0000 0101);-O+GYa4LiI(#`
+Ga4LiI
` ` 4) "low" priority will be encoded with value "zero" ( 0000 0000);O+GYa4LiI(#`
+Ga4LiI
` ` 5) For a receiving network entity, a value lower than 5 shall be considered as "low"; a value
lower than 10 and higher than 5 shall be considered as "normal", and a value lower than
14 and higher than 10 shall be considered as "high";P+GYa4LiI(#`
+Gca2LiI
Xc) Network entities supporting priority shall process PDUs in which the priority parameter is absent
as either "low", "normal", or "high" according to a locally configurable parameter. This is to ensure
that NPDUs not containing the priority parameter can be processed by intermediate systems in a
defined manner with respect to those which do contain the priority parameter;#R+Ga2LiI(#
+Gca2LiI
Xd) IEEE 802.4 and IEEE 802.5 local area networks as well as some X.25 networks implementations
have the ability to support subnetwork priorities. When available, a subnetwork priority function
should be utilized in support of the priority requested of the network layer. The mapping of network
layer priority levels onto subnetwork priority levels is a local configuration matter.T+Ga2LiI(#
+GLiO۲ a) 1) a) 1) 1 .1 .1 .1 .1 .1 .1 .1 LiIp>"(#m #X2PP#G-
Ne
H #X2PP#XEditor's Note #P2P3P#To enchance the behavior of the congestion notification function (see LLSIG/9163), the
following changes to part 3, 5.1 of the Stable Implementation Agreements are to be made:VGANe(#! 0*&&((Ԍ~J#X2PP#.Parۙ#X2PP#Add the following after the definitions of "previous" and "current" cycles:X.HPar
#X2PP#.Par
#X2PP#c) in addition, it is recommended that when the busy period of the current cycle comprises a single
packet then the current cycle is combined with the previous cycle.Y.HPar
#X2PP#.Par
#X2PP#Changes to the algorithm components defined in table 1 are as follows:Z.HPar
#X2PP#LiO 1 .1 .1 .1 .1 .1 .1 .1 a) 1) a) 1)LiIp>"(#m #X2PP#[ca2LiI
Xa) the old component number 3 becomes component number 4;\[a2LiI(#
[ca2LiI
Xb) just prior to the definition of the new algorithm component 3, add the following definition of C:w][a2LiI(#
[a3LiI
` ` ۩&C=no. of packets processed during the current cycle, initailly 0;V^[Xa3LiI(#`
[ca2LiI
Xc) the new algorithm component number 3 is defined as follows:_[a2LiI(#
[a3LiI
` ` ۩ 3. If C=1 at the end of the current cycle combine the current cycle into the previous
cycle as follows:_[Xa3LiI(#`
[Fa7LiI
` ` &` .۩ area of previous cycle = area of previous cycle + area of current cycle;`[3#a7LiI(#
[Fa7LiI
` ` &` .۩ duration of previous cycle = duration of previous cycle + duration of
current cycle.`a[3#a7LiI(#
[LiO۲ a) 1) a) 1) 1 .1 .1 .1 .1 .1 .1 .1 LiIp>"(#m #X2PP#H`No
H#TD4PP#XNOTE #P2P3P#the corresponding changes to figure 1 are depicted below:cHU`No(#
#X2PP#>mFld0*&&((Ԍs4":#d
@l;
f@#
": The algorithm makes use of the following variables:
":
": t = Current time
": ti = time of ith arrival or departure event
": qi = number of packets in the system after the event
": T0 = time at the beginning of the previous cycle
": T1 = time at the beginning of the current cycle
": C = number of PDUs processed during current cycle
": initially 0
":
": The algorithm consists of three components:
":
": 1. Queue Length Update: Beginning with q0 = 0,
": If the ith event is an arrival event, qi = qié1+1
": If the ith event is a departure event, qi = qié1ĩ1
":
": 2. Queue Area (integral) update:
":
": Area of the previous cycle = $ qié1(tiĩtié1)
": ti{T0,T1)
":
": Area of the current cycle = $ qié1(tiĩtié1)
": ti{T1,t)
":
": 3. If C = 1 at the end of the current cycle,
": then area of previous cycle = area of previous
": cycle + area of current cycle;
":
": duration of previous cycle = duration of
": previous cycle + duration of current cycle.
":
": 4. Average Queue Length Update:
":
": Average Queue length over the two cycles
": Area of the two cycles Area of the two cycles
": = =
": Time of the two cycles tT0
":
":
H$
6d>I5Ft-
#
X2PP#%Figure 1 Queue length averaging algorithmtI6d>MPFt%
*#d6X@8;
f@#6d>ZFld#
X2PP#.Par
#X2PP#Add an additional item:Ov.HPar
#X2PP#.Par
#X2PP#g) when providing an"echo" or "ping" function for CLNP, the protocol mechanisms shall be as
specified in ISO 8473/PDAM6. It is strongly recommended that end and intermediate systems
support this function and provide appropriate mechanisms through which the Echo request function
may be invoked.v.HPar
#X2PP#&PH2
X 0*&&((ԌWԙ#xo> P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8:.HPar
#X2PP#%H1
0*&&((ԌWԙ#7o> P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P0gXP#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8:"(#m #X2PP#ca2LiI
Xa) low prioritya2LiI(#
ca2LiI
x0*&&((ԌXb) normal priority#a2LiI(#
ca2LiI
Xc) high prioritya2LiI(#
ca2LiI
Xd) high reserved priority[a2LiI(#
LiO۲ a) 1) a) 1) 1 .1 .1 .1 .1 .1 .1 .1 LiIp>"(#m #X2PP#.Par
#X2PP#The high reserved priority level is intended primarily for OSI network management purposes. The three
lower priority levels are intended for information exchange by users..HPar
#X2PP#.Par
#X2PP#These four priority levels are used, from an applications point of view, in the various communications lower
layers (Transport, Network and Data Link) to provide a consistent mapping of "abstract priority levels" in and
nservice onto the n1 service and when available, priority parameter values in the layer protocol. In the
upper layers (ASCE, Presentation and Session) local mechanisms are expected to be provided to application
layer ASEs with a means for conveying priority information in both directions through the communication
upper layers..HPar
#X2PP#.Par
#X2PP#For example, this implies that an application request for a high priority service will be conveyed through
association/presentation/session and will result in a high priority data transport connection and either high
priority data CLNP PDUs (CLNS case) or a high priority data network connection/X.25 virtual call (CONS
case)..HPar
#X2PP#%H1
W0#7o> P+P#X` hp x (#%'0*,.8135@8: P+P#X` hp x (#%'0*,.8135@8: