메뉴 건너뛰기




Volumn , Issue , 2003, Pages 38-43

A dual-level matching algorithm for 3-stage Clos-network packet switches

Author keywords

Chaos; Fabrics; Internet; Packet switching; Round robin; Routing; Scheduling algorithm; Switches; System performance; Traffic control

Indexed keywords

CHAOS THEORY; FABRICS; INTERNET; PACKET NETWORKS; PACKET SWITCHING; ROUTERS; SCHEDULING ALGORITHMS; SWITCHES; SWITCHING NETWORKS; TRAFFIC CONTROL;

EID: 60649096310     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CONECT.2003.1231475     Document Type: Conference Paper
Times cited : (13)

References (9)
  • 1
    • 0141524334 scopus 로고    scopus 로고
    • Next generation routers
    • invited paper, Sep
    • H. J. Chao, "Next Generation Routers," invited paper, Proceedings of the IEEE, vol. 90, no. 9, Sep. 2002, pp. 1518-1558.
    • (2002) Proceedings of the IEEE , vol.90 , Issue.9 , pp. 1518-1558
    • Chao, H.J.1
  • 2
    • 0031169829 scopus 로고    scopus 로고
    • Path switching - A quasi-static routing scheme for large-scale ATM packet switches
    • June
    • T. T. Lee and C. H. Lam, "Path switching - A quasi-static routing scheme for large-scale ATM packet switches," IEEE J. Select. Areas Commun., vol. 15, pp. 914-924, June 1997.
    • (1997) IEEE J. Select. Areas Commun. , vol.15 , pp. 914-924
    • Lee, T.T.1    Lam, C.H.2
  • 3
    • 0036967437 scopus 로고    scopus 로고
    • Distro: A distributed static round-robin scheduling algorithm for bufferless Clos-network switches
    • Taipei, Nov 17-21
    • K. Pun and M. Hamdi, "Distro: A Distributed Static Round-Robin Scheduling Algorithm for Bufferless Clos-Network Switches," IEEE GLOBECOM'2002, Taipei, Nov 17-21, 2002.
    • (2002) IEEE GLOBECOM'2002
    • Pun, K.1    Hamdi, M.2
  • 5
    • 0032655137 scopus 로고    scopus 로고
    • The iSLIP scheduling algorithm for input-queues switches
    • April
    • N. McKeown, "The iSLIP scheduling algorithm for input-queues switches," IEEE/ACM Trans. On Networking, pp. 188-200, April, 1999.
    • (1999) IEEE/ACM Trans. on Networking , pp. 188-200
    • McKeown, N.1
  • 6
    • 0141524328 scopus 로고    scopus 로고
    • Frame-based matching algorithms for input-queued switches
    • Kobe, Japan, 26-29 May
    • A. Bianco, et al., "Frame-based matching algorithms for input-queued switches," Workshop on High Performance Switching and Routing, Kobe, Japan, 26-29 May 2002
    • (2002) Workshop on High Performance Switching and Routing
    • Bianco, A.1
  • 7
    • 0040438506 scopus 로고    scopus 로고
    • Edge-coloring bipartite multigraphs in O(E log D) time
    • R. Cole, K. Ost, S. Schirra, "Edge-coloring bipartite multigraphs in O(E log D) time", Combinatorica 21 (2001), pp 5-12.
    • (2001) Combinatorica , vol.21 , pp. 5-12
    • Cole, R.1    Ost, K.2    Schirra, S.3
  • 8
    • 0036864606 scopus 로고    scopus 로고
    • Parallel routing algorithms in Benes-Clos network
    • Nov
    • T. T. Lee and S. Y. Liew, "Parallel routing algorithms in Benes-Clos network," IEEE Trans. on Commun., vol. 50, no. 11, Nov. 2002, pp. 1841-1847.
    • (2002) IEEE Trans. on Commun. , vol.50 , Issue.11 , pp. 1841-1847
    • Lee, T.T.1    Liew, S.Y.2
  • 9
    • 0026814871 scopus 로고
    • Performance analysis of a growable architecture for broadband packet (ATM) switching
    • Feb
    • M. Karol, and C-L. I, "Performance Analysis of a Growable Architecture for Broadband Packet (ATM) Switching," IEEE Trans. on Commun., vol. 40, no. 2, pp 431-439, Feb. 1992.
    • (1992) IEEE Trans. on Commun. , vol.40 , Issue.2 , pp. 431-439
    • Karol, M.1    I, C.-L.2


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