Article

Free access

A hierarchical solution for application level store-and-forward deadlock prevention

Authors:

B. J. Brachman,

S. T. ChansonAuthors Info & Claims

SIGCOMM '89: Symposium proceedings on Communications architectures & protocols

Pages 25 - 32

https://doi.org/10.1145/75246.75250

Published: 01 August 1989 Publication History

Abstract

Application level message transfer systems, primarily used to transport electronic mail, have several unique characteristics that make using existing methods of dealing with deadlock impractical. The special requirements for the efficient transport of application level messages are discussed and a description of a hierarchical scheme that meets these requirements is given. For networks consisting of interconnected clusters of computers, the structured buffer pool technique can be combined with other deadlock-free message transport schemes to form a network-wide, deadlock-free message transport facility. A properly chosen hierarchical system has the advantages of the individual schemes while lessening the impact of their disadvantages. The hierarchical scheme is also applicable to packet-switched and datagram-based networks.

References

[1]

Bta~.ewicz, Jacek, Brzezifiski, Jerzy, and Gambosi, Giorgio. "Time-Stamp Approach to Store-and- Forward Deadlock Prevention", IEEE Transactions on Comm., vol. COM-35, no. 5, (May 1987), pp. 490-495.

[2]

Bongiovanni, G., and Bovet, D. P. "Minimal Deadlock- Free Store-and-Forward Communication Networks", Networks, vol. 17, (1987), pp. 187-200.

Digital Library

[3]

Brachman, Barry J. "EANft User's Guide", unpublished memorandum, University of British Columbia, Dept. of Computer Science, September 1986.

[4]

Brachman, Barry J., and Chanson, Samuel T. "Fragmentation in Store-and-Forward Message Transfer", IEEE Communications Magazine, vol. 26, no. 7, (July 1988), pp. 18-27.

Digital Library

[5]

Brachman, Barry J., and Chanson, S~muel T. "Flow and Congestion Control in the Message Handling Environment'', Proc. IEEE INFOCOM '89, 1989, pp. 721-730.

[6]

Brachman, Barry j. "Resource Management in Application Level Message Transfer Systems", Ph.D. Dissertation, Department of Computer Science, University of British Columbia, June 1989.

Digital Library

[7]

Chan, Cheung-Wing, and Yurn, Tak-Shing. ~An Algorithm for Detecting and Resolving Store-and- Forward Deadlocks in Packet Switched Networks", IEEE Trans. on Comm., vol. COM-35, no. 8, (August 1987), pp. 801-807.

[8]

Dongarra, Jack J., and Grosse, Eric. "Distribution of Mathematical Software Via Electronic Mail", Commun. A CM, vol. 30, no. 5, (May 1987), pp. 403-407.

Digital Library

[9]

Oiessler, A., H~nle, J., K~nig, A., and Pade, E. ~Free Buffer Allocation- An Investigation by Simulation', Computer Networks, vol. 2, 1978, pp. 191-208.

[10]

Giessler, Alfred, J~gemann, Annemarie, Mgser, Ellen, and H~nle, J~rgen. "Flow Control Based on Buffer Classes", IEEE Transactions on Comm., vol. COM- 29, no. 4, (April 1981), pp. 436-443.

[11]

GopM, Inder S. "Prevention of Store-and-Forward Deadlock in Computer Networks", IEEE Transactions on Comm., vol. COM-33, no. 12, (December 1985), pp. 1258-1264.

[12]

Ghnther, Klaus D. "Prevention of Deadlocks in Packet-Switched Data Transport Systems", IEEE Transactions on Comm., vol. COM-29, no. 4, (April 1981), pp. 512-524.

[13]

Howard, J. H., Jr. "Mixed Solutions for the Deadlock Problem", Commun. A CM, vol. 16, no. 7, (July 1973), pp. 427-430.

Digital Library

[14]

Isloor, Sreek~anth S., and Marsland, T. Anthony. "The Deadlock Problem: An Overview", Computer, vol. 13, no. 9, (September 1980), pp. 58-78.

Digital Library

[15]

Merlin, Philip M., and Schweitzer, Paul J. "Deadlock Avoidance in Store-and-Forward Networks, Parts I and II',IEEE Transactions on Comm., vol. COM-28, no. 3 (March 1980), pp. 345-360.

[16]

Partridge, Craig. "The CSNET Information Server: Automatic Documentation Distribution Using Electronic Marl", Computer Communication Review, vol. 17, no. 4, (October/November 1987), pp. 3-10.

Digital Library

[17]

Quarterman, John S., and Hoskins, Josiah C. "Notable Computer Networks", Commun. A CM, vol. 29, no. 10, (October 1986), pp. 932-971.

Digital Library

[18]

Quarterman, JohnS. The Matrix: Computer Networks and Conferencing S~tstems Worldwide, Digital Press, 1989.

Digital Library

[19]

Raubold, E., and H~nle, J. "A Method of Deadlockfree Resource Allocation and Flow Control in Packet Networks", Proc. 8rd International Con/erence on Computer Communication, 1976, pp. 483-487.

[20]

Thomas, Robert H., Forsdick, Harry C., Crowley, Terfence R., Schaaf, Richard W., Tomlinson, Raymond S., and Travers, Virginia M. "Diamond: A Multimedia Message System Built on a Distributed Architectur&, Computer, vol. 18, no. 12, (December 1985), pp. 65-78.

Digital Library

[21]

Toueg, Sam, and Unman, Jeffrey D. "Deadlock-Free Packet Switching Networks", Proc. 11th A GM $~npo. sium on the Theory of Computing, 1979, pp. 89-98.

Digital Library

[22]

Toueg, Sam. "Deadlock- and Livelock-Free Packet Switching Networks", Proc. l~th A CM Symposium on the Theory o/Computing, 1980, pp. 94-99.

Digital Library

[23]

Wimmer, Wolfgang. "Using Barrier Graphs for Deadlock Prevention in Communication Networks", IEEE Trans. on Communications, vol. COM-32, no. 8, (August 1984), pp. 897-901.

[24]

Zwaenepoel, Willy. "Protocols for Large Data Transfers Over Local Networks", Proceedings of the Ninth Data Communications Symposium, Sept. 1985, pp. 22- 32.

Digital Library

Cited By

Awerbuch BAzar Y(1994)Local optimization of global objectivesProceedings of the 35th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1994.365690(240-249)Online publication date: 20-Nov-1994
https://dl.acm.org/doi/10.1109/SFCS.1994.365690
Awerbuch BKutten SPeleg D(1994)On buffer-economical store-and-forward deadlock preventionIEEE Transactions on Communications10.1109/26.32897342:11(2934-2937)Online publication date: Jan-1994
https://doi.org/10.1109/26.328973
Awerbuch BKutten SPeleg D(1991)On buffer-economical store-and-forward deadlock preventionIEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings10.1109/INFCOM.1991.147532(410-414 vol.1)Online publication date: 1991
https://doi.org/10.1109/INFCOM.1991.147532

Index Terms

A hierarchical solution for application level store-and-forward deadlock prevention

Recommendations

A hierarchical solution for application level store-and-forward deadlock prevention

Application level message transfer systems, primarily used to transport electronic mail, have several unique characteristics that make using existing methods of dealing with deadlock impractical. The special requirements for the efficient transport of ...
Fragmentation in store-and-forward message transfer

The advantages of store-and-forward (S/F) message transfer at the application layer and problems with existing systems are discussed. Current systems suffer from the limitation that if an intermediate message transfer agent (MTA), the entity responsible ...
Determining deadlock exposure for a class of store and forward communication networks

Given a network design, is the network exposed to deadlock for message buffers? This problem is addressed for a class of networks called "routed networks." A routed network is a store and forward communication network in which all transmissions follow ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '89: Symposium proceedings on Communications architectures & protocols

August 1989

313 pages

ISBN:0897913329

DOI:10.1145/75246

Chairman:
Lawrence H. Landweber

ACM SIGCOMM Computer Communication Review Volume 19, Issue 4
Sep. 1989
311 pages
ISSN:0146-4833
DOI:10.1145/75247
Editor:
Craig Partridge
Bolt Beranek and Newman Inc., Cambridge, MA
Issue’s Table of Contents

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM89

Sponsor:

SIGCOMM

SIGCOMM89: Communications Architectures & Protocols

September 25 - 27, 1989

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
563
Total Downloads

Downloads (Last 12 months)55
Downloads (Last 6 weeks)13

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Awerbuch BAzar Y(1994)Local optimization of global objectivesProceedings of the 35th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1994.365690(240-249)Online publication date: 20-Nov-1994
https://dl.acm.org/doi/10.1109/SFCS.1994.365690
Awerbuch BKutten SPeleg D(1994)On buffer-economical store-and-forward deadlock preventionIEEE Transactions on Communications10.1109/26.32897342:11(2934-2937)Online publication date: Jan-1994
https://doi.org/10.1109/26.328973
Awerbuch BKutten SPeleg D(1991)On buffer-economical store-and-forward deadlock preventionIEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings10.1109/INFCOM.1991.147532(410-414 vol.1)Online publication date: 1991
https://doi.org/10.1109/INFCOM.1991.147532

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents