The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within an AS, border routers exchange externally-learned BGP route advertisements via Internal- BGP (I-BGP) peerings. Naive solutions for these I-BGP peering sessions (e.g., based on full-mesh topologies) simply cannot scale to the sizes of modern AS networks.

The Internet consists of many administrative domains, or \emph{Autonomous Systems} (ASes), each owned by an economic entity (Microsoft, AT\&T, The Hebrew University, etc.). The task of ensuring interconnectivity between ASes, known as \emph{interdomain routing}, is currently handled by the \emph{Border Gateway Protocol} (BGP). ASes are self-interested and might be willing to manipulate BGP for their benefit. In this paper we

Border Gateway Protocol (BGP) is the most commonly used method for routing between autonomous systems, it selects paths where the data (traffic) is routed between the autonomous systems BGP to calculate the routes by attributes or policies. There are two types of attributes, the first type is the well-known attributes that must be recognized by all nodes and are propagated to other nodes and it is divided into two types, well known mandatory one that must be represented in all updates and well known discretionary that may be presented but not a must. The second type is the optional attributes that are recognized by some nodes but not all of them and expected not to be recognized by all nodes and are also divided into two types, optional transitive which if not recognized it is propagated to other neighbors and non-transitive which if not recognized they will be dropped. BGP does not put the link utilization in its calculations to select the best route to rout traffic on it. We will present a proposal to put the traffic utilization in the calculation for the best route selection.