Does not communicate full routing info btw orgs Roouting updates contain :- AS numbers Aggregated Prefx Address Policy routing info !e routing updates are "ery important so it uses #P !e key features of BGP-4 include t!ese: $ %t is a pat! "ector protocol& $ 'ull routing updates are sent at t!e start of t!e session( trigger updates are sent subse)uently& $ %t creates and maintains connections between peers( using #P port *+,& $ !e connection is maintained by periodic -eepali"es& $ !e failure to see a -eepali"e( an update( or a notifcation is t!e means by w!ic! destination networ-s and pat!s to t!ose destinations are trac-ed& Any c!ange in t!e networ- results in a triggered update& $ !e metric used in ./P-0 is intricate and is t!e source of its complexity and its strengt!& !e metric( referred to as attributes( allows great granularity in pat! selection& $ !e use of !ierarc!ical addressing and t!e capability to manipulate tra1c 2ow results in a networ- t!at is designed to grow& $ %t !as its own routing table( alt!oug! it is capable of bot! s!aring and in)uiring of t!e interior %P routing table& $ %t is possible to manipulate t!e tra1c 2ow by using t!e complex metric called attributes( but policy-based routing is based on t!e !op-by-!op paradigm& !is means t!at no router can send tra1c on a route t!at t!e next-!op router would not c!oose for itself& Overview of the BGP-4 Operation ./P-0 is connection-oriented& 3!en a neig!bor is seen( a #P peering session is establis!ed and maintained& ./P-0 probes are sent out periodically to sustain t!e lin- and maintain t!e session& !ese probes( ot!erwise -nown as -eepali"es( are simply t!e *, byte !eader used in t!e ./P updates& 4a"ing establis!ed t!e session( t!e routing tables are exc!anged and sync!roni5ed& !e routers now send incremental updates only w!en c!anges occur& !e update refers to a single pat! and t!e networ-s t!at may be reac!ed "ia t!at pat!& 4a"ing corrected t!e routing table( t!e ./P-0 process propagates t!e c!ange to all neig!bors( wit! a few exceptions( based on an algorit!m to ensure a loop-free networ-& !e operation of ./P-0 is "ery straig!tforward& %ndeed( all t!e complexity of t!e protocol is deli"ered in only a few di6erent types of routing pac-ets& Message Types 'our di6erent message types are used in ./P-0: $ 7pen messages8Used to establis! connections wit! peers& $ 9eepali"es8Sent periodically between peers to maintain connections and "erify pat!s !eld by t!e router sending t!e -eepali"e& !ese pac-ets are sent unreliably& %f t!e periodic timer is set to a "alue of :( t!is e)uates to infnity( and no -eepali"es are sent& $ Update messages8#ontain pat!s to destination networ-s and t!e pat! attributes& Routes t!at are no longer a"ailable or wit!drawn routes are included in updates& !ere is one pat! per update( re)uiring many updates for many pat!s& !e information contained in t!e update includes t!e pat! attributes suc! as origin( Autonomous System pat!( neig!bor( and inter-Autonomous System metric& $ ;otifcation8Used to inform t!e recei"ing router of errors&