Network Technologies for Real-Time Systems

  • Ajit Kumar Verma
  • Srividya Ajit
  • Manoj Kumar
Part of the Springer Series in Reliability Engineering book series (RELIABILITY)


The purpose of this chapter is to introduce basic term and concepts of network technology. Main emphasis of is on schedulers and real-time analysis of these networks. Networks used in critical applications, such as, CAN and MIL-STD-1553B are discussed in detail.


Medium Access Control Medium Access Control Protocol Busy Period Time Division Multiple Access Controller Area Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Tanenbaum A (2003) Computer networks. Prentice Hall, Upper Saddle RiverGoogle Scholar
  2. 2.
    Nolte T (2006) Share-driven scheduling of embedded networks. PhD thesis, Malardalen University, Sweden, May 2006Google Scholar
  3. 3.
    IEEE 802.15, Working group for wireless personal area networks (wpans),
  4. 4.
    MIL-STD-1553B: Aircraft internal time division command/response multiplex data bus, 30 April 1975Google Scholar
  5. 5.
    Kopetz H, Bauer G (2003) The time-triggered architecture. Proc IEEE 91(1):112–126CrossRefGoogle Scholar
  6. 6.
    Berwanger J, Peller M, Griessbach R. Byteflight—a new high-performance data bus system for safety-related applications. BMW AG, LondonGoogle Scholar
  7. 7.
    Flexray communications system—protocol specification, version 2.0, 2004Google Scholar
  8. 8.
    Malcolm M, Zhao W (1994) The timed token protocol for real-time communication. IEEE Comput 27(1):35–41Google Scholar
  9. 9.
    IEC 61158: Digital data communications for measurement and control: Fieldbus for use in industrial control systems, 2003Google Scholar
  10. 10.
    PROFInet - architecture description and specification, No. 2.202, 2003Google Scholar
  11. 11.
    Specification of the ttp/a protocol, 2005,
  12. 12.
    Spurgeon CE (2000) Ethernet: the definitive guide. O’Reilly & Associates, Inc, USAGoogle Scholar
  13. 13.
    Shoch JF, Dalal YK, Redell DD, Crane RC (1982) Evolution of the ethernet local computer network. Computer 15(8):10–27CrossRefGoogle Scholar
  14. 14.
    Kopetz H, Damm A, Koza C, Mulazzani M, Schwabl W, Senft C, Zainlinger R (1989) Distributed fault-tolerant real-time systems: The mars approach. IEEE Micro 9(1):25–40CrossRefGoogle Scholar
  15. 15.
    Chiueh T, Venkatramani C (1994) Supporting real-time traffic on ethernet. In: Proceedings of Real-Time Systems Symposium, pp 282–286Google Scholar
  16. 16.
    Pedreiras P, Almeida L, Gai P (2002) The ftt-ethernet protocol: Merging flexibility, timeliness and efficiency. In: Proceedings of the 14th Euromicro Conference on Real-Time Systems, 0:152Google Scholar
  17. 17.
    Molle M, Kleinrock L (1985) Virtual time CSMA: why two clocks are better than one. IEEE Trans Commun 33(9):919–933CrossRefGoogle Scholar
  18. 18.
    Zhao W, Stonkovic JA, Ramamritham K (1990) A window protocol for transmission of time-constrained messages. IEEE Trans Comput 39(9):1186–1203CrossRefGoogle Scholar
  19. 19.
    Kweon S-K, Shin KG, Workman G (2000) Achieving real-time communication over ethernet with adaptive traffic smoothing. In: Real-Time and Embedded Technology and Applications Symposium, IEEE, 0:90Google Scholar
  20. 20.
    Lo Bello L, Kaczynski GA, Mirabella O (2005) Improving the real-time behavior of ethernet networks using traffic smoothing. IEEE Trans Ind Inform 1(3):151–161CrossRefGoogle Scholar
  21. 21.
    Farsi M, Ratcliff K, Barbosa M (1999) An overview of controller area network. Comput Control Eng J 10:113–120CrossRefGoogle Scholar
  22. 22.
    CAN specification 2.0. part A and B, CAN in automation (CiA)Google Scholar
  23. 23.
    MIL-STD-1553 Tutorial, CONDOR Engineering, Inc, Santa Barbara, CA 93101Google Scholar
  24. 24.
    Buttazzo GC (2003) Hard real-time computing systems - predictable scheduling algorithms and applications. Springer, HeidelbergGoogle Scholar
  25. 25.
    Sha L, Abdelzaher T, Arzen K-E, Cervin A, Baker T, Burns A, Buttazzo G, Caccamo M, Lehoczky J, Mok AK (2004) Real time scheduling theory: A historical perspective. Real-Time Syst 28(2–3):101–155MATHCrossRefGoogle Scholar
  26. 26.
    Kopetz H (1998) The time-triggered model of computation. In: Proceedings of the 19th IEEE Real-Time Systems Symposium (RTSS’98), pp 168–177Google Scholar
  27. 27.
    Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):40–61MathSciNetCrossRefGoogle Scholar
  28. 28.
    Leung JY-T, Whitehead J (1982) On the complexity of fixed priority scheduling of periodic real-time tasks. Perform Eval 2(4):237–250MathSciNetMATHCrossRefGoogle Scholar
  29. 29.
    Stocia I, Abdel-Wahab H, Jeffay K, Baruah SK, Gehrke JE, Plaxton CG (1996) A proportional share resource allocation algorithm for real-time, time-shared systems. In: Proceedings of the 17th IEEE Real-Time Systems Symposium (RTSS’96), pp 288–299Google Scholar
  30. 30.
    Parekh AK, Gallager RG (1993) A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Trans Netw 1(3):334–357CrossRefGoogle Scholar
  31. 31.
    Parekh AK, Gallager RG (1994) A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans Netw 2(2):137–150CrossRefGoogle Scholar
  32. 32.
    Sprunt B, Sha L, Lehoczky JP (1989) Aperiodic task scheduling for hard real-time systems. Real-Time Syst 1(1):27–60CrossRefGoogle Scholar
  33. 33.
    Spuri M, Buttazzo GC (1994) Efficient aperiodic service under earliest deadline scheduling. In: Proceedings of the 15th IEEE Real-Time Systems Symposium (RTSS’94), pp 2–11Google Scholar
  34. 34.
    Strosnider JK, Lehoczky JP, Sha L (1995) The deferrable server algorithm for enhanced aperiodic responsiveness in the hard real-time environment. IEEE Trans Comput 44(1):73–91MATHCrossRefGoogle Scholar
  35. 35.
    Tia T-S, Liu W-S, Shankar M (1996) Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems. Real-Time Syst 10(1):23–43CrossRefGoogle Scholar
  36. 36.
    Spuri M, Buttazzo GC (1996) Scheduling aperiodic tasks in dynamic priority systems. Real-Time Syst 10(2):179–210CrossRefGoogle Scholar
  37. 37.
    Tindell KW, Burns A, Wellings AJ (1994) An extendible approach for analysing fixed priority hard real-time tasks. Real-Time Syst 6(2):133–151CrossRefGoogle Scholar
  38. 38.
    Sha L, Goodenough JB (1990) Real-time scheduling theory and ADA. IEEE Comput 23(4):53–62Google Scholar
  39. 39.
    Sha L, Rajkumar R, Lehoczky JP (1990) Priority inheritance protocols: An approach to real-time synchronization. IEEE Trans Comput 39(9):1175–1185MathSciNetCrossRefGoogle Scholar
  40. 40.
    Baruah SK, Mok AK, Rosier LE (1990) Preemptive scheduling hard real-time sporadic tasks on one processor. In: Proceedings of the 11th IEEE Real-Time Systems Symposium (RTSS’90), pp 182–190Google Scholar
  41. 41.
    Baruah SK, Rosier LE, Howell RR (1990) Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Syst 2(4):301–324CrossRefGoogle Scholar
  42. 42.
    Joseph M, Pandya P (1986) Finding response times in a real-time system. Comput J 29(5):390–395MathSciNetCrossRefGoogle Scholar
  43. 43.
    Audsley NC, Burns A, Richardson MF, Tindell K, Wellings AJ (1993) Applying new scheduling theory to static priority pre-emptive scheduling. Softw Eng J 8(5):284–292CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2011

Authors and Affiliations

  1. 1.Department of Electrical EngineeringIndian Institute of Technology Bombay (IITB)Powai, MumbaiIndia
  2. 2.Department of Civil EngineeringIndian Institute of Technology Bombay (IITB)Powai, MumbaiIndia

Personalised recommendations