Abstract
The optimal preemptive strategy SRPT1 reduces the mean delay time by preferring short jobs or messages especially in systems with a high coefficient of variation of the message length. In packet switching networks the service time, i.e. the transmission time, is known in advance, so that this strategy can be applied. The CSMA/CD2 media access control (MAC) protocol of the widely used Ethernet LAN’s with their heterogeneous mixed traffic load is a promising object for a first application of SRPT. In this paper the optimized CSMA/CD/SRPT protocol based on this strategy is introduced. Access to the channel is allowed only to messages which are shorter than the rest of the message currently transmitted. Short messages can interrupt the transmission of a longer one by provoking a collision. After such a collision stations start their transmission according to the message length in reserved slots. This is similar to the hyperchannel priorities for station numbers. Simulation results for a realistic network topology and user scenario show that the mean transfer time of interactive terminal traffic and paging traffic as well as that of the total traffic can be substantially reduced.
Since November 1, 1988, Mr. Schölten is with IBM Germany in Boeblingen
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
IEEE 802.3: Carrier Sense Multiple Access with Collision Detection (CSMA/CD); Access Method and Physical Layer Specifications. IEEE, New York, 1985.
Xerox System Integration Standard: Internet Transport Protocols. Xerox, December 1981.
W. Bux. Analysis of a Local-Area Bus System with Controlled Access. In Performance of Data Communication Systems and their Application, pp. 11–22, North-Holland, 1981.
W. Bux. Local-Area Subnetworks: A Performance Comparison. IEEE Trans. Commun., Vol. COM-29, No. 10, pp. 1465–1473, 1981.
N. Damnen, U. Killat, and R. Stecher. Performance Analysis of Token Bus and CSMA/CD Protocols Derived from FORCASD Simulation Runs. In Performance of Computer Communication Systems, Elsevier North-Holland, Amsterdam, 1984.
C. Görg. Evaluation of the Optimal SRPT Strategy with Overhead. IEEE Trans. Commun., Vol. COM-34, No. 4, pp. 338–344, 1986.
C. Görg. Further Results on a New Combined Strategy Based on the SRPT-Principle. (to appear in IEEE Trans. Commun.).
M. Gude. Concept for a High Performance Random Number Generator Based on Physical Random Phenomena, Frequenz, Vol. 39, No. 7/8, pp. 187–190, 1985.
R. Gusella. The Analysis of Diskless Workstation Traffic on an Ethernet. Technical Report UCB/CSD 87/379, Computer Science Dev., University of California, Berkeley, California, 1987.
M. Kochan, C. Görg, H. Tuchel, and N. Niebert. SIMPASII: Ereignisorientiertes Simulationssystem in der Programmiersprache PASCAL. Technical Report, Lehrstuhl DFV, RWTH Aachen, 1984.
W.T. Marshall and S.P. Morgan. Statistics of Mixed Data Traffic on a Local Area Network. Computer Networks and ISDN Systems, No. 10, 1985.
R.M. Metcalfe and D.R. Boggs. Ethernet: Distributed Packet Switching for Local Computer Networks. Communications of the ACM, Vol. 19, No. 7, pp. 395–404, 1976.
P. Pawlita. Traffic Measurements in Data Networks, Recent Measurement Results, and Some Implications. IEEE Trans. Commun., Vol. COM-29, No. 4, pp. 525–535, 1981.
R. Perera. Contributions to the Theory of Queueing Systems with the Optimal Strategies SPT and SRPT. Ph. D. Thesis, RWTH Aachen, 1989. (in German).
X.H. Pham and F. Schreiber. The Optimal Strategy SRPT in Priority Systems of Digital Communication Networks. AEÜ, Vol. 43, No. 3, pp. 129–134, 1989.
L. Schmickler. Representation of Data Network Measurement Results by the Mixed Erlang Approximation Method MEDA. In Proc. 12th Int. Teletraffic Congress (ITC), Turin, 1988.
L.E. Schrage. A Proof of the Optimality of the Shortest Remaining Processing Time Discipline. Operations Research, Vol. 16, pp. 678–690, 1968.
L.E. Schrage and L.W. Miller. The Queue M/G/1 with the Shortest Remaining Processing Time Discipline. Operations Research, Vol. 14, pp. 670–684, 1966.
F. Schreiber. Improved Simulation by Application of the Objective Bayes-Statistics. AEU, Vol. 34, pp. 243–249, 1980.
J.R. Shoch and J.A. Hupp. Measured Performance of an Ethernet Local Network. Communications of the ACM, Vol. 23, No. 12, pp. 711–721, 1980.
O. Spaniol. Analysis and Performance Evaluation of HYPERchannel Access Protocols. Performance Evaluation, Vol. 1, pp. 170–179, 1981.
T. Welzel. Analyse und Messung der Workload einer technisch-wissenschaftlichen Programmentwicklungsumgebung als Grundlage der Leistungsbewertung Lokaler Netze. In Informatik Fachberichte: Kommunikation in verteilten Systemen, GI/NTG Fachtagung Erlangen, Springer-Verlag, Berlin, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmickler, L., Scholten, K. (1989). Applying the SRPT Principle to Improve the Performance of the CSMA/CD Media Access Control Protocol. In: Stiege, G., Lie, J.S. (eds) Messung, Modellierung und Bewertung von Rechensystemen und Netzen. Informatik-Fachberichte, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75079-3_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-75079-3_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51713-9
Online ISBN: 978-3-642-75079-3
eBook Packages: Springer Book Archive