-
1
-
-
42549092311
-
Characterization of BGP recovery time under large-scale failures
-
June
-
A. Sahoo, K. Kant, and P. Mohapatra, "Characterization of BGP recovery time under large-scale failures," in Proceedings of ICC 2006, June 2006.
-
(2006)
Proceedings of ICC 2006
-
-
Sahoo, A.1
Kant, K.2
Mohapatra, P.3
-
3
-
-
0000179582
-
Delayed Internet routing convergence
-
Aug
-
C. Labovitz, A. Ahuja, A. Abose, and F. Jahanian, "Delayed Internet routing convergence," in Proceedings of ACM SIGCOMM 2000, Aug. 2000.
-
(2000)
Proceedings of ACM SIGCOMM 2000
-
-
Labovitz, C.1
Ahuja, A.2
Abose, A.3
Jahanian, F.4
-
5
-
-
49749092222
-
Towards a next generation inter-domain routing protocol
-
Nov
-
L. Subramanian, M. Caesar, C. T. Ee, M. Handley, Z. M. Mao, S. Shenker, and I. Stoica, "Towards a next generation inter-domain routing protocol," in Proceedings of Hotnets III, Nov. 2004.
-
(2004)
Proceedings of Hotnets III
-
-
Subramanian, L.1
Caesar, M.2
Ee, C.T.3
Handley, M.4
Mao, Z.M.5
Shenker, S.6
Stoica, I.7
-
6
-
-
0035009719
-
The impact of Internet policy and topology on delayed routing convergence
-
Dec
-
C. Labovitz, A. Ahuja, R. Wattenhofer, and S. Venkatachary, "The impact of Internet policy and topology on delayed routing convergence," in Proceedings of INFOCOM 2001, Dec. 2001.
-
(2001)
Proceedings of INFOCOM 2001
-
-
Labovitz, C.1
Ahuja, A.2
Wattenhofer, R.3
Venkatachary, S.4
-
7
-
-
16244391907
-
BGP-RCN: Improving BGP convergence through root cause notification
-
UCLA CSD, Tech. Rep. TR-030047, Oct
-
Dan Pei and Matt Azuma and Nam Nguyen and Jiwei Chen and Dan Massey and Lixia Zhang, "BGP-RCN: Improving BGP convergence through root cause notification," UCLA CSD, Tech. Rep. TR-030047, Oct. 2003.
-
(2003)
-
-
Pei, D.1
Azuma, M.2
Nguyen, N.3
Chen, J.4
Massey, D.5
Zhang, L.6
-
10
-
-
32544447066
-
Dynamic overlay routing based on available bandwidth estimation: A simulation study
-
Apr
-
Y.Zhu, C. Dovrolis, and M. Ammar, "Dynamic overlay routing based on available bandwidth estimation: A simulation study," Computer Networks Journal, vol. 50, pp. 739-876, Apr. 2006.
-
(2006)
Computer Networks Journal
, vol.50
, pp. 739-876
-
-
Zhu, Y.1
Dovrolis, C.2
Ammar, M.3
-
11
-
-
19544363416
-
Best-path vs. multi-path overlay routing
-
Oct
-
D. G. Andersen, A. C. Snoeren, and H. Balakrishnan, "Best-path vs. multi-path overlay routing," in Proceedings of ACM SIGCOMM conference on Internet measurement, Oct. 2003, pp. 91-100.
-
(2003)
Proceedings of ACM SIGCOMM conference on Internet measurement
, pp. 91-100
-
-
Andersen, D.G.1
Snoeren, A.C.2
Balakrishnan, H.3
-
12
-
-
0036036742
-
Resilient overlay networks
-
Oct
-
D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "Resilient overlay networks," in Proceedings of 18th ACM Symposium on Operating Systems Principles, Oct. 2001.
-
(2001)
Proceedings of 18th ACM Symposium on Operating Systems Principles
-
-
Andersen, D.G.1
Balakrishnan, H.2
Kaashoek, M.F.3
Morris, R.4
-
13
-
-
33845188587
-
Scalable routing overlay networks
-
Jan
-
A. Nakao, L. Peterson, and A. Bavier, "Scalable routing overlay networks," ACM SIGOPS Operating Systems Review, vol. 40, pp. 49-61, Jan. 2006.
-
(2006)
ACM SIGOPS Operating Systems Review
, vol.40
, pp. 49-61
-
-
Nakao, A.1
Peterson, L.2
Bavier, A.3
-
14
-
-
34147120474
-
A note on two problems in connexion with graphs
-
E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik 1, pp. 269-271, 1959.
-
(1959)
Numerische Mathematik
, vol.1
, pp. 269-271
-
-
Dijkstra, E.W.1
-
15
-
-
84902186540
-
-
available at
-
The CAIDA Web Site, available at http://www.caida.org/home/.
-
The CAIDA Web Site
-
-
|