1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691
|
<pre>RFC: 756 July 1979
<span class="h1">The NIC Name Server--A Datagram Based Information Utility</span>
by
John R. Pickens, Elizabeth J. Feinler, and James E. Mathis
July 1979
SRI International
Telecommunications Sciences Center
333 Ravenswood
Menlo Park, California 94025
(Also published in Proceedings of the Fourth Berkeley Conference
on Distributed Data Management and Computer Networks)</pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-1" ></span>
NIC Name Server July 1979
Abstract
In this paper a new method for distributing and updating host
name/address information in large computer networks is described.
The technique uses datagrams to provide a simple
transaction-based query/response service. A provisional service
is being provided by the Arpanet Network Information Center (NIC)
and is used by mobile packet radio terminals, as well as by
several Arpanet DEC-10 hosts. Extensions to the service are
suggested that would expand the query functionality to allow more
flexible query formats as well as queries for service addresses.
Several architectural approaches with potential for expansion
into a distributed internet environment are proposed. This
technique may be utilized in support of other distributed
applications such as user identification and group distribution
for computer based mail.
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. INTRODUCTION</span>
In large computer networks, such as the Arpanet [1],
network-wide standard host-addressing information must be
maintained and distributed. To fulfill that need, the Arpanet
Network Information Center (NIC) at SRI International has
maintained, administered, and distributed the host addressing
data base to Arpanet hosts since 1972 [2].
The most common method for maintaining an up-to-date copy on
each host is to bulk-transfer the entire data base to each host
individually. This technique satisfies most host addressing
needs on the Arpanet today. However, some hosts maintain neither
a complete nor a current copy of the data base because of limited
memory capacity and infrequent processing of updates. In
addition, with the expansion of the Arpanet into the internet
environment [3, 4], a strong need has arisen for new techniques
to augment the distribution of name/address information.
One method currently being investigated is the dynamic
distribution of host-address information via a transaction-based,
inquiry-response process called the Name Server [5, 6]. To
support this investigation, the NIC has developed a provisional
Name Server that is compatible with a level of service specified
in the Defense Advanced Research Projects Agency (DARPA) Internet
experiment [5]. The basic Name Server is described in this paper
and a set of additional functions that such a service might be
expected to support is proposed.
The discussion is structured as follows: <a href="#section-1">Section 1</a> describes
the NIC Name Server and how it is derived from the NIC data base
service. <a href="#section-2">Section 2</a> describes extensions of the name server which
allow a richer syntax and queries for service addresses. Section
<span class="grey">SRI International [Page 1]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-2" ></span>
<span class="grey">July 1979 NIC Name Server</span>
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a> discusses architectural issues, and presents some preliminary</span>
thoughts on how to evolve from the current centralized,
hierarchic service to a distributed Name Server service.
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. THE NIC NAME SERVER</span>
A Name Server service has been installed on SRI-KA, an Arpanet
DEC-10. Inquiry-response access is via the Internet Name Server
protocol [5], which in turn employs the DARPA Internet Protocol,
IP4 [7].
To demonstrate the service a simple interactive facility is
provided to format user input into name server requests--e.g. a
query of the form !ARPANET!FOO-TENEX returns an address such as
"10 2 0 9" (NET=10, HOST=2, LOGICALHOST=0, IMP=9; for details of
host address formats see [8]).
User access to the name server has been implemented on several
Arpanet DEC-10 TENEX and Packet Radio Network LSI-11 Terminal
Interface Unit (TIU) hosts [9, 10]. While the TENEX program
serves primarily as a demonstration vehicle, the LSI-11 program
provides a valuable augmentation of the TIU's host table. A
typical scenario is that when the packet radio TIU is initiated
or initialized, it contains only a minimal host table, with the
addresses of a few candidate name servers. The user queries the
name server with a simple manual query process, and then uses the
address obtained to open a TELNET connection to the desired host.
The information to support the name server originates from the
NIC's Arpanet host address data base. An optimized version of
this data base is presented to the name server upon program
initiation as an input file.
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. NAME SERVER ISSUES</span>
The basic name server provides a simple address-binding service
[5]. In response to a datagram query [7, 11], the name server
returns either an address, a list of similar names if a unique
match is not found, or an error indication. Several useful
additional functions can be envisioned for the name server such
as service queries and broader access to host-related
information.
<span class="h3"><a class="selflink" id="section-3.1" href="#section-3.1">3.1</a>. Similar Names</span>
An important issue to be resolved is that of the interpretation
given to the "similar names" response. A standard definition
should be given and not be left to implementors' whims.
[Page 2] SRI International</pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-3" ></span>
NIC Name Server July 1979
If the "similar names" response is used primarily to provide
helpful information to a human-interface process, then it may be
useful to model the behavior of the name server on the behavior
of other known processes that present host name information on
demand. An example of this is a common implementation of virtual
terminal access on the Arpanet, User TELNET [12], in which three
different functions occur:
1. Upon termination of host name input (e.g. <CR>), the
user is warned only with an audible alarm if the name
used is not unique. If the name is unique, the name is
completed, and the requested operation is initiated.
2. In response to <ESC>, either the name will be completed
if unique or the user will be warned with an audible
alarm if the name is not unique.
3. Only in response to "?" will a list of similar names be
printed. "Similar names", in this case, means all
names that begin with the same character string. The
list is alphabetized.
In support of this style of user interface, it may be
appropriate to return the "similar names" response only when
requested. Two ways to achieve this might be either to set an
option bit or to use "?" to force the similar names response.
<span class="h3"><a class="selflink" id="section-3.2" href="#section-3.2">3.2</a>. Query Syntax</span>
A second issue in the provision of name server service is that
of query syntax. The basic level of service previously described
allows only a few query functions. With more intelligent name
servers, complex queries can be supported.
The current Internet name server requires two fields in the
query string--a network name field and a host name field. If the
network field is non-existent, a local network query is assumed.
Since network independent queries are desirable, an expanded
query functionality must be specified. One way this might be
done is to add to the notion of "missing field", which means
"local", the notion of a special character like "*", which means
"all".
The semantic range of queries afforded by adopting this
convention is listed below (Note: ~ is used to mean "null". If
both network and host fields are null the representation is "~
~". "N" means "network" and "H" means "host"):
<span class="grey">SRI International [Page 3]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-4" ></span>
<span class="grey">July 1979 NIC Name Server</span>
~ ~ local net, local host (validity check?)
~ * local net, all hosts
~ H local net, named host
* ~ all nets, local host (inverse search)
* * all nets, all hosts (probably prohibited)
* H all nets, named host
N ~ named net, local host (inverse search)
N * named net, all hosts
N H named net, named host
By combining the on-demand similar-names function, "all" and
"local", and by allowing "*" to be prefixed or appended to the
query string as a wild card character, one can query as follows:
~ SRI*? All hosts named SRI* on local net
* SRI*? All hosts named SRI* on all nets
* *UNIX*? All hosts named *UNIX* on all nets
<span class="h3"><a class="selflink" id="section-3.3" href="#section-3.3">3.3</a>. Service Queries</span>
It has been suggested that the name server be generalized into
a binding function [13, 14]. In this context, allowing service
queries is a very useful extension. One application of this
service, that exists within the Packet Radio Project at SRI, is
the need to find the addresses of Hosts that support the
LoaderServer service--a service that allows packet radio TIUs to
receive executable programs via downline loading.
Service querying, unlike host names querying, requires a
multiple response capability. The querying process would, upon
receiving multiple service descriptors, attempt to establish
access to each service, one at a time, until successful.
Service descriptors consist of an official name, a list of
alias names, and a network-dependent address. In the case of
Arpanet Internet services, this address field would consist of
the host address(32 bits), port(32 bits), and protocol number(8
bits). For Arpanet NCP services, the address would consist of a
host address(24 bits) and a socket(32 bits).
[Page 4] SRI International</pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-5" ></span>
NIC Name Server July 1979
Syntactically, service queries can be derived from host queries
by the addition of a service name field, as below:
NET HOST SERVICE
A network-independent service query, for example, can be
represented as:
* * SERVICE
<span class="h3"><a class="selflink" id="section-3.4" href="#section-3.4">3.4</a>. Name Server Options</span>
The concept of options has been introduced in the discussion of
the "similar names" function. Another group of options may be
used to specify the format of the reply. At one extreme is the
compact, binary, style such as exists in the basic level of
service. At the other extreme is an expanded, textual, style
such as is represented by a NIC host table record with official
and alias names included. Options can be envisioned that
specify:
- Binary versus text format
- Inclusion of each field in the reply
- Inclusion of official name, per field, in the reply
- Inclusion of alias names, per field, in the reply
- Inclusion of other miscellaneous information, such as
operating system, machine type, access restrictions,
and so on.
Other options can be envisioned that specify the scope of the
search, such as "find SERVER hosts only". An alternate form for
specifying formats might be to settle on several standard ones,
and allow an option to select among them.
Certainly, not all name servers can support all such options,
and not all options are equally useful. Thus, the proposed list
will be expanded or contracted to fit the actual needs of
processes using the name server service.
<span class="h3"><a class="selflink" id="section-3.5" href="#section-3.5">3.5</a>. MORE DATA Protocol</span>
It should be noted that some of the proposed name server
extensions have the potential for generating more than a single
datagram's worth of reply, since the current DARPA Internet
Protocol limits the size which all networks must support to 576
octets [15]. In spite of this, the size of such replies need not
require a full-blown stream protocol. Several alternatives
<span class="grey">SRI International [Page 5]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-6" ></span>
<span class="grey">July 1979 NIC Name Server</span>
exist:
1. Disallow options that imply large replies.
2. Truncate the packet for large replies.
3. Ignore the recommended maximum datagram size.
4. Utilize an alternate base protocol for such requests.
5. Develop a MORE DATA protocol.
If alternative 1 is chosen, the potential for overflow exists,
even with the basic level of service. Alternative 2 implies
unpredictable behavior to the user of the name server service.
Alternative 3 reduces the availability of the service.
Alternative 4 is certainly possible, but may be overkill.
Alternative 5 appears to be a reasonable solution and could be
implemented very simply. The name server could return, as part
of the reply, a code of the following form:
+------+---------+
| MORE | ID_NEXT |
+------+---------+
where ID_NEXT is a name-server-chosen quantity that allows the
name server to find the next block of reply, the next time it is
queried. This quantity may be an internal pointer, a block
number, or whatever the name server chooses. Follow-on queries
may be implemented by recomputing the entire original query and
discarding output until the ID_NEXT block is reached, or by
efficiently storing the entire reply in a cache, fragmented into
blocks (with appropriate decay algorithms).
<span class="h3"><a class="selflink" id="section-3.6" href="#section-3.6">3.6</a>. Dynamic Updates</span>
In the previous discussion, the host name data base was assumed
to have been a static or slowly changing entity with an
administrative and manual update authority. This model reflects
most of the network needs in the Arpanet and Internet
communities. However, dynamic automated updating of the host
table may be needed in the future, especially in mobile
environments such as the Packet Radio Network.
In a closed user group community (such as a local network of
mutually trusting hosts), dynamic updating becomes simply a
technical question concerning packet formats. In wider
communities, a mechanism to authenticate the change request must
be developed; however, the authentication issue is outside the
scope of this paper.
[Page 6] SRI International</pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-7" ></span>
NIC Name Server July 1979
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. ARCHITECTURE</span>
The Name Server concept is invaluable for allowing hosts with
incomplete knowledge of the network address space to obtain full
access to network services. Whether for reasons of insufficient
kernel space or of dynamically changing environments, the need
for the service is little questioned. However, significant
design issues revolve around the methods for providing the
service and for administering and updating the data base.
In the current NIC Name Server, the service is centralized, and
is supported by a data base administered by a single authority.
In the long range, other architectures are possible that present
more flexible ways to distribute host information within and
between networks and administrative entities. These present
opportunities for dynamic, automated, approaches to the
maintenance and sharing of data--particularly host name data.
From an evolutionary point of view, initial Name Server
services will likely exist as a centralized service, possibly
with one large Name Server that has knowledge of multiple
networks. From this beginning, an expansion in two orthogonal
directions can be envisioned.
- In the direction of internal distribution, the name
server can be partitioned into multiple, cooperating
processes on separate hosts. The data base can be
replicated exactly or managed as a distributed data
base.
- In the direction of administrative distribution,
multiple autonomous name servers may exist that
exchange data in an appropriate fashion, on a per
network or other administrative basis.
For hosts with small host tables, caching might be used,
whereby local, temporary copies would be maintained of subsets of
the addressing data base. Such copies may be obtained either by
remembering previous queries made of name servers, or by
receiving automatic distributions of data from name servers. For
mobile hosts, in which even the home network is unknown, it would
be possible to maintain a very sparse table with the addresses of
only a few name servers.
For hosts lacking even the knowledge of name server addresses,
a very primitive name server function can be provided by all
network hosts that would allow real name servers to be located;
e.g., a query of the form "* * RealNameServer" addressed to an
arbitrarily selected host could elicit the address of a real Name
Server.
Finally, the possibility exists for multiple name servers to
communicate dynamically in attempting to resolve queries. If,
<span class="grey">SRI International [Page 7]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-8" ></span>
<span class="grey">July 1979 NIC Name Server</span>
for example, a name server on the Arpanet receives a query for a
host on the Packet Radio Network, then the Arpanet name server
can conceivably query the Packet Radio Network Name Server to
resolve the reply.
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. FUTURE WORK</span>
The techniques discussed in this paper for providing dynamic
access to and maintenance of host address information are
generally applicable to other information-providing services.
Two possibilities currently under investigation at SRI include
user identification servers [16] and time servers, which offer
people/address and time-stamp information, respectively, as
datagram driven information utilities.
Further work is needed to refine the implementation of the name
server and its using query processes. Two items in particular
are direct system calls into the NIC data base management system
for general access to host information and process-level query
interfaces for using processes. The design issues for efficient
implementation are complex and involve some trade-offs. The most
obvious trade-off is volume of network traffic versus "freshness"
of information. The local host table handler can either send a
message to the name server for every address request, or it can
use some type of local cache to remember frequently requested
names. SRI is exploring both the process-level interface for the
LSI-11 TIU and the problems of local host table management in
small machines operating in a dynamic environment.
Information services such as the Name Server are integral
components of distributed systems and applications. However, the
effective utilization of such services is a relatively unstudied
and unexplored area. One area in which SRI plans to study their
impact on distributed architectures is in computer based mail
applications. Information utilities in this environment can
range from the support of simple mailbox address queries to
complex address list management needed for inter-organizational
and group resolution.
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. CONCLUSION</span>
A provisional Name Server service, based on the NIC host
address data base was described in this paper. In addition, a
collection of design ideas for an internet Name Server service
has been presented.
Work is continuing on the refinement of the NIC name server
service. New requirements and opportunities for functional
distribution are being investigated. Many questions have been
[Page 8] SRI International</pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-9" ></span>
NIC Name Server July 1979
raised in exploring an expansion of the existing service. Such an
expansion is expected to result in more useful support of
internet (and intranet) capability.
REFERENCES
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. L. G. Roberts and B. D. Wessler, "Computer Network</span>
<span class="h2"> Development to Achieve Resource Sharing," in Proceedings of</span>
SJCC, pp. 543-549 (AFIP, 1970).
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. M. D. Kudlick and E. J. Feinler, Host Names On-line, <a href="./rfc608">RFC</a></span>
<a href="./rfc608">608</a>, Stanford Research Institute, Menlo Park, California
(January 1974).
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. V. G. Cerf and R. E. Kahn, "A Protocol for Packet Network</span>
<span class="h2"> Interconnection," IEEE Transactions on Communication</span>
Technology, Vol. COM-22, pp. 637-641 (1974)._
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. V. G. Cerf and P. T. Kirstein, "Issues in Packet-Network</span>
<span class="h2"> Interconnection," Proc. IEEE, Vol. 66, No. 11, pp.</span>
1386-1408 (November 1978).
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. J. Postel, Internet Name Server, IEN 89, Information</span>
<span class="h2"> Sciences Institute, Univ. of Southern Calif., Marina Del</span>
Rey, California, May 1979.
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. J. R. Pickens, E. J. Feinler and J. E. Mathis, An</span>
<span class="h2"> Experimental Network Information Center Name Server</span>
(NICNAME), IEN 103, SRI International, Menlo Park,
California (May 1979).
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. J. Postel, Internet Protocol, IEN 81, Information Sciences</span>
<span class="h2"> Institute, Univ. of Southern Calif., Marina Del Rey,</span>
California (February 1979).
<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. J. Postel, Address Mappings, IEN 91, Information Sciences</span>
<span class="h2"> Institute, Univ. of Southern Calif., Marina Del Rey,</span>
California (May 1979).
<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. R. E. Kahn, "The Organization of Computer Resources into a</span>
<span class="h2"> Packet Radio Network," IEEE Transactions on Communications,</span>
Vol. COM-25, No. 1, pp. 169-178 (January 1977).
<span class="h2"><a class="selflink" id="section-10" href="#section-10">10</a>. R. E. Kahn, S. A. Gronemeyer, J. Burchfiel, and R. C.</span>
<span class="h2"> Kunzelman, "Advances in Packet Radio Technology," Proc.</span>
IEEE, Vol. 66, No. 11, pp. 1468-1496 (November 1978).
<span class="h2"><a class="selflink" id="section-11" href="#section-11">11</a>. J. Postel, User Datagram Protocol, IEN 88, Information</span>
<span class="h2"> Sciences Institute, Univ. of Southern Calif., Marina Del</span>
Rey, California (May 1979).
<span class="grey">SRI International [Page 9]</span></pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-10" ></span>
<span class="grey">July 1979 NIC Name Server</span>
<span class="h2"><a class="selflink" id="section-12" href="#section-12">12</a>. E. Leavitt, TENEX USER'S GUIDE, Bolt Beranek and Newman,</span>
<span class="h2"> Inc., Cambridge, Massachusetts.</span>
<span class="h2"><a class="selflink" id="section-13" href="#section-13">13</a>. R. Bressler, A Proposed Experiment With a Message Switching</span>
<span class="h2"> Protocol (section on Information Operator), pp. 26-31, <a href="./rfc333">RFC</a></span>
<a href="./rfc333">333</a>, Bolt Beranek and Newman Inc, Cambridge, Mass. (May 15,
1972).
<span class="h2"><a class="selflink" id="section-14" href="#section-14">14</a>. Y. Dalal, Internet Meeting, January 24,25 1979, (Group</span>
<span class="h2"> Discussion).</span>
<span class="h2"><a class="selflink" id="section-15" href="#section-15">15</a>. J. Postel, Internet Meeting Notes - 25,26 January 1979, pp.</span>
<span class="h2"> 12, IEN 76, Information Sciences Institute, Univ. of</span>
Southern Calif., Marina Del Rey, California (February
1979).
<span class="h2"><a class="selflink" id="section-16" href="#section-16">16</a>. E. J. Feinler, "The Identification Data Base in a</span>
<span class="h2"> Networking Environment," in NTC '77 Conference Record, pp.</span>
21:3 (IEEE, 1977).
[Page 10] SRI International</pre>
<hr class='noprint'/><!--NewPage--><pre class='newpage'><span id="page-i" ></span>
NIC Name Server July 1979
Table of Contents
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. INTRODUCTION </span> 1
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. THE NIC NAME SERVER </span> 2
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. NAME SERVER ISSUES </span> 2
3.1. Similar Names 2
3.2. Query Syntax 3
3.3. Service Queries 4
3.4. Name Server Options 5
3.5. MORE DATA Protocol 5
3.6. Dynamic Updates 6
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. ARCHITECTURE </span> 7
<span class="h2"><a class="selflink" id="section-5" href="#section-5">5</a>. FUTURE WORK </span> 8
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. CONCLUSION </span> 8
REFERENCES 9
SRI International [Page i]
</pre>
|