메뉴 건너뛰기




Volumn 3, Issue , 2002, Pages 2644-2648

Extensions to OSPF for tunnel multicasting

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; MULTICASTING; NETWORK PROTOCOLS; ROUTERS;

EID: 0036967417     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (13)
  • 1
    • 0032095757 scopus 로고    scopus 로고
    • Restricted dynamic steiner trees for scalable multicast in datagram networks
    • Jun.
    • E. Aharoni and R. Cohen, "Restricted dynamic Steiner trees for scalable multicast in datagram networks," IEEE/ACM Trans. on Networking, vol. 6, no. 3, pp. 286-297, Jun. 1998.
    • (1998) IEEE/ACM Trans. on Networking , vol.6 , Issue.3 , pp. 286-297
    • Aharoni, E.1    Cohen, R.2
  • 3
    • 0034998777 scopus 로고    scopus 로고
    • A unicast-based approach for streaming multicast
    • Apr.
    • R. Cohen, and G. Kaempfer, "A unicast-based approach for streaming multicast," in Proc. IEEE Infocom'01, pp. 440-448, Apr. 2001.
    • (2001) Proc. IEEE Infocom'01 , pp. 440-448
    • Cohen, R.1    Kaempfer, G.2
  • 6
    • 0003202851 scopus 로고    scopus 로고
    • Analysis of an equal-cost multi-path algorithm
    • Nov.
    • C. Hopps, "Analysis of an Equal-Cost Multi-Path Algorithm," RFC 2992, Nov. 2000.
    • (2000) RFC , vol.2992
    • Hopps, C.1
  • 7
    • 0003352401 scopus 로고
    • Multicast extension to OSPF
    • Mar.
    • J.Moy," Multicast extension to OSPF, " RFC 1584, Mar. 1994
    • (1994) RFC , vol.1584
    • Moy, J.1
  • 8
    • 0003276078 scopus 로고    scopus 로고
    • OSPF version 2
    • STD 54, RFC 2328, April
    • J. Moy, "OSPF version 2, " RFC 2328, STD 54, RFC 2328, April 1998.
    • (1998) RFC , vol.2328
    • Moy, J.1
  • 9
    • 0003205663 scopus 로고    scopus 로고
    • IP encapsulation within IP
    • Oct.
    • C. Perkins," IP encapsulation within IP," RFC 2003, Oct. 1996.
    • (1996) RFC , vol.2003
    • Perkins, C.1
  • 10
    • 0031702306 scopus 로고    scopus 로고
    • Forwarding state reduction for sparsem odem ulticast communication
    • Mar.
    • J. Tian and G. Neufeld, "Forwarding state reduction for sparsem odem ulticast communication," in Proc. IEEE Infocom'98, pp.711-719, Mar. 1998.
    • (1998) Proc. IEEE Infocom'98 , pp. 711-719
    • Tian, J.1    Neufeld, G.2
  • 11
    • 0003311671 scopus 로고
    • Distance vector multicast routing protocol
    • Nov.
    • D. Waitzman, C. Partridge, and S. Deering, "Distance vector multicast routing protocol," RFC1075, Nov. l988.
    • (1988) RFC , vol.1075
    • Waitzman, D.1    Partridge, C.2    Deering, S.3
  • 13
    • 0036285369 scopus 로고    scopus 로고
    • A destination-driven shortest path tree algorithm
    • New York, Apr.
    • B. Zhang and H. T. Mouftah, "A destination-driven shortest path tree algorithm," in Proc. IEEE ICC'02, New York, Apr. 2002.
    • (2002) Proc. IEEE ICC'02
    • Zhang, B.1    Mouftah, H.T.2


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