RFC58 Logical Message Synchronization

0058 Logical Message Synchronization. T.P. Skinner. June 1970. (Format: TXT=3767 bytes) (Status: UNKNOWN)

日本語訳
RFC一覧

参照

Network Working Group                                      T. P. Skinner
Request for Comments: 58                                 MIT Project MAC
                                                               June 1970

                    Logical Message Synchronization


At the last network meeting, the question of logical and physical
message distinctions was raised.  An argument was made in favor of
never running two logical messages together as one or more physical
messages.  Another method of stating this is that a logical message
must begin on a physical message boundary.  This did not, however,
solve the problem of locating the end of a logical message.  A rather
poor technique was suggested by myself which consisted of using the
first partial physical message as an indication of the last physical
message of the logical message.  This technique was thrown out for a
number of very valid reasons.  The solution that seemed most pleasing
was the inclusion of some sort of a bit count or data type
specification to precede the logical message.  Most everyone seemed to
like this even though it was stated in a very general way.

As of this writing it appears that it is desired to completely sever
the relation between physical and logical messages.  This certainly is
aesthetically pleasing.  However, we are now forced to view the
network as a virtually infinite bit stream with no physical
delineations.  It may well do to transmit a logical header and bit
count for each message as long as there are no errors along the line.
If, however, a bit is dropped, the problem of synchronization is
compounded by the fact that we have no ability to search for the
beginning of a logical message other than brute force.  An error of
this type could be introduced by faulty host or user software/hardware
as well as the imp itself.  This would involve the shifting of the
message bit by bit and seeing if the data looked reasonable.  This
could certainly be time-consuming as well as introducing the
possibility of false synchronism.

I can think of several solutions to the problem at the moment.  None
of them seems to be very good.  Upon losing synchronism, a user could
send some form of error message to the other host.  The other host
could then in return cease sending and wait for a message to continue
from the troubled user.  This would allow the troubled user to flush
out all waiting input.  He would then be assured that the next bit
started a logical message.  The problems here are in assuring
synchrony due to input/output buffering in the network and at both
hosts.  How, for example, can the troubled host be assured he has all
the pending data?  Once he is sure, he can then resume input assuming
all is OK.




                                                                [Page 1]

Another partial solution requires the original restriction that
logical messages always start on physical boundaries.  A user then
merely has to examine the beginning of each physical message to see if
it fits the pattern of a logical message header.  This technique is a
lot safer than examining the entire input stream as well as being
quite a bit faster.

I have not intended to suggest a solution to the problem, but merely
bring it to light.  If we want to restrict logical messages to begin
on physical boundaries we must plan this early in the game.  (It
probably works out that way in most cases anyway.)  Other schemes can
be tried later.  We must, however, face up to this problem fairly
soon.



       [ This RFC was put into machine readable form for entry ]
        [ into the online RFC archives by Carl Alexander 7/97 ]

































                                                                [Page 2]

一覧

 RFC 1〜100  RFC 1401〜1500  RFC 2801〜2900  RFC 4201〜4300 
 RFC 101〜200  RFC 1501〜1600  RFC 2901〜3000  RFC 4301〜4400 
 RFC 201〜300  RFC 1601〜1700  RFC 3001〜3100  RFC 4401〜4500 
 RFC 301〜400  RFC 1701〜1800  RFC 3101〜3200  RFC 4501〜4600 
 RFC 401〜500  RFC 1801〜1900  RFC 3201〜3300  RFC 4601〜4700 
 RFC 501〜600  RFC 1901〜2000  RFC 3301〜3400  RFC 4701〜4800 
 RFC 601〜700  RFC 2001〜2100  RFC 3401〜3500  RFC 4801〜4900 
 RFC 701〜800  RFC 2101〜2200  RFC 3501〜3600  RFC 4901〜5000 
 RFC 801〜900  RFC 2201〜2300  RFC 3601〜3700  RFC 5001〜5100 
 RFC 901〜1000  RFC 2301〜2400  RFC 3701〜3800  RFC 5101〜5200 
 RFC 1001〜1100  RFC 2401〜2500  RFC 3801〜3900  RFC 5201〜5300 
 RFC 1101〜1200  RFC 2501〜2600  RFC 3901〜4000  RFC 5301〜5400 
 RFC 1201〜1300  RFC 2601〜2700  RFC 4001〜4100  RFC 5401〜5500 
 RFC 1301〜1400  RFC 2701〜2800  RFC 4101〜4200 

スポンサーリンク

子要素として許可される要素 内包可能要素

ホームページ製作・web系アプリ系の製作案件募集中です。

上に戻る