Real-Time Communication in Multihop Networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 5, Issue 10, 1994, Pages 1044-1056

  Ferrari, Domenico ^a   Kandlur, Dilip D ^b   Shin, Kang G ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

guaranteed delay; point to point networks; Real time systems. communication; scheduling

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; DATA COMMUNICATION SYSTEMS; SCHEDULING; STORAGE ALLOCATION (COMPUTER);

GUARANTEED DELAYS; MULTIHOP NETWORKS; POINT TO POINT NETWORKS; REAL TIME COMMUNICATION;

REAL TIME SYSTEMS;

EID: 0028516173     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.313121     Document Type: Article

References (25)

1. W. Zhao and K. Ramamritham, “Virtual time CSMA protocols for hard real-time communication,” IEEE Trans. Software Eng., vol. 13, pp. 938–952, Aug. 1987.
2. J. F. Kurose, M. Schwartz, and Y. Yemini, “Controlling window protocols for time-constrained communication in multiple access networks,” IEEE Trans. Commun., vol. 36, pp. 41-49, Jan. 1988.
3. W. Zhao, J.A. Stankovic, and K. Ramamritham, “A multi-access window protocol for transmission of time constrained messages,” in Proc. 8th Int. Conf. Distrib. Computing Syst., 1988, pp. 384–392.
4. J.F. Kurose, M. Schwartz, and Y. Yemini, “Multiple-access protocols and time-constrained communication,” ACM Computing Surv., vol. 16, 43–70, Mar. 1984.
5. J. K. Strosnider and T. E. Marchok, “Responsive, deterministic IEEE 802.5 token ring scheduling,” J. Real-Time Syst., vol. 1, pp. 133–158, Sept. 1989.
6. D. Ferrari, “Guaranteeing performance for real-time communication in wide-area networks,” Tech. Rep. UCB/CSD 89/485, Comput. Sci. Div., Dept. of Elec. Eng. and Comput. Sci., Univ. of California, Berkeley, CA, USA, Jan. 1989.
7. D. Ferrari and D. C. Verma, “A scheme for real-time channel establishment in wide-area networks,” IEEE J. Selected Areas Commun., vol. 8, pp. 368–379, Apr. 1990.
8. D. P. Anderson, “A software architecture for network communication,” in Proc. 8th Int. Conf. Distrib. Computing Syst., 1988, pp. 376–383.
9. D. P. Anderson and D. Ferrari, “The DASH project: An overview,” Tech. Rep. 84/405, Comput. Sci. Div., Dept. of Elec. Eng. and Comput. Sci., Univ. of California, Berkeley, CA, USA, Feb. 1988.
10. J.W. Dolter, P. Ramanathan, and K. G. Shin, “A microprogrammable VLSI routing controller for HARTS,” in Proc. IEEE Int. Conf. Comput. Design: VLSI in Comput., 1989, pp. 160–163.
11. P. Ramanathan, D. D. Kandlur, and K. G. Shin, “Hardware assisted software clock synchronization for homogeneous distributed systems,” IEEE Trans. Comput., vol. 39, pp. 514–524, Apr. 1990.
12. R. L. Cruz, “A calculus for network delay and a note on topologies of interconnection networks,” Ph.D. dissertation, Tech. Rep. UILU-ENG-87-2246, Univ. of Illinois at Urbana-Champaign, USA, July 1987.
13. D.P. Anderson, S.Y. Tzou, R. Wahbe, R. Govindan, and M. Andrews, “Support for continuous media in the DASH system,” in Proc. 10th Int. Conf. Distrib. Computing Syst., 1990, pp. 54—61.
14. D.P. Anderson, R.G. Herrtwich, and C. Schaefer, “SRP: A resource reservation protocol for guaranteed performance communication in the Internet,” Tech. Rep. TR-90-006, Int. Comput. Sci. Inst., Berkeley, CA, USA, Feb. 1990.
15. D.D. Kandlur and K. G. Shin, “Traffic routing for networks with virtual cut-through capability,” in Proc. 10th Int. Conf. Distrib. Computing Syst., 1990, 398–405.
16. M. L. Dertouzos, “Control robotics: The procedural control of physical processes,” in Proc. IFIP Congress, 1974, pp. 807–813.
17. C.L. Liu and J.W. Layland, “Scheduling algorithms for multiprogramming in a hard-real-time environment,” J. ACM, vol. 20, pp. 46–61, Jan. 1973.
18. J.Y.-T. Leung and J. Whitehead, “On the complexity of fixed-priority scheduling of periodic, real-time tasks,” Performance Evaluation, vol. 2, 237–250, Dec. 1982.
19. D. E. Comer and R. Yavatkar, “FLOWS: Performance guarantees in best effort delivery systems,” Tech. Rep. CSD-TR-791, Comput. Sci. Dept., Purdue Univ., West Lafayette, IN, USA, July 1988.
20. I. Cidon and I. S. Gopal, “PARIS: An approach to integrated high-speed private networks,” Int. J. Digital Analog Cabled Syst., vol. 1, pp. 77–86, Apr. 1988.
21. I. Cidon, I. Gopal, G. Grover, and M. Sidi, “Real-time packet switching: A performance analysis,” IEEE J. Selected Areas Commun., vol. 6, pp. 1576–1586, Dec. 1988.
22. S.J. Golestani, “Congestion-free transmission of real-time traffic in packet networks,” in Proc. INEOCOM, 1990, pp. 527–536.
23. S.J. Golestani “A stop-and-go queueing framework for congestion management,” in Proc. SIGCOMM, 1990, pp. 8–18.
24. M.-S. Chen, K.G. Shin, and D.D. Kandlur, “Addressing, routing, and broadcasting in hexagonal mesh multiprocessors,” IEEE Trans. Comput., vol. 39, pp. 10–18, Jan. 1990.
25. J. Lehoczky, L. Sha, and Y. Ding, “The rate monotonic scheduling algorithm: Exact characterization and average case behavior,” in Proc. Real-time Syst. Symp., 1989, pp. 166–171.