The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Compliance with the Gao-Rexford conditions [1] is perhaps the most realistic explanation of Internet routing stability, although BGP is renowned to be prone to oscillations. Informally, the Gao-Rexford conditions assume that (i) the business relationships between Internet Service Providers (ISPs) yield a hierarchy, (ii) each ISP behaves in a rational way, i.e., it does not offer transit to other ISPs...
BGP allows providers to express complex routing policies preserving high degrees of autonomy. However, unrestricted routing policies can adversely impact routing stability. A key concept to understand the interplay between autonomy and expressiveness on one side, and stability on the other side, is safety under filtering, i.e., guaranteed stability under autonomous usage of route filters. BGP route...
Internet service providers can enforce a fine grained control of interdomain routing by cleverly configuring the Border Gateway Protocol. However, the price to pay for the flexibility of BGP is the lack of convergence guarantees. Network protocol design literature introduced several sufficient conditions that routing policies should satisfy to guarantee convergence. However, to our knowledge, none...
Recent works on modeling the Internet topology have highlighted how the complexity of relationships between Autonomous Systems (ASes) can not be oversimplified without sacrificing accuracy in capturing route selection. Such a shortcoming can mislead the understanding, hence the prediction, of the BGP (Border Gateway Protocol) behavior. In particular, models that assume an AS to be an atomic entity...
The policy-oriented nature ofBGP provides network operators with great flexibility and control over the interdomain routing, nevertheless researchers showed that these benefits come at the cost of stability and predictability. In particular, policy interactions often separate, both in time and space, the effects of network events from their causes, making it hard to assess and debug network configurations...
Interdomain routes change over time, and it is impressive to observe up to which extent. Routes may change many times in the same day and sometimes in the same hour or minute. Such changes are caused by several types of events, e.g., a routing policy variation in an ISP, a router reboot, or a link fault. In this paper we do a step towards the identification of the cause of route changes, a problem...
Abstract. A k -path query on a graph consists of computing k vertex-disjoint paths between two given vertices of the graph, whenever they exist. In this paper we study the problem of performing k -path queries, with , in a graph G with n vertices. We denote with the total length of the reported paths. For , we present an optimal data structure for G that uses O(n) space...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.