Browse Prior Art Database

Implementing Queues Instead of Timer for Remote Name Directory Maintenance in NETBIOS

IP.com Disclosure Number: IPCOM000116187D
Original Publication Date: 1995-Aug-01
Included in the Prior Art Database: 2005-Mar-30
Document File: 2 page(s) / 59K

Publishing Venue

IBM

Related People

Anand, VK: AUTHOR [+2]

Abstract

Remote Name Directory (RND) Service is one of the features of the IBM* NetBIOS* protocol. RND is used to filter the broadcast storm on the network. A directory is used to store NetBIOS names and the network addresses of the nodes in the NetBIOS network. Frames like NameQuerys and Datagrams can be sent to the target node if the network address is known instead of broadcasting to NetBIOS functional address. RND can be used to eliminate these broadcast frames from the network. Since this directory lookup table can store only a finite number of entries, maintenance should be done to keep the directory up to date.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 52% of the total text.

Implementing Queues Instead of Timer for Remote Name Directory Maintenance
in NETBIOS

      Remote Name Directory (RND) Service is one of the features of
the IBM* NetBIOS* protocol.  RND is used to filter the broadcast
storm on the network.  A directory is used to store NetBIOS names and
the network addresses of the nodes in the NetBIOS network.  Frames
like NameQuerys and Datagrams can be sent to the target node if the
network address is known instead of broadcasting to NetBIOS
functional address.  RND can be used to eliminate these broadcast
frames from the network.  Since this directory lookup table can store
only a finite number of entries, maintenance should be done to keep
the directory up to date.

      It is important to  find out what old entries that the system
may not need.  The entries are considered old when the following
conditions happen:
  1.  The least used name entry from the name cache.
  2.  Name entry not used recently.

      To find out whether an entry has been used least number of
times, a counter can be added.  The counter alone is not enough since
the new name that just got added to the namecache may have been used
only once but the probability of its frequency cannot be determined
by the counter alone.  A timer is needed along with the counter to
determine whether the entry has been used recently.  At the same time
we do not want to complicate the code and thereby add more processing
time to maintain the name cache.  The na...