draft-hares-bgp-statemt-00.txt

BCAST Implementation for NS2

                                                                        
   Internet Draft                                              S. Hares 
   Document: draft-hares-bgp-statemt-00.txt                       NextHop 
                                                          Technologies, 
                                                                   Inc. 
   Expires: August 2002                                   February 2002 
 
                                     
   BGP-4 Finite State Machine Table 
    
 
   Status of this Memo 
    
    
   This document is an Internet-Draft and is in full conformance 
   with all provisions of Section 10 of RFC2026. 
    
   Internet-Drafts are working documents of the Internet Engineering 
   Task Force (IETF), its areas, and its working groups.  Note that      
   other groups may also distribute working documents as Internet-
   Drafts. 
    
   Internet-Drafts are draft documents valid for a maximum of six 
   months and may be updated, replaced, or obsoleted by other documents 
   at any time.  It is inappropriate to use Internet-Drafts as 
   reference material or to cite them other than as "work in progress." 
    
   The list of current Internet-Drafts can be accessed at 
        http://www.ietf.org/ietf/1id-abstracts.txt 
   The list of Internet-Draft Shadow Directories can be accessed at 
        http://www.ietf.org/shadow.html. 
 
 
 
Abstract 
         
        This document describes the BGP-4 Finite State Machine in detail.
	This Finite State machine (FSM) describes how the 27 events
	operate on the 6 states described in the BGP-4 standard.   
	These 27 events include administrative events, timer events,
	TCP connectivity events and BGP message events. 

        This document is standards track to accompany the BGP-4 [1] standard
	as a standard document.  This description augments the BGP-4 FSM
	description (section 8 of BGP-4 draft).
 
           
                   Table of Contents 
      
        Abstract     .........................................1 
        1.0 BGP FSM Table Overview........................... 2 
        2.0 BGP FSM Table    .................................4 
        3.0 Actions in state table............................5 
        Security Considerations...............................8 
        References............................................9
        Author's Addresses.................................   9



    
   Hares         Informational - Expires August 2002                1 




   BGP-4 Finite State Machine                           February 2002 
    
    
    
1.0 BGP FSM Table Overview 

       
      The table below gives the BGP State machine in table format.  There 
      are 6 states in the state table:  Idle, Connect, Open Sent, Active, 
      Open Confirm, and Established.  The states are listed as columns in 
      the table. 
       
      Each row of the table focuses on the state transitions when a single 
      event occurs.  The event is listed as the row header 
       
      In each box of the table, the first entry in the box is the new 
      state.  The second entry is the set of actions.   Each action is 
      either specified (such as Ignore) or it given a Letter (such as B) 
      that is described at the end of the table. 
       
      For example, if an manual start event occurs in the Idle state, the 
      local system performs the actions listed under 鬉