메뉴 건너뛰기




Volumn 4, Issue , 2004, Pages 2283-2294

Viking: A multi-spanning-tree ethernet architecture for metropolitan area and cluster networks

Author keywords

Ethernet; Experimentation with real networks Testbeds; Simulations; Spanning Tree; System design

Indexed keywords

ETHERNET; EXPERIMENTATION WITH REAL NETWORKS/TESTBEDS; FAILURE RECOVERY; SPANNING TREE;

EID: 8344282696     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2004.1354651     Document Type: Conference Paper
Times cited : (133)

References (18)
  • 4
    • 0032674478 scopus 로고    scopus 로고
    • Automatic fault detection and recovery in real time switched ethernet networks
    • S. Varadarajan and T. Chiueh, "Automatic fault detection and recovery in real time switched ethernet networks," in IEEE INFOCOMM, 1999, vol. 1, pp. 161-169.
    • (1999) IEEE INFOCOMM , vol.1 , pp. 161-169
    • Varadarajan, S.1    Chiueh, T.2
  • 5
    • 8344226950 scopus 로고
    • Automatic reconfiguration in autonet
    • T. Rodeheffer and M. Schroeder, "'Automatic reconfiguration in autonet," in ACM SIGOPS, 1991, vol. 25 of 5, pp. 183-197.
    • (1991) ACM SIGOPS , vol.25 , Issue.5 , pp. 183-197
    • Rodeheffer, T.1    Schroeder, M.2
  • 7
    • 33645756832 scopus 로고    scopus 로고
    • Star: A transparent spanning tree bridge protocol with alternate routing
    • K. Lui, W. Lee, and K. Nahrstedt, "Star: A transparent spanning tree bridge protocol with alternate routing," in ACM SIGCOMM, 2002, vol. 32 of 3, pp. 33-46.
    • (2002) ACM SIGCOMM , vol.32 , Issue.3 , pp. 33-46
    • Lui, K.1    Lee, W.2    Nahrstedt, K.3
  • 8
    • 84866746748 scopus 로고    scopus 로고
    • A new transparent bridge protocol for lan internetworking using topologies with active loops
    • T. Lai, Ed.
    • R. Garcia, J. Duato, and J. Serrano, "A new transparent bridge protocol for lan internetworking using topologies with active loops," in ICPP'98, T. Lai, Ed., 1998, pp. 295-303.
    • (1998) ICPP'98 , pp. 295-303
    • Garcia, R.1    Duato, J.2    Serrano, J.3
  • 9
    • 8344290525 scopus 로고    scopus 로고
    • Network planning and tuning in switch-based lans
    • T. Lai, Ed.
    • W. Qiao and L. Ni, "Network planning and tuning in switch-based lans," in ICPP'98, T. Lai, Ed., 1998, pp. 287-294.
    • (1998) ICPP'98 , pp. 287-294
    • Qiao, W.1    Ni, L.2
  • 13
    • 8344220547 scopus 로고    scopus 로고
    • The performance of a service for network-aware appplications
    • K. Obraczka and G. Georghiu, "The performance of a service for network-aware appplications.," in ACM Sigmetrics SPDT'98, 1998.
    • (1998) ACM Sigmetrics SPDT'98
    • Obraczka, K.1    Georghiu, G.2
  • 16
    • 8344284361 scopus 로고    scopus 로고
    • Efficient network resource allocation with QoS guarantees
    • Experimental Computer Systems Labs. Department of Computer Science State University of New York at Stony Brook, March
    • K. Gopalan, "Efficient network resource allocation with QoS guarantees," Technical Report TR-133, Experimental Computer Systems Labs. Department of Computer Science, State University of New York at Stony Brook, March 2003.
    • (2003) Technical Report , vol.TR-133
    • Gopalan, K.1
  • 17
    • 0009267001 scopus 로고
    • K-th shortest paths and applications to probabilistic networks
    • B.L. Fox, "k-th shortest paths and applications to probabilistic networks," In ORSA/TIMS Joint National Mtg., vol. 23, pp. B263, 1975.
    • (1975) ORSA/TIMS Joint National Mtg. , vol.23 B263
    • Fox, B.L.1
  • 18
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • D. Eppstein, "Finding the k shortest paths," SIAM J. Computing, vol. 28(2), pp. 652-673, 1998.
    • (1998) SIAM J. Computing , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1


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