-
1
-
-
33846902581
-
"A Path Computation Element (PCE)-Based Architecture"
-
Aug
-
A. Farrel, J. P. Vasseur, and J. Ash, "A Path Computation Element (PCE)-Based Architecture," IETF RFC 4655, Aug. 2006.
-
(2006)
IETF RFC 4655
-
-
Farrel, A.1
Vasseur, J.P.2
Ash, J.3
-
2
-
-
33846420049
-
"Path Computation Element (PCE) Communication Protocol (PCEP) - Version 1"
-
Internet draft, draft-ietf-pce-pcep-02.txt, June work in progress
-
JP. Vasseur et al., "Path Computation Element (PCE) Communication Protocol (PCEP) - Version 1, " Internet draft, draft-ietf-pce-pcep-02.txt, June 2006, work in progress.
-
(2006)
-
-
Vasseur, J.P.1
-
3
-
-
0037984010
-
"Interdomain Traffic Engineering with BGP"
-
May
-
B. Quoitin et al., "Interdomain Traffic Engineering with BGP," IEEE Commun. Mag., May 2003.
-
(2003)
IEEE Commun. Mag.
-
-
Quoitin, B.1
-
4
-
-
33846917467
-
"Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks"
-
Res. rep. RR-CBA-2006-4, Dept. of Comp. Architecture, Tech. Univ. Catalonia, Spain, Sept
-
A. Sprintson et al., "Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks," Res. rep. RR-CBA-2006-4, http://elio.ac.upc.edu/~dacsecre/reports/2006/31/RR-2DPs_Interdomain.pdf, Dept. of Comp. Architecture, Tech. Univ. Catalonia, Spain, Sept. 2006.
-
(2006)
-
-
Sprintson, A.1
-
5
-
-
8344255723
-
"Efficient Algorithms for Computing Disjoint QoS Paths"
-
Hong Kong, Mar
-
A. Orda and A. Sprintson, "Efficient Algorithms for Computing Disjoint QoS Paths," Proc. IEEE INFOCOM, Hong Kong, Mar. 2004.
-
(2004)
Proc. IEEE INFOCOM
-
-
Orda, A.1
Sprintson, A.2
-
7
-
-
0041671612
-
"BRITE: An Approach to Universal Topology Generation"
-
Aug
-
A. Medina et al., "BRITE: An Approach to Universal Topology Generation," Proc. MASCOTS, Aug. 2001.
-
(2001)
Proc. MASCOTS
-
-
Medina, A.1
-
8
-
-
0003734431
-
"Routing of Multipoint Connections"
-
Dec
-
B. Waxman. "Routing of Multipoint Connections," IEEE JSAC, Dec. 1988.
-
(1988)
IEEE JSAC
-
-
Waxman, B.1
-
9
-
-
0038483826
-
"Emergence of Scaling in Random Networks"
-
A. L. Barabasi and R. Albert, "Emergence of Scaling in Random Networks," Science J., vol. 286, 1999, pp. 509-12.
-
(1999)
Science J.
, vol.286
, pp. 509-512
-
-
Barabasi, A.L.1
Albert, R.2
-
10
-
-
33745903450
-
"Unleashing Traffic Engineering for IPv6 Multihomed Sites"
-
Ph.D. thesis, Univ. Catholique de Louvain, Sept
-
C. de Launois, "Unleashing Traffic Engineering for IPv6 Multihomed Sites," Ph.D. thesis, Univ. Catholique de Louvain, Sept. 2005.
-
(2005)
-
-
de Launois, C.1
-
11
-
-
33846920341
-
"A Per-domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE) Label Switched Paths (LSPs)"
-
Internet draft, draft-ietf-ccamp-inter-domain-pd-path-comp-03.txt, Aug. work in progress
-
J P. Vasseur, A. Ayyangar, and R. Zhang, "A Per-domain Path Computation Method for Establishing Inter-Domain Traffic Engineering (TE Label Switched Paths (LSPs)," Internet draft, draft-ietf-ccamp-inter-domain-pd-path-comp-03.txt, Aug. 2006, work in progress.
-
(2006)
-
-
Vasseur, J.P.1
Ayyangar, A.2
Zhang, R.3
-
12
-
-
22144459833
-
"Distributed Schemes for Diverse Path Computation in Multi-Domain MPLS Networks"
-
June
-
F. Ricciato, U. Monaco, and D. Ali, "Distributed Schemes for Diverse Path Computation in Multi-Domain MPLS Networks," IEEE Commun. Mag., vol. 43, no. 6, June 2005.
-
(2005)
IEEE Commun. Mag.
, vol.43
, Issue.6
-
-
Ricciato, F.1
Monaco, U.2
Ali, D.3
-
13
-
-
33846909747
-
"Path Selection Techniques to Establish Constrained Interdomain MPLS LSPs"
-
Coimbra, Portugal, May
-
C. Pelsser and O. Bonaventure, "Path Selection Techniques to Establish Constrained Interdomain MPLS LSPs," Networking 2006, Coimbra, Portugal, May 2006.
-
(2006)
Networking 2006
-
-
Pelsser, C.1
Bonaventure, O.2
-
14
-
-
33846914647
-
"Combining Border Router Policies for Disjoint LSP Computation"
-
Gerona, Spain, Mar
-
R. Romeral and D. Larrabeiti, "Combining Border Router Policies for Disjoint LSP Computation," Proc. V Wksp. G/MPLS Networks, Gerona, Spain, Mar. 2006.
-
(2006)
Proc. V Wksp. G/MPLS Networks
-
-
Romeral, R.1
Larrabeiti, D.2
|