메뉴 건너뛰기




Volumn , Issue , 2011, Pages

ALIAS: Scalable, decentralized label assignment for data centers

Author keywords

Data center address assignment; Data center management; Hierarchical labeling

Indexed keywords

ADDRESS ASSIGNMENT; ARBITRARY FAILURES; AUTO-CONFIGURATION; DATA CENTER MANAGEMENT; DATA CENTERS; HIERARCHICAL TOPOLOGY; LARGE NETWORKS; NETWORK FABRIC; PRACTICAL SOLUTIONS; SCALABLE COMMUNICATION; TOPOLOGY DISCOVERY;

EID: 82155203131     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2038916.2038922     Document Type: Conference Paper
Times cited : (15)

References (29)
  • 2
    • 82155174901 scopus 로고    scopus 로고
    • Openflow. www.openflowswitch.org.
  • 6
    • 0021411652 scopus 로고
    • Generalized hypercube and hyperbus structures for a computer network
    • April
    • L. N. Bhuyan and D. P. Agrawal. Generalized hypercube and hyperbus structures for a computer network. IEEE Transactions on Computers, 33:323-333, April 1984.
    • (1984) IEEE Transactions on Computers , vol.33 , pp. 323-333
    • Bhuyan, L.N.1    Agrawal, D.P.2
  • 18
    • 0022141776 scopus 로고
    • Fat-trees universal networks for hardware-efficient supercomputing
    • October
    • C. E. Leiserson. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, 34:892-901, October 1985.
    • (1985) IEEE Transactions on Computers , vol.34 , pp. 892-901
    • Leiserson, C.E.1
  • 21
    • 0032594116 scopus 로고    scopus 로고
    • The deflection self-routing banyan network: A large-scale ATM switch using the fully adaptive self-routing and its performance analyses
    • August
    • J.-H. Park, H. Yoon, and H.-K. Lee. The deflection self-routing banyan network: a large-scale ATM switch using the fully adaptive self-routing and its performance analyses. IEEE/ACM Transactions on Networks (TON), 7:588-604, August 1999.
    • (1999) IEEE/ACM Transactions on Networks (TON) , vol.7 , pp. 588-604
    • Park, J.-H.1    Yoon, H.2    Lee, H.-K.3
  • 22
    • 0022209638 scopus 로고
    • Algorithm for distributed computation of a spanning tree in an extended lan
    • R. Perlman. An algorithm for distributed computation of a spanningtree in an extended LAN. In Proceedings of the ninth symposium on Data communications, SIGCOMM '85, pages 44-53, New York, NY, USA, 1985. ACM. (Pubitemid 16557703)
    • (1985) Proceedings - Data Communications Symposium , pp. 44-53
    • Perlman Radia1
  • 26
    • 0030244799 scopus 로고    scopus 로고
    • Inside parallel computers: Trends in interconnection networks
    • September
    • H. J. Siegel and C. B. Stunkel. Inside parallel computers: Trends in interconnection networks. IEEE Computer Science & Engineering, 3:69-71, September 1996.
    • (1996) IEEE Computer Science & Engineering , vol.3 , pp. 69-71
    • Siegel, H.J.1    Stunkel, C.B.2
  • 27
    • 77956088993 scopus 로고    scopus 로고
    • Transparent interconnection of lots of links (TRILL): Problem and applicability statement
    • May
    • J. Touch and R. Perlman. Transparent interconnection of lots of links (TRILL): Problem and applicability statement, RFC 5556, May 2009.
    • (2009) RFC , vol.5556
    • Touch, J.1    Perlman, R.2


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