메뉴 건너뛰기




Volumn , Issue , 2008, Pages 5863-5868

AS tree selection for inter-domain multipoint MPLS tunnels

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; COMPUTER NETWORKS; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

EID: 51249083080     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2008.1096     Document Type: Conference Paper
Times cited : (6)

References (14)
  • 4
    • 50149101175 scopus 로고    scopus 로고
    • On the Selection of Optimal Diverse AS-Paths for Inter-Domain IP/MPLS Tunnel Provisioning
    • 13-15 Feb, Venezia, Italy
    • S. Secci, J.-L. Rougier, A. Pattavina, "On the Selection of Optimal Diverse AS-Paths for Inter-Domain IP/MPLS Tunnel Provisioning", in Proc. of 4th IT-NEWS (QoS-IP) 2008, 13-15 Feb. 2008, Venezia, Italy.
    • (2008) Proc. of 4th IT-NEWS (QoS-IP) 2008
    • Secci, S.1    Rougier, J.-L.2    Pattavina, A.3
  • 6
    • 45749135876 scopus 로고    scopus 로고
    • A Service Plane over the PCE Architecture for Automatic Multi-Domain Connection-Oriented Services
    • submitted to
    • R. Douville, J.-L. Le Roux, J.-L. Rougier, S. Secci, "A Service Plane over the PCE Architecture for Automatic Multi-Domain Connection-Oriented Services", submitted to IEEE Communications Magazine.
    • IEEE Communications Magazine
    • Douville, R.1    Le Roux, J.-L.2    Rougier, J.-L.3    Secci, S.4
  • 8
    • 34249770791 scopus 로고    scopus 로고
    • S. Chopra1, M.R. Rao, The Steiner tree problem I: Formulations, compositions and extension of facets, J. Math. Progr., 64 (1994).
    • S. Chopra1, M.R. Rao, "The Steiner tree problem I: Formulations, compositions and extension of facets", J. Math. Progr., Vol. 64 (1994).
  • 9
    • 0031124754 scopus 로고    scopus 로고
    • Evaluation of multicast routing algorithms for real-time communication on high-speed networks
    • H.F. Salama, D.S. Reeves, Y. Viniotis, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks", IEEE J. on Sel. Areas in Communications, Vol. 15, No. 3 (1997).
    • (1997) IEEE J. on Sel. Areas in Communications , vol.15 , Issue.3
    • Salama, H.F.1    Reeves, D.S.2    Viniotis, Y.3
  • 10
    • 0007459114 scopus 로고    scopus 로고
    • A source-based algorithm for delay-constrained minimum-cost multicasting
    • Q. Zhu et al., "A source-based algorithm for delay-constrained minimum-cost multicasting", in Proc. of INFOCOM 1995.
    • Proc. of INFOCOM 1995
    • Zhu, Q.1
  • 12
    • 0035019899 scopus 로고    scopus 로고
    • A*Prune: An algorithm for finding K shortest paths subject to multiple constraints
    • G Liu, KG Ramakrishnan, "A*Prune: an algorithm for finding K shortest paths subject to multiple constraints", in Proc. of INFOCOM 2001
    • Proc. of INFOCOM 2001
    • Liu, G.1    Ramakrishnan, K.G.2
  • 13
    • 84945709831 scopus 로고
    • Algorithm 97: Shortest Path
    • R.W. Floyd, "Algorithm 97: Shortest Path", Communications of the ACM, Vol. 5 (6) (1962)
    • (1962) Communications of the ACM , vol.5 , Issue.6
    • Floyd, R.W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.