Skip to main content

Approaches to Quality of Service in High-Performance Networks

  • Conference paper
  • First Online:
Parallel Computer Routing and Communication (PCRCW 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1417))

Included in the following conference series:

Abstract

In recent years, the topic of quality of service (QoS) has gar- nered much discussion and research amongst network designers. QoS has many definitions, but here we focus on the notion of predictable com- munication performance such as guaranteed bandwidth and maximum latency. Such predictability not only supports continuous media (e.g. au- dio, video, virtual reality) and interactive response (e.g. client response time, real-time control), but also good parallel application performance. We discuss three major approaches for quality of service and evaluate their match for high performance system-area networks.

We classify the wealth of approaches to network quality of service into three classes: virtual circuits, physical circuits, and global scheduling. These approaches differ significantly in their assumptions about the net- work environment and in how they bind communication tasks to physi- cal resources, how physical resources are multiplexed and scheduled, and what information is available to do so. These choices fundamentally affect the cost, complexity, and performance of each approach. Virtual circuit approaches attain the greatest flexibility, but require complex hardware for implementation. Physical circuit approaches reduce hardware com- plexity, but need research to understand to best exploit them to deliver quality of service. Finally, we discuss two promising avenues for combin- ing external control with simple network switches to deliver both low cost and high performance (route based and time-based global schedul- ing). These approaches are in their infancy and many research questions remain about their capabilities and generality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nanette J. Boden, Danny Cohen, Robert E. Felderman, Alan E. Kulawik, Charles L. Seitz, Jakov N. Seizovic, and Wen-King Su. Myrinet—a gigabit-per-second local-area network. IEEE Micro, 15(1):29–36, February 1995. Available from http://www.myri.com/research/publications/Hot.ps.

  2. Kay Connelly and Andrew Chien. FM-QoS: Real-time communication using self-synchronizing schedules. In Proceedings of Supercomputing Conference, San Jose, CA, November 1997.

    Google Scholar 

  3. W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547–53, May 1987.

    Article  Google Scholar 

  4. W. J. Dally. Virtual channel flow control. IEEE Transactions on Parallel and Distributed Systems, 3(2):194–205, 1992.

    Article  Google Scholar 

  5. A. Demers, S. Keshav, and S. Shenker. Analysis and simulations of a fair queueing algorithm. In Proceedings of ACM SIGCOMM, pages 3–12, Austin, TX, 1989.

    Google Scholar 

  6. T. Feng. A survey of interconnection networks. IEEE Transactions on Computers, C-14(12):12–27, Dec. 1981.

    Google Scholar 

  7. S. Golestani. A self-clocked fair queueing scheme for broadband applications. In Proceedings of IEEE INFOCOM, pages 636–646, Toronto, Canada, 1994.

    Google Scholar 

  8. S. J. Golestani. Congestion-free communication in high-speed packet networks. IEEE Transactions on Communications, 39(12):1802–1812, Dec. 1991.

    Article  Google Scholar 

  9. R. Horst. TNet: A reliable system area network. IEEE Micro, pages 37–45, February 1995.

    Google Scholar 

  10. J. H. Kim. Bandwidth and Latency Guarantees in Low-cost, High Performance Networks. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, Illinois, January 1997.

    Google Scholar 

  11. J. H. Kim and A. A. Chien. Rotating combined queueing (RCQ): Bandwidth and latency guarantees in low-cost, high-performance networks. In Proceedings of the International Symposium on Computer Architecture, pages 226–236, Philadelphia, PA, 1996.

    Google Scholar 

  12. R. Mraz. Reducing the variance of point-to-point transfers for parallel real-time programs. IEEE Parallel & Distributed Technology, pages 20–31, Winter 1994.

    Google Scholar 

  13. J. Ngai and C. Seitz. A framework for adaptive routing in multicomputer networks. In Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 1–9, Santa Fe, NM, 1989.

    Google Scholar 

  14. S. Pakin, M. Lauria, and A. Chien. High performance messaging on workstations: Illinois Fast Messages (FM) for Myrinet. In Proceedings of Supercomputing, San Diego, CA, Dec. 1995. Available from http://www-csag.cs.uiuc.edu/papers/myrinet-fm-sc95.ps.

  15. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks — the single node case. In Proceedings of IEEE INFOCOM, pages 915–924, Florence, Italy, 1992.

    Google Scholar 

  16. J. Rexford, A. Greenberg, and F. Bonomi. Hardware-efficient fair queueing architectures for high-speed networks. In Proceedings of IEEE INFOCOM, San Francisco, CA, 1996.

    Google Scholar 

  17. S. Scott and G. Thorson. Optimized routing in the Cray T3D. In Proceedings of the Parallel Computer Routing and Communication Workshop, pages 281–294, Seattle, Washington, 1994. Springer-Verlag Lecture Notes in Computer Science No. 853.

    Google Scholar 

  18. C. Seitz. Myrinet — a gigabit-per-second local-area network. In Proceedings of the IEEE Hot Interconnects Symposium, Palo Alto, CA, 1994.

    Google Scholar 

  19. D. Stiliadis and A. Varma. Design and analysis of frame-based queueing: A new traffic scheduling algorithm for packet-switched networks. In Proceedings of SIGMETRICS, pages 104–115, Philadelphia, PA, 1996.

    Google Scholar 

  20. H. Zhang. Service disciplines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE, 83(10), Oct. 1995.

    Google Scholar 

  21. L. Zhang. Virtual clock: A new traffic control algorithm for packet switching networks. In Proceedings of ACM SIGCOMM, pages 19–29, Philadelphia, PA, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chien, A.A., Kim, J.H. (1998). Approaches to Quality of Service in High-Performance Networks. In: Yalamanchili, S., Duato, J. (eds) Parallel Computer Routing and Communication. PCRCW 1997. Lecture Notes in Computer Science, vol 1417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69352-1_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-69352-1_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64571-9

  • Online ISBN: 978-3-540-69352-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics