메뉴 건너뛰기




Volumn 15, Issue 4, 2001, Pages 535-555

Paths in the simple random graph and the Waxman graph

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POISSON DISTRIBUTION;

EID: 0035629474     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0269964801154070     Document Type: Article
Times cited : (40)

References (13)
  • 4
    • 0033908221 scopus 로고    scopus 로고
    • TAMCRA: A tunable accuracy multiple constraints routing algorithm
    • Neve, H. & Van Mieghem, P. (2000). TAMCRA: A tunable accuracy multiple constraints routing algorithm. Computer Communications 23: 667-679.
    • (2000) Computer Communications , vol.23 , pp. 667-679
    • Neve, H.1    Van Mieghem, P.2
  • 7
    • 0032284732 scopus 로고    scopus 로고
    • A lower bound for the end-to-end delay in networks: Application to Voice over IP
    • Van Mieghem, P. (1998). A lower bound for the end-to-end delay in networks: Application to Voice over IP. In IEEE Globecom 1998, Vol. 4, pp. 2508-2513.
    • (1998) IEEE Globecom 1998 , vol.4 , pp. 2508-2513
    • Van Mieghem, P.1
  • 13
    • 0031334402 scopus 로고    scopus 로고
    • A quantitative comparison of graph-based models for internet topology
    • Zegura, E.W., Calvert, K.L., & Donahoo, M.J. (1997). A quantitative comparison of graph-based models for internet topology. IEEE/ACM Transactions on Networking 5(6): 770-783.
    • (1997) IEEE/ACM Transactions on Networking , vol.5 , Issue.6 , pp. 770-783
    • Zegura, E.W.1    Calvert, K.L.2    Donahoo, M.J.3


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