| T. G. Griffin, F. B. Sheperd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. IEEE/ACM Transactions on Networking, 10(2), April 2002. |
.... protocols, safety means that execution of the protocol will always converge to a solution to Griffin and Wilfong s Stable Paths Problem (SPP) 20] and General Stable Paths Problem (GSPP) 22] The absence of a dispute cycle guarantees that the protocol will always converge to a unique solution [25]. At a basic level, routing policies are expressed in terms of preferences (e.g. a router prefers routes with paths with a certain nexthop AS, a three hop path through a certain AS, etc. Policy cycles can be detected either statically (by analysis of the routing policies of each autonomous ....
.... [12, 32] route flap dampening [30] accidental misconfiguration [29] and the difficulties in route prediction for traffic engineering [14] The work of Griffin et al. on the Stable Paths Problem and General Stable Paths Problem is an integral part of our routing logic rules for safety [21, 22, 23, 25]. Additionally, previous work has proposed extensions or alternatives to contemporary wide area routing protocols that improve certain properties, such as scalability [7] the ability to withstand certain types of failures [34] and defense against malicious or incorrect route advertisements ....
GRIFFIN, T. G., SHEPHERD, F. B., , AND WILFONG, G. The stable paths problem and interdomain routing. IEEE Transactions on Networking 10, 1 (2002), 232--243.
....difficult in practice. This is especially true for BGP due to the complex interaction of local routing policies. Instead, we investigate backup routing in the context of the stable paths problem (SPP) a static formalism that captures the semantics of the interdomain routing policies [11] 12] [13]. This allows us to define a high level, global model of backup routing that is independent of the low level implementation of local policies. In addition, we employ the results of [11] 12] 13] in the proofs that our model is inherently safe. Section II A reviews the stable paths problem (SPP) ....
....(SPP) a static formalism that captures the semantics of the interdomain routing policies [11] 12] 13] This allows us to define a high level, global model of backup routing that is independent of the low level implementation of local policies. In addition, we employ the results of [11] 12] [13] in the proofs that our model is inherently safe. Section II A reviews the stable paths problem (SPP) while Section II B reviews the main result of [10] Section III discusses how to support peer peer backup relationships without sacrificing the inherent safety of the underlying system. Section IV ....
[Article contains additional citation context not shown here]
T. G. Griffin, F. B. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," Submitted for publication.
No context found.
T. G. Griffin, F. B. Shepherd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. IEEE/ACM Transactions on Networking, 10(2):232--243, April 2002.
....of BGP. In particular, it is not clear how the BGP convergence in a single VPN will be impacted by the number of other VPN routes being supported over the same infrastructure. Policy interaction. BGP policies can interact in unexpected and counter intuitive ways to produce routing anomalies [24] [25], and these can even occur within a single autonomous system [26] 27] 28] 29] We need to investigate if anomalous policy conflicts can arise either within a single service provider or between providers in BGP MPLS VPNs of RFC 2547. ACKNOWLEDGMENTS Formalizing a rapidly developing ....
Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Transactions on Networking, 2002.
No context found.
T. G. Griffin, F. B. Sheperd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. IEEE/ACM Transactions on Networking, 10(2), April 2002.
No context found.
T. G. Griffin, F. B. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking, 10(2):232--243, 2002.
No context found.
T. Griffin, F. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 232-- 243, 2002.
No context found.
T. Griffin, F. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 232-- 243, 2002.
No context found.
Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong, The stable paths problem and interdomain routing, IEEE/ACM Transactions on Networking, vol. 10, April 2002.
No context found.
T. G. Gri#n, F. B. Shepherd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. ACM/IEEE Trans. on Networking, 10(2):232--243, 2002.
No context found.
T. G. Griffin, F. B. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking, 10(2):232--243, Apr. 2002.
No context found.
T. Griffin, F. Shepherd, and G. Wilfong, "The stable paths problem and Interdomain routing," IEEE/ACM Transactions on Networking, 2002.
No context found.
T. G. Griffin, F. B. Shepherd, and G. Wilfong. The Stable Paths Problem and Interdomain Routing. ACM/IEEE Trans. on Networking, 10(2):232--243, 2002.
No context found.
GRIFFIN, T. G., SHEPHERD,F. B., , AND WILFONG, G. The stable paths problem and interdomain routing. IEEE Transactions on Networking 10, 1 (2002), 232--243.
No context found.
GRIFFIN, T. G., SHEPHERD, F. B., , AND WILFONG, G. The stable paths problem and interdomain routing. IEEE Transactions on Networking 10, 1 (2002), 232--243.
No context found.
T. Griffin, F. B. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Trans. Networking, vol. 10, no. 1, pp. 232--243, 2002.
No context found.
Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong, The stable paths problem and interdomain routing, IEEE/ACM Transactions on Networking, vol. 10, April 2002.
No context found.
T. Griffin, F. Shepherd, and G. Wilfong, "The stable paths problem and Interdomain routing," IEEE/ACM Transactions on Networking, 2002.
No context found.
GRIFFIN, T. G., SHEPHERD, F. B., , AND WILFONG, G. The stable paths problem and interdomain routing. IEEE Transactions on Networking 10, 1 (2002), 232--243.
No context found.
Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong, The stable paths problem and interdomain routing, IEEE/ACM Transactions on Networking, vol. 10, April 2002.
No context found.
Timothy G. Griffin, F. Bruce Shepherd, and Gordon Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Transactions on Networking, vol. 10, no. 2, pp. 232--243, Apr. 2002.
No context found.
T. Griffin, F. Shepherd, and G. Wilfong, "The stable paths problem and Interdomain routing," IEEE/ACM Transactions on Networking, 2002.
No context found.
T. Griffin, F. B. Shepherd, and G. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Trans. Networking, vol. 10, no. 1, pp. 232--243, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC