A Survey on Efforts to Evolve the Control Plane of Inter-Domain Routing <s> Traffic Engineering with BGP <s> Traffic engineering is an important mechanism for Internet network providers seeking to optimize network performance and traffic delivery. Routing optimization plays a key role in traffic engineering, finding efficient routes so as to achieve the desired network performance. In this survey we review Internet traffic engineering from the perspective of routing optimization. A taxonomy of routing algorithms in the literature is provided, dating from the advent of the TE concept in the late 1990s. We classify the algorithms into multiple dimensions: unicast/multicast, intra-/inter- domain, IP-/MPLS-based and offline/online TE schemes. In addition, we investigate some important traffic engineering issues, including robustness, TE interactions, and interoperability with overlay selfish routing. In addition to a review of existing solutions, we also point out some challenges in TE operation and important issues that are worthy of investigation in future research activities. <s> BIB001 </s> A Survey on Efforts to Evolve the Control Plane of Inter-Domain Routing <s> Traffic Engineering with BGP <s> This paper will give an overview of how to connect reliably to the Internet using connections to multiple Internet Service Providers (ISPs). Since there are numerous possible ways for packets to enter and leave our own network in such a setup, a network operator might want to control this behavior as best as possible for several reasons. We will discuss how to achieve this goal. <s> BIB002 </s> A Survey on Efforts to Evolve the Control Plane of Inter-Domain Routing <s> Traffic Engineering with BGP <s> Given the distributed and business-driven nature of the Internet, economic interests of autonomous systems (ASes) may be incompatible. Previous works studied specific effects of incompatible interests, especially BGP policy conflicts leading to routing and forwarding anomalies. In this paper, we focus on the effects of incompatible interests that do not trigger such anomalies. We take the perspective of a single AS: we show that incompatible interests can have a tangible impact on its business and provide a classification of its unsatisfied interests. Since incompatible interests cannot be solved automatically, our effort is directed to support network managers in their business decisions. Hence, we describe algorithms to identify and assess their impact, as well as a prototype of a warning system aimed at signaling the most relevant unsatisfied interests. We evaluate our prototype on real data from two operational networks. In addition, to illustrate the potential of our system, our evaluation shows that unsatisfied interest are relatively frequent and likely affect a significant amount of traffic in practice. <s> BIB003
Control of the outbound network traffic is an easy task. Since an AS controls the decision process on its BGP routes, it can select each best path to reach a particular destination through its peers. The AS can rely on the Local preference attribute, for example. By assigning appropriate values, the AS indicates which route should be considered as the best route to the BGP routers BIB002 . However, it is not a simple task to control inbound network traffic because it requires techniques to be applied that do not guarantee its effectiveness BIB001 . A network operator can use the following techniques to influence the incoming network traffic with the BGP BIB003 : • Selective advertisement: to rely on selective advertisements and announce different route advertisements on different links; • AS-path prepending: by default, the BGP prefers the route with the shortest AS-Path length when two or more routes exist to reach a particular prefix. Increasing the AS Path length of a particular route may change the way that the BGP selects the best routes and consequently how the other AS traffic is handled; • Multi-Exit Discriminator (MED): MED is a hint to external neighbor routers about the preferred path into an AS that has multiple entry points. This suggestion can, or not, be acceptable for the neighbors; • Communities: are "tags" associated with advertisement prefixes and appended pre-arranged communities can be used to influence path selection of other ASs if the neighbors consider those communities in their routing decision process. Therefore, network operators can only rely on the manipulation of the BGP's attributes to apply any traffic engineering technique. However, for inbound traffic engineering, those approaches only try to influence the routing decisions of external ASs, in order to obtain their desired inbound traffic distribution. Nonetheless, because each AS selects preferred routes based on its own policies, usually the BGP inbound techniques lead to a trial-and-error process with no guarantees of success. Therefore, the agreements, contracts and AS relationships dictate how the configuration of the BGP should be performed for a given AS.