메뉴 건너뛰기




Volumn , Issue , 2011, Pages 858-863

Minimum Disclosure Routing for network virtualization

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE TIME; NETWORK MODELS; NETWORK VIRTUALIZATION; ROUTING INFORMATION; SECURE MULTI-PARTY COMPUTATION; SERVICE PROVIDER;

EID: 79960586672     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2011.5928932     Document Type: Conference Paper
Times cited : (5)

References (29)
  • 1
    • 79960607407 scopus 로고    scopus 로고
    • "GENI: Global Environment for Network Innovations," http://www.geni.net/.
  • 3
    • 77954346145 scopus 로고    scopus 로고
    • CoreLab: An emerging network Testbed employing hosted virtual machine monitor
    • December
    • A. Nakao, R. Ozaki, and Y. Nishida, "CoreLab: An Emerging Network Testbed Employing Hosted Virtual Machine Monitor," Proc. ROADS '08, December 2008.
    • (2008) Proc. ROADS '08
    • Nakao, A.1    Ozaki, R.2    Nishida, Y.3
  • 5
    • 68949188091 scopus 로고    scopus 로고
    • Network virtualization: State of the art and research challenges
    • N. Chowdhury and R. Boutaba, "Network virtualization: state of the art and research challenges," IEEE Communications magazine, vol. 47, no. 7, pp. 20-26, 2009.
    • (2009) IEEE Communications Magazine , vol.47 , Issue.7 , pp. 20-26
    • Chowdhury, N.1    Boutaba, R.2
  • 9
    • 79960580635 scopus 로고    scopus 로고
    • The evolution of the US Internet peering ecosystem
    • W. Norton, "The evolution of the US Internet peering ecosystem," The 31st NANOG meeting, 2004.
    • (2004) The 31st NANOG Meeting
    • Norton, W.1
  • 11
    • 0442281562 scopus 로고    scopus 로고
    • Best practice does not equal best strategy
    • P. Nattermann, "Best practice does not equal best strategy," The McKinsey Quarterly, vol. 2, no. 2000, pp. 22-31, 2000.
    • (2000) The McKinsey Quarterly , vol.2 , Issue.2000 , pp. 22-31
    • Nattermann, P.1
  • 15
    • 84891632752 scopus 로고    scopus 로고
    • Qwest Business, "Qwest Network Maps," http://www.qwest- business.com/demos/network-maps.html.
    • Qwest Network Maps
  • 17
    • 84898960610 scopus 로고
    • Completeness theorems for non-cryptographic fault-tolerant distributed computation
    • M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in Proc. of ACM STOC. ACM, 1988, pp. 1-10.
    • (1988) Proc. of ACM STOC. ACM , pp. 1-10
    • Ben-Or, M.1    Goldwasser, S.2    Wigderson, A.3
  • 18
    • 0018545449 scopus 로고
    • How to share a secret
    • A. Shamir, "How to share a secret," Communications of the ACM, vol. 22, no. 11, pp. 612-613, 1979.
    • (1979) Communications of the ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 19
    • 58049108203 scopus 로고    scopus 로고
    • Analyzing and modeling router-level Internet topology
    • R. Fukumoto, S. Arakawa, T. Takine, and M. Murata, "Analyzing and modeling router-level Internet topology," LNCS, vol. 5200, pp. 171-182, 2008.
    • (2008) LNCS , vol.5200 , pp. 171-182
    • Fukumoto, R.1    Arakawa, S.2    Takine, T.3    Murata, M.4
  • 22
    • 33645762992 scopus 로고    scopus 로고
    • Achieving subsecond IGP convergence in large IP networks
    • P. Francois, C. Filsfils, J. Evans, and O. Bonaventure, "Achieving subsecond IGP convergence in large IP networks," ACM SIGCOMM CCR, vol. 35, no. 3, pp. 35-44, 2005.
    • (2005) ACM SIGCOMM CCR , vol.35 , Issue.3 , pp. 35-44
    • Francois, P.1    Filsfils, C.2    Evans, J.3    Bonaventure, O.4
  • 24
    • 79960579219 scopus 로고    scopus 로고
    • OSPF areas considered harmful
    • M. Thorup, "OSPF areas considered harmful," Private paper, 2003.
    • (2003) Private Paper
    • Thorup, M.1
  • 25
    • 85014857125 scopus 로고    scopus 로고
    • Accountability in hosted virtual networks
    • ACM
    • E. Keller, R. Lee, and J. Rexford, "Accountability in hosted virtual networks," in Proc. of VISA. ACM, 2009, pp. 29-36.
    • (2009) Proc. of VISA. , pp. 29-36
    • Keller, E.1    Lee, R.2    Rexford, J.3
  • 26
    • 77953691051 scopus 로고    scopus 로고
    • Preserving topology confidentiality in interdomain path computation using a path-key-based mechanism
    • April
    • J. Vasseur and A. Farrel, "Preserving topology confidentiality in interdomain path computation using a path-key-based mechanism," RFC 5520, April 2009.
    • (2009) RFC 5520
    • Vasseur, J.1    Farrel, A.2
  • 28
    • 33646793331 scopus 로고    scopus 로고
    • Privacy-preserving graph algorithms in the semi-honest model
    • J. Brickell and V. Shmatikov, "Privacy-preserving graph algorithms in the semi-honest model," LNCS, vol. 3788, p. 236, 2005.
    • (2005) LNCS , vol.3788 , pp. 236
    • Brickell, J.1    Shmatikov, V.2
  • 29
    • 33847272740 scopus 로고    scopus 로고
    • Verifying global invariants in multi-provider distributed systems
    • S. Machiraju and R. Katz, "Verifying global invariants in multi-provider distributed systems," in Proc. SIGCOMM HotNets, 2004, pp. 149-154.
    • (2004) Proc. SIGCOMM HotNets , pp. 149-154
    • MacHiraju, S.1    Katz, R.2


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