Dynamic real-time channel establishment in multiple access bus networks

  • Anita Mittal
  • G. Manimaran
  • C. Siva Ram Murthy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1586)


Real-time communication with performance guarantees is becoming very important to many applications, like computer integrated manufacturing, multimedia, and many embedded systems. Though several real-time protocols have been proposed for the multiple access bus networks, there is no guarantee based protocol which addresses the problem of integrated scheduling of dynamically arriving periodic and aperiodic messages. In this paper, we propose two guarantee based protocols, EDF and BUS protocols, which address this problem. In the simulation studies, the performance metrics, success ratio (measure of schedulability) and channel utilization are used to study the performance of the two protocols. It is observed that the EDF protocol offers higher schedulability as compared to the BUS protocol for periodic messages, while the BUS protocol offers better channel utilization for aperiodic messages as compared to the EDF protocol.


Schedule Algorithm Message Size Channel Utilization Earliest Deadline First Admission Test 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Ferrari, and D. C. Verma, “A Scheme for real-time channel establishment in wide area networks”, IEEE J. on Selected Areas in Commun., vol. 8, no. 4, 368–379, 1990.CrossRefGoogle Scholar
  2. 2.
    D. D. Kandlur, K. G. Shin, and D. Ferrari, “Real-time communication in multi-hop networks”, IEEE Trans. on Parallel and Distributed Systems, vol. 5, no. 10, 1044–1055, 1994.CrossRefGoogle Scholar
  3. 3.
    J. F. Kurose, M. Schwartz, and Y. Yemini, “Multiple-access protocols and time constrained communication”, ACM Computing Surveys, vol. 16, no. 1, 43–70, 1984.MathSciNetCrossRefGoogle Scholar
  4. 4.
    N. Malcom and W. Zhao, “Hard real-time communication in mutiple-access networks”, Real-Time Systems, no. 8, 35–77, 1995.CrossRefGoogle Scholar
  5. 5.
    S. Norden, G. Manimaran, and Siva Ram Murthy, “Dynamic Planning based protocols for real-time communication in multiple access networks”, Technical Report, Dept. of Computer Science and Engg., Indian Institute of Technology Madras, 1997.Google Scholar
  6. 6.
    C. C. Chou, and K. G. Shin, “Statistical real-time channels on multi-access bus networks”, IEEE Trans. on Parallel and Distributed Systems, vol. 8, no. 8, 769–780, 1997.CrossRefGoogle Scholar
  7. 7.
    S. H. Khayat, and B. D. Bovopoulos, “A simple and efficient bus management scheme that supports continuous streams”, ACM Trans. on Computer Systems, vol. 13, no. 2, 122–140, 1995.CrossRefGoogle Scholar
  8. 8.
    V. Upadhya, “Design and analysis of real-time LAN protocols”, M. S. Thesis, Dept. of Computer Science and Engg., Indian Institute of Technology, Madras, 1996.Google Scholar
  9. 9.
    C. L. Liu, and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard-real-time environment”, Journal of the ACM, vol. 20, no. 1, 45–61, 1973.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • Anita Mittal
    • 1
  • G. Manimaran
    • 2
  • C. Siva Ram Murthy
    • 1
  1. 1.Dept. of Computer Science and EngineeringIndian Institute of TechnologyMadrasINDIA
  2. 2.Dept. of Electrical and Computer EngineeringIowa State Univ.AmesUSA

Personalised recommendations