Hubert Lelong wrote in a message to all:
 HL> I'm looking for some definition (a kind of RFC ?) for
 HL> Spanning Tree protoocl, where can I get it ?
I hope this is a joke, because I cannot imagine anyone learning this from the 
standards documents.  In any case, it is RFC1583:
1583  Moy, J.  OSPF Version 2.  1994 March; 216 p. (Format:
      TXT=523636 PS=990864 bytes)  (Obsoletes RFC 1247)
You may also want some additional related RFCs:
1585  Moy, J.  MOSPF: Analysis and Experience.  1994 March; 13 p. (Format:
      TXT=29754 bytes)
1584  Moy, J.  Multicast Extensions to OSPF.  1994 March; 102 p. (Format:
      TXT=262463 bytes)
1370  Internet Architecture Board.  Applicability Statement for OSPF.  1992
      October; 2 p. (Format: TXT=4304 bytes)
1246  Moy, J.,ed.  Experience with the OSPF protocol.  1991 July; 31 p.
      (Format: PS=146913 TXT=72180 bytes)
1245  Moy, J.,ed.  OSPF protocol analysis.  1991 July; 12 p. (Format:
      PS=64094 TXT=27492 bytes)
Now that I have given you this, what exactly is it that you are trying to 
find out?  You might look at a good book on the subject, either Christian 
Huitema's "Routing the Internet" or Radia Perlman's more technical 
"Internetwork Routing."  OSPF and spanning tree algorithms generally are 
extremely complex.
 
-- Mike
--- 
---------------