메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 289-300

Switch scheduling and network design for real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

LOW-COST NETWORKS; MESSAGE TRANSFER; NETWORK DESIGN; SCHEDULING ALGORITHMS; SWITCHING ALGORITHMS;

EID: 33749594229     PISSN: 15453421     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTAS.2006.42     Document Type: Conference Paper
Times cited : (16)

References (36)
  • 1
    • 84859693938 scopus 로고    scopus 로고
    • Juniper Networks, Sunnyvale, California
    • M-series platform datasheet. Juniper Networks, Sunnyvale, California. Available online: http://www.juniper.net/products/mseries/100042.html.
    • M-series Platform Datasheet
  • 2
    • 84859692799 scopus 로고    scopus 로고
    • Performing Internet routing and switching at Gigabit speeds
    • Cisco Systems, San Jose, California
    • Performing Internet routing and switching at Gigabit speeds. GSR 12000 Technical Product Description, Cisco Systems, San Jose, California. Available online: http://www.cisco.com/warp/public/733/12000/index.shtml
    • GSR 12000 Technical Product Description
  • 3
    • 33749647793 scopus 로고
    • Issues on large network design
    • Network Analysis Corporation
    • Issues on large network design. Network Analysis Corporation, ARPA Report, 1974.
    • (1974) ARPA Report
  • 5
    • 84859673359 scopus 로고    scopus 로고
    • MMC Networks, Sunnyvale, California
    • ATMS2000: 5 Gb/sec switch engine chipset. MMC Networks, Sunnyvale, California, 1996. Available online: http://mmcnet.com/Solutions/ATMS2000.asp.
    • (1996) ATMS2000: 5 Gb/sec Switch Engine Chipset
  • 11
    • 0026000660 scopus 로고
    • A calculus for network delay, part I: Network elements in isolation
    • Jan.
    • CRUZ, R. L. A calculus for network delay, part I: Network elements in isolation. IEEE Transactions on Information Theory 37, 1 (Jan. 1991), 114-131.
    • (1991) IEEE Transactions on Information Theory , vol.37 , Issue.1 , pp. 114-131
    • Cruz, R.L.1
  • 12
    • 0025994959 scopus 로고
    • A calculus for network delay, part II: Network analysis
    • Jan.
    • CRUZ, R. L. A calculus for network delay, part II: Network analysis. IEEE Transactions on Information Theory 37, 1 (Jan. 1991), 132-141.
    • (1991) IEEE Transactions on Information Theory , vol.37 , Issue.1 , pp. 132-141
    • Cruz, R.L.1
  • 13
    • 0015201164 scopus 로고
    • Optimal design of centralized computer networks
    • FRANK, H., FRISCH, I., CHOU, W., AND SLYKE, R. Optimal design of centralized computer networks. Networks 1 (1971), 43-57.
    • (1971) Networks , vol.1 , pp. 43-57
    • Frank, H.1    Frisch, I.2    Chou, W.3    Slyke, R.4
  • 15
    • 0017440153 scopus 로고
    • On the topological design of distributed computer networks
    • GERLA, M., AND KLEINROCK, L. On the topological design of distributed computer networks. IEEE Transactions on Communication 25 (1977), 48-60.
    • (1977) IEEE Transactions on Communication , vol.25 , pp. 48-60
    • Gerla, M.1    Kleinrock, L.2
  • 16
    • 0023670354 scopus 로고
    • Input versus output queueing on a space division switch
    • Dec.
    • KAROL, M., HLUCHYJ, M., AND MORGAN, S. Input versus output queueing on a space division switch. IEEE Transactions on Communication, 12 (Dec. 1987), 1347-1356.
    • (1987) IEEE Transactions on Communication , vol.12 , pp. 1347-1356
    • Karol, M.1    Hluchyj, M.2    Morgan, S.3
  • 17
    • 0242364203 scopus 로고    scopus 로고
    • Maximum size matching is unstable for any packet switch
    • Oct.
    • KESLASSY, I., ZHANG-SHEN, R., AND MCKEOWN, N. Maximum size matching is unstable for any packet switch. IEEE Communication Letters 7, 10 (Oct. 2003), 496-498.
    • (2003) IEEE Communication Letters , vol.7 , Issue.10 , pp. 496-498
    • Keslassy, I.1    Zhang-Shen, R.2    Mckeown, N.3
  • 18
    • 2942595607 scopus 로고    scopus 로고
    • Bounds on delays and queue lengths in input-queued switches
    • July
    • LEONARDI, E., MELLIA, M., NERI, F., AND AJMONE MARSAN, M. Bounds on delays and queue lengths in input-queued switches. Journal of the ACM 50, 4 (July 2003), 520-550.
    • (2003) Journal of the ACM , vol.50 , Issue.4 , pp. 520-550
    • Leonardi, E.1    Mellia, M.2    Neri, F.3    Ajmone Marsan, M.4
  • 20
    • 0032655137 scopus 로고    scopus 로고
    • ISLIP: A scheduling algorithm for input-queued switches
    • Apr.
    • MCKEOWN, N. iSLIP: A scheduling algorithm for input-queued switches. IEEE Transactions on Networking 7, 2 (Apr. 1999).
    • (1999) IEEE Transactions on Networking , vol.7 , Issue.2
    • Mckeown, N.1
  • 22
    • 0031649903 scopus 로고    scopus 로고
    • A practical scheduling algorithm to achieve 100% throughput in input-queued switches
    • MCKEOWN, N., AND MEKKITTIKUL, A. A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In Proceedings of IEEE Infocom (1998), pp. 792-799.
    • (1998) Proceedings of IEEE Infocom , pp. 792-799
    • Mckeown, N.1    Mekkittikul, A.2
  • 25
    • 0032179068 scopus 로고    scopus 로고
    • A router architecture for real-time communication in multicomputer networks
    • Oct
    • REXFORD, J., HALL, J., AND SHIN, K. G. A router architecture for real-time communication in multicomputer networks. IEEE Transactions on Computers 47, 10 (Oct1998), 1215-1227.
    • (1998) IEEE Transactions on Computers , vol.47 , Issue.10 , pp. 1215-1227
    • Rexford, J.1    Hall, J.2    Shin, K.G.3
  • 26
    • 33749627902 scopus 로고    scopus 로고
    • Infiniband as an avionics net: A proposal
    • Oct.
    • RIDDEL, D. Infiniband as an avionics net: a proposal. COTS Journal (Oct. 2003), 85-89.
    • (2003) COTS Journal , pp. 85-89
    • Riddel, D.1
  • 28
    • 0036349140 scopus 로고    scopus 로고
    • Delay bounds for approximate maximum weight matching algorithms for input queued switches
    • SHAH, D., AND KOPIKARE, M. Delay bounds for approximate maximum weight matching algorithms for input queued switches. In Proceedings of IEEE Infocom (2002), pp. 1024-1031.
    • (2002) Proceedings of IEEE Infocom , pp. 1024-1031
    • Shah, D.1    Kopikare, M.2
  • 29
    • 84859693271 scopus 로고    scopus 로고
    • HP moves hard on Cisco
    • June
    • SPANGLER, T. HP moves hard on Cisco. Byte and Switch, June 2003. Available online: http://www.byteandswitch.com/document.asp?doc_id=35013.
    • (2003) Byte and Switch
    • Spangler, T.1
  • 30
    • 26444457447 scopus 로고    scopus 로고
    • A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems
    • STACEY, C., EYERS, T., AND ANIDO, G. A concave link elimination (CLE) procedure and lower bound for concave topology, capacity and flow assignment network design problems. Telecommunication Systems 13 (2000), 351-371.
    • (2000) Telecommunication Systems , vol.13 , pp. 351-371
    • Stacey, C.1    Eyers, T.2    Anido, G.3
  • 34
  • 35
    • 33749584760 scopus 로고    scopus 로고
    • The Morgan Kaufmann Systems On Silicon Series. Kluwer Academic Publishers, 2001, ch. An architectural co-synthesis algorithm for distributed, embedded computing systems
    • WOLF, W. Readings in hardware/software co-design. The Morgan Kaufmann Systems On Silicon Series. Kluwer Academic Publishers, 2001, ch. An architectural co-synthesis algorithm for distributed, embedded computing systems, pp. 338-349.
    • Readings in Hardware/software Co-design , pp. 338-349
    • Wolf, W.1
  • 36
    • 84981622582 scopus 로고
    • Minimum cost routing for static network models
    • YAGED, B. Minimum cost routing for static network models. Networks 1 (1911), 139-172.
    • (1911) Networks , vol.1 , pp. 139-172
    • Yaged, B.1


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