메뉴 건너뛰기




Volumn , Issue , 2008, Pages 439-447

Network routing topology inference from end-to-end measurements

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; CONTROL THEORY; NETWORK ROUTING; SEQUENTIAL SWITCHING;

EID: 51349138898     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.16     Document Type: Conference Paper
Times cited : (23)

References (24)
  • 1
    • 34250818849 scopus 로고    scopus 로고
    • PlanetLab, http://www.planet-lab.org.
    • PlanetLab
  • 4
    • 0023359361 scopus 로고
    • Asynchronous Distance Between Homogenous DNA Squences
    • June
    • D. Barry and J. A. Hartigan, "Asynchronous Distance Between Homogenous DNA Squences," Biometrics, vol. 43, pp. 261-276, June 1987.
    • (1987) Biometrics , vol.43 , pp. 261-276
    • Barry, D.1    Hartigan, J.A.2
  • 5
    • 84976485825 scopus 로고
    • End-to-End Packet Delay and Loss Behavior in the Internet
    • Sept
    • J.-C. Bolot, "End-to-End Packet Delay and Loss Behavior in the Internet," Proc. SIGCOMM 93, Sept. 1993.
    • (1993) Proc. SIGCOMM , vol.93
    • Bolot, J.-C.1
  • 6
    • 0002074731 scopus 로고
    • The Recovery of Trees from Measures of Dissimilarity
    • Edinburgh University Press, pp
    • P. Buneman, "The Recovery of Trees from Measures of Dissimilarity," Mathematics in the Aivhaeological and Historical Sciences, Edinburgh University Press, pp. 387-395, 1971.
    • (1971) Mathematics in the Aivhaeological and Historical Sciences , pp. 387-395
    • Buneman, P.1
  • 9
    • 0030588055 scopus 로고    scopus 로고
    • Full Reconstruction of Markov Models on Evolutionary Trees: Identifiability and Consistency
    • J. T. Chang, "Full Reconstruction of Markov Models on Evolutionary Trees: Identifiability and Consistency," Mathematical Biosciences, vol. 137, pp. 51-73, 1996.
    • (1996) Mathematical Biosciences , vol.137 , pp. 51-73
    • Chang, J.T.1
  • 16
    • 39049134449 scopus 로고    scopus 로고
    • A Markov Random Field Approach to MulticastBased Network Inference Problems
    • Seattle. July
    • J. Ni and S. Tatikonda, "A Markov Random Field Approach to MulticastBased Network Inference Problems," Proc. IEEE ISIT 2006. Seattle. July 2006.
    • (2006) Proc. IEEE ISIT 2006
    • Ni, J.1    Tatikonda, S.2
  • 18
    • 51349106602 scopus 로고    scopus 로고
    • Network Routing Topology Inference From End-to-End Measurements
    • Yale University
    • J. Ni, H. Xie, S. Tatikonda, Y. R. Yang, "Network Routing Topology Inference From End-to-End Measurements," Technical Repon. Yale University, 2007.
    • (2007) Technical Repon
    • Ni, J.1    Xie, H.2    Tatikonda, S.3    Yang, Y.R.4
  • 20
    • 0032685895 scopus 로고    scopus 로고
    • Inference of Multicast Routing Trees and Bottleneck Bandwidths using End-to-end Measurements
    • Mar
    • S. Ratnasamy and S. McCanne, "Inference of Multicast Routing Trees and Bottleneck Bandwidths using End-to-end Measurements," Proc. IEEE INFOCOM 1999, Mar. 1999.
    • (1999) Proc. IEEE INFOCOM 1999
    • Ratnasamy, S.1    McCanne, S.2
  • 21
    • 0023375195 scopus 로고
    • The Neighbor-Joining Method: A New Method for Reconstruction of Phylogenetic Trees
    • N. Saitou and M. Nei, "The Neighbor-Joining Method: A New Method for Reconstruction of Phylogenetic Trees," Molecular Biology and Evolution, vol. 4, no. 4, pp. 406-425, 1987.
    • (1987) Molecular Biology and Evolution , vol.4 , Issue.4 , pp. 406-425
    • Saitou, N.1    Nei, M.2


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