Skip to main content

Research Progresses and Trends of Onboard Switching for Satellite Communications

  • Conference paper
  • First Online:
Space Information Networks (SINC 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 688))

Included in the following conference series:

Abstract

As broadband satellite communication (SAT-COM) systems develop rapidly, Onboard Switching (OBS) technologies with flexible connectivity has attracted much attention by academic researchers and industry. However, due to the threat by the space radiation effects and the firm constraints of payload processing and power resources, OBS technologies are facing to great challenges in terms of its reliability and scalability. In the past literatures, in order to improve the connectivity and reliability of the single-path Crossbar switch, the multi-path Clos network is widely investigated for preferable adoption in OBS. Nevertheless, due to the extensive use of centralized scheduling, the current Clos network with low scalability is not applicable for high-throughput OBS systems. In this paper, by analyzing progresses and trends of decades of related researches, the developing directions of OBS are provided and discussed, combining the switching architecture, the queuing strategy and the corresponding scheduling algorithms. By employing specific queuing structure to sup-port distributed scheduling in the Clos network and along with distributed, fault-tolerant scheduling algorithms, the requirements for high scalability and fault tolerance of the OBS systems can be efficiently guaranteed, which is expected to be a new trend of OBS researches.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Farserotu, J., Prasad, R.: A survey of future broadband multimedia satellite systems, issues and trends. IEEE Commun. Mag. 38(6), 128–133 (2000)

    Article  Google Scholar 

  2. Maurer, R.H., Fraeman, M.E., Martin, M.N., et al.: Harsh environments: space radiation environment, effects, and mitigation. Johns Hopkins APL Tech. Dig. 28(1), 17–29 (2008)

    Google Scholar 

  3. Chao, H.J., Liu, B.: High performance switches and routers. Setit.rnu.tn 17(2), 1009–1012 (2007)

    Google Scholar 

  4. Hu, H., et al.: Integrated uni- and multicast traffic scheduling in buffered crossbar switches. In: International Conference on Communications and Networking in China, Hangzhou, Zhejiang, China, 2008, Chinacom, pp. 66–72. IEEE (2008)

    Google Scholar 

  5. Iyer, S., Mckeown, N., et al.: On the speedup required for a parallel packet switch. IEEE/ACM Trans. Netw. 5(6), 269–271 (2001)

    Google Scholar 

  6. Rojas-Cessa, R., Oki, E., Jing, Z., et al.: CIXB-1: combined input-one-cell-crosspoint buffered switch. In: 2001 IEEE Workshop on High Performance Switching and Routing, Dallas, USA, pp. 324–329 (2001)

    Google Scholar 

  7. Clos, C.: A study of non-blocking switch networks. Bell Syst. Tech. J. 32(2), 406–424 (1953)

    Article  Google Scholar 

  8. Gao, X., Qiu, Z., Zhang, M., et al.: Padded-frame based in-sequence dispatching scheme for Memory-Memory-Memory (MMM) Clos-network. J. Electron. Inf. Technol. 34(11), 2715–2720 (2012)

    Article  Google Scholar 

  9. Chao, H.J., Jing, Z., Liew, S.Y.: Matching algorithms for three-stage bufferless Clos network switches. IEEE Commun. Mag. 41(10), 46–54 (2003)

    Article  Google Scholar 

  10. Gao, Y., Qiu, Z., Zhang, M., et al.: Distributed weight matching dispatching scheme in MSM Clos-network packet switches. IEEE Commun. Lett. 17(3), 580–583 (2013)

    Article  Google Scholar 

  11. Oki, E., Jing, Z., Rojas-Cessa, R., et al.: Concurrent Round-Robin-Based dispatching schemes for Clos-network switches. IEEE/ACM Trans. Netw. 10(6), 830–844 (2002)

    Article  Google Scholar 

  12. Liu, K.: Research on key techniques for high speed onboard switching. Tsinghua University, Beijing (2015)

    Google Scholar 

  13. Gao, Y.: Study of Load-Balanced Scheduling Algorithms in Multi-stage Packet Switching Networks. Xidian University, Xi’an (2014)

    Google Scholar 

  14. Carpinelli, J.D., Nassar, H.: Fault-Tolerance For Switching Networks. Switching Networks: Recent Advances, pp. 1–23. Kluwer Academic Publishers, New York (2001)

    Google Scholar 

  15. Haynos, M.P., Yang, Y.: An analytical model on the blocking probability of a fault-tolerant network. IEEE Trans. Parallel Distrib. Syst. 10(10), 1040–1051 (1999)

    Article  Google Scholar 

  16. Yang, Y., Wang, J.: A fault-tolerant rearrangeable permutation network. IEEE Trans. Comput. 53(4), 414–442 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiang Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Chen, W., Liu, K., Chen, X. (2017). Research Progresses and Trends of Onboard Switching for Satellite Communications. In: Yu, Q. (eds) Space Information Networks. SINC 2016. Communications in Computer and Information Science, vol 688. Springer, Singapore. https://doi.org/10.1007/978-981-10-4403-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-4403-8_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-4402-1

  • Online ISBN: 978-981-10-4403-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics