메뉴 건너뛰기




Volumn 30, Issue 10, 2007, Pages 2149-2161

Captured-frame matching schemes for scalable input-queued packet switches

Author keywords

Captured frame; Frame eligibility; Input queued switch; Nonuniform traffic; Service frame

Indexed keywords

CAPTURED FRAMES; FRAME ELIGIBILITY; INPUT-QUEUED SWITCH; NONUNIFORM DISTRIBUTIONS; SERVICE FRAMES;

EID: 34447645655     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2007.04.005     Document Type: Article
Times cited : (12)

References (23)
  • 1
    • 0024122165 scopus 로고
    • Queuing in high-performance packet-switching
    • Karol M., and Hluchyj M. Queuing in high-performance packet-switching. IEEE J. Sel. Area Commun. 6 (1988) 1587-1597
    • (1988) IEEE J. Sel. Area Commun. , vol.6 , pp. 1587-1597
    • Karol, M.1    Hluchyj, M.2
  • 3
    • 34447638828 scopus 로고    scopus 로고
    • N. McKeown, Scheduling Algorithms for Input-Queued Cell Switches, Ph.D. Dissertation, Dept. Elect. Eng. Comput. Sci., University of California at Berkeley, Berkeley, CA, 1995.
  • 5
    • 0032655137 scopus 로고    scopus 로고
    • The iSLIP scheduling algorithm for input-queued switches
    • McKeown N. The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Network. 7 4 (1999) 188-201
    • (1999) IEEE/ACM Trans. Network. , vol.7 , Issue.4 , pp. 188-201
    • McKeown, N.1
  • 6
    • 0032218996 scopus 로고    scopus 로고
    • H.J. Chao, J.-S. Park, Centralized contention resolution schemes for a large-capacity optical ATM switch, IEEE ATM Workshop (1998) 11-16.
  • 7
    • 0035684526 scopus 로고    scopus 로고
    • PMM: a pipelined maximal-sized matching scheduling approach for input-buffered switches
    • Oki E., Rojas-Cessa R., and Chao H.J. PMM: a pipelined maximal-sized matching scheduling approach for input-buffered switches. IEEE Globecom (2001) 35-39
    • (2001) IEEE Globecom , pp. 35-39
    • Oki, E.1    Rojas-Cessa, R.2    Chao, H.J.3
  • 8
    • 0035786591 scopus 로고    scopus 로고
    • A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture
    • Jiang Y., and Hamdi M. A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture. IEEE HPSR (2001) 407-411
    • (2001) IEEE HPSR , pp. 407-411
    • Jiang, Y.1    Hamdi, M.2
  • 9
    • 0035785791 scopus 로고    scopus 로고
    • Load balanced Birkhoff-Von Neumman switches
    • Chang C.-S., Lee D.-S., and Jou Y.-S. Load balanced Birkhoff-Von Neumman switches. IEEE HPSR (2001) 276-280
    • (2001) IEEE HPSR , pp. 276-280
    • Chang, C.-S.1    Lee, D.-S.2    Jou, Y.-S.3
  • 10
    • 18144396959 scopus 로고    scopus 로고
    • The dual round-robin matching switch with exhaustive service
    • Li Y., Panwar S., and Chao H.J. The dual round-robin matching switch with exhaustive service. IEEE HPSR (2002) 58-63
    • (2002) IEEE HPSR , pp. 58-63
    • Li, Y.1    Panwar, S.2    Chao, H.J.3
  • 11
    • 0031701310 scopus 로고    scopus 로고
    • Linear complexity algorithms for maximum throughput in radio networks and input queued switches
    • Tassiulas L. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. IEEE INFOCOM 2 (1998) 533-539
    • (1998) IEEE INFOCOM , vol.2 , pp. 533-539
    • Tassiulas, L.1
  • 12
    • 0038623639 scopus 로고    scopus 로고
    • Randomized scheduling algorithms for high-aggregate bandwidth switches
    • Giaccone P., Prabhakar B., and Shah D. Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE J. Sel. Area Commun. 21 (2003) 546-559
    • (2003) IEEE J. Sel. Area Commun. , vol.21 , pp. 546-559
    • Giaccone, P.1    Prabhakar, B.2    Shah, D.3
  • 14
    • 84944260529 scopus 로고
    • A study of nonblocking switching networks
    • Clos C. A study of nonblocking switching networks. Bell Syst. Tech. J. (1953) 406-424
    • (1953) Bell Syst. Tech. J. , pp. 406-424
    • Clos, C.1
  • 15
    • 0036952165 scopus 로고    scopus 로고
    • Concurrent round-robin dispatching schemes for Clos-network switches
    • Oki E., Jing Z., Rojas-Cessa R., and Chao H.J. Concurrent round-robin dispatching schemes for Clos-network switches. IEEE/ACM Trans. Network. 10 6 (2001) 830-844
    • (2001) IEEE/ACM Trans. Network. , vol.10 , Issue.6 , pp. 830-844
    • Oki, E.1    Jing, Z.2    Rojas-Cessa, R.3    Chao, H.J.4
  • 16
    • 0029779442 scopus 로고    scopus 로고
    • Parallel routing algorithm in Benes-Clos networks
    • Lee T.T., and Liew S.-Y. Parallel routing algorithm in Benes-Clos networks. IEEE INFOCOM' 96 (1996) 279-286
    • (1996) IEEE INFOCOM' , vol.96 , pp. 279-286
    • Lee, T.T.1    Liew, S.-Y.2
  • 17
    • 60649096310 scopus 로고    scopus 로고
    • H.J. Chao, S.Y. Liew, Z. Jing, A dual-level matching algorithm for 3-stage Clos-network packet switches, in: Proc. 11th Symposium on High Performance Interconnects, (2003) 38-44.
  • 18
    • 84905494962 scopus 로고    scopus 로고
    • Static round-robin dispatching schemes for Clos-network switches
    • Pun K., and Hamdi M. Static round-robin dispatching schemes for Clos-network switches. Proc. IEEE HPSR (2002) 239-243
    • (2002) Proc. IEEE HPSR , pp. 239-243
    • Pun, K.1    Hamdi, M.2
  • 19
    • 0029637831 scopus 로고
    • Input-queued switch based on a scheduling algorithm
    • Motoyama S., Petr D.W., and Frost V.S. Input-queued switch based on a scheduling algorithm. Electron. Lett. 31 14 (1995) 1127-1128
    • (1995) Electron. Lett. , vol.31 , Issue.14 , pp. 1127-1128
    • Motoyama, S.1    Petr, D.W.2    Frost, V.S.3
  • 20
    • 0032663268 scopus 로고    scopus 로고
    • Analysis of nonblocking ATM switches with multiple input queues, networking
    • Nong G., Muppala J.K., and Hamdi M. Analysis of nonblocking ATM switches with multiple input queues, networking. IEEE/ACM Trans. Network. 7 1 (1999) 60-74
    • (1999) IEEE/ACM Trans. Network. , vol.7 , Issue.1 , pp. 60-74
    • Nong, G.1    Muppala, J.K.2    Hamdi, M.3
  • 21
    • 0035785965 scopus 로고    scopus 로고
    • CIXB-1: combined input-one-cell-crosspoint buffered switch
    • Rojas-Cessa R., Oki E., Jing Z., and Chao H.J. CIXB-1: combined input-one-cell-crosspoint buffered switch. IEEE HPSR (2001) 324-329
    • (2001) IEEE HPSR , pp. 324-329
    • Rojas-Cessa, R.1    Oki, E.2    Jing, Z.3    Chao, H.J.4
  • 22
    • 34447620968 scopus 로고    scopus 로고
    • R. Schoene, G. Post, G. Sander, Weighted Arbitration Algorithms with Priorities for Input-Queued Switches with 100% Throughput, Broadband Switches Symposium'99, 1999. http://www.schoenen-service.de/assets/papers/Schoenen99bssw.pdf.
  • 23
    • 0031337497 scopus 로고    scopus 로고
    • Low-Cost Scalable Switching Solutions for Broadband Networking: the ATLANTA Architecture and Chipset
    • Chiussi F.M., Kneuer J.G., and Kumar V.P. Low-Cost Scalable Switching Solutions for Broadband Networking: the ATLANTA Architecture and Chipset. IEEE Commun. Mag. (1997) 44-53
    • (1997) IEEE Commun. Mag. , pp. 44-53
    • Chiussi, F.M.1    Kneuer, J.G.2    Kumar, V.P.3


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