| 1 |
<pre>Network Working Group S. Shenker |
| 2 |
Request for Comments: 2216 J. Wroclawski |
| 3 |
Category: Informational Xerox PARC/MIT LCS |
| 4 |
September 1997 |
| 5 |
|
| 6 |
|
| 7 |
<span class="h1">Network Element Service Specification Template</span> |
| 8 |
|
| 9 |
|
| 10 |
Status of this Memo |
| 11 |
|
| 12 |
This memo provides information for the Internet community. It does |
| 13 |
not specify an Internet standard of any kind. Distribution of this |
| 14 |
memo is unlimited. |
| 15 |
|
| 16 |
Abstract |
| 17 |
|
| 18 |
This document defines a framework for specifying services provided by |
| 19 |
network elements, and available to applications, in an internetwork |
| 20 |
which offers multiple qualities of service. The document first |
| 21 |
provides some necessary context -- including relevant definitions and |
| 22 |
suggested data formats -- and then specifies a "template" which |
| 23 |
service specification documents should follow. The specification |
| 24 |
template includes per-element requirements such as the service's |
| 25 |
packet handling behavior, parameters required and made available by |
| 26 |
the service, traffic specification and policing requirements, and |
| 27 |
traffic ordering relationships. It also includes evaluation criteria |
| 28 |
for elements providing the service, and examples of how the service |
| 29 |
might be implemented (by network elements) and used (by |
| 30 |
applications). |
| 31 |
|
| 32 |
Introduction |
| 33 |
|
| 34 |
This document defines the framework used to specify the functionality |
| 35 |
of internetwork system components which support the the ability to |
| 36 |
provide multiple, dynamically selectable qualities of service to |
| 37 |
applications using an internetwork. The behavior of individual |
| 38 |
routers and subnetworks is captured as a set of "services", some or |
| 39 |
all of which may be offered by each element. The concatenation of |
| 40 |
these services along the end-to-end data paths used by an application |
| 41 |
provides overall quality of service control. |
| 42 |
|
| 43 |
The definition of a service states what is required of a router (or, |
| 44 |
more generally, any network element; a router, switch, subnet, etc.) |
| 45 |
which supports a particular service. The service definition also |
| 46 |
|
| 47 |
|
| 48 |
|
| 49 |
|
| 50 |
|
| 51 |
|
| 52 |
<span class="grey">Shenker & Wroclawski Informational [Page 1]</span></pre> |
| 53 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span> |
| 54 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 55 |
|
| 56 |
|
| 57 |
specifies parameters used to invoke the service, the relationship |
| 58 |
between those parameters and the service delivered, and the end-to- |
| 59 |
end behavior obtained by concatenating several instances of the |
| 60 |
service. |
| 61 |
|
| 62 |
Each service definition also specifies the interface between that |
| 63 |
service and the environment. This includes the parameters needed to |
| 64 |
invoke the service, informational parameters which the service must |
| 65 |
make available for use by setup, routing, and management mechanisms, |
| 66 |
and information which should be carried between end-nodes and network |
| 67 |
elements by those mechanisms in order to achieve the desired end-to- |
| 68 |
end behavior. However, a service definition does not describe the |
| 69 |
specific protocols or mechanisms used to establish state in the |
| 70 |
network elements for flows that use the described service. |
| 71 |
|
| 72 |
Services defined following the guidelines of this document are |
| 73 |
intended for use both within the global Internet and private IP |
| 74 |
networks. In certain cases a concatenation of network element |
| 75 |
services may be used to provide a range of end-to-end behaviors, some |
| 76 |
more suited to a decentralized internet and some more appropriate for |
| 77 |
a tightly managed private network. This document points out places |
| 78 |
where such distinction may be appropriate. |
| 79 |
|
| 80 |
This document is comprised of three parts. The first defines some |
| 81 |
terms used both in this document and in the various service |
| 82 |
specification documents. The second discusses data formats and |
| 83 |
representations. The third portion of the document describes the |
| 84 |
various components of the service specification template. |
| 85 |
|
| 86 |
Definitions |
| 87 |
|
| 88 |
The following terms are used throughout this document. Service |
| 89 |
specification documents should employ the same terms to express these |
| 90 |
concepts. |
| 91 |
|
| 92 |
o Quality of Service (QoS) |
| 93 |
|
| 94 |
In the context of this document, quality of service refers to the |
| 95 |
nature of the packet delivery service provided, as described by |
| 96 |
parameters such as achieved bandwidth, packet delay, and packet loss |
| 97 |
rates. Traditionally, the Internet has offered a single quality of |
| 98 |
service, best-effort delivery, with available bandwidth and delay |
| 99 |
characteristics dependent on instantaneous load. Control over the |
| 100 |
quality of service seen by applications is exercised by adequate |
| 101 |
provisioning of the network infrastructure. In contrast, a network |
| 102 |
with dynamically controllable quality of service allows individual |
| 103 |
application sessions to request network packet delivery |
| 104 |
characteristics according to their perceived needs, and may provide |
| 105 |
|
| 106 |
|
| 107 |
|
| 108 |
<span class="grey">Shenker & Wroclawski Informational [Page 2]</span></pre> |
| 109 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span> |
| 110 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 111 |
|
| 112 |
|
| 113 |
different qualities of service to different applications. It should |
| 114 |
be understood that there is a range of useful possibilities between |
| 115 |
the two endpoints of providing no dynamic QoS control at all and |
| 116 |
providing extremely precise and accurate control of QoS parameters. |
| 117 |
|
| 118 |
o Network Element |
| 119 |
|
| 120 |
A "Network Element" (or the equivalent shorter form "Element"), is |
| 121 |
any component of an internetwork which directly handles data packets |
| 122 |
and thus is potentially capable of exercising QoS control over data |
| 123 |
flowing through it. Network elements include routers, subnetworks, |
| 124 |
and end-node operating systems. A QoS-capable network element is one |
| 125 |
which offers one or more of the services defined according to the |
| 126 |
rules given in this document. Note that this definition, by itself, |
| 127 |
preclude QoS-capable network elements that meet performance goals |
| 128 |
purely through adequate provisioning rather than active admission and |
| 129 |
traffic control mechanisms. A "QoS-aware" network element is one |
| 130 |
which supports the interfaces (described below) required by the |
| 131 |
service definitions. Thus, a QoS-aware network element need not |
| 132 |
actually offer any of the services defined according to the format of |
| 133 |
this document; it merely needs to know how to deny service requests. |
| 134 |
|
| 135 |
o Flow |
| 136 |
|
| 137 |
For the purposes of this document a flow is a set of packets |
| 138 |
traversing a network element all of which are covered by the same |
| 139 |
request for control of quality of service. At a given network element |
| 140 |
a flow may consist of the packets from a single application session, |
| 141 |
or it may be an aggregation comprising the combined data traffic from |
| 142 |
a number of application sessions. |
| 143 |
|
| 144 |
NOTE: this definition of a flow is different from that used in |
| 145 |
IPv6, where a flow is defined as those packets with the same |
| 146 |
source address and FlowID. |
| 147 |
|
| 148 |
Mechanisms used to associate a request for quality of service control |
| 149 |
with the packets covered by that request are beyond the scope of this |
| 150 |
document. |
| 151 |
|
| 152 |
o Service |
| 153 |
|
| 154 |
The phrase "service" or "QoS Control Service" describes a named, |
| 155 |
coordinated set of QoS control capabilities provided by a single |
| 156 |
network element. The definition of a service includes a |
| 157 |
specification of the functions to be performed by the network |
| 158 |
|
| 159 |
|
| 160 |
|
| 161 |
|
| 162 |
|
| 163 |
|
| 164 |
<span class="grey">Shenker & Wroclawski Informational [Page 3]</span></pre> |
| 165 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span> |
| 166 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 167 |
|
| 168 |
|
| 169 |
element, the information required by the element to perform these |
| 170 |
functions, and the information made available by the element to other |
| 171 |
elements of the system. A service is conceptually implemented within |
| 172 |
the "service module" contained within the network element. |
| 173 |
|
| 174 |
NOTE: The above defines a precise meaning for the word "service". |
| 175 |
Service is a word which has a variety of meanings throughout the |
| 176 |
networking community; the definition of "service" given here |
| 177 |
refers specifically to the actions and responses of a single |
| 178 |
network element such as a router or subnet. This contrasts with |
| 179 |
the more end-to-end oriented definition of the same word seen in |
| 180 |
some other networking contexts. |
| 181 |
|
| 182 |
o Behavior |
| 183 |
|
| 184 |
A "behavior" is the QoS-related end-to-end performance seen by an |
| 185 |
application session. This behavior is the end result of composing the |
| 186 |
services offered by each network element along the path of the |
| 187 |
application's data flow. |
| 188 |
|
| 189 |
When each network element along a data flow path offers the same |
| 190 |
service, it is frequently possible to explain the resulting end-to- |
| 191 |
end behavior in a straightforward fashion. The behavior of a data |
| 192 |
flow path comprised of elements using different services is more |
| 193 |
complicated, and may in fact be undefined. A future version of this |
| 194 |
document may impose additional requirements on the service |
| 195 |
specification relating to multi-service concatenation. |
| 196 |
|
| 197 |
o Characterization |
| 198 |
|
| 199 |
A characterization is a computed approximation of the actual end-to- |
| 200 |
end behavior which would be seen by a flow requesting specific QoS |
| 201 |
services from the network. By providing additional information to |
| 202 |
the end-nodes before a flow is established, characterizations assist |
| 203 |
the end-nodes in choosing the services to be requested from the |
| 204 |
network. |
| 205 |
|
| 206 |
o Characterization Parameters |
| 207 |
|
| 208 |
Characterizations are computed from a set of characterization |
| 209 |
parameters provided by each network element on the flow's path, and a |
| 210 |
composition function which computes the end-to-end characterization |
| 211 |
from those parameters. The composition function may in practice be |
| 212 |
executed in a distributed fashion by the setup or routing protocol, |
| 213 |
or the characterization parameters may be gathered to a single point |
| 214 |
and the characterization computed at that point. |
| 215 |
|
| 216 |
|
| 217 |
|
| 218 |
|
| 219 |
|
| 220 |
<span class="grey">Shenker & Wroclawski Informational [Page 4]</span></pre> |
| 221 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span> |
| 222 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 223 |
|
| 224 |
|
| 225 |
Several characterizations may be computed for a single candidate data |
| 226 |
flow. Conversely, a service may provide no characterizations, and |
| 227 |
under some conditions no characterizations may be available to the |
| 228 |
end-nodes requesting QoS services. |
| 229 |
|
| 230 |
o Composition Function |
| 231 |
|
| 232 |
A composition function accepts characterization parameters as input |
| 233 |
and computes a characterization, as described above. |
| 234 |
|
| 235 |
o Traffic Specification (TSpec) |
| 236 |
|
| 237 |
A Traffic Specification, or TSpec, is a description of the traffic |
| 238 |
pattern for which service is being requested. In general, the TSpec |
| 239 |
forms one side of a "contract" between the data flow and the service. |
| 240 |
Once a service request is accepted, the service module has agreed to |
| 241 |
provide a specific QoS as long as the flow's data traffic continues |
| 242 |
to be accurately described by the TSpec. |
| 243 |
|
| 244 |
As examples, this specification might take the form of a token bucket |
| 245 |
filter (defined below) or an upper bound on the peak rate. Note that |
| 246 |
the traffic specification specifies the flow's *allowed* traffic |
| 247 |
pattern, not the flows *actual* traffic pattern. The behavior of a |
| 248 |
service when a flow's actual traffic does not conform to the traffic |
| 249 |
specification must be defined by the service (see "Policing" below). |
| 250 |
|
| 251 |
o Service Request Specification (RSpec) |
| 252 |
|
| 253 |
A Service Request Specification, or RSpec, is a specification of the |
| 254 |
quality of service a flow wishes to request from a network element. |
| 255 |
The contents of a service request specification is highly specific to |
| 256 |
a particular service. As examples, these specifications might contain |
| 257 |
information about bandwidth allocated to the flow, maximum delays, or |
| 258 |
packet loss rates. |
| 259 |
|
| 260 |
o Setup Protocol |
| 261 |
|
| 262 |
A setup protocol is used to carry QoS-related information from the |
| 263 |
end-nodes requesting QoS control to network elements which must |
| 264 |
exercise that control, and to install and maintain to required QoS |
| 265 |
control state in those network elements. A setup protocol may also |
| 266 |
be used to collect QoS-related information from interior network |
| 267 |
elements along an application's data flow path for ultimate delivery |
| 268 |
to end nodes. Examples of protocols which perform setup functions are |
| 269 |
RSVP [<a href="./rfc2205">RFC 2205</a>], ST-II [<a href="./rfc1819">RFC 1819</a>], and Q.2931. |
| 270 |
|
| 271 |
|
| 272 |
|
| 273 |
|
| 274 |
|
| 275 |
|
| 276 |
<span class="grey">Shenker & Wroclawski Informational [Page 5]</span></pre> |
| 277 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span> |
| 278 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 279 |
|
| 280 |
|
| 281 |
Note that other mechanisms, such as network management protocols, may |
| 282 |
also perform this function. The phrase "setup protocol" |
| 283 |
conventionally refers to a protocol with this function as its primary |
| 284 |
purpose. |
| 285 |
|
| 286 |
o Token Bucket |
| 287 |
|
| 288 |
A Token Bucket is a particular form of traffic specification |
| 289 |
consisting of a "token rate" r and a "bucket size" b. Essentially, |
| 290 |
the r parameter specifies the continually sustainable data rate, |
| 291 |
while the b parameter specifies the extent to which the data rate can |
| 292 |
exceed the sustainable level for short periods of time. More |
| 293 |
specifically, the traffic must obey the rule that over all time |
| 294 |
periods, the amount of data sent cannot exceed rT+b, where T is the |
| 295 |
length of the time period. |
| 296 |
|
| 297 |
Token buckets are further discussed in [<a href="#ref-PARTRIDGE" title="Gigabit Networking">PARTRIDGE</a>]. |
| 298 |
|
| 299 |
o Token Bucket Filter |
| 300 |
|
| 301 |
A Token Bucket Filter is a filtering or policing function which |
| 302 |
differentiates those packets in a traffic flow which conform to a |
| 303 |
particular token bucket specification from those packets which do |
| 304 |
not. The specific treatment accorded nonconforming packets is not |
| 305 |
specified in this definition; common actions are relegating the |
| 306 |
packet to best effort service, discarding the packet, or marking the |
| 307 |
packet in some fashion. |
| 308 |
|
| 309 |
o Admission Control |
| 310 |
|
| 311 |
Admission control is the process of deciding whether a newly arriving |
| 312 |
request for service from a network element can be granted. This |
| 313 |
action must be performed by any service which wishes to offer |
| 314 |
absolute quantitative bounds on overall performance. It is not |
| 315 |
necessary for services which provide only relative statements about |
| 316 |
performance, such as the Internet's current best-effort service. The |
| 317 |
precise criteria for making the admission control decision are a |
| 318 |
specific to each particular service. |
| 319 |
|
| 320 |
o Policing |
| 321 |
|
| 322 |
Policing is the set of actions triggered when a flow's actual data |
| 323 |
traffic characteristics exceed the expected values given in the |
| 324 |
flow's traffic specification. Services which require policing |
| 325 |
functions to operate correctly must specify both the action to be |
| 326 |
|
| 327 |
|
| 328 |
|
| 329 |
|
| 330 |
|
| 331 |
|
| 332 |
<span class="grey">Shenker & Wroclawski Informational [Page 6]</span></pre> |
| 333 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span> |
| 334 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 335 |
|
| 336 |
|
| 337 |
taken when such discrepancies occur and the locations in the network |
| 338 |
where discrepancies are to be detected. Examples of such actions |
| 339 |
might include relegating the packet to best effort service, dropping |
| 340 |
packets, reshaping the traffic, or marking non-conforming traffic in |
| 341 |
some fashion. |
| 342 |
|
| 343 |
o Interfaces |
| 344 |
|
| 345 |
The service module conceptually interacts with other portions of the |
| 346 |
network element through a number of interfaces. The service |
| 347 |
specification document should clearly define the specific data, |
| 348 |
including formats, which moves across each conceptual interface, and |
| 349 |
ensure that the mapping between conceptual interfaces and the |
| 350 |
specific mechanisms of the service being defined are clear. |
| 351 |
|
| 352 |
Data Format and Representation |
| 353 |
|
| 354 |
A service module will import and export a variety of data according |
| 355 |
to the specific requirements of the services the network element |
| 356 |
supports. Each service definition MUST specify the format of each |
| 357 |
such data item in an abstract manner. The information specified must |
| 358 |
be sufficient for the designer of a setup protocol to correctly |
| 359 |
select an appropriate concrete (packet) format for variables |
| 360 |
containing this data. At minimum, the following information must be |
| 361 |
given: |
| 362 |
|
| 363 |
- Type: whether the quantity is an enumeration, a numerical value, |
| 364 |
etc. |
| 365 |
|
| 366 |
- Range: for numerical quantities, the minimum and maximum values |
| 367 |
the quantity must be able to represent. For enumerated quantities, |
| 368 |
an estimate of the maximum number of items which may need be |
| 369 |
enumerated in the future, even if many of the values are currently |
| 370 |
unused. |
| 371 |
|
| 372 |
- Precision: the precision with which a numerical quantity must be |
| 373 |
represented, and whether that precision is absolute (calling for an |
| 374 |
integer quantity) or a percentage of the value (allowing for a |
| 375 |
floating point quantity). |
| 376 |
|
| 377 |
The service definition SHOULD additionally specify a preferred |
| 378 |
concrete format for each data field, in the usual packet-layout |
| 379 |
format used in current Internet Standard documents or in some other |
| 380 |
accepted specification format. If the service definition contains |
| 381 |
these concrete definitions, they should be sufficiently complete and |
| 382 |
detailed to allow the service definition to be incorporated by |
| 383 |
reference into the specifications for setup protocols and other users |
| 384 |
of the specified data. |
| 385 |
|
| 386 |
|
| 387 |
|
| 388 |
<span class="grey">Shenker & Wroclawski Informational [Page 7]</span></pre> |
| 389 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span> |
| 390 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 391 |
|
| 392 |
|
| 393 |
NOTE: The wording above is intended to encourage the use of common |
| 394 |
data formats by all protocols carrying data related to a specific |
| 395 |
service, while not mandating this common format or infringing on |
| 396 |
the freedom of protocol specification designers to define data |
| 397 |
representations using alternative mechanisms such as ASN.1 or XDR. |
| 398 |
|
| 399 |
Service and Data Element Naming |
| 400 |
|
| 401 |
End-nodes, network elements, setup protocols, and management entities |
| 402 |
within an integrated services internetwork need to exchange |
| 403 |
information about services, service invocation parameters, |
| 404 |
characterization parameters, and the intermediate variables and end |
| 405 |
results of composition functions. To support this requirement, a |
| 406 |
single uniform namespace is established for services and their |
| 407 |
parameters. |
| 408 |
|
| 409 |
The namespace is a two-level hierarchy: |
| 410 |
|
| 411 |
<service_name>.<parameter_name>. |
| 412 |
|
| 413 |
Each of these elements is a integer numerical quantity. |
| 414 |
|
| 415 |
<Service Name> is an integer in the range 1 to 254. The number space |
| 416 |
is broken into three regions. |
| 417 |
|
| 418 |
Service number 1 is used to indicate that the associated parameter is |
| 419 |
generic", and is not associated with a specific service. This use of |
| 420 |
generic parameters is described more fully in [<a href="./rfc2215">RFC 2215</a>]. |
| 421 |
|
| 422 |
The range from 2 to 127 used to name services defined by the IETF. |
| 423 |
Procedures for allocating service numbers in this region will be |
| 424 |
established by the IETF INT-SERV WG and the IANA. Services designed |
| 425 |
for public use should obtain a number from this space. The minimum |
| 426 |
requirement for doing so is a published RFC following the format |
| 427 |
described in this note. |
| 428 |
|
| 429 |
Service numbers in the region above 127 are reserved for experimental |
| 430 |
or private services. Service designers may allocate numbers from this |
| 431 |
space at random for local experimental use. A policy for global but |
| 432 |
temporary allocation of these numbers may be established in the |
| 433 |
future if necessary. |
| 434 |
|
| 435 |
The value 0 is left unused to allow the direct mapping of parameter |
| 436 |
names to MIB object names, as described below. |
| 437 |
|
| 438 |
The value 255 is reserved to facilitate future expansion of the |
| 439 |
service number space, if required. |
| 440 |
|
| 441 |
|
| 442 |
|
| 443 |
|
| 444 |
<span class="grey">Shenker & Wroclawski Informational [Page 8]</span></pre> |
| 445 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span> |
| 446 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 447 |
|
| 448 |
|
| 449 |
<Parameter_name> is a number in the range 1 to 254, allocated on a |
| 450 |
per-service basis. Within this range, the values 1 to 127 are |
| 451 |
reserved for assignment to parameters with a common, shared meaning |
| 452 |
across all services. These parameters are defined in [<a href="./rfc2215">RFC 2215</a>]. |
| 453 |
|
| 454 |
Numbers for parameters specific to a service are assigned from the |
| 455 |
range 128-254 by the author of the service specification document. |
| 456 |
|
| 457 |
The value 0 is left unused to allow the direct mapping of parameter |
| 458 |
names to MIB object names, as described below. |
| 459 |
|
| 460 |
The value 255 is reserved to facilitate future expansion of the |
| 461 |
parameter number space, if required. |
| 462 |
|
| 463 |
In addition to their uses within the integrated services framework, |
| 464 |
these <service_number>.<parameter_number> pairs should be used as |
| 465 |
last two levels of the MIB name when the corresponding values are |
| 466 |
made available to network management protocols. |
| 467 |
|
| 468 |
Specification Document Format |
| 469 |
|
| 470 |
The following portion of this document describes the layout and |
| 471 |
contents of a service specification. Each service specification |
| 472 |
document MUST contain the sections marked [required] below, in the |
| 473 |
order listed. Each document SHOULD contain each of the remaining |
| 474 |
sections in the list below, unless there is a compelling argument |
| 475 |
that the presence of the section is not beneficial. Additional |
| 476 |
material, including references, should be included at the end of the |
| 477 |
document. |
| 478 |
|
| 479 |
Some of these sections are normative, in that they describe specific |
| 480 |
requirements to which conformant implementations must adhere. Other |
| 481 |
sections are informational in nature, in that they describe necessary |
| 482 |
context and technical considerations important to the implementor of |
| 483 |
a service. The sections, and their nature (required or optional, and |
| 484 |
informational or normative) are listed below: |
| 485 |
|
| 486 |
o Components |
| 487 |
|
| 488 |
The body of a service specification document incorporates the |
| 489 |
following sections: |
| 490 |
|
| 491 |
- End-to-End Behavior [required] [informational] |
| 492 |
|
| 493 |
- Motivation [required] [informational] |
| 494 |
|
| 495 |
- Network Element Data Handling Requirements [required] [normative] |
| 496 |
|
| 497 |
|
| 498 |
|
| 499 |
|
| 500 |
<span class="grey">Shenker & Wroclawski Informational [Page 9]</span></pre> |
| 501 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span> |
| 502 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 503 |
|
| 504 |
|
| 505 |
- Invocation Information [required] [normative] |
| 506 |
|
| 507 |
- Exported Information [required] [normative] |
| 508 |
|
| 509 |
- Policing [required] [normative] |
| 510 |
|
| 511 |
- Ordering and Merging [required] [normative] |
| 512 |
|
| 513 |
- Guidelines for Implementors [optional] [informational] |
| 514 |
|
| 515 |
- Evaluation Criteria [required] [informational] |
| 516 |
|
| 517 |
- Examples of Implementation [optional] [informational] |
| 518 |
|
| 519 |
- Examples of Use [optional] [informational] |
| 520 |
|
| 521 |
o End-to-end Behavior |
| 522 |
|
| 523 |
This is a description of the behavior that results if all network |
| 524 |
elements along the path offer the same service, invoked with a |
| 525 |
defined set of parameters. |
| 526 |
|
| 527 |
In private networks it will generally be the case that the required |
| 528 |
end-to-end behavior is obtained by concatenation of network elements |
| 529 |
utilizing the same service and making significant use of |
| 530 |
characterizations. |
| 531 |
|
| 532 |
In the global Internet, this will not always be true. End-to-end |
| 533 |
behaviors will frequently be obtained through a concatenation of |
| 534 |
network elements supporting different services, including in some |
| 535 |
cases elements which exercise no QoS control at all. Mechanisms to |
| 536 |
characterize end-to-end behavior in this circumstance are not fully |
| 537 |
established at this time. Future versions of this document may impose |
| 538 |
additional requirements on service specifications to facilitate |
| 539 |
inter-service composition. |
| 540 |
|
| 541 |
This section is for informational purposes only. |
| 542 |
|
| 543 |
o Motivation |
| 544 |
|
| 545 |
This section discusses why this service is being defined. It |
| 546 |
describes what kinds of applications might make use of this service, |
| 547 |
and why this service might be more appropriate for those applications |
| 548 |
than other possible choices. This section is for informational |
| 549 |
purposes only. |
| 550 |
|
| 551 |
|
| 552 |
|
| 553 |
|
| 554 |
|
| 555 |
|
| 556 |
<span class="grey">Shenker & Wroclawski Informational [Page 10]</span></pre> |
| 557 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-11" ></span> |
| 558 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 559 |
|
| 560 |
|
| 561 |
o Network Element Data Handling Requirements |
| 562 |
|
| 563 |
This section contains a description of the QoS properties seen by |
| 564 |
data packets processed by a network element using this service. The |
| 565 |
description must clearly explain what variables are controlled, the |
| 566 |
degree of control exercised, and what aspects of the service's |
| 567 |
handling model are fixed or assumed. Examples of degree of control |
| 568 |
information include "this property must be mathematically assured" |
| 569 |
and "this property should be met under most conditions". An example |
| 570 |
of a stated assumption is "this service is assumed to have extremely |
| 571 |
low packet loss; delay targets must be met using admission control |
| 572 |
rather than by discarding packets when overloaded". |
| 573 |
|
| 574 |
Requirements on packet handling SHOULD, when at all possible, be |
| 575 |
expressed as performance requirements rather than by specifying a a |
| 576 |
particular packet scheduling algorithm. The performance requirements |
| 577 |
might, for example, be a specification of the maximal packet delays |
| 578 |
or the minimal bandwidth share given to a flow. |
| 579 |
|
| 580 |
This section also specifies actions which the packet handling path is |
| 581 |
required to take to actively provide feedback to end-nodes about |
| 582 |
conditions at the network element. Such actions might include |
| 583 |
explicitly generated congestion feedback, indicated either as bits |
| 584 |
set in the header of data packets or separate control messages sent. |
| 585 |
|
| 586 |
When writing this section of the service specification document, the |
| 587 |
authors' goal should be to specify the required behavior as precisely |
| 588 |
as necessary while still leaving adequate room for the implementation |
| 589 |
and architectural tradeoffs appropriate to different circumstances |
| 590 |
and classes of network elements. Successfully achieving this balance |
| 591 |
may require some care. |
| 592 |
|
| 593 |
o Invocation Information |
| 594 |
|
| 595 |
This section describes the set of parameters required by a service |
| 596 |
module to invoke the service, and a description of how the parameter |
| 597 |
values are used by the service module. For example, a hypothetical |
| 598 |
"bounded delay" service might be described as accepting a request |
| 599 |
indicating a delay target for the network element and the set of |
| 600 |
packets subject to that delay target, and processing packets in the |
| 601 |
given set with a delay of the target value or less. |
| 602 |
|
| 603 |
Necessary invocation information for most services can be broken into |
| 604 |
two parts, the Traffic Specification (TSpec) and the Service Request |
| 605 |
Specification (RSpec). The TSpec gives characteristics of the data |
| 606 |
|
| 607 |
|
| 608 |
|
| 609 |
|
| 610 |
|
| 611 |
|
| 612 |
<span class="grey">Shenker & Wroclawski Informational [Page 11]</span></pre> |
| 613 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-12" ></span> |
| 614 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 615 |
|
| 616 |
|
| 617 |
traffic to be handled, while the Rspec specifies the properties |
| 618 |
desired from the service. For example, a service offering a |
| 619 |
mathematical bound on delay might accept a TSpec giving the traffic |
| 620 |
flow's bandwidth and burstiness specified as a Token Bucket, and an |
| 621 |
RSpec giving the maximum tolerable queueing delay. |
| 622 |
|
| 623 |
A service accepting an invocation request may be thought of as |
| 624 |
entering into a "contract" to provide the service described by the |
| 625 |
RSpec as long as the flow's traffic continues to be described by the |
| 626 |
TSpec. If the flow's traffic pattern falls outside the bounds of the |
| 627 |
TSpec, the QoS provided to the flow may change. The precise nature of |
| 628 |
this change is also described by the service specification (see |
| 629 |
"Policing" below). |
| 630 |
|
| 631 |
The RSPec and TSpec components of the invocation information should |
| 632 |
be specified separately and independently, as they will often be |
| 633 |
generated by different elements of the internetwork |
| 634 |
|
| 635 |
All quantitative information specifications in this section should |
| 636 |
follow the guidelines given in the Data Formats section of this |
| 637 |
document, above. |
| 638 |
|
| 639 |
o Exported Information and Characterization Parameters |
| 640 |
|
| 641 |
This section describes information which must be collected and |
| 642 |
exported by the service module. Exported information is available to |
| 643 |
other modules of the network element, and by extension to setup |
| 644 |
protocols, routing protocols, network management tools, and the like. |
| 645 |
|
| 646 |
Information exported by service modules may be used in several ways. |
| 647 |
For example, quantities such as the amount of link bandwidth |
| 648 |
dedicated to the service and the set of data flows currently |
| 649 |
receiving the service are appropriate pieces of information to make |
| 650 |
available as network management variables. |
| 651 |
|
| 652 |
A service definition may identify a particular subset of the |
| 653 |
information exported by a service module as characterization |
| 654 |
parameters. These characterization parameters may be used to compute |
| 655 |
or estimate the end-to-end behavior of a data flow traversing a |
| 656 |
concatenation of network service elements. They may also be used to |
| 657 |
characterize portions of the path for use by network elements (e.g., |
| 658 |
in computing the buffer necessary, an element may need to know |
| 659 |
something about the service characteristics of the upstream portion |
| 660 |
of the path). A service which defines characterization parameters |
| 661 |
also specifies the characterizations they are used to generate and |
| 662 |
the composition functions used to generate the characterizations. |
| 663 |
|
| 664 |
|
| 665 |
|
| 666 |
|
| 667 |
|
| 668 |
<span class="grey">Shenker & Wroclawski Informational [Page 12]</span></pre> |
| 669 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-13" ></span> |
| 670 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 671 |
|
| 672 |
|
| 673 |
NOTE: Characterization parameters are identified as such by virtue |
| 674 |
of being the inputs to a service's defined composition functions. |
| 675 |
Because characterization parameters are part of a service's |
| 676 |
overall exported data set, they are also available to other |
| 677 |
functions, such as network management. The discussion below |
| 678 |
relates solely to their use as characterization parameters, and is |
| 679 |
not intended to limit other uses. |
| 680 |
|
| 681 |
Characterization parameters may be relatively static quantities, such |
| 682 |
as the bandwidth available on a specific link, or relatively dynamic |
| 683 |
quantities, such as a running estimation of current packet delay. |
| 684 |
|
| 685 |
Support for a service's defined characterization parameters is |
| 686 |
mandatory. Any network element offering this service must be able to |
| 687 |
measure, compute, or, if allowed by the specification, estimate the |
| 688 |
service's characterization parameters. Service designers are |
| 689 |
encouraged to understand the implications of specifying |
| 690 |
characterization parameters for a service, particularly with respect |
| 691 |
to not unduly restricting the choice of hardware and software |
| 692 |
architectures used to implement the network element. |
| 693 |
|
| 694 |
Characterization parameters are used by composing the values exported |
| 695 |
by each network element along a data flow's path according to a |
| 696 |
composition rule. For each parameter or set of parameters used to |
| 697 |
develop a characterization, the service specification must specify |
| 698 |
the composition rule to be used. These composition rules should |
| 699 |
result in characterizations that are independent of the order in |
| 700 |
which the element are composed; commutativity and associativity are |
| 701 |
sufficient but not necessary conditions for this. |
| 702 |
|
| 703 |
Characterization parameters are available through a general |
| 704 |
interface, and are provided in response to a request from some other |
| 705 |
module, such as a setup protocol or the routing protocol. The |
| 706 |
question of exactly how, or if, a specific protocol (e.g., RSVP) uses |
| 707 |
characterization parameters to generate characterizations is |
| 708 |
described in the specification of that specific protocol. |
| 709 |
|
| 710 |
The correct use of characterization parameters supplied by service |
| 711 |
modules is a function of the setup, routing, or management protocol |
| 712 |
controlling the module. There is no absolute guarantee that |
| 713 |
characterizations will be available to end-nodes desiring to use a |
| 714 |
|
| 715 |
QoS control service. Service designers targeting services for the |
| 716 |
global Internet may wish to ensure that a service is useful even in |
| 717 |
the absence of characterizations, and to exhibit such uses in the |
| 718 |
"Examples" sections of the service description document. |
| 719 |
|
| 720 |
|
| 721 |
|
| 722 |
|
| 723 |
|
| 724 |
<span class="grey">Shenker & Wroclawski Informational [Page 13]</span></pre> |
| 725 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-14" ></span> |
| 726 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 727 |
|
| 728 |
|
| 729 |
Conversely, the availability of characterizations may be mandatory in |
| 730 |
certain circumstances, particularly for private IP networks providing |
| 731 |
tightly controlled qualities of service for specific applications. |
| 732 |
Service designers targeting this environment should particularly |
| 733 |
ensure that the service provides adequate characterization parameters |
| 734 |
and composition functions to meet the needs of target audiences. It |
| 735 |
may be appropriate to specify the same basic service with additional |
| 736 |
characterizations for meeting specific requirements beyond those of |
| 737 |
the global Internet. |
| 738 |
|
| 739 |
Some useful "general" characterization parameters and corresponding |
| 740 |
composition rules are not associated with any specific service. |
| 741 |
These include the speed-of-light latency of communication links and |
| 742 |
available link bandwidth. These general characterization parameters |
| 743 |
are defined in [<a href="./rfc2215">RFC 2215</a>]. |
| 744 |
|
| 745 |
Although every conformant implementation of a service is required to |
| 746 |
provide that service's characterization parameters, it is still |
| 747 |
possible that the desired characterization parameters will not be |
| 748 |
available for composition at all network elements in a path. This |
| 749 |
situation may arise when different network element services are used |
| 750 |
at different points in the end-to-end path, as may be required in a |
| 751 |
heterogeneous internetworking environment. For this reason, |
| 752 |
characterization parameters and composition function results |
| 753 |
conceptually include a "validity flag". A network element which is |
| 754 |
unable to provide the characterization parameter must set this flag, |
| 755 |
and otherwise leave parameter or composed value unchanged. Once set, |
| 756 |
the flag is preserved by the composition function, and serves as an |
| 757 |
indicator of the validity of the data when the final composed result |
| 758 |
is delivered to its destination. |
| 759 |
|
| 760 |
Protocols which transport characterization parameters and composition |
| 761 |
data must define and support a concrete representation for this |
| 762 |
validity flag, as well as for the characterization parameters |
| 763 |
themselves. |
| 764 |
|
| 765 |
NOTE: This service specification template does not allow a service |
| 766 |
definition to *require* that a setup or invocation mechanism used |
| 767 |
with the service perform any function other than transport of |
| 768 |
invocation parameters to the network elements and signalling of |
| 769 |
errors generated by the network elements to the end nodes. A notable |
| 770 |
example of this is that service specification documents may not |
| 771 |
require or assume that characterizations defined in the specification |
| 772 |
are actually computed or presented to the end nodes. |
| 773 |
|
| 774 |
That point notwithstanding, the practical usefulness of a specific |
| 775 |
service may be highly dependent on the presence of some additional |
| 776 |
behavior in the networked system, such as the computation and |
| 777 |
|
| 778 |
|
| 779 |
|
| 780 |
<span class="grey">Shenker & Wroclawski Informational [Page 14]</span></pre> |
| 781 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-15" ></span> |
| 782 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 783 |
|
| 784 |
|
| 785 |
presentation of characterizations to end-nodes or the reliable |
| 786 |
assurance that every network element in the path from sender to |
| 787 |
receivers supports the given service. Service specification authors |
| 788 |
are strongly encouraged to clearly explain the situation of their |
| 789 |
service in this regard. Statements such as: |
| 790 |
|
| 791 |
The characterizations defined by this service serve as useful |
| 792 |
hints to the application. However, the service is specifically |
| 793 |
intended to be useful even if characterizations are not available. |
| 794 |
|
| 795 |
or |
| 796 |
|
| 797 |
The usefulness of this service depends strongly on the delivery of |
| 798 |
both characterizations and the knowledge that all network elements |
| 799 |
on the path support the service. Requests for this service when |
| 800 |
characterizations are not available are likely to lead to |
| 801 |
incorrect or misleading results. |
| 802 |
|
| 803 |
are appropriate. It may also be useful to consider this point in the |
| 804 |
"Examples of Use" section described below. |
| 805 |
|
| 806 |
NOTE: The possibility of modifying the overall architecture to |
| 807 |
provide information about the invoking protocol in a service request, |
| 808 |
and to allow a service to require that the invocation protocol |
| 809 |
support specific additional functionality, is an area of active |
| 810 |
study. |
| 811 |
|
| 812 |
o Policing |
| 813 |
|
| 814 |
This portion of the service description describes the nature of |
| 815 |
policing used to enforce adherence to a flow's Traffic Specification. |
| 816 |
The specification document must specify the following points |
| 817 |
|
| 818 |
- Expected policing action. This is the action taken when packets |
| 819 |
not conforming to the TSpec are detected. Example actions include |
| 820 |
relegating nonconforming packets to best effort, immediately |
| 821 |
dropping nonconforming packets, delaying these packets until they |
| 822 |
once again "fit" into the TSpec, or "marking" nonconforming packets |
| 823 |
in some way. |
| 824 |
|
| 825 |
- Legality of alternative policing actions. The section must |
| 826 |
specify whether actions not specifically mentioned in |
| 827 |
specification's description of policing behavior are legal. For |
| 828 |
example, a service description which specifies that nonconforming |
| 829 |
packets are to be dropped should state whether an alternate action, |
| 830 |
such as delaying these packets, is acceptable. |
| 831 |
|
| 832 |
|
| 833 |
|
| 834 |
|
| 835 |
|
| 836 |
<span class="grey">Shenker & Wroclawski Informational [Page 15]</span></pre> |
| 837 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-16" ></span> |
| 838 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 839 |
|
| 840 |
|
| 841 |
- Location of policing actions in the internetwork. The description |
| 842 |
of policing must specify where that policing is done. Possibilities |
| 843 |
include "at the edges of the network only", "at every hop", |
| 844 |
"heterogeneous branch points" (points where the branches of a |
| 845 |
multicast tree converge and have different TSpecs reserved |
| 846 |
downstream), and "source merge points" (points where multiple data |
| 847 |
streams covered by a single resource reservation converge). The |
| 848 |
specification should clearly state requirements about topology |
| 849 |
information (for example "this is an edge node" or "this is a |
| 850 |
source merge point") which must be available from the setup |
| 851 |
protocol or another source. |
| 852 |
|
| 853 |
In this section the specification should also specify the legality |
| 854 |
of policing at additional points in the network, beyond those |
| 855 |
listed above. This is important due to technical effects such as |
| 856 |
are described in the next paragraph. |
| 857 |
|
| 858 |
Applicable additional technical considerations. If policing of data |
| 859 |
flows is required or legal at points other than the flow's first |
| 860 |
entry into the network, the service definition should describe any |
| 861 |
additional technical considerations which affect the design of such |
| 862 |
policing. For example, many potential services will allow a data |
| 863 |
flow to become more bursty as it progresses through the network. If |
| 864 |
such a service allows policing at points other than the network |
| 865 |
edge, the traffic specification describing the flow will have to be |
| 866 |
modified from that given by the application to the network to |
| 867 |
account for this growing burstiness. Otherwise, it is likely that |
| 868 |
the flow will be overpoliced, with packets being penalized |
| 869 |
unnecessarily. |
| 870 |
|
| 871 |
o Ordering and Merging |
| 872 |
|
| 873 |
Ordering and merging come into play when a network element receives |
| 874 |
several invocation requests covering the same data flow. As examples, |
| 875 |
this could occur if several receivers of a multicast data flow |
| 876 |
requested QoS services for that flow using the RSVP setup protocol, |
| 877 |
or if a flow was subject to both a statically installed permanent |
| 878 |
invocation request and a dynamic request from a resource setup |
| 879 |
protocol. |
| 880 |
|
| 881 |
In this situation the service module must be able to answer questions |
| 882 |
about the ordering between different invocation requests, and must be |
| 883 |
able to generate a single new invocation request which meets the |
| 884 |
semantics of the setup protocol and the requirements of all the |
| 885 |
original requesters. Operationally, this is achieved by having the |
| 886 |
invoking protocol ask the service module, given a set of invocation |
| 887 |
requests I1...In, to compute a new request which results in the |
| 888 |
desired behavior. |
| 889 |
|
| 890 |
|
| 891 |
|
| 892 |
<span class="grey">Shenker & Wroclawski Informational [Page 16]</span></pre> |
| 893 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-17" ></span> |
| 894 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 895 |
|
| 896 |
|
| 897 |
Five operations must be defined in this section. These are: |
| 898 |
|
| 899 |
- Ordering. The section must define an ordering relationship |
| 900 |
between the service's TSpecs and RSpecs. This may be a partial |
| 901 |
ordering, in that some TSpecs or RSpecs may be unordered with |
| 902 |
respect to each other. |
| 903 |
|
| 904 |
- Summation. This function computes an invocation request which |
| 905 |
represents the sum of N input invocation requests. Typically this |
| 906 |
function is used to compute the size of a service request adequate |
| 907 |
for a shared reservation for N different flows. It is desirable but |
| 908 |
not required that this function compute the "least possible sum". |
| 909 |
|
| 910 |
- Minimum. This function computes the minimum of two TSpecs. |
| 911 |
Typically this function is used to compute the TSpec for an actual |
| 912 |
service invocation given a target TSpec for the service request and |
| 913 |
a TSpec for the flow's actual traffic pattern. The minimum function |
| 914 |
must compute the smallest TSpec adequate to describe the minimum of |
| 915 |
the requested TSpec and the flow's actual traffic. |
| 916 |
|
| 917 |
- RSVP-Merge function. This function computes the invocation |
| 918 |
request used to request service at an RSVP [<a href="./rfc2205">RFC 2205</a>] merge point. |
| 919 |
The function must a) compute an appropriate invocation request for |
| 920 |
a set of downstream reservations being merged, and b) generate |
| 921 |
appropriate reservation parameters to be passed upstream by RSVP. |
| 922 |
This function is described further below and in [<a href="./rfc2210">RFC 2210</a>]. |
| 923 |
|
| 924 |
- Least Common Request function. This function computes an |
| 925 |
invocation request sufficient to provide service at least |
| 926 |
equivalent to any one of the original requests passed to the |
| 927 |
function. This function differs from the RSVP-merge function in |
| 928 |
that it simply computes an upper bound. It does not need to compute |
| 929 |
new invocation parameters to be passed upstream by RSVP and cannot |
| 930 |
utilize the second option discussed in "Notes on RSVP Merging" |
| 931 |
below. |
| 932 |
|
| 933 |
oo Notes on Ordering |
| 934 |
|
| 935 |
Typically the ordering relation will be described separately for the |
| 936 |
service's TSpec and RSpec. An invocation request is ordered with |
| 937 |
respect to another if and only if both its TSpec and its RSpec are |
| 938 |
similarly ordered with respect to each other. |
| 939 |
|
| 940 |
For TSpecs, the basic ordering relation is well defined. TSpec A is |
| 941 |
substitutable for TSpec B if and only any flow that is compliant with |
| 942 |
TSpec B is also compliant with TSpec A. The service specification |
| 943 |
must explain how to compare two TSpecs to determine whether this is |
| 944 |
true. |
| 945 |
|
| 946 |
|
| 947 |
|
| 948 |
<span class="grey">Shenker & Wroclawski Informational [Page 17]</span></pre> |
| 949 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-18" ></span> |
| 950 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 951 |
|
| 952 |
|
| 953 |
For RSpecs, the ordering relation is dependent on the service. RSpec |
| 954 |
A is substitutable for RSpec B if the quality of service invoked by |
| 955 |
RSpec A is at least as good as the quality of service invoked by |
| 956 |
RSpec B. Since there is no precise mathematical description of |
| 957 |
"goodness" of quality of service, these ordering relations must be |
| 958 |
spelled out explicitly in the service description. |
| 959 |
|
| 960 |
oo Notes on RSVP Merging |
| 961 |
|
| 962 |
The purpose of the RSVP merging function is to compute an invocation |
| 963 |
request which will provide service to the merged flow at least |
| 964 |
equivalent to that which any of the original requests would obtain |
| 965 |
for its corresponding unmerged flow. This equivalence may be obtained |
| 966 |
in two ways |
| 967 |
|
| 968 |
1) The merged request may be computed as an upper bound on the set |
| 969 |
of original (unmerged) invocation requests. In this case, the |
| 970 |
service offered by the merged request to any particular traffic |
| 971 |
flow is identical to that offered by the largest unmerged request, |
| 972 |
by definition. |
| 973 |
|
| 974 |
2) The merged request may be computed as a value smaller than the |
| 975 |
upper bound on the set of original requests, but the results passed |
| 976 |
upstream may restrict the traffic sources to behavior which makes |
| 977 |
the merged and unmerged requests behave identically. |
| 978 |
|
| 979 |
Note that the merging rules for a particular service may apply either |
| 980 |
option 1 or option 2 to the different components of a TSpec, as |
| 981 |
appropriate. The decision is typically made as follows: |
| 982 |
|
| 983 |
When a downstream service module instance can tolerate a flow which |
| 984 |
exceeds the parameter, the upper bound should be used. For example, |
| 985 |
if the service supports policing to protect itself against excess |
| 986 |
traffic, the traffic rate supported by a merged reservation might |
| 987 |
be an upper bound across the traffic rates supported by each |
| 988 |
unmerged reservation. The effect of this will be to install the |
| 989 |
merged reservation at the local node and to inform each traffic |
| 990 |
source of the largest traffic rate protected by reservation along |
| 991 |
any *one* distribution path from the source to a receiver. |
| 992 |
|
| 993 |
When a downstream service module instance will not function |
| 994 |
properly if the parameter is exceeded, the merged function should |
| 995 |
select the least agressive value of the parameter to install and |
| 996 |
pass upstream. In this case, the traffic sources will be informed |
| 997 |
of a parameter value which is appropriate for *all* distribution |
| 998 |
paths traversed by the traffic flow. For example, services which |
| 999 |
can handle packets of only limited size can incorporate packet size |
| 1000 |
in the TSpec, and treat the parmeter as described in option 2. The |
| 1001 |
|
| 1002 |
|
| 1003 |
|
| 1004 |
<span class="grey">Shenker & Wroclawski Informational [Page 18]</span></pre> |
| 1005 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-19" ></span> |
| 1006 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 1007 |
|
| 1008 |
|
| 1009 |
effect of this will be to limit packet sizes in the flow to those |
| 1010 |
which can be handled by every instance of the service along the |
| 1011 |
flow's path. |
| 1012 |
|
| 1013 |
This merging calculation must be performed by the service module |
| 1014 |
because it is specific to a particular service. |
| 1015 |
|
| 1016 |
oo Notes on Calculating Upper Bounds |
| 1017 |
|
| 1018 |
Both the RSVP-Merge function and the Least Common Request function |
| 1019 |
may make use of calculated upper bounds on TSpec and RSpec |
| 1020 |
parameters. |
| 1021 |
|
| 1022 |
The calculated upper bound need not be a least upper bound, nor do |
| 1023 |
the various network elements along the path need to all use the same |
| 1024 |
choice of upper bound. Any selection of invocation parameters Iu is |
| 1025 |
compliant as long as it substitutable for each of the parameters |
| 1026 |
I1...In from which it is calculated. Intuitively, one set of |
| 1027 |
parameters is substitutable for another if the resulting quality of |
| 1028 |
service is at least as desirable to all applications. A precise |
| 1029 |
definition of this "substitutable for" function; the ordering |
| 1030 |
relation, must be specified in the service definition. (It may be |
| 1031 |
specified as the empty set, in which case merging of dissimilar |
| 1032 |
requests will not be allowed). If the ordering function specified in |
| 1033 |
this section gives a partial order (if it is possible for two RSpecs |
| 1034 |
or TSpecs to be unordered), then a separate upper bound computation |
| 1035 |
for the parmeter must be given as well. |
| 1036 |
|
| 1037 |
oo Notes on Service Substitution |
| 1038 |
|
| 1039 |
This portion of the service description may also note any |
| 1040 |
relationships with other services which are strictly ordered with |
| 1041 |
respect to the service being defined. Two services A and B are |
| 1042 |
strictly ordered if it is always possible to substitute service B for |
| 1043 |
the service A given a set of invocation parameters for service A. |
| 1044 |
This ordering information may be used to allow network elements which |
| 1045 |
provide service B to respond to requests for service A, even if the |
| 1046 |
element does not provide service A directly. If the service |
| 1047 |
specification describes such an inter-service ordering, it MUST also |
| 1048 |
include a description of the invocation parameter mapping function |
| 1049 |
for that ordering. |
| 1050 |
|
| 1051 |
Substitution of of one service for another in cases where they are |
| 1052 |
not strictly ordered is currently not supported. A future version of |
| 1053 |
this document may augment the service specification format to support |
| 1054 |
this capability. |
| 1055 |
|
| 1056 |
|
| 1057 |
|
| 1058 |
|
| 1059 |
|
| 1060 |
<span class="grey">Shenker & Wroclawski Informational [Page 19]</span></pre> |
| 1061 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-20" ></span> |
| 1062 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 1063 |
|
| 1064 |
|
| 1065 |
o Guidelines for Implementors |
| 1066 |
|
| 1067 |
Many services may be defined in a manner which allows the range of |
| 1068 |
behavior of a compliant network element to be rather broad. This |
| 1069 |
section should provide some guidance as to what range of behaviors |
| 1070 |
the author of the service specification expects the community to |
| 1071 |
desire in their implementations. Because these guidelines depend on |
| 1072 |
such imprecise and undefinable notions at "typical loads", these |
| 1073 |
guidelines cannot be incorporated as part of a strict compliance |
| 1074 |
test. Instead, they are for informational purposes only. |
| 1075 |
|
| 1076 |
o Evaluation Criteria |
| 1077 |
|
| 1078 |
Specific functional behaviors required of an implementation for |
| 1079 |
conformance to a service specification is detailed in the previous |
| 1080 |
sections. However, the service specifications are intended to allow |
| 1081 |
a wide range of implementations, and these implementations will |
| 1082 |
differ in performance. This section describes tests that can be used |
| 1083 |
to evaluate a network element's implementation of a given service. |
| 1084 |
|
| 1085 |
Implementors of service modules face a number of tradeoffs, and it is |
| 1086 |
unlikely that a single implementation would be considered "best" |
| 1087 |
under all circumstances. For instance, given the same service |
| 1088 |
specification, an implementation appropriate for a low-speed link |
| 1089 |
might target extremely high link utilization, while a different |
| 1090 |
implementation might attempt to reduce non-loaded packet forwarding |
| 1091 |
delay to the minimum at the expense of somewhat lower utilization of |
| 1092 |
the link. The intention of the tests specified in this section should |
| 1093 |
be to probe the tradeoffs made by the implementation designer, and to |
| 1094 |
provide metrics useful to guide the customer's choice of an |
| 1095 |
appropriate implementation for her needs. |
| 1096 |
|
| 1097 |
The tests specified in this section should be designed to operate on |
| 1098 |
a single network element in isolation. This enables their use in a |
| 1099 |
comparative rating system for QoS-aware network elements. In |
| 1100 |
production networks, users will be more concerned with the end-to-end |
| 1101 |
behavior obtained, which will depend not just on the particular |
| 1102 |
network elements selected, but also on other factors such as the |
| 1103 |
setup protocol and the bandwidth of the links. Some user-relevant |
| 1104 |
performance factors are the rate of admission control rejections, the |
| 1105 |
range of services offered, and the packet delay and drop rates in the |
| 1106 |
various service classes. The form of any standardized end-to-end |
| 1107 |
metrics and measurement tools for integrated service internetworks is |
| 1108 |
not specified by this document or by service specification document |
| 1109 |
which follow the format given here. |
| 1110 |
|
| 1111 |
This section is for informational purposes only. |
| 1112 |
|
| 1113 |
|
| 1114 |
|
| 1115 |
|
| 1116 |
<span class="grey">Shenker & Wroclawski Informational [Page 20]</span></pre> |
| 1117 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-21" ></span> |
| 1118 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 1119 |
|
| 1120 |
|
| 1121 |
o Examples of Implementation |
| 1122 |
|
| 1123 |
This section describes example instantiations of the service. Often |
| 1124 |
these will just be references to the literature, or brief sketches of |
| 1125 |
how the service could be implemented. The purposes of the section |
| 1126 |
are to to provide a more concrete sense of the service being |
| 1127 |
specified and to provide pointers and hints to aid the implementor. |
| 1128 |
However, the descriptions in this section are specifically not |
| 1129 |
intended to exclude other implementation strategies. |
| 1130 |
|
| 1131 |
This section is for informational purposes only. |
| 1132 |
|
| 1133 |
o Examples of Use |
| 1134 |
|
| 1135 |
In order to provide more a more concrete sense of how this service |
| 1136 |
might be used, this section describes some example uses of the |
| 1137 |
service, for informational purposes only. The examples here are not |
| 1138 |
meant to be exhaustive, and do not exclude in any way other uses of |
| 1139 |
the service. |
| 1140 |
|
| 1141 |
This section is for informational purposes only. |
| 1142 |
|
| 1143 |
Security Considerations |
| 1144 |
|
| 1145 |
Security considerations are not discussed in this memo. |
| 1146 |
|
| 1147 |
References |
| 1148 |
|
| 1149 |
[<a id="ref-PARTRIDGE">PARTRIDGE</a>] C. Partridge, Gigabit Networking, Addison Wesley |
| 1150 |
Publishers (1994). |
| 1151 |
|
| 1152 |
[<a id="ref-RFC 2215">RFC 2215</a>] Shenker, S., and J. Wroclawski, "General Characterization |
| 1153 |
Parameters for Integrated Service Network Elements", <a href="./rfc2215">RFC 2215</a>, |
| 1154 |
September 1997. |
| 1155 |
|
| 1156 |
[<a id="ref-RFC 2205">RFC 2205</a>] Braden, R., Ed., et. al., "Resource Reservation Protocol |
| 1157 |
(RSVP) - Version 1 Functional Specification", <a href="./rfc2205">RFC 2205</a>, September |
| 1158 |
1997. |
| 1159 |
|
| 1160 |
[<a id="ref-RFC 2212">RFC 2212</a>] Shenker, S., Partridge, C., and R. Guerin, "Specification |
| 1161 |
of Guaranteed Quality of Service", <a href="./rfc2212">RFC 2212</a>, September 1997. |
| 1162 |
|
| 1163 |
[<a id="ref-RFC 2211">RFC 2211</a>] Wroclawski, J., "Specification of the Controlled Load |
| 1164 |
Quality of Service", <a href="./rfc2211">RFC 2211</a>, September 1997. |
| 1165 |
|
| 1166 |
[<a id="ref-RFC 1819">RFC 1819</a>] Delgrossi, L., and L. Berger, Editors, "Internet Stream |
| 1167 |
Protocol Version 2 (ST2) Protocol Specification - Version ST2+", <a href="./rfc1819">RFC</a> |
| 1168 |
<a href="./rfc1819">1819</a>, August 1995. |
| 1169 |
|
| 1170 |
|
| 1171 |
|
| 1172 |
<span class="grey">Shenker & Wroclawski Informational [Page 21]</span></pre> |
| 1173 |
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-22" ></span> |
| 1174 |
<span class="grey"><a href="./rfc2216">RFC 2216</a> Network Element Service Template September 1997</span> |
| 1175 |
|
| 1176 |
|
| 1177 |
[<a id="ref-RFC 2210">RFC 2210</a>] Wroclawski, J., "The Use of RSVP with IETF Integrated |
| 1178 |
Services", <a href="./rfc2210">RFC 2210</a>, September 1997. |
| 1179 |
|
| 1180 |
Authors' Address: |
| 1181 |
|
| 1182 |
Scott Shenker |
| 1183 |
Xerox PARC |
| 1184 |
3333 Coyote Hill Road |
| 1185 |
Palo Alto, CA 94304-1314 |
| 1186 |
|
| 1187 |
Phone: 415-812-4840 |
| 1188 |
Fax: 415-812-4471 |
| 1189 |
EMail: [email protected] |
| 1190 |
|
| 1191 |
|
| 1192 |
John Wroclawski |
| 1193 |
MIT Laboratory for Computer Science |
| 1194 |
545 Technology Sq. |
| 1195 |
Cambridge, MA 02139 |
| 1196 |
|
| 1197 |
Phone: 617-253-7885 |
| 1198 |
Fax: 617-253-2673 |
| 1199 |
EMail: [email protected] |
| 1200 |
|
| 1201 |
|
| 1202 |
|
| 1203 |
|
| 1204 |
|
| 1205 |
|
| 1206 |
|
| 1207 |
|
| 1208 |
|
| 1209 |
|
| 1210 |
|
| 1211 |
|
| 1212 |
|
| 1213 |
|
| 1214 |
|
| 1215 |
|
| 1216 |
|
| 1217 |
|
| 1218 |
|
| 1219 |
|
| 1220 |
|
| 1221 |
|
| 1222 |
|
| 1223 |
|
| 1224 |
|
| 1225 |
|
| 1226 |
|
| 1227 |
|
| 1228 |
Shenker & Wroclawski Informational [Page 22] |
| 1229 |
</pre> |