Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound

  • 359 Accesses

  • 10 Citations

Abstract

Most commercial network switches are designed to achieve good average throughput and delay needed for Internet traffic, whereas hard real-time applications demand a bounded delay. Our real-time switch combines clearance-time-optimal switching with clock-based scheduling on a crossbar switching fabric. We use real-time virtual machine tasks to serve both periodic and aperiodic traffic, which simplifies analysis and provides isolation from other system operations. We can then show that any feasible traffic will be switched in two clock periods. This delay bound is enabled by introducing one-shot traffic, which can be constructed at the cost of a fixed delay of one clock period. We carry out simulation to compare our switch with the popular iSLIP crossbar switch scheduler. Our switch has a larger schedulability region, a bounded lower end-to-end switching delay, and a shorter clearance time which is the time required to serve every packet in the system.

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

Fig. 1
Fig. 2
Algorithm 1
Algorithm 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Notes

  1. 1.

    In case messages are of different sizes, before their injection into the MAC layer of the source end network interface, they will be fragmented into the fixed standard-size packets. Hence in the physical layer of the network, packets are all of the same standard size. This is already a common practice in industrial fieldbuses (Wang and Gopalakrishnan 2010; Wang et al. 2008; Dopatka and Wismuller 2007; Leung and Yum 1997).

References

  1. Chang C-S, Chen W-J, Huang H-Y (1999) On service guarantees for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann. In: Proc of IEEE IWQoS 1999, pp 79–86

  2. Chen L, Liu X, Wang Q, Wang Y (2011) A real-time multicast routing scheme for multi-hop switched fieldbuses. In: Proc of INFOCOM 2011, pp 3209–3217

  3. Cisco (2012) Catalyst 3560 series switching solutions. http://www.cisco.com

  4. Davis R, Burns A (2005) Hierarchical fixed priority preemptive scheduling. In: Proc IEEE real-time systems symposium (RTSS 2005), Miami, FL, USA. IEEE Comput Soc, Los Alamitos, pp 389–398

  5. Davis R, Burns A (2006) Resource sharing in hierarchical fixed priority pre-emptive systems. In: Proc IEEE real-time systems symposium (RTSS 2006), Rio de Janeiro, Brazil. IEEE Comput Soc, Los Alamitos, pp 257–270

  6. Deb S, Shah D, Shakkottai S (2006) Fast matching algorithms for repetitive optimization: an application to switch scheduling. In: Proc conference on information, sciences and systems (CISS 2006). Princeton, New Jersey, USA, pp 1266–1271. IEEE Information Theory Society

  7. Deng Z, Liu JW-S (1997) Scheduling real-time applications in an open environment. In: Proc IEEE real-time systems symposium (RTSS 1997), San Francisco, CA, USA. IEEE Comput Soc, Los Alamitos, pp 308–319

  8. Dopatka F, Wismuller R (2007) Design of a realtime industrial Ethernet network including hot-pluggable asynchronous devices. In: Proc IEEE international symposium on industrial electronics (ISIE 2007), Vigo, Spain. IEEE Comput Soc, Los Alamitos, pp 1826–1831

  9. E2E Real-Time Solution for Avionics and Control Demo (2012) Remote control via real-time switch. http://www.youtube.com/watch?v=f-Q5sFbyfIg

  10. Elhanany I, Kahane M, Sadot D (2001) Packet scheduling in next-generation multiterabit networks. Computer 34(4):104–106

  11. Fisher B, Fels S, MacLean K, Munzner T, Rensink T (2004) Seeing, hearing, and touching: putting it all together. In: Proc international conference on computer graphics and interactive techniques, Los Angeles, CA, USA. ACM, New York

  12. Fisher B, Fels S, MacLean K, Munzner T, Rensink T (2006) Exploiting perception in high-fidelity virtual environments. In: Proc international conference on computer graphics and interactive techniques, Boston, MA, USA. ACM, New York

  13. Gopalakrishnan S, Sha L, Caccamo M (2004) Hard real-time communication in bus-based networks. In: Proc IEEE real-time systems symposium (RTSS 2004), Lisbon, Portugal. IEEE Comput Soc, Los Alamitos, pp 405–414

  14. Gopalakrishnan S, Caccamo M, Sha L (2006) Switch scheduling and network design for real-time systems. In: Proc IEEE real-time and embedded technology and applications symposium (RTAS 2006), San Jose, CA, USA. IEEE Comput Soc, Los Alamitos, pp 289–300

  15. Gupta GR, Sanghavi S, Shroff NB (2009) Node weighted scheduling. In: Proc international joint conference on measurement and modeling of computer systems (SIGMETRICS 2009), Seattle, WA, USA. ACM, New York, pp 97–108

  16. Karol M, Hluchyj M, Morgan S (1987) Input versus output queueing on a space-division packet swtich. IEEE Trans Commun 35(12):1347–1356

  17. Karp R, Hopcroft J (1973) An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J Comput 2:225–231

  18. Kuo T-W, Li C-H (1999) A fixed-priority-driven open environment for real-time applications. In: Proc IEEE real-time systems symposium (RTSS 1999), Phoenix, AZ, USA. IEEE Comput Soc, Los Alamitos, pp 256–267

  19. Leung Y-W, Yum T-S (1997) A TDM-based multibus packet switch. IEEE Trans Commun 45(7):859–866

  20. Lipari G, Bini E (2003) Resource partitioning among real-time applications. In: Proc Euromicro conference on real-time systems (ECRTS 2003), Porto, Portugal. IEEE Comput Soc, Los Alamitos, pp 151–158

  21. Liu JW-S (2000) Real-time systems. Prentice Hall, New York

  22. McKeown N (1999) The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans Netw 7(2):188–201

  23. Mekkittikul A, McKeown M (1998) Practical scheduling algorithm to achieve 100 % throughput in input-queued switches. In: Proc IEEE INFOCOM, San Francisco, CA, USA. IEEE Comput Soc, Los Alamitos, pp 792–799

  24. Neely MJ, Modiano E, Cheng Y-S (2007) Logarithmic delay for N×N packet switches under the crossbar constraint. IEEE/ACM Trans Netw 15(3):657–668

  25. Peterson LL, Davie BS (2000) Computer networks: a system approach. Morgan Kaufmann, San Mateo

  26. Poovendran R, Sampigethaya K, Gupta SKS, Lee I, Prasad KV, Corman D, Paunicka J (2012) Special issue on cyber-physical systems. Proc IEEE 100(1):6–12

  27. Profibus & Profinet International (2012) http://www.profibus.com

  28. Rao L, Wang Q, Liu X, Wang Y (2012) Analysis of TDMA crossbar real-time switch design for AFDX networks. In: Proc INFOCOM 2012, pp 2462–2470

  29. Rexford J, Hall J, Shin KG (1998) A router architecture for real-time communication in multicomputer networks. IEEE Trans Comput 47(10):1088–1101

  30. Santos R, Vieira A, Pedreiras P, Oliveira A, Almeida L, Marau R (2010) Flexible, efficient and robust real-time communication with server-based Ethernet switching. In: Proc IEEE international workshop on factory communication systems (WFCS 2010), Aveiro, Portugal, pp 131–140

  31. Sha L, Rajkumar R, Lehoczky JP (1990) Real-time scheduling support in Futurebus+. In: Proc IEEE real-time systems symposium (RTSS 1990), Lake Buena Vista, FL, USA. IEEE Comput Soc, Los Alamitos, pp 331–340

  32. Sha L, Gopalakrishnan S, Liu X, Wang Q (2008) Cyber-physical systems: a new frontier. In: Proc IEEE international conference on sensor networks, ubiquitous, and trustworthy computing (SUTC 2008), Taichung, Taiwan. IEEE Comput Soc, Los Alamitos, pp 1–9

  33. Shah D, Wischik D (2006) Optimal scheduling algorithms for input-queued switches. In: Proc IEEE INFOCOM, Barcelona, Catalunya, Spain. IEEE Comput Soc, Los Alamitos, pp 1–11

  34. Shah D, Giaccone P, Leonardi E, Prabhakar B (2004) Delay bounds for combined input and output switches with low speedups. Perform Eval 55(1–2):113–128

  35. Shah D, Giaccone P, Leonardi E (2007) Throughput region of finite-buffered networks. IEEE Trans Parallel Distrib Syst 18(2):251–263

  36. Stankovic JA, Lee JA, Mok A, Rajkumar R (2005) Opportunities and obligations for physical computing systems. Computer 38(11):23–31

  37. TTEthernet Specification (2008). TTTech Computertechnik AG

  38. Venkatramani C, Chiueh T (1997) Design and implementation of a real-time switch for segmented Ethernets. In: Proc IEEE international conference on network protocol (ICNP 1997), Atlanta, GA, USA. IEEE Comput Soc, Los Alamitos, pp 152–161

  39. Wang Q (2008) Real-time and embedded systems building blocks for cyber-physical systems. Ph.D. dissertation, Department of Computer Science, UIUC

  40. Wang Q, Gopalakrishnan S (2010) Adapting a main-stream Internet switch architecture for multi-hop real-time industrial networks. IEEE Trans Ind Inform 6(3):393–404

  41. Wang Q, Gopalakrishnan S, Liu X, Sha L (2008) A switch design for real-time industrial networks. In: Proc IEEE real-time and embedded technology and applications symposium (RTAS 2008), St. Louis, MO, USA. IEEE Comput Soc, Los Alamitos, pp 367–376

  42. Weller T, Hajek B (1997) Scheduling nonuniform traffic in a packet-switching system with small propagation delay. IEEE/ACM Trans Netw 5(6):813–823

Download references

Author information

Correspondence to Kyung-Joon Park.

Additional information

This work was supported by the research fund of Hanyang University (HY-2011-N).

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Kang, K., Park, K., Sha, L. et al. Design of a crossbar VOQ real-time switch with clock-driven scheduling for a guaranteed delay bound. Real-Time Syst 49, 117–135 (2013). https://doi.org/10.1007/s11241-012-9169-6

Download citation

Keywords

  • Real-time switch
  • Bounded delay
  • Schedulability analysis
  • Clock-driven scheduling