메뉴 건너뛰기




Volumn , Issue , 2013, Pages

A virtual network allocation algorithm for reliability negotiation

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION ALGORITHM; CLIENT REQUIREMENT; DISJOINT PATHS; REAL NETWORKS; RELIABILITY CALCULATION; SERVICE LEVEL AGREEMENTS; VIRTUAL NETWORKS;

EID: 84891448589     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2013.6614097     Document Type: Conference Paper
Times cited : (14)

References (12)
  • 2
    • 80052760303 scopus 로고    scopus 로고
    • Diverse routing in networks with probabilistic failures
    • H.-W. Lee, E. Modiano, and K. Lee, "Diverse routing in networks with probabilistic failures," IEEE/ACM Transactions on Networking, vol. 18, no. 6, pp. 1895 -1907, 2010.
    • (2010) IEEE/ACM Transactions on Networking , vol.18 , Issue.6 , pp. 1895-1907
    • Lee, H.-W.1    Modiano, E.2    Lee, K.3
  • 3
    • 82455221068 scopus 로고    scopus 로고
    • An enabling platform for autonomic management of the future internet
    • M. Femminella, R. Francescangeli, G. Reali, J. W. Lee, and H. Schulzrinne, "An enabling platform for autonomic management of the future internet," IEEE Network, vol. 25, no. 6, pp. 24-32, 2011.
    • (2011) IEEE Network , vol.25 , Issue.6 , pp. 24-32
    • Femminella, M.1    Francescangeli, R.2    Reali, G.3    Lee, J.W.4    Schulzrinne, H.5
  • 7
    • 0021515396 scopus 로고
    • Performance analysis of networks with unreliable components
    • oct
    • V. Li and J. Silvester, "Performance analysis of networks with unreliable components," IEEE Transactions on Communications, vol. 32, no. 10, pp. 1105 - 1110, oct 1984.
    • (1984) IEEE Transactions on Communications , vol.32 , Issue.10 , pp. 1105-1110
    • Li, V.1    Silvester, J.2
  • 8
    • 0021441708 scopus 로고
    • A quick method for finding shortest pairs of disjoint paths
    • J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, no. 2, pp. 325-336, 1984.
    • (1984) Networks , vol.14 , Issue.2 , pp. 325-336
    • Suurballe, J.W.1    Tarjan, R.E.2
  • 9
    • 33947635163 scopus 로고    scopus 로고
    • Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
    • T. Gomes and J. Craveirinha, "Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks," European Journal of Operational Research, vol. 181, no. 3, 2007.
    • (2007) European Journal of Operational Research , vol.181 , Issue.3
    • Gomes, T.1    Craveirinha, J.2
  • 11
    • 77953244221 scopus 로고    scopus 로고
    • Survivable virtual network embedding
    • M. Rahman, I. Aib, and R. Boutaba, "Survivable virtual network embedding," in NETWORKING, 2010, vol. 6091, pp. 40 - 52.
    • (2010) NETWORKING , vol.6091 , pp. 40-52
    • Rahman, M.1    Aib, I.2    Boutaba, R.3
  • 12
    • 80155201616 scopus 로고    scopus 로고
    • The framework and algorithms for the survivable mapping of virtual network onto a substrate network
    • G. Sun, H. Di, H. Yu, L. Li, and V. Anand, "The framework and algorithms for the survivable mapping of virtual network onto a substrate network," IETE Technical Review, vol. 28, no. 5, 2011.
    • (2011) IETE Technical Review , vol.28 , Issue.5
    • Sun, G.1    Di, H.2    Yu, H.3    Li, L.4    Anand, V.5


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