research-article

Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol

Authors:

Ching-Chih Han,

Chao-Ju HouAuthors Info & Claims

IEEE Transactions on Computers, Volume 50, Issue 5

Pages 414 - 431

https://doi.org/10.1109/12.926157

Published: 01 May 2001 Publication History

Abstract

One of the key issues in tailoring the timed-token MAC protocol for real-time applications is synchronous bandwidth allocation (SBA), whose objective is to meet both the protocol and deadline constraints. The former constraint requires that the total time allocated to all nodes for transmitting synchronous messages should not exceed the target token rotation time. The latter constraint requires that the minimum time available for a node to transmit its synchronous messages before their deadlines should be no less than the maximum message transmission time. Several nonoptimal local SBA schemes and an optimal global SBA scheme have been proposed [1], [2], [3], [8], [17], [29]. Local SBA schemes use only information available locally to each node and are thus preferred to global schemes because of their lower network-management overhead. If optimal local SBA schemes, if any, can be devised, they will be superior to their global counterparts both in performance and in ease of network management. In this paper, we formally prove that there does not exist any optimal local SBA scheme. We also propose an optimal global SBA scheme which has an $O(nM)$ polynomial-time worst-case complexity, where $n$ is the number of synchronous message streams in the system and $M$ is the time complexity for solving a linear programming problem with $3n$ constraints and $n$ variables.

References

[1]

G. Agrawal B. Chen and W. Zhao, “Local Synchronous Capacity Allocation Schemes for Guaranteeing Message Deadlines with the Timed-Token Protocol,” Proc. Infocom, pp. 186-193, Apr. 1993.

[2]

G. Agrawal B. Chen W. Zhao and S. Davari, “Guaranteeing Synchronous Message Deadlines with the Timed Token Protocol,” Proc. IEEE Int'l Conf. Distributed Computing Systems, pp. 468-475, June 1992.

[3]

G. Agrawal B. Chen W. Zhao and S. Davari, “Guaranteeing Synchronous Message Deadlines with the Timed Token Medium Access Control Protocol” IEEE Trans. Computers, vol. 43, no. 3, pp. 327-350, Mar. 1994.

Digital Library

[4]

“Token Passing Bus Access Method,” ANSI/IEEE Standard 802. 4-1985, 1985.

[5]

“Fiber Distributed Data Interface (FDDI)—Token Ring Media Access Control (MAC),” ANSI X3.139, 1987.

[6]

S. Baase, Computer Algorithms: Introduction to Design and Analysis, second ed. Addison-Wesley, 1991.

Digital Library

[7]

M.S. Bazaraa J.J. Jarvis and H.D. Sherali, Linear Programming and Network Flows, second ed. John Wiley & Sons, 1990.

Digital Library

[8]

B. Chen G. Agrawal and W. Zhao, “Optimal Synchronous Capacity Allocation for Hard Real-Time Communications with the Timed Token Protocol,” Proc. 13th Real-Time Systems Symp., pp. 198-207, Dec. 1992.

[9]

B. Chen and W. Zhao, “Properties of the Timed Token Protocol,” Technical Report 92-038, Dept. of Computer Science, Texas A&M Univ., Oct. 1992.

[10]

D. Dykeman and W. Bux, “Analysis and Tuning of the FDDI Media Access Control Protocol,” IEEE J. Selected Areas in Comm., vol. 6,no. 6, pp. 997-1010, July 1988.

Digital Library

[11]

“Manufacturing Automation Protocol,” General Motors Corp., version 3.0, implementation release, May 1987.

[12]

S.J. Golestani, “Congestion-Free Communication in High-Speed Packet Networks,” IEEE Trans. Comm., vol. 39, no. 12, pp. 1802-1812, Dec. 1991.

[13]

S.J. Golestani., “A Framing Strategy for Congestion Management,” IEEE J. Selected Areas in Comm., vol. 9, no. 7, pp. 1065-1077, Sept. 1991.

Digital Library

[14]

C.-C. Han C.-J. Hou and K.G. Shin, “On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks,” IEEE Trans. Computers, vol. 46, no. 7, pp. 756-767, July 1997.

Digital Library

[15]

R. Jain, “FDDI: Current Issues and Future Plans,” IEEE Comm. Magazine, pp. 98-105, Sept. 1993.

Digital Library

[16]

M.J. Johnson, “Proof that Timing Requirements of the FDDI Token Ring Protocol Are Satisfied,” IEEE Trans. Comm., vol. 35, no. 6, pp. 620-625, June 1987.

[17]

S. Kamat N. Malcolm and W. Zhao, “Performance Evaluation of a Bandwidth Allocation Scheme for Guaranteeing Synchronous Messages with Arbitrary Deadlines in an FDDI Network,” Proc. 14th Real-Time Systems Symp., pp. 34-43, Dec. 1993.

[18]

L.G. Khachian, “A Polynomial Algorithm in Linear Programming,” Soviet Math. Doklady, vol. 20, pp. 191-194, 1979.

[19]

L.G. Khachian, “Polynomial Algorithms in Linear Programming,” USSR Computational Math. and Math. Physics, vol. 20, pp. 53-72, 1980.

[20]

C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 46-61, 1973.

Digital Library

[21]

N. Malcolm and W. Zhao, “The Timed-Token Protocol for Real-Time Communications,” Computer, vol. 27, no. 1, pp. 35-40, Jan. 1994.

Digital Library

[22]

J.W.M. Pang and F.A. Tobagi, “Throughput Analysis of a Timer Controlled Token Passing Protocol under Heavy Load,” IEEE Trans. Comm., vol. 37, no. 7, pp. 694-702, July 1989.

[23]

F.E. Ross, “FDDI—A Tutorial,” Computer, vol. 24, no. 5, pp. 10-17, May 1986.

[24]

F.E. Ross, “An Overview of FDDI: The Fiber Distributed Data Interface,” IEEE J. Selected Areas in Comm., vol. 7, no. 7, pp. 1043-1051, Sept. 1989.

Digital Library

[25]

K.C. Sevcik and M.J. Johnson, “Cycle Time Properties of the FDDI Token Ring Protocol,” IEEE Trans. Software Eng., vol. 13, no. 3, pp. 376-385, Mar. 1987.

Digital Library

[26]

J.K. Strosnider T. Marchok and J.P. Lehoczky, “Advanced Real-Time Scheduling Using the IEEE 802.5 Token Ring,” Proc. Ninth Real-Time Systems Symp., pp. 42-52, Dec. 1988.

[27]

J.S. Turner, “New Directions in Communications (or Which Way to the Information Age),” IEEE Comm. Magazine, vol. 24, no. 10, pp. 8-15, Oct. 1986.

Digital Library

[28]

A. Valenzano P. Montuschi and L. Ciminiera, “Some Properties of Timed Token Medium Access Protocols,” IEEE Trans. Software Eng., vol. 16, no. 8, pp. 858-869, Aug. 1990.

Digital Library

[29]

Q. Zheng and K.G. Shin, “Synchronous Bandwidth Allocation in FDDI Networks,” Proc. ACM Multimedia '93, pp. 31-38, Aug. 1993.

Digital Library

Cited By

Nguyen NLeu MLiu X(2018)RTEthernetTransactions on Emerging Telecommunications Technologies10.1002/ett.343329:7Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1002/ett.3433
Zhang SBurns AChen JLee E(2004)Hard Real-Time Communication with the Timed Token ProtocolReal-Time Systems10.1023/B:TIME.0000029051.60313.0627:3(271-295)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1023/B%3ATIME.0000029051.60313.06
Lenzini LMingozzi EStea G(2002)A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queuing Services Based on the Timed Token ProtocolIEEE Transactions on Computers10.1109/TC.2002.103262251:9(1011-1025)Online publication date: 1-Sep-2002
https://dl.acm.org/doi/10.1109/TC.2002.1032622
Show More Cited By

Index Terms

Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol

Recommendations

A polynomial-time optimal synchronous bandwidth allocation scheme for the timed-token MAC protocol
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2

Numerous methods have been proposed to integrate real-time and non-real-time services of the timed-token medium access control (MAC) protocol. One of the key issues in tailoring the timed-token MAC protocol for real-time applications is the synchronous ...
Efficient Global Allocation of Synchronous Bandwidths for Hard Real-Time Communication with the Timed Token MAC Protocol
RTCSA '99: Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications

This paper presents an efficient global synchronous bandwidth allocation (SBA) scheme for guaranteeing synchronous message deadlines in a timed token network (such as FDDI) where the timed token medium access control (MAC) protocol is used. A local SBA ...
Cycle time properties of the PROFIBUS timed-token protocol

A recent trend in distributed computer-controlled systems (DCCS) is to interconnect the distributed computing elements by means of multi-point broadcast networks. Since the network medium is shared between a number of network nodes, access contention ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 50, Issue 5

May 2001

144 pages

ISSN:0018-9340

Editors:
Jean-Luc Gaudiot
Univ. of Southern California, Los Angeles
,
Fabrizio Lombardi
Northeastern Univ., Boston, MA

Issue’s Table of Contents

Copyright © Copyright © 2001 IEEE. All Rights Reserved.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 May 2001

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Nguyen NLeu MLiu X(2018)RTEthernetTransactions on Emerging Telecommunications Technologies10.1002/ett.343329:7Online publication date: 9-Jul-2018
https://dl.acm.org/doi/10.1002/ett.3433
Zhang SBurns AChen JLee E(2004)Hard Real-Time Communication with the Timed Token ProtocolReal-Time Systems10.1023/B:TIME.0000029051.60313.0627:3(271-295)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1023/B%3ATIME.0000029051.60313.06
Lenzini LMingozzi EStea G(2002)A Unifying Service Discipline for Providing Rate-Based Guaranteed and Fair Queuing Services Based on the Timed Token ProtocolIEEE Transactions on Computers10.1109/TC.2002.103262251:9(1011-1025)Online publication date: 1-Sep-2002
https://dl.acm.org/doi/10.1109/TC.2002.1032622
Hou CShin K(1997)Allocation of Periodic Task Modules with Precedence and Deadline Constraints in Distributed Real-Time SystemsIEEE Transactions on Computers10.1109/12.64193446:12(1338-1356)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.1109/12.641934

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents